Adiabatic quantum optimization with the wrong Hamiltonian
arXiv:1310.0529 · doi:10.1103/PhysRevA.88.062314
Abstract
Analog models of quantum information processing, such as adiabatic quantum computation and analog quantum simulation, require the ability to subject a system to precisely specified Hamiltonians. Unfortunately, the hardware used to implement these Hamiltonians will be imperfect and limited in its precision. Even small perturbations and imprecisions can have profound effects on the nature of the ground state. Here we consider an imperfect implementation of adiabatic quantum optimization and show that, for a widely applicable random control noise model, quantum stabilizer encodings are able to reduce the effective noise magnitude and thus improve the likelihood of a successful computation or simulation. This reduction builds upon two design principles: summation of equivalent logical operators to increase the energy scale of the encoded optimization problem, and the inclusion of a penalty term comprising the sum of the code stabilizer elements. We illustrate our findings with an Ising ladder and show that classical repetition coding drastically increases the probability that the ground state of a perturbed model is decodable to that of the unperturbed model, while using only realistic two-body interaction. Finally, we note that the repetition encoding is a special case of quantum stabilizer encodings, and show that this in principle allows us to generalize our results to many types of analog quantum information processing, albeit at the expense of many-body interactions.
8 pages, 4 figures
References in corpus (7)
- Bounds for the adiabatic approximation with applications to quantum computation
- Error corrected quantum annealing with hundreds of qubits
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- Towards Fault Tolerant Adiabatic Quantum Computation
- Quantum accuracy threshold for concatenated distance-3 codes
- Error suppression and error correction in adiabatic quantum computation I: techniques and challenges
- High Fidelity Adiabatic Quantum Computation via Dynamical Decoupling
Cited by in corpus (37)
- Quantum Optimization of Fully-Connected Spin Glasses
- Probing for quantum speedup in spin glass problems with planted solutions
- Decoherence in adiabatic quantum computation
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Consistency Tests of Classical and Quantum Models for a Quantum Annealer
- Quantum annealing correction for random Ising problems
- Modernizing Quantum Annealing using Local Searches
- Quantum Annealing Correction with Minor Embedding
- Benchmarking a quantum annealing processor with the time-to-target metric
- Role of Non-stoquastic Catalysts in Quantum Adiabatic Optimization
- Nested Quantum Annealing Correction
- Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
- Quantum fluctuation theorem to benchmark quantum annealers
- Quantum annealing correction at finite temperature: ferromagnetic -spin models
- Algorithm engineering for a quantum annealing platform
- Analog Errors in Ising Machines
- Performance of two different quantum annealing correction codes
- An energetic perspective on rapid quenches in quantum annealing
- Mean Field Analysis of Quantum Annealing Correction
- Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs
- Schedule path optimization for quantum annealing and adiabatic quantum computing
- Scalable effective temperature reduction for quantum annealers via nested quantum annealing correction
- Two quantum Ising algorithms for the Shortest Vector Problem: one for now and one for later
- Nested Quantum Annealing Correction at Finite Temperature: -spin models
- A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing
- Fast clique minor generation in Chimera qubit connectivity graphs
- Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes
- Error measurements for a quantum annealer using the one-dimensional Ising model with twisted boundaries
- Quantum annealing with a nonvanishing final value of the transverse field
- Perturbative gadgets without strong interactions
- Demonstration of error-suppressed quantum annealing via boundary cancellation
- Using copies to improve precision in continuous-time quantum computing
- Benchmarking Embedded Chain Breaking in Quantum Annealing
- Analog Errors in Quantum Annealing: Doom and Hope
- Structural Comparison of Error Mitigation Methods for Ising Machines: Penalty-Spin Model versus Stacked Model
- Frustration-enhanced quantum annealing correction models with additional inter-replica interactions
- Families of 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions