A NASA Perspective on Quantum Computing: Opportunities and Challenges

Research paper by Rupak Biswas, Zhang Jiang, Kostya Kechezhi, Sergey Knysh, Salvatore Mandrà, Bryan O’Gorman, Alejandro Perdomo-Ortiz, Andre Petukhov, John Realpe-Gomez, Eleanor Rieffel, Davide Venturelli, Fedir Vasko, Zhihui Wang

Indexed on: 08 Dec '16Published on: 27 Nov '16Published in: Parallel Computing


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.

Figure 10.1016/j.parco.2016.11.002.0.jpg
Figure 10.1016/j.parco.2016.11.002.1.jpg
Figure 10.1016/j.parco.2016.11.002.2.jpg
Figure 10.1016/j.parco.2016.11.002.3.jpg
Figure 10.1016/j.parco.2016.11.002.4.jpg
Figure 10.1016/j.parco.2016.11.002.5.jpg
Figure 10.1016/j.parco.2016.11.002.6.jpg
Figure 10.1016/j.parco.2016.11.002.7.jpg