Simon's Period Finding on a Quantum Annealer
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918232803246080 |
|---|---|
| author | Robertson, Reece Doucet, Emery Mzaouali, Zakaria Domino, Krzysztof Gardas, Bartłomiej Deffner, Sebastian |
| author_facet | Robertson, Reece Doucet, Emery Mzaouali, Zakaria Domino, Krzysztof Gardas, Bartłomiej Deffner, Sebastian |
| contents | Dating to 1994, Simon's period-finding algorithm is among the earliest and most fragile of quantum algorithms. The algorithm's fragility arises from the requirement that, to solve an n qubit problem, one must fault-tolerantly sample O(n) linearly independent values from a solution space. In this paper, we study an adiabatic implementation of Simon's algorithm that requires a constant number of successful samples regardless of problem size. We implement this algorithm on D-Wave hardware and solve problems with up to 298 qubits. We compare the runtime of classical algorithms to the D-Wave solution to analyze any potential advantage. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_10771 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Simon's Period Finding on a Quantum Annealer Robertson, Reece Doucet, Emery Mzaouali, Zakaria Domino, Krzysztof Gardas, Bartłomiej Deffner, Sebastian Quantum Physics Emerging Technologies Dating to 1994, Simon's period-finding algorithm is among the earliest and most fragile of quantum algorithms. The algorithm's fragility arises from the requirement that, to solve an n qubit problem, one must fault-tolerantly sample O(n) linearly independent values from a solution space. In this paper, we study an adiabatic implementation of Simon's algorithm that requires a constant number of successful samples regardless of problem size. We implement this algorithm on D-Wave hardware and solve problems with up to 298 qubits. We compare the runtime of classical algorithms to the D-Wave solution to analyze any potential advantage. |
| title | Simon's Period Finding on a Quantum Annealer |
| topic | Quantum Physics Emerging Technologies |
| url | https://arxiv.org/abs/2504.10771 |