Analog Errors in Ising Machines
arXiv:1806.03744 · doi:10.1088/2058-9565/ab13ea
Abstract
Recent technological breakthroughs have precipitated the availability of specialized devices that promise to solve NP-Hard problems faster than standard computers. These `Ising Machines' are however analog in nature and as such inevitably have implementation errors. We find that their success probability decays exponentially with problem size for a fixed error level, and we derive a sufficient scaling law for the error in order to maintain a fixed success probability. We corroborate our results with experiment and numerical simulations and discuss the practical implications of our findings.
arXiv comment14 pages, 15 figures. v2: Updated to published version
References in corpus (37)
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Quantum Annealing in the Transverse Ising Model
- Characterizing Quantum Supremacy in Near-Term Devices
- Boson Sampling on a Photonic Chip
- Photonic Boson Sampling in a Tunable Circuit
- A blueprint for demonstrating quantum supremacy with superconducting qubits
- Architectural considerations in the design of a superconducting quantum annealing processor
- Can One Trust Quantum Simulators?
- Average-case complexity versus approximate simulation of commuting quantum computations
- Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
- Computational Role of Multiqubit Tunneling in a Quantum Annealer
- Quantum Optimization of Fully-Connected Spin Glasses
- Error corrected quantum annealing with hundreds of qubits
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- Thermal and Residual Excited-State Population in a 3D Transmon Qubit
- A scalable control system for a superconducting adiabatic quantum optimization processor
- Probing for quantum speedup in spin glass problems with planted solutions
- A scalable readout system for a superconducting adiabatic quantum optimization system
- Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
- Quantum annealing correction for random Ising problems
- On the hardness of classically simulating the one clean qubit model
- Quantum Annealing Correction with Minor Embedding
- Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
- Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities
- Inductance of Circuit Structures for MIT LL Superconductor Electronics Fabrication Process with 8 Niobium Layers
- Temperature and Disorder Chaos in Three-Dimensional Ising Spin Glasses
- Scalings of domain wall energies in two dimensional Ising spin glasses
- Temperature scaling law for quantum annealing optimizers
- Adiabatic quantum optimization with the wrong Hamiltonian
- Unraveling Quantum Annealers using Classical Hardness
- Chaos and Universality in a Four-Dimensional Spin Glass
- Nested Quantum Annealing Correction
- Temperature chaos in 3D Ising Spin Glasses is driven by rare events
- Performance evaluation of coherent Ising machines against classical neural networks
- Disorder chaos in spin glasses
- Bond chaos in spin glasses revealed through thermal boundary conditions
- Signature of the Ground-State Topology in the Low-Temperature Dynamics of Spin Glasses
Cited by in corpus (25)
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
- Role of Non-stoquastic Catalysts in Quantum Adiabatic Optimization
- 3-Regular 3-XORSAT Planted Solutions Benchmark of Classical and Quantum Heuristic Optimizers
- Image Acquisition Planning for Earth Observation Satellites with a Quantum Annealer
- Programmable Quantum Annealers as Noisy Gibbs Samplers
- The Quantum Transition of the Two-Dimensional Ising Spin Glass: A Tale of Two Gaps
- Small, Highly Accurate Quantum Processor for Intermediate-Depth Quantum Simulations
- High-quality Thermal Gibbs Sampling with Quantum Annealing Hardware
- Improved Boltzmann machines with error corrected quantum annealing
- Scaling Advantage in Approximate Optimization with Quantum Annealing
- Equation Planting: A Tool for Benchmarking Ising Machines
- Using quantum annealing to design lattice proteins
- Computational Overhead of Locality Reduction in Binary Optimization Problems
- Disorder-dressed quantum evolution
- Signatures of Open and Noisy Quantum Systems in Single-Qubit Quantum Annealing
- Perils of Embedding for Sampling Problems
- A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing
- Disorder-assisted graph coloring on quantum annealers
- How Quantum is the Speedup in Adiabatic Unstructured Search?
- Demonstration of error-suppressed quantum annealing via boundary cancellation
- Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
- Spatial correlations in the qubit properties of D-Wave 2000Q measured and simulated qubit networks
- Quantitative analysis of the effectiveness of mid-anneal measurement in quantum annealing
- Structural Comparison of Error Mitigation Methods for Ising Machines: Penalty-Spin Model versus Stacked Model