The Perturbed Ferromagnetic Chain: A Tuneable Test of Quantum Hardness in the Transverse-Field Ising Model
arXiv:2106.11019 · doi:10.1103/PhysRevA.105.022410
Abstract
Quantum annealing in the transverse-field Ising model (TFIM) with open-system dynamics is known to use thermally-assisted tunneling to drive computation. However, it is still subject to debate whether quantum systems in the presence of decoherence are more useful than those using classical dynamics to drive computation. We contribute to this debate by introducing the perturbed ferromagnetic chain (PFC), a chain of frustrated sub-systems where the degree of frustration scales inversely with the perturbation introduced by a tunable parameter. This gives us an easily embeddable gadget whereby problem hardness can be tuned for systems of constant size. We outline the properties of the PFC and compare classical spin-vector Monte Carlo (SVMC) variants with the adiabatic quantum master equation. We demonstrate that SVMC methods get trapped in the exponentially large first-excited-state manifold when solving this frustrated problem, whereas evolution using quantum dynamics remains in the lowest energy eigenstates. This results in significant differences in ground state probability when using either classical or quantum annealing dynamics in the TFIM.
References in corpus (29)
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Observation of topological phenomena in a programmable lattice of 1,800 qubits
- Experimental signature of programmable quantum annealing
- Quantum Adiabatic Markovian Master Equations
- What is the Computational Value of Finite Range Tunneling?
- Reverse Quantum Annealing Approach to Portfolio Optimization Problems
- Computational Role of Multiqubit Tunneling in a Quantum Annealer
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing
- Expanding the horizon of automated metamaterials discovery via quantum annealing
- Quantum Speedup by Quantum Annealing
- Decoherence in adiabatic quantum computation
- Scaling advantage in quantum simulation of geometrically frustrated magnets
- Probing the Universality of Topological Defect Formation in a Quantum Annealer: Kibble-Zurek Mechanism and Beyond
- Consistency Tests of Classical and Quantum Models for a Quantum Annealer
- Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
- Traffic Signal Optimization on a Square Lattice with Quantum Annealing
- Probing Noise in Flux Qubits via Macroscopic Resonant Tunneling
- Tunneling and speedup in quantum optimization for permutation-symmetric problems
- A deceptive step towards quantum speedup detection
- Benchmarking Hamiltonian Noise in the D-Wave Quantum Annealer
- Finite temperature quantum annealing solving exponentially small gap problem with non-monotonic success probability
- Simulating the Shastry-Sutherland Ising Model using Quantum Annealing
- Why and when is pausing beneficial in quantum annealing?
- Comparing relaxation mechanisms in quantum and classical transverse-field annealing
- Probing High Frequency Noise with Macroscopic Resonant Tunneling
- Quantum and Classical in Adiabatic Computation
- Search range in experimental quantum annealing