Local adiabatic quantum search with different paths
Recep Eryigit, Yigit Gunduc, Resul Eryigit
Abstract
We report on a detailed analysis of generalization of the local adiabatic search algorithm. Instead of evolving directly from an initial ground state Hamiltonian to a solution Hamiltonian a different evolution path is introduced and is shown that the time required to find an item in a database of size N can be made to be independent of the size of the database by modifying the Hamiltonian used to evolve the system.
Create a lesson
Related papers
Generative learning of time series with holographic quantum circuit sampling
Bingzhi Zhang, Matthew W. Lee, Tom Finke et al.
Entanglement detection in dynamical quantum systems
Xingjian Zhang, Jiayi Wu, Jue Xu et al.
Partial-coherence weak measurement of polarization qubits with a temporal pointer: theory and experiment
Shane P. Gervais, Lambert Giner
A complete classification of operator controllability for closed three-level quantum systems driven by a single control
Sergey Kuznetsov, Alexander Pechen
Entanglement generation from degeneracy breaking of superradiant Liouvillian steady states by local operations
Adam Burgess, Erik M. Gauger
Classical Communication Helps Single-Shot Quantum Compression
Omri Farber, Gilad Gour