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: | Wilczek, F, Hu, HY, Wu, B |
---|---|
Format: | Article |
Language: | English |
Published: |
IOP Publishing
2021
|
Online Access: | https://hdl.handle.net/1721.1/132573 |
Similar Items
-
Resonant Quantum Search with Monitor Qubits
by: Wilczek, Frank, et al.
Published: (2021) -
Quantum Algorithm for Approximating Maximum Independent Sets
by: Yu, Hongye, et al.
Published: (2022) -
Quantum independent-set problem and non-Abelian adiabatic mixing
by: Wu, Biao, et al.
Published: (2021) -
Quantum nonlocality of massive qubits in a moving frame
by: Su, Hong-Yi., et al.
Published: (2014) -
Quantum Time Crystals
by: Wilczek, Frank
Published: (2013)