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.
14 pages, 15 figures. v2: Updated to published version
References in corpus (9)
- Photonic Boson Sampling in a Tunable Circuit
- A blueprint for demonstrating quantum supremacy with superconducting qubits
- Thermal and Residual Excited-State Population in a 3D Transmon Qubit
- Quantum annealing correction for random Ising problems
- Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
- 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
- Performance evaluation of coherent Ising machines against classical neural networks
- Disorder chaos in 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