A NASA Perspective on Quantum Computing: Opportunities and Challenges
arXiv:1704.04836 · doi:10.1016/j.parco.2016.11.002
Abstract
In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can provide an advantage, and if so by how much, or how to design quantum algorithms that realize such advantages. Many of the most challenging computational problems arising in the practical world are tackled today by heuristic algorithms that have not been mathematically proven to outperform other approaches but have been shown to be effective empirically. While quantum heuristic algorithms have been proposed, empirical testing becomes possible only as quantum computation hardware is built. The next few years will be exciting as empirical testing of quantum heuristic algorithms becomes more and more feasible. While large-scale universal quantum computers are likely decades away, special-purpose quantum computational hardware has begun to emerge that will become more powerful over time, as well as some small-scale universal quantum computers.
arXiv commentParallel Computing, 2016
References in corpus (38)
- Charge insensitive qubit design derived from the Cooper pair box
- Coherent control of macroscopic quantum states in a single-Cooper-pair box
- Hybrid quantum circuits: Superconducting circuits interacting with other quantum systems
- An introduction to quantum machine learning
- 1/f noise: implications for solid-state quantum information
- Defining and detecting quantum speedup
- Qubit architecture with high coherence and fast tunable coupling
- Quantum Computation by Adiabatic Evolution
- Dressed Collective Qubit States and the Tavis-Cummings Model in Circuit QED
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- A practical heuristic for finding graph minors
- 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
- Experimental Demonstration of a Robust and Scalable Flux Qubit
- Application of Quantum Annealing to Training of Deep Neural Networks
- Searching for quantum speedup in quasistatic quantum annealers
- Error correcting codes for adiabatic quantum computation
- Quantum Annealing Implementation of Job-Shop Scheduling
- Energy gaps in quantum first-order mean-field-like transitions: The problems that quantum annealing cannot solve
- 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
- Understanding Quantum Tunneling through Quantum Monte Carlo Simulations
- Quantum Annealing Correction with Minor Embedding
- A Compound Josephson Junction Coupler for Flux Qubits With Minimal Crosstalk
- A Quantum Annealing Approach for Fault Detection and Diagnosis of Graph-Based Systems
- On quantum mean-field models and their quantum annealing
- A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration
- Scaling analysis and instantons for thermally-assisted tunneling and Quantum Monte Carlo simulations
- An investigation of the hidden structure of states in a mean field spin glass model
- Construction of Energy Functions for Lattice Heteropolymer Models: A Case Study in Constraint Satisfaction Programming and Adiabatic Quantum Optimization
- Resource Efficient Gadgets for Compiling Adiabatic Quantum Optimization Problems
- Evidence for temperature dependent spin-diffusion as a mechanism of intrinsic flux noise in SQUIDs
- Open system quantum annealing in mean field models with exponential degeneracy
- A Performance Estimator for Quantum Annealers: Gauge selection and Parameter Setting
- Computational Role of Collective Tunneling in a Quantum Annealer
- Programmable Multi-Node Quantum Network Design and Simulation
- Critical properties of dissipative quantum spin systems in finite dimensions
Cited by in corpus (21)
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer
- Leveraging Quantum Annealing for Large MIMO Processing in Centralized Radio Access Networks
- Measurement-based adaptation protocol with quantum reinforcement learning
- A novel design update framework for topology optimization with quantum annealing: Application to truss and continuum structures
- Quantum-assisted associative adversarial network: Applying quantum annealing in deep learning
- A symbolic approach to discrete structural optimization using quantum annealing
- Measurement-based adaptation protocol with quantum reinforcement learning in a Rigetti quantum computer
- Adiabatic Quantum Kitchen Sinks for Learning Kernels Using Randomized Features
- A QUBO Formulation for Minimum Loss Spanning Tree Reconfiguration Problems in Electric Power Networks
- Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
- Quantum algorithms for scientific computing
- High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder
- From Ansätze to Z-gates: a NASA View of Quantum Computing
- Graph Coloring with Quantum Annealing
- Toward a standardized methodology for constructing quantum computing use cases
- Applications of Quantum Annealing in Statistics
- Decoding quantum error correction with Ising model hardware
- Quantum-soft QUBO Suppression for Accurate Object Detection
- A Variable Neighbourhood Descent Heuristic for Conformational Search Using a Quantum Annealer