Difference between quantum annealing by imaginary-time and real-time Schrödinger equation of Grover's search
arXiv:1801.06297 · doi:10.7566/JPSJ.88.024803
Abstract
We confirmed the annealing time of Grover's search which is required to obtain desired success probability for quantum annealing by the imaginary-time and the real-time Schrödinger equation with two kinds of schedulings; one linearly decreases the quantum fluctuation and the other tunes the evolution rate of the Hamiltonian based on the adiabatic condition. With linear scheduling, the required annealing time for quantum annealing by the imaginary-time Schrödinger equation is of order , which is very different from required for the quantum annealing by the real-time Schrödinger equation. With the scheduling based on the adiabatic condition, the required annealing time is of order , which is identical to the annealing time for quantum annealing by the real-time Schrödinger equation. Although the scheduling based on the adiabatic condition is optimal for the quantum annealing by the real-time Schrödinger equation, it is inefficient for the quantum annealing by the imaginary-time Schrödinger equation. This result implies that the optimal scheduling for the quantum annealing by the imaginary-time and the real-time Schrödinger equation is very different, and the efficient scheduling considered with the quantum Monte Carlo methods, which is based on imaginary-time Schrödinger equation, is not necessarily effective to improve the performance of quantum annealing by the real-time Schrödinger equation. We discuss the efficient scheduling for quantum annealing by the imaginary-time Schrödinger equation with respect to the exponential decay of excited states.
arXiv comment6 pages, 2 figure
References in corpus (17)
- Quantum Mechanics helps in searching for a needle in a haystack
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- Theory of Quantum Annealing of an Ising Spin Glass
- Quantum Search by Local Adiabatic Evolution
- Defining and detecting quantum speedup
- Mathematical Foundation of Quantum Annealing
- What is the Computational Value of Finite Range Tunneling?
- Quantum annealing of the Traveling Salesman Problem
- Quantum annealing with antiferromagnetic fluctuations
- Optimization by Quantum Annealing: Lessons from hard 3-SAT cases
- Optimization by Quantum Annealing: Lessons from Simple Cases
- Comparative Study of the Performance of Quantum Annealing and Simulated Annealing
- Direct comparison of quantum and simulated annealing on a fully-connected Ising ferromagnet
- Quantum annealing speedup over simulated annealing on random Ising chains
- Adiabatic approximation for the imaginary-time Schroedinger equation and its application to simulated annealing
- Dynamics of open quantum systems by interpolation of von Neumann and classical master equations, and its application to quantum annealing