Quantum Annealing for Industry Applications: Introduction and Review
arXiv:2112.07491 · doi:10.1088/1361-6633/ac8c54
Abstract
Quantum annealing is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale quantum processors that implement the quantum annealing algorithm for programmable use. Specifically, quantum annealing processors produced by D-Wave Systems have been studied and tested extensively in both research and industrial settings across different disciplines. In this paper we provide a literature review of the theoretical motivations for quantum annealing as a heuristic quantum optimization algorithm, the software and hardware that is required to use such quantum processors, and the state-of-the-art applications and proofs-of-concepts that have been demonstrated using them. The goal of our review is to provide a centralized and condensed source regarding applications of quantum annealing technology. We identify the advantages, limitations, and potential of quantum annealing for both researchers and practitioners from various fields.
arXiv commentmajor revision with extended noise section and discussion of alternative platforms
References in corpus (78)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Ising formulations of many NP problems
- Coherent control of macroscopic quantum states in a single-Cooper-pair box
- Adiabatic Quantum Computing
- Parallel Tempering: Theory, Applications, and New Perspectives
- Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
- Demonstration of a small programmable quantum computer with atomic qubits
- Programmable quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms
- Quantum Annealing and Analog Quantum Computation
- Quantum computing for finance: overview and prospects
- Defining and detecting quantum speedup
- Experimental realization of a quantum algorithm
- Benchmarking an 11-qubit quantum computer
- Perspectives of quantum annealing: Methods and implementations
- Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- Mathematical Foundation of Quantum Annealing
- A compact ion-trap quantum computing demonstrator
- Observation of topological phenomena in a programmable lattice of 1,800 qubits
- High fidelity spin entanglement using optimal control
- Implementation of a Quantum Algorithm to Solve Deutsch's Problem on a Nuclear Magnetic Resonance Quantum Computer
- Demonstration of Universal Parametric Entangling Gates on a Multi-Qubit Lattice
- Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
- What is the Computational Value of Finite Range Tunneling?
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- Reverse Quantum Annealing Approach to Portfolio Optimization Problems
- A case study in programming a quantum annealer for hard operational planning problems
- Quantum Optimization of Fully-Connected Spin Glasses
- Error corrected quantum annealing with hundreds of qubits
- Entanglement in a quantum annealing processor
- A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer
- Expanding the horizon of automated metamaterials discovery via quantum annealing
- Support vector machines on the D-Wave quantum annealer
- Realizable Hamiltonians for Universal Adiabatic Quantum Computers
- Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
- Quantum annealing versus classical machine learning applied to a simplified computational biology problem
- Nonnegative/binary matrix factorization with a D-Wave quantum annealer
- Application of Quantum Annealing to Nurse Scheduling Problem
- Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
- Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
- Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
- Coherent addressing of individual neutral atoms in a 3D optical lattice
- Quantum Annealing for Combinatorial Clustering
- Traffic Signal Optimization on a Square Lattice with Quantum Annealing
- Modernizing Quantum Annealing using Local Searches
- Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
- A Coherent Quantum Annealer with Rydberg Atoms
- Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
- Domain wall encoding of discrete variables for quantum annealing and QAOA
- Tunneling and speedup in quantum optimization for permutation-symmetric problems
- Exponential Enhancement of the Efficiency of Quantum Annealing by Non-Stochastic Hamiltonians
- Exponential Speedup of Quantum Annealing by Inhomogeneous Driving of the Transverse Field
- Whole-device entanglement in a 65-qubit superconducting quantum computer
- Benchmarking Quantum Annealing Controls with Portfolio Optimization
- Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
- Scalable squeezed light source for continuous variable quantum sampling
- On the Computational Complexity of Curing the Sign Problem
- Global warming: Temperature estimation in annealers
- Rapid counter-diabatic sweeps in lattice gauge adiabatic quantum computing
- Reverse Annealing for Nonnegative/Binary Matrix Factorization
- Non-Stoquastic Interactions in Quantum Annealing via the Aharonov-Anandan Phase
- Polymer Physics by Quantum Computing
- Programmable Quantum Annealing Architectures with Ising Quantum Wires
- Quantum annealing for the number partitioning problem using a tunable spin glass of ions
- Enhancing Quantum Annealing Performance for the Molecular Similarity Problem
- Quantum annealing with ultracold atoms in a multimode optical resonator
- Scaling overhead of embedding optimization problems in quantum annealing
- Machine Learning Framework for Quantum Sampling of Highly-Constrained, Continuous Optimization Problems
- Thermalization, freeze-out and noise: deciphering experimental quantum annealers
- Probing Entanglement in Adiabatic Quantum Optimization with Trapped Ions
- Quantum algorithms with local particle number conservation: noise effects and error correction
- Practical Integer-to-Binary Mapping for Quantum Annealers
- De-Signing Hamiltonians for Quantum Adiabatic Optimization
- Computational Overhead of Locality Reduction in Binary Optimization Problems
- Embedding of Complete Graphs in Broken Chimera Graphs
- Parity Quantum Optimization: Encoding Constraints
- Quantum-assisted finite-element design optimization
Cited by in corpus (13)
- Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
- Application of QUBO solver using black-box optimization to structural design for resonance avoidance
- NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
- Quantum approximate optimization algorithm for qudit systems
- Quantum Computing Techniques for Multi-Knapsack Problems
- Comparing Three Generations of D-Wave Quantum Annealers for Minor Embedded Combinatorial Optimization Problems
- Imaginary time evolution with quantum nondemolition measurements: multi-qubit interactions via measurement nonlinearities
- Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits
- An Advantage Using Feature Selection with a Quantum Annealer
- Dynamic Asset Allocation with Expected Shortfall via Quantum Annealing
- Quantum Algorithm for Smoothed Particle Hydrodynamics
- Mapping State Transition Susceptibility in Quantum Annealing
- Calculating Nash Equilibrium on Quantum Annealers