Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
arXiv:2406.15601 · doi:10.1016/j.future.2024.06.012
Abstract
Quantum computing is one of the most enticing computational paradigms with the potential to revolutionize diverse areas of future-generation computational systems. While quantum computing hardware has advanced rapidly, from tiny laboratory experiments to quantum chips that can outperform even the largest supercomputers on specialized computational tasks, these noisy-intermediate scale quantum (NISQ) processors are still too small and non-robust to be directly useful for any real-world applications. In this paper, we describe NASA's work in assessing and advancing the potential of quantum computing. We discuss advances in algorithms, both near- and longer-term, and the results of our explorations on current hardware as well as with simulations, including illustrating the benefits of algorithm-hardware co-design in the NISQ era. This work also includes physics-inspired classical algorithms that can be used at application scale today. We discuss innovative tools supporting the assessment and advancement of quantum computing and describe improved methods for simulating quantum systems of various types on high-performance computing systems that incorporate realistic error models. We provide an overview of recent methods for benchmarking, evaluating, and characterizing quantum hardware for error mitigation, as well as insights into fundamental quantum physics that can be harnessed for computational purposes.
27 pages, 0 figures
References in corpus (123)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Anyons in an exactly solved model and beyond
- Variational Quantum Algorithms
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- A Quantum Approximate Optimization Algorithm
- Improved Simulation of Stabilizer Circuits
- Black holes as mirrors: quantum information in random subsystems
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Suppressing quantum errors by scaling a surface code logical qubit
- A class of quantum many-body states that can be efficiently simulated
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Operator Spreading in Random Unitary Circuits
- Towards Practical Quantum Variational Algorithms
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Lieb-Robinson bounds and the generation of correlations and topological quantum order
- Quantum Computation by Adiabatic Evolution
- Ab-Initio Solution of the Many-Electron Schrödinger Equation with Deep Neural Networks
- Simulating quantum computation by contracting tensor networks
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- The random K-satisfiability problem: from an analytic solution to an efficient algorithm
- Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Information Scrambling in Computationally Complex Quantum Circuits
- Obstacles to State Preparation and Variational Optimization from Symmetry Protection
- Entanglement of Quantum Evolutions
- Hyper-optimized tensor network contraction
- Multiqubit Clifford groups are unitary 3-designs
- Probing for quantum speedup in spin glass problems with planted solutions
- General Methods for Digital Quantum Simulation of Gauge Theories
- Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
- Solving the sampling problem of the Sycamore quantum circuits
- Entanglement scaling of operators: a conformal field theory approach, with a glimpse of simulability of long-time dynamics in 1+1d
- Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
- Hiding Quiet Solutions in Random Constraint Satisfaction Problems
- A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
- Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
- Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
- Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
- Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
- Scrambling Dynamics and Out-of-Time Ordered Correlators in Quantum Many-Body Systems: a Tutorial
- Efficient algorithm for boson sampling with partially distinguishable photons
- Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension
- Hiding solutions in random satisfiability problems: A statistical mechanics approach
- A NASA Perspective on Quantum Computing: Opportunities and Challenges
- Observation of separated dynamics of charge and spin in the Fermi-Hubbard model
- On the representation of Boolean and real functions as Hamiltonians for quantum computing
- Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
- Information Scrambling over Bipartitions: Equilibration, Entropy Production, and Typicality
- Information Scrambling and Chaos in Open Quantum Systems
- A polynomial-time classical algorithm for noisy random circuit sampling
- Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
- A deceptive step towards quantum speedup detection
- Classical symmetries and the Quantum Approximate Optimization Algorithm
- On the Computational Complexity of Curing the Sign Problem
- Optimization by thermal cycling
- Characterizing local noise in QAOA circuits
- Wave function Ansatz (but Periodic) Networks and the Homogeneous Electron Gas
- Quantum speedup of branch-and-bound algorithms
- Primitive Quantum Gates for Dihedral Gauge Theories
- Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
- Quiet Planting in the Locked Constraint Satisfaction Problems
- Two-Unitary Decomposition Algorithm and Open Quantum System Simulation
- Quantum-Enhanced Greedy Combinatorial Optimization Solver
- Quantum algorithms with local particle number conservation: noise effects and error correction
- Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
- Practical engineering of hard spin-glass instances
- Scrambling of Algebras in Open Quantum Systems
- The Wishart planted ensemble: A tunably-rugged pairwise Ising model with a first-order phase transition
- Benchmarking variational quantum eigensolvers for the square-octagon-lattice Kitaev model
- Quantum-assisted associative adversarial network: Applying quantum annealing in deep learning
- A "thoughtful" Local Friendliness no-go theorem: a prospective experiment with new assumptions to suit
- Bounds on approximating Max XOR with quantum and classical local algorithms
- Quantum computing hardware for HEP algorithms and sensing
- Noise suppression via generalized-Markovian processes
- Entanglement Production and Convergence Properties of the Variational Quantum Eigensolver
- Preparing quantum many-body scar states on quantum computers
- Equation Planting: A Tool for Benchmarking Ising Machines
- Practical Verification of Quantum Properties in Quantum Approximate Optimization Runs
- Distillation of Indistinguishable Photons
- Ferromagnetically shifting the power of pausing
- Numerical Gate Synthesis for Quantum Heuristics on Bosonic Quantum Processors
- Lower Bounds on Quantum Annealing Times
- Learning Noise via Dynamical Decoupling of Entangled Qubits
- Simulation of adiabatic quantum computing for molecular ground states
- BROTOCs and Quantum Information Scrambling at Finite Temperature
- Perils of Embedding for Sampling Problems
- Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints
- Quantum-accelerated constraint programming
- Characterizing low-frequency qubit noise
- Quantum Logic Gate Synthesis as a Markov Decision Process
- Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
- Scrambling and operator entanglement in local non-Hermitian quantum systems
- Simulation of quantum optics by coherent state decomposition
- Binary Control Pulse Optimization for Quantum Systems
- Chook -- A comprehensive suite for generating binary optimization problems with planted solutions
- Pre-optimizing variational quantum eigensolvers with tensor networks
- Advantage of pausing: parameter setting for quantum annealers
- Nonergodic measurements of qubit frequency noise
- Simulations of state-of-the-art fermionic neural network wave functions with diffusion Monte Carlo
- Quantum annealing speedup of embedded problems via suppression of Griffiths singularities
- Planning for Compilation of a Quantum Algorithm for Graph Coloring
- Quantum Alternating Operator Ansatz (QAOA) beyond low depth with gradually changing unitaries
- QUBO.jl: A Julia Ecosystem for Quadratic Unconstrained Binary Optimization
- The planted -factor problem
- Lefschetz Thimble Quantum Monte Carlo for Spin Systems
- A truncated Davidson method for the efficient "chemically accurate" calculation of full configuration interaction wavefunctions without any large matrix diagonalization
- Master Equation Emulation and Coherence Preservation with Classical Control of a Superconducting Qubit
- Discriminating Non-Isomorphic Graphs with an Experimental Quantum Annealer
- Augmented fidelities for single qubit gates
- Switching Time Optimization for Binary Quantum Optimal Control
- Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms
- HybridQ: A Hybrid Simulator for Quantum Circuits
- Towards solving the Fermi-Hubbard model via tailored quantum annealers
- Benchmarking the Operation of Quantum Heuristics and Ising Machines: Scoring Parameter Setting Strategies on Optimization Applications
- Binary Quantum Control Optimization with Uncertain Hamiltonians
- Embedding quantum optimization problems using AC driven quantum ferromagnets
- Optimization and benchmarking of the thermal cycling algorithm
- Exponential acceleration of macroscopic quantum tunneling in a Floquet Ising model
- Primitive Quantum Gates for an Discrete Subgroup: Binary Octahedral
- Quantum Adversarial Learning in Emulation of Monte-Carlo Methods for Max-cut Approximation: QAOA is not optimal
- Self-consistent Quantum Iteratively Sparsified Hamiltonian method (SQuISH): A new algorithm for efficient Hamiltonian simulation and compression