Localization in the constrained quantum annealing of graph coloring
arXiv:1902.07888 · doi:10.7566/JPSJ.89.064001
Abstract
Constrained quantum annealing (CQA) is a quantum annealing approach that is designed so that constraints are satisfied without penalty terms. There is an analogy between the model for the CQA of graph coloring and a set of disordered spin chains. In the model for the CQA of graph coloring, disorder corresponds to the fluctuation of effective local fields that increase in a CQA process. Numerical simulations of effective fields and entanglement demonstrate how localization appears in the CQA. Some notable features appear in the concurrence, which is a measure of entanglement, plotted as a function of the fluctuation of effective fields.
arXiv comment7 pages, 7 figures
References in corpus (42)
- Chaos and Quantum Thermalization
- Thermalization and its mechanism for generic isolated quantum systems
- Entanglement of a Pair of Quantum Bits
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Adiabatic Quantum Computing
- Many-body localization edge in the random-field Heisenberg chain
- Unbounded growth of entanglement in models of many-body localization
- Many body localization in Heisenberg XXZ magnet in a random field
- Local conservation laws and the structure of the many-body localized states
- Quantum Annealing and Analog Quantum Computation
- Universal slow growth of entanglement in interacting strongly disordered systems
- Many-body localization in a disordered quantum Ising chain
- Entangled Rings
- Phase Transitions in the Coloring of Random Graphs
- Two universality classes for the many-body localization transition
- Anderson localization casts clouds over adiabatic quantum optimization
- Many-body localization characterized from a one-particle perspective
- A case study in programming a quantum annealer for hard operational planning problems
- Critical Properties of the Many-Body Localization Transition
- Quantum annealing of the Traveling Salesman Problem
- First order phase transition in the Quantum Adiabatic Algorithm
- First Order Quantum Phase Transition in Adiabatic Quantum Computation
- Experimental determination of Ramsey numbers
- Nonstoquastic Hamiltonians and Quantum Annealing of an Ising Spin Glass
- Quantum Annealing for Constrained Optimization
- Many-body localization in infinite chains
- Universal properties of many-body localization transitions in quasiperiodic systems
- Exponential Enhancement of the Efficiency of Quantum Annealing by Non-Stochastic Hamiltonians
- Exponential Speedup of Quantum Annealing by Inhomogeneous Driving of the Transverse Field
- Ramsey numbers and adiabatic quantum computing
- Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs
- Driver Hamiltonians for constrained optimization in quantum annealing
- Many-body localization in Fock-space: a local perspective
- Percolation in Fock space as a proxy for many-body localisation
- Graph isomorphism and adiabatic quantum computing
- Many Body Localization Due to Correlated Disorder in Fock Space
- Local entanglement structure across a many-body localization transition
- Constrained quantum annealing of graph coloring
- Exact solution of a percolation analogue for the many-body localisation transition
- Simple probability distributions on a Fock-space lattice