The Quantum Computer Puzzle (Expanded Version)

Quantum computers are hypothetical devices, based on quantum physics, that would enable us to perform certain computations hundreds of orders of magnitude faster than digital computers. This feature is coined as "quantum supremacy" and one aspect or another of such quantum computational supremacy might be brought about in experiments in the near future: by implementing quantum error-correction, systems of non-interacting bosons, exotic new phases of matter called anyons, quantum annealing, or in various other ways. A main concern regarding the feasibility of quantum computers is that quantum systems are inherently noisy: we cannot accurately control them, and we cannot accurately describe them. We will describe an optimistic hypothesis of quantum noise that would allow quantum computing and a pessimistic hypothesis that wouldn't. The quantum computer puzzle is deciding between these two hypotheses. Here is a brief summary of the author's pessimistic point of view as explained in the paper: understanding quantum computers in the presence of noise requires consideration of behavior at different scales. In the small scale, standard models of noise from the mid-90s are suitable, and quantum evolutions and states described by them manifest a very low-level computational power. This small-scale behavior has far-reaching consequences for the behavior of noisy quantum systems at larger scales. On the one hand, it does not allow reaching the starting points for quantum fault tolerance and quantum supremacy, making them both impossible at all scales. On the other hand, it leads to novel implicit ways for modeling noise at larger scales and to various predictions on the behavior of noisy quantum systems.

[1]  G. Kalai The Quantum Computer Puzzle , 2016, 1605.00992.

[2]  Alexander Barvinok,et al.  Approximating permanents and hafnians , 2016, 1601.07518.

[3]  Alexander I. Barvinok Approximating permanents and hafnians of positive matrices , 2016, ArXiv.

[4]  D. Harlow,et al.  Jerusalem Lectures on Black Holes and Quantum Information , 2014, 1409.1231.

[5]  Amit Daniely,et al.  Complexity Theoretic Limitations on Learning DNF's , 2014, COLT.

[6]  Greg Kuperberg,et al.  Contagious error sources would need time travel to prevent quantum computation , 2014, 1412.1907.

[7]  Christophe Garban,et al.  Noise Sensitivity of Boolean Functions and Percolation , 2011, 1102.5761.

[8]  Guy Kindler,et al.  Gaussian Noise Sensitivity and BosonSampling , 2014, ArXiv.

[9]  Shai Ben-David,et al.  Understanding Machine Learning: From Theory to Algorithms , 2014 .

[10]  J. Preskill,et al.  Quantum Algorithms for Fermionic Quantum Field Theories , 2014, 1404.7115.

[11]  T. Tao Finite time blowup for an averaged three-dimensional Navier-Stokes equation , 2014, 1402.0290.

[12]  Nathan Linial,et al.  From average case complexity to improper learning complexity , 2013, STOC.

[13]  Leonid Polterovich,et al.  Symplectic Geometry of Quantum Noise , 2012, 1206.3707.

[14]  Richard R. Warren,et al.  Numeric Experiments on the commercial quantum computer , 2013 .

[15]  L. Susskind,et al.  Cool horizons for entangled black holes , 2013, 1306.0533.

[16]  P. Hayden,et al.  Quantum computation vs. firewalls , 2013, 1301.4504.

[17]  John Preskill,et al.  Sufficient condition on noise correlations for scalable quantum computing , 2012, Quantum Inf. Comput..

[18]  J. Polchinski,et al.  Black holes: complementarity or firewalls? , 2012, Journal of High Energy Physics.

[19]  John Preskill,et al.  Quantum computing and the entanglement frontier , 2012, 1203.5813.

[20]  J. Eisert,et al.  Probing the relaxation towards equilibrium in an isolated strongly correlated one-dimensional Bose gas , 2011, Nature Physics.

[21]  Gil Kalai,et al.  How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation , 2011, ArXiv.

[22]  Scott Aaronson,et al.  The computational complexity of linear optics , 2010, STOC '11.

[23]  R. Jozsa,et al.  Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[24]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[25]  Gil Kalai,et al.  How Quantum Computers Can Fail , 2006, quant-ph/0607021.

[26]  Oded Goldreich,et al.  Computational complexity: a conceptual perspective , 2008, SIGA.

[27]  Ben Reichardt,et al.  Fault-Tolerant Quantum Computation , 2016, Encyclopedia of Algorithms.

[28]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[29]  Mikhail I. Dyakonov,et al.  Is Fault-Tolerant Quantum Computation Really Possible? , 2006, quant-ph/0610117.

[30]  R. Alicki,et al.  Can one build a quantum hard drive? A no-go theorem for storing quantum information in equilibrium systems , 2006, quant-ph/0603260.

[31]  J. Preskill,et al.  Quantum accuracy threshold for concatenated distance-3 codes , 2005, Quantum Inf. Comput..

[32]  Leonid Gurvits,et al.  On the Complexity of Mixed Discriminants and Related Problems , 2005, MFCS.

[33]  B. Terhal,et al.  Fault-tolerant quantum computation for local non-Markovian noise , 2004, quant-ph/0402104.

[34]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[35]  Archil Avaliani,et al.  Quantum Computers , 2004, ArXiv.

[36]  P. Busch,et al.  Noise and disturbance in quantum measurement , 2003, quant-ph/0312006.

[37]  Scott Aaronson,et al.  Multilinear formulas and skepticism of quantum computing , 2003, STOC '04.

[38]  M. Ozawa Uncertainty relations for joint measurements of noncommuting observables , 2003, quant-ph/0310070.

[39]  David P. DiVincenzo,et al.  Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games , 2002, Quantum Inf. Comput..

[40]  Leonid A. Levin,et al.  The Tale of One-Way Functions , 2000, Probl. Inf. Transm..

[41]  A. Kitaev,et al.  Fault tolerant quantum computation by anyons , 1997, quant-ph/9707021.

[42]  Andrew Chi-Chih Yao,et al.  Classical physics and the Church--Turing Thesis , 2003, JACM.

[43]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[44]  I. Benjamini,et al.  Noise sensitivity of Boolean functions and applications to percolation , 1998, math/9811157.

[45]  J. Preskill Quantum computing: pro and con , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[46]  E. Knill,et al.  Resilient quantum computation: error models and thresholds , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[47]  M. Ben-Or,et al.  Fault-tolerant quantum computation with constant error , 1996, STOC '97.

[48]  A. Kitaev Quantum Error Correction with Imperfect Gates , 1997 .

[49]  J. Raimond,et al.  Quantum Computing: Dream or Nightmare? , 1996 .

[50]  Steane,et al.  Error Correcting Codes in Quantum Theory. , 1996, Physical review letters.

[51]  Lidror Troyansky,et al.  Permanent Uncertainty: on the Quantum Evaluation of the Determinant and the Permanent of a Matrix , 1996 .

[52]  R. Landauer Is quantum mechanics useful , 1995 .

[53]  Shor,et al.  Scheme for reducing decoherence in quantum computer memory. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[54]  Unruh,et al.  Maintaining coherence in quantum computers. , 1994, Physical review. A, Atomic, molecular, and optical physics.

[55]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[56]  Umesh V. Vazirani,et al.  An Introduction to Computational Learning Theory , 1994 .

[57]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

[58]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[59]  Gregory W. Moore,et al.  Nonabelions in the fractional quantum Hall effect , 1991 .

[60]  D. Deutsch Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[61]  R. Feynman Simulating physics with computers , 1999 .

[62]  H. S. Allen The Quantum Theory , 1928, Nature.