Necessary adiabatic run times in quantum optimization
نویسندگان
چکیده
منابع مشابه
Necessary condition for the quantum adiabatic approximation
A gapped quantum system that is adiabatically perturbed remains approximately in its eigenstate after the evolution. We prove that, for constant gap, general quantum processes that approximately prepare the final eigenstate require a minimum time proportional to the ratio of the length of the eigenstate path to the gap. Thus, no rigorous adiabatic condition can yield a smaller cost. We also giv...
متن کاملNon-hermitian Adiabatic Quantum Optimization
Many physical and combinatorial problems associated with complex networks of interacting degrees of freedom can be mapped to equivalent problems of finding the ground (or minimum cost) state of a corresponding quantum Hamiltonian H0 1,2,3,4,5,6,7,8,9. One of the approaches to finding the ground state of H0 is adiabatic quantum computation which can be formulated as follows. Consider the time de...
متن کاملAccuracy versus run time in an adiabatic quantum search
A. T. Rezakhani,1,2,3 A. K. Pimachev,1,2 and D. A. Lidar1,2,4,5 1Department of Chemistry, University of Southern California, Los Angeles, California 90089, USA 2Center for Quantum Information Science & Technology, University of Southern California, Los Angeles, California 90089, USA 3Department of Physics, Sharif University of Technology, Tehran, Iran 4Department of Physics, University of South...
متن کاملMultiobjective Optimization in a Quantum Adiabatic Computer
In this work we present a quantum algorithm for multiobjective combinatorial optimization. We show that the adiabatic algorithm of Farhi et al. [arXiv:quant-ph/0001106] can be used by mapping a multiobjective combinatorial optimization problem onto a Hamiltonian using a convex combination among objectives. We present mathematical properties of the eigenspectrum of the associated Hamiltonian and...
متن کاملAdiabatic quantum optimization for associative memory recall
2 Hopfield networks are a variant of associative memory that recall patterns stored in the 3 couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the 4 network dynamics that correspond to energetic minima of the spin state. We show that memories 5 stored in a Hopfield network may also be recalled by energy minimization using adiabatic 6 quantum optimizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2017
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.95.032335