A Practical Architecture for Reliable Quantum Computers

Quantum computation has advanced to the point where system-level solutions can help close the gap between emerging quantum technologies and real-world computing requirements. Empirical studies of practical quantum architectures are just beginning to appear in the literature. Elementary architectural concepts are still lacking: How do we provide quantum storage, data paths, classical control circuits, parallelism, and system integration? And, crucially, how can we design architectures to reduce error-correction overhead? The authors describe a proposed architecture that uses code teleportation, quantum memory refresh units, dynamic compilation of quantum programs, and scalable error correction to achieve system-level efficiencies. They assert that their work indicates the underlying technology's reliability is crucial; practical architectures will require quantum technologies with error rates between 10/sup -6/ and 10/sup -9/.

[1]  D. DiVincenzo,et al.  Quantum information is physical , 1997, cond-mat/9710259.

[2]  H. Weinfurter,et al.  Experimental quantum teleportation , 1997, Nature.

[3]  Jeff Gilchrist,et al.  Factorization of a 512-Bit RSA Modulus , 2000, EUROCRYPT.

[4]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[5]  Gregory Breyta,et al.  Experimental realization of order-finding with a quantum computer , 2000 .

[6]  Dorit Aharonov,et al.  Fault-tolerant quantum computation with constant error , 1997, STOC '97.

[7]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[8]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and EPR channels , 1993 .

[9]  N. Gisin,et al.  Quantum cryptography , 1998 .

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

[11]  R. Martinez,et al.  An algorithmic benchmark for quantum information processing , 2000, Nature.

[12]  Alvin M. Despain,et al.  Using simulation to assess the feasibility of quantum computing , 1998 .

[13]  I. Chuang,et al.  Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance , 2001, Nature.

[14]  Orlando,et al.  Josephson Persistent-Current Qubit , 2022 .

[15]  Isaac L. Chuang,et al.  Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations , 1999, Nature.

[16]  L M Vandersypen,et al.  Experimental realization of an order-finding algorithm with an NMR quantum computer. , 2000, Physical review letters.

[17]  J. von Neumann,et al.  Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .

[18]  Bernhard Ömer,et al.  Quantum Programming in QCL , 2000 .

[19]  Daniel A. Lidar,et al.  Decoherence-Free Subspaces for Quantum Computation , 1998, quant-ph/9807004.

[20]  B. E. Kane.  A silicon-based nuclear spin quantum computer , 1998, Nature.

[21]  Andrew Steane,et al.  Active Stabilization, Quantum Computation, and Quantum State Synthesis , 1997 .

[22]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[23]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[24]  I. Chuang,et al.  Quantum Teleportation is a Universal Computational Primitive , 1999, quant-ph/9908010.