Mapping State Transition Susceptibility in Quantum Annealing
arXiv:2210.16513 · doi:10.1103/PhysRevResearch.5.013224
Abstract
Quantum annealing is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. Quantum annealing in the transverse field Ising model, implemented on D-Wave devices, works by applying a time dependent transverse field, which puts all qubits into a uniform state of superposition, and then applying a Hamiltonian over time which describes a user programmed Ising problem. We present a method which utilizes two control features of D-Wave quantum annealers, reverse annealing and an h-gain schedule, to quantify the susceptibility, or the distance, between two classical states of an Ising problem. The starting state is encoded using reverse annealing, and the second state is encoded on the linear terms of problem Hamiltonian. An h-gain schedule is specified which incrementally increases the strength of the linear terms, thus allowing a quantification of the h-gain strength required to transition the anneal into a specific state at the final measurement. By the nature of quantum annealing, the state tends towards global minima and therefore we restrict the second classical state to a minimum solution of the given Ising problem. This susceptibility mapping, when enumerated across all initial states, shows in detail the behavior of the quantum annealer during reverse annealing. The procedure is experimentally demonstrated on three small test Ising's which were embedded in parallel on the D-Wave Advantage_system4.1. Analysis of the state transition mapping shows detailed characteristics of the reverse annealing process including intermediate state transition paths, which are visually represented as state transition networks.
arXiv commentTypo fixes and updated figures
References in corpus (56)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Quantum Computing in the NISQ era and beyond
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- Quantum annealing with more than one hundred qubits
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Quantum Annealing and Analog Quantum Computation
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Perspectives of quantum annealing: Methods and implementations
- Statistical physics of inference: Thresholds and algorithms
- Mathematical Foundation of Quantum Annealing
- Quantum Annealing for Industry Applications: Introduction and Review
- Experimental signature of programmable quantum annealing
- Warm-starting quantum optimization
- What is the Computational Value of Finite Range Tunneling?
- Reverse Quantum Annealing Approach to Portfolio Optimization Problems
- Quantum Optimization of Fully-Connected Spin Glasses
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing
- Probing for quantum speedup in spin glass problems with planted solutions
- Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
- Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
- Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
- Reverse annealing for the fully connected -spin model
- Quantum annealing correction for random Ising problems
- Modernizing Quantum Annealing using Local Searches
- Quantum Annealing Correction with Minor Embedding
- Nonstoquastic Hamiltonians and Quantum Annealing of an Ising Spin Glass
- Domain wall encoding of discrete variables for quantum annealing and QAOA
- Detecting Multiple Communities Using Quantum Annealing on the D-Wave System
- Prime factorization using quantum annealing and computational algebraic geometry
- A Quantum Annealing Approach for Fault Detection and Diagnosis of Graph-Based Systems
- Dynamics of reverse annealing for the fully-connected -spin model
- Exponentially-Biased Ground-State Sampling of Quantum Annealing Machines with Transverse-Field Driving Hamiltonians
- Qubit spin ice
- Parallel Quantum Annealing
- 3-Regular 3-XORSAT Planted Solutions Benchmark of Classical and Quantum Heuristic Optimizers
- Reverse Annealing for Nonnegative/Binary Matrix Factorization
- Quantum Computing for Quantum Tunnelling
- Uncertain fate of fair sampling in quantum annealing
- Scaling overhead of embedding optimization problems in quantum annealing
- Performance of two different quantum annealing correction codes
- Quantum annealing simulation of out-of-equilibrium magnetization in a spin-chain compound
- Fair Sampling by Simulated Annealing on Quantum Annealer
- Understanding domain-wall encoding theoretically and experimentally
- Experimental Realization of Classical Spin Liquids in a Programmable Quantum Device
- Computational hardness of spin-glass problems with tile-planted solutions
- Assessment of Quantum Annealing for the Construction of Satisfiability Filters
- Quantum Annealing Algorithms for Boolean Tensor Networks
- Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
- Fair sampling of ground-state configurations of binary optimization problems
- A double-slit proposal for quantum annealing
- Signatures of Open and Noisy Quantum Systems in Single-Qubit Quantum Annealing
- Customized quantum annealing schedules
- Perils of Embedding for Quantum Sampling
- Feeding the multitude: A polynomial-time algorithm to improve sampling
- The Perturbed Ferromagnetic Chain: A Tuneable Test of Quantum Hardness in the Transverse-Field Ising Model