From Ansätze to Z-gates: a NASA View of Quantum Computing
arXiv:1905.02860 · doi:10.3233/APC190010
Abstract
For the last few years, the NASA Quantum Artificial Intelligence Laboratory (QuAIL) has been performing research to assess the potential impact of quantum computers on challenging computational problems relevant to future NASA missions. A key aspect of this research is devising methods to most effectively utilize emerging quantum computing hardware. Research questions include what experiments on early quantum hardware would give the most insight into the potential impact of quantum computing, the design of algorithms to explore on such hardware, and the development of tools to minimize the quantum resource requirements. We survey work relevant to these questions, with a particular emphasis on our recent work in quantum algorithms and applications, in elucidating mechanisms of quantum mechanics and their uses for quantum computational purposes, and in simulation, compilation, and physics-inspired classical algorithms. To our early application thrusts in planning and scheduling, fault diagnosis, and machine learning, we add thrusts related to robustness of communication networks and the simulation of many-body systems for material science and chemistry. We provide a brief update on quantum annealing work, but concentrate on gate-model quantum computing research advances within the last couple of years.
arXiv comment20 pages plus extensive references, 3 figures
References in corpus (94)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Quantum Annealing in the Transverse Ising Model
- Barren plateaus in quantum neural network training landscapes
- A Quantum Approximate Optimization Algorithm
- Efficient simulation of one-dimensional quantum many-body systems
- Pixel Recurrent Neural Networks
- Semi-Supervised Learning with Deep Generative Models
- Characterizing Quantum Supremacy in Near-Term Devices
- Phenomenology of fully many-body-localized systems
- A phenomenology of certain many-body-localized systems
- Local conservation laws and the structure of the many-body localized states
- Quantum Computational Supremacy
- Quantum annealing with more than one hundred qubits
- A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
- Towards Quantum Chemistry on a Quantum Computer
- Elucidating Reaction Mechanisms on Quantum Computers
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Grover's quantum searching algorithm is optimal
- On Many-Body Localization for Quantum Spin Chains
- Defining and detecting quantum speedup
- Quantum Computation by Adiabatic Evolution
- Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
- Integrals of motion in the Many-Body localized phase
- Simulating quantum computation by contracting tensor networks
- Quantum measurements and the Abelian Stabilizer Problem
- A blueprint for demonstrating quantum supremacy with superconducting qubits
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
- Quantum Algorithms for Fermionic Simulations
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Gate count estimates for performing quantum chemistry on small quantum computers
- QMCPACK : An open source ab initio Quantum Monte Carlo package for the electronic structure of atoms, molecules, and solids
- Diagonalization and Many-Body Localization for a Disordered Quantum Spin Chain
- Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers
- Anderson localization casts clouds over adiabatic quantum optimization
- 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
- -mixers: analytical and numerical results for QAOA
- Quantum Supremacy through the Quantum Approximate Optimization Algorithm
- Low rank representations for quantum simulation of electronic structure
- Many-body mobility edge in a mean-field quantum spin glass
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Quantum computing and the entanglement frontier
- Quantum Simulation of Helium Hydride in a Solid-State Spin Register
- Simulating chemistry efficiently on fault-tolerant quantum computers
- Near-optimal quantum circuit for Grover's unstructured search using a transverse field
- Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions
- Compiling quantum circuits to realistic hardware architectures using temporal planners
- A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
- Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
- Quantum Annealing Implementation of Job-Shop Scheduling
- 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
- Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension
- Understanding Quantum Tunneling through Quantum Monte Carlo Simulations
- Practical optimization for hybrid quantum-classical algorithms
- A NASA Perspective on Quantum Computing: Opportunities and Challenges
- Quantum-assisted Helmholtz machines: A quantum-classical deep learning framework for industrial datasets in near-term devices
- On the representation of Boolean and real functions as Hamiltonians for quantum computing
- Training A Quantum Optimizer
- A quantum algorithm to train neural networks using low-depth circuits
- A Quantum Annealing Approach for Fault Detection and Diagnosis of Graph-Based Systems
- Exponentially-Biased Ground-State Sampling of Quantum Annealing Machines with Transverse-Field Driving Hamiltonians
- Singularities of Quantum Control Landscapes
- The many-body localized phase of the quantum random energy model
- Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension
- Scaling analysis and instantons for thermally-assisted tunneling and Quantum Monte Carlo simulations
- Molecular-Atomic Transition in the Deuterium Hugoniot with Coupled Electron Ion Monte Carlo
- Discrete Variational Autoencoders
- Quantum annealing via environment-mediated quantum diffusion
- The role of controllability in optimizing quantum dynamics
- Open system quantum annealing in mean field models with exponential degeneracy
- Performance of QAOA on Typical Instances of Constraint Satisfaction Problems with Bounded Degree
- On the relevance of avoided crossings away from quantum critical point to the complexity of quantum adiabatic algorithm
- Direct calculation of the Entanglement Spectrum in Quantum Monte Carlo with application to \textit{ab initio} Hamiltonians
- Average-Case Quantum Advantage with Shallow Circuits
- Error Suppression for Hamiltonian Quantum Computing in Markovian Environments
- PixelVAE++: Improved PixelVAE with Discrete Prior
- Ergodic and localized regions in quantum spin glasses on the Bethe lattice
- Patch-planting spin-glass solution for benchmarking
- Quantum Proofs for Classical Theorems
- Quantum Control Landscapes Are Almost Always Trap Free
- Renyi Entanglement Entropy of Molecules: Interaction Effects and Signatures of Bonding
- Feeding the multitude: A polynomial-time algorithm to improve sampling
- Random Transverse Field Spin-Glass Model on the Cayley tree : phase transition between the two Many-Body-Localized Phases
- Path-Integral Quantum Monte Carlo simulation with Open-Boundary Conditions
- GumBolt: Extending Gumbel trick to Boltzmann priors
- Parameterization of tensor network contraction