Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study

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 (21)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• A Quantum Approximate Optimization Algorithm
• Black holes as mirrors: quantum information in random subsystems
• A class of quantum many-body states that can be efficiently simulated
• Lieb-Robinson bounds and the generation of correlations and topological quantum order
• Hiding Quiet Solutions in Random Constraint Satisfaction Problems
• A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
• 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
• Quantum computing hardware for HEP algorithms and sensing
• Noise suppression via generalized-Markovian processes
• Pre-optimizing variational quantum eigensolvers with tensor networks
• Simulations of state-of-the-art fermionic neural network wave functions with diffusion Monte Carlo
• Planning for Compilation of a Quantum Algorithm for Graph Coloring
• Discriminating Non-Isomorphic Graphs with an Experimental Quantum Annealer
• Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms
• 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
• 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