A framework for reducing the overhead of the quantum oracle for use with Grover’s algorithm with applications to cryptanalysis of SIKE
In this paper we provide a framework for applying classical search and preprocessing to quantum oracles for use with Grover’s quantum search algorithm in order to lower the quantum circuit-complexity of Grover’s algorithm for single-target search problems. This has the effect (for certain problems)...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
De Gruyter
2020-11-01
|
| シリーズ: | Journal of Mathematical Cryptology |
| 主題: | |
| オンライン･アクセス: | https://doi.org/10.1515/jmc-2020-0080 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|