Viewing Vanilla Quantum Annealing Through Spin Glasses
arXiv:1708.08885 · doi:10.1088/2058-9565/aab6ba
Abstract
Quantum annealing promises to solve complex combinatorial optimization problems faster than current transistor-based computer technologies. Although to date only one commercially-available quantum annealer is procurable, one can already start to map out the application scope of these novel optimization machines. These mid-scale programmable analog special-purpose devices could, potentially, revolutionize optimization. However, their disruptive application domain remains to be found. While the commercial analog quantum optimization machine by D-Wave Systems Inc. already exceeds 1000 qubits, here it is argued that maybe smaller devices with better quality qubits, higher connectivity, and more tunability might be better suited to answer if quantum annealing will ever truly outperform specialized silicon technology combined with efficient heuristics for optimization and sampling applications.
arXiv commentPerspective article submitted to QST on the subject "What would you do with 1000 qubits?"
References in corpus (45)
- Exchange Monte Carlo Method and Application to Spin Glass Simulations
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum annealing with more than one hundred qubits
- Theory of Quantum Annealing of an Ising Spin Glass
- Quantum Annealing and Analog Quantum Computation
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Defining and detecting quantum speedup
- Experimental Comparison of Two Quantum Computing Architectures
- Architectural considerations in the design of a superconducting quantum annealing processor
- Experimental signature of programmable quantum annealing
- What is the Computational Value of Finite Range Tunneling?
- Feedback-optimized parallel tempering Monte Carlo
- Computational Role of Multiqubit Tunneling in a Quantum Annealer
- A case study in programming a quantum annealer for hard operational planning problems
- Estimation of effective temperatures in quantum annealers for sampling applications: A case study with possible applications in deep learning
- Quantum Optimization of Fully-Connected Spin Glasses
- Error corrected quantum annealing with hundreds of qubits
- Entanglement in a quantum annealing processor
- Quantum versus Classical Annealing of Ising Spin Glasses
- Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
- Probing for quantum speedup in spin glass problems with planted solutions
- Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
- Consistency Tests of Classical and Quantum Models for a Quantum Annealer
- Singlet Excitations in Pyrochlore: A Study of Quantum Frustration
- Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
- Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Models
- Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension
- Quantum annealing correction for random Ising problems
- Reexamining classical and quantum models for the D-Wave One processor
- Quantum Annealing Correction with Minor Embedding
- Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
- Comparing Monte Carlo methods for finding ground states of Ising spin glasses: population annealing, simulated annealing and parallel tempering
- Exponential Enhancement of the Efficiency of Quantum Annealing by Non-Stochastic Hamiltonians
- A Quantum Annealing Approach for Fault Detection and Diagnosis of Graph-Based Systems
- Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities
- Exponentially-Biased Ground-State Sampling of Quantum Annealing Machines with Transverse-Field Driving Hamiltonians
- Finding Low-Temperature States with Parallel Tempering, Simulated Annealing and Simple Monte Carlo
- MAX 2-SAT with up to 108 qubits
- Unraveling Quantum Annealers using Classical Hardness
- Enhancing Quantum Annealing Performance for the Molecular Similarity Problem
- Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods
- Practical engineering of hard spin-glass instances
- From local to global ground states in Ising spin glasses
- The pitfalls of planar spin-glass benchmarks: Raising the bar for quantum annealers (again)
Cited by in corpus (9)
- Quantum computing for finance: overview and prospects
- Perspectives of quantum annealing: Methods and implementations
- Combinatorial Optimization with Physics-Inspired Graph Neural Networks
- A quantum annealer with fully programmable all-to-all coupling via Floquet engineering
- Scaling overhead of embedding optimization problems in quantum annealing
- Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian
- Demonstration of long-range correlations via susceptibility measurements in a one-dimensional superconducting Josephson spin chain
- Optimization of Robot Trajectory Planning with Nature-Inspired and Hybrid Quantum Algorithms
- Testing Quantum and Simulated Annealers on the Drone Delivery Packing Problem