| dc.contributor.author | Wilczek, Frank | |
| dc.contributor.author | Hu, Hong-Ye | |
| dc.contributor.author | Wu, Biao | |
| dc.date.accessioned | 2021-12-17T18:25:12Z | |
| dc.date.available | 2021-09-20T18:23:08Z | |
| dc.date.available | 2021-12-17T18:25:12Z | |
| dc.date.issued | 2020 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/132573.2 | |
| dc.description.abstract | © 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. | en_US |
| dc.language.iso | en | |
| dc.publisher | IOP Publishing | en_US |
| dc.relation.isversionof | 10.1088/0256-307X/37/5/050304 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | arXiv | en_US |
| dc.title | Resonant Quantum Search with Monitor Qubits | en_US |
| dc.type | Article | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Center for Theoretical Physics | en_US |
| dc.relation.journal | Chinese Physics Letters | en_US |
| dc.eprint.version | Original manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2020-11-17T14:34:18Z | |
| dspace.orderedauthors | Wilczek, F; Hu, HY; Wu, B | en_US |
| dspace.date.submission | 2020-11-17T14:34:23Z | |
| mit.journal.volume | 37 | en_US |
| mit.journal.issue | 5 | en_US |
| mit.license | OPEN_ACCESS_POLICY | |
| mit.metadata.status | Publication Information Needed | en_US |
