2021/04/07 by Erica Grant, Travis Humble, Grant, Erica +2 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Adiabatic process #Adiabatic quantum computation #Algorithm #Annealing (glass) #Artificial intelligence #Benchmarking #Computer science #Embedding #FOS: Physical sciences #Hamiltonian (control theory) #Mathematical optimization #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum annealing #Quantum computer #Quantum mechanics #Quantum-Dot Cellular Automata #Simulated annealing #Statistical physics #Suite #Thermodynamics #quant-ph
paper · pdf · doi:10.48550/arxiv.2104.03258
published in arXiv (Cornell University) (Cornell University)
arxiv created 2021/04/07 · openalex publication_date 2021/04/07 · arxiv updated 2021/04/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
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.