Resonant Quantum Search with Monitor Qubits
© 2020 Chinese Physical Society and IOP Publishing Ltd. We present an algorithm for the generalized search problem (searching k marked items among N items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity as the Grover algorithm. A natu...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOP Publishing
2021
|
| Online Access: | https://hdl.handle.net/1721.1/132573 |
| _version_ | 1826193529315000320 |
|---|---|
| author | Wilczek, F Wilczek, F Hu, HY Wu, B Wu, B Wu, B |
| author_facet | Wilczek, F Wilczek, F Hu, HY Wu, B Wu, B Wu, B |
| author_sort | Wilczek, F |
| collection | MIT |
| description | © 2020 Chinese Physical Society and IOP Publishing Ltd. We present an algorithm for the generalized search problem (searching k marked items among N items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity as the Grover algorithm. A natural extension of the algorithm, incorporating auxiliary "monitor"qubits, can determine k precisely, if it is unknown. The time complexity of our counting algorithm is O(√N), similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources. |
| first_indexed | 2024-09-23T09:40:53Z |
| format | Article |
| id | mit-1721.1/132573 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T09:40:53Z |
| publishDate | 2021 |
| publisher | IOP Publishing |
| record_format | dspace |
| spelling | mit-1721.1/1325732021-09-21T03:56:47Z Resonant Quantum Search with Monitor Qubits Wilczek, F Wilczek, F Hu, HY Wu, B Wu, B Wu, B © 2020 Chinese Physical Society and IOP Publishing Ltd. We present an algorithm for the generalized search problem (searching k marked items among N items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity as the Grover algorithm. A natural extension of the algorithm, incorporating auxiliary "monitor"qubits, can determine k precisely, if it is unknown. The time complexity of our counting algorithm is O(√N), similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources. 2021-09-20T18:23:08Z 2021-09-20T18:23:08Z 2020-11-17T14:34:18Z Article http://purl.org/eprint/type/JournalArticle https://hdl.handle.net/1721.1/132573 en 10.1088/0256-307X/37/5/050304 Chinese Physics Letters Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf IOP Publishing arXiv |
| spellingShingle | Wilczek, F Wilczek, F Hu, HY Wu, B Wu, B Wu, B Resonant Quantum Search with Monitor Qubits |
| title | Resonant Quantum Search with Monitor Qubits |
| title_full | Resonant Quantum Search with Monitor Qubits |
| title_fullStr | Resonant Quantum Search with Monitor Qubits |
| title_full_unstemmed | Resonant Quantum Search with Monitor Qubits |
| title_short | Resonant Quantum Search with Monitor Qubits |
| title_sort | resonant quantum search with monitor qubits |
| url | https://hdl.handle.net/1721.1/132573 |
| work_keys_str_mv | AT wilczekf resonantquantumsearchwithmonitorqubits AT wilczekf resonantquantumsearchwithmonitorqubits AT huhy resonantquantumsearchwithmonitorqubits AT wub resonantquantumsearchwithmonitorqubits AT wub resonantquantumsearchwithmonitorqubits AT wub resonantquantumsearchwithmonitorqubits |