Improving nonstoquastic quantum annealing with spin-reversal transformations
arXiv:2010.00065 · doi:10.1103/PhysRevA.104.012619
Abstract
Nonstoquastic Hamiltonians are hard to simulate due to the sign problem in quantum Monte Carlo simulation. It is however unclear whether nonstoquasticity can lead to advantage in quantum annealing. Here we show that YY-interaction between the qubits makes the adiabatic path during quantum annealing, and therefore the performance, dependent on spin-reversal transformations. With the right choice of spin-reversal transformation, a nonstoquastic Hamiltonian with YY-interaction can outperform stoquastic Hamiltonians with similar parameters. We introduce an optimization protocol to determine the optimal transformation and discuss the effect of suboptimality.
References in corpus (25)
- Quantum Annealing in the Transverse Ising Model
- QuTiP 2: A Python framework for the dynamics of open quantum systems
- QuTiP: An open-source Python framework for the dynamics of open quantum systems
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Quantum Computation by Adiabatic Evolution
- Architectural considerations in the design of a superconducting quantum annealing processor
- Consistency of the Adiabatic Theorem
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- First Order Quantum Phase Transition in Adiabatic Quantum Computation
- Understanding Quantum Tunneling through Quantum Monte Carlo Simulations
- Nonstoquastic Hamiltonians and Quantum Annealing of an Ising Spin Glass
- Exponential Enhancement of the Efficiency of Quantum Annealing by Non-Stochastic Hamiltonians
- Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
- On the Computational Complexity of Curing the Sign Problem
- Role of Non-stoquastic Catalysts in Quantum Adiabatic Optimization
- Algorithmic approach to adiabatic quantum optimization
- Adiabatic optimization versus diffusion Monte Carlo
- Relation between quantum fluctuations and the performance enhancement of quantum annealing in a nonstoquastic Hamiltonian
- De-Signing Hamiltonians for Quantum Adiabatic Optimization
- Two-local qubit Hamiltonians: when are they stoquastic?
- Quantum Speed-Up at Zero Temperature via Coherent Catalysis
- Proof of efficient, parallelized, universal adiabatic quantum computation
Cited by in corpus (3)
- Comparing Three Generations of D-Wave Quantum Annealers for Minor Embedded Combinatorial Optimization Problems
- Quantum Annealing with Trigger Hamiltonians: Application to 2-SAT and Nonstoquastic Problems
- Quantum annealing for hard 2-SAT problems : Distribution and scaling of minimum energy gap and success probability