| Item type |
SIG Technical Reports(1) |
| 公開日 |
2020-10-09 |
| タイトル |
|
|
タイトル |
Finding Small and Large <i>k</i>-Clique Instances on a Quantum Computer |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Finding Small and Large <i>k</i>-Clique Instances on a Quantum Computer |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Keio Quantum Computing Center Keio University |
| 著者所属 |
|
|
|
Graduate School of Mathematics Nagoya University |
| 著者所属 |
|
|
|
Keio Quantum Computing Center Keio University |
| 著者所属(英) |
|
|
|
en |
|
|
Keio Quantum Computing Center Keio University |
| 著者所属(英) |
|
|
|
en |
|
|
Graduate School of Mathematics Nagoya University |
| 著者所属(英) |
|
|
|
en |
|
|
Keio Quantum Computing Center Keio University |
| 著者名 |
Sara, Ayman Metwalli
François, Le Gall
Rodney, Van Meter
|
| 著者名(英) |
Sara, Ayman Metwalli
François, Le Gall
Rodney, Van Meter
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Algorithms for triangle-finding, the smallest nontrivial instance of the k-clique problem, have been proposed for quantum computers. Still, those algorithms assume the use of fixed access time quantum RAM (QRAM). We present a practical gate-based approach to both the triangle-finding problem and its NP-hard k-clique generalization. We examine both constant factors for near-term implementation on a Noisy Intermediate Scale Quantum computer (NISQ) device, and the scaling of the problem to evaluate long-term use of quantum computers. We compare the time complexity and circuit practicality of the theoretical approach and actual implementation. We propose and apply two different strategies to the k-clique problem, examining the circuit size of Qiskit implementations. We analyze our implementations by simulating triangle finding with various error models, observing the effect on damping the amplitude of the correct answer, and compare to execution on six real IBMQ machines. Finally, we estimate the date when the methods proposed can run effectively on an actual device based on IBM's quantum volume exponential growth forecast and the results of our error analysis. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Algorithms for triangle-finding, the smallest nontrivial instance of the k-clique problem, have been proposed for quantum computers. Still, those algorithms assume the use of fixed access time quantum RAM (QRAM). We present a practical gate-based approach to both the triangle-finding problem and its NP-hard k-clique generalization. We examine both constant factors for near-term implementation on a Noisy Intermediate Scale Quantum computer (NISQ) device, and the scaling of the problem to evaluate long-term use of quantum computers. We compare the time complexity and circuit practicality of the theoretical approach and actual implementation. We propose and apply two different strategies to the k-clique problem, examining the circuit size of Qiskit implementations. We analyze our implementations by simulating triangle finding with various error models, observing the effect on damping the amplitude of the correct answer, and compare to execution on six real IBMQ machines. Finally, we estimate the date when the methods proposed can run effectively on an actual device based on IBM's quantum volume exponential growth forecast and the results of our error analysis. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AA12894105 |
| 書誌情報 |
研究報告量子ソフトウェア（QS）
巻 2020-QS-1,
号 14,
p. 1-8,
発行日 2020-10-09
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2435-6492 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-QS20001014.pdf (1.7 MB)
