A NASA perspective on quantum computing: Opportunities and challenges

  title={A NASA perspective on quantum computing: Opportunities and challenges},
  author={Rupak Biswas and Zhang Jiang and Kostya Kechezhi and Sergey Knysh and Salvatore Mandr{\`a} and Bryan O’Gorman and Alejandro Perdomo-Ortiz and Andre Petukhov and John Realpe-G{\'o}mez and Eleanor Gilbert Rieffel and Davide Venturelli and Fedir Vasko and Zhihui Wang},
  journal={Parallel Comput.},

Figures from this paper

From Ans\"atze to Z-gates: a NASA View of Quantum Computing

Early application thrusts related to robustness of communication networks and the simulation of many-body systems for material science and chemistry are added to the QuAIL research agenda.

Quantum Computing Methods for Supervised Learning

This paper provides a background and summarize key results of quantum computing before exploring its application to supervised machine learning problems, and aims to make this introduction accessible to data scientists, machine learning practitioners, and researchers from across disciplines.

From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz

The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter.

Quantum Computing for Solving Spatial Optimization Problems

This chapter demonstrates how to employ QA to solve NP-hard spatial optimization problems through an illustrative example of programming a p-median model and a case study on spatial supply chain optimization.

Quantum-inspired memory-enhanced stochastic algorithms

It is shown that it is possible to develop quantum-inspired classical algorithms that require much less memory than the best classical algorithms known to date.

Quantum Speedup for Aeroscience and Engineering

An overview of the state-of-the art in QC is given, tailored towards interests in the aerospace community, which has been relying on high performance computing heavily and will surely want to be informed of the developments in QC.

Quantum Algorithms for Scientific Computing and Approximate Optimization

The performance of the quantum approximate optimization algorithm (QAOA) is studied, and a generalization of QAOA is shown, particularly suitable for constrained optimization problems and low-resource implementations on near-term quantum devices.

Toward a standardized methodology for constructing quantum computing use cases

We propose a standardized methodology for developing and evaluating use cases for quantum computers and quantum inspired methods. This methodology consists of a standardized set of questions which

Analog-Quantum Feature Mapping for Machine-Learning Applications

This work proposes an alternative algorithm called ``analog-quantum kitchen sinks'' (AQKSs), which employs an analog- quantum computer for mapping data features into new features in a nonlinear manner and presents the possibility to use current quantum annealers for solving practical machine-learning problems.



Defining and detecting quantum speedup

Here, it is shown how to define and measure quantum speedup and how to avoid pitfalls that might mask or fake such a speedup, and the subtle nature of the quantum speed up question is illustrated.

Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly

This work proposes to complement head-to-head scaling studies that compare quantum annealing machines to state-of-the-art classical codes with an approach that compares the performance of different algorithms and/or computing architectures on different classes of computationally hard tunable spin-glass instances.

A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration

The architecture of the D-Wave One machine is described and the ways to circumvent the limitation of the Ising mapping using a "blackbox" approach based on ideas from probabilistic computing are discussed.

Quantum annealing correction with minor embedding

This work demonstrates that quantum annealing correction can and should be used to improve the robustness of quantumAnnealing not only for natively embeddable problems, but also when minor embedding is used to extend the connectivity of physical devices.

Error Correcting Codes For Adiabatic Quantum Computation

Mathematics Department, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139(Dated: February 1, 2008)Recently, there has been growing interest in using adiabatic quantum computation

1 / f noise: Implications for solid-state quantum information

The efficiency of the future devices for quantum information processing will be limited mostly by the finite decoherence rates of the individual qubits and quantum gates. Recently, substantial

An introduction to quantum machine learning

This contribution gives a systematic overview of the emerging field of quantum machine learning and presents the approaches as well as technical details in an accessible way, and discusses the potential of a future theory of quantum learning.

Resource efficient gadgets for compiling adiabatic quantum optimization problems

A resource efficient method by which the ground‐state of an arbitrary k‐local, optimization Hamiltonian can be encoded as the ground‐state of a k−1 ‐local, optimization Hamiltonian is developed. This

A Hybrid Quantum-Classical Approach to Solving Scheduling Problems

A hybrid decomposition that incorporates a quantum annealer that samples from the configuration space of a relaxed problem to obtain strong candidate solutions, and a classical processor that maintains a global search tree and enforces constraints on the relaxed components of the problem.

Compiling Planning into Quantum Optimization Problems: A Comparative Study

Preliminary results from running an early quantum annealer on a parameterized family of hard planning problems show that different mappings can lead to a substantial difference in performance, even when many superficial features of the resulting instances are similar.