Benchmarking Embedded Chain Breaking in Quantum Annealing

Abstract

Quantum annealing solves combinatorial optimization problems by finding the energetic ground states of an embedded Hamiltonian. However, quantum annealing dynamics under the embedded Hamiltonian may violate the principles of adiabatic evolution and generate excitations that correspond to errors in the computed solution. Here we empirically benchmark the probability of chain breaks and identify sweet spots for solving a suite of embedded Hamiltonians. We further correlate the physical location of chain breaks in the quantum annealing hardware with the underlying embedding technique and use these localized rates in a tailored post-processing strategies. Our results demonstrate how to use characterization of the quantum annealing hardware to tune the embedded Hamiltonian and remove computational errors.

References in corpus (23)

• Ising formulations of many NP problems
• Adiabatic Quantum Computing
• Dynamics of quantum phase transition: exact solution in quantum Ising model
• Robustness of adiabatic quantum computation
• Reverse Quantum Annealing Approach to Portfolio Optimization Problems
• Quantum Optimization of Fully-Connected Spin Glasses
• Decoherence in adiabatic quantum computation
• Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
• Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
• Quantum annealing correction for random Ising problems
• Quantum Annealing Correction with Minor Embedding
• Decoherence in adiabatic quantum computation
• Benchmarking a quantum annealing processor with the time-to-target metric
• Prime factorization using quantum annealing and computational algebraic geometry
• Adiabatic quantum optimization with the wrong Hamiltonian
• Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization
• Finite temperature quantum annealing solving exponentially small gap problem with non-monotonic success probability
• Quantum annealing correction at finite temperature: ferromagnetic $p$-spin models
• Heavy tails in the distribution of time-to-solution for classical and quantum annealing
• Algorithm engineering for a quantum annealing platform
• Performance of two different quantum annealing correction codes
• Exploring More-Coherent Quantum Annealing
• Improving performance of logical qubits by parameter tuning and topology compensation