The effect of communication costs in solid-state quantum computing architectures

Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed under idealized assumptions without important physical constraints in mind. In this paper, we analyze two key constraints: the short spatial distance of quantum interactions and the short temporal life of quantum data.In particular, quantum computations must make use of extremely robust error correction techniques to extend the life of quantum data. We present optimized spatial layouts of quantum error correction circuits for quantum bits embedded in silicon. We analyze the complexity of error correction under the constraint that interaction between these bits is near neighbor and data must be propagated via swap operations from one part of the circuit to another.We discover two interesting results from our quantum layouts. First, the recursive nature of quantum error correction circuits requires a additional communication technique more powerful than near-neighbor swaps -- too much error accumulates if we attempt to swap over long distances. We show that quantum teleportation can be used to implement recursive structures. We also show that the reliability of the quantum swap operation is the limiting factor in solid-state quantum computation.

[1]  Frank H. Sumner,et al.  Reliable computation in the presence of noise , 1965 .

[2]  Colin P. Williams,et al.  Quantum Atomic Clock Synchronization Based on Shared Prior Entanglement , .

[3]  Y. Pashkin,et al.  Coherent control of macroscopic quantum states in a single-Cooper-pair box , 1999, Nature.

[4]  Hood,et al.  Measurement of conditional phase shifts for quantum logic. , 1995, Physical review letters.

[5]  Roberto Gorrieri,et al.  Symposium on the Theory of Computation , 1999 .

[6]  Umesh V. Vazirani,et al.  Molecular scale heat engines and scalable quantum computation , 1999, STOC '99.

[7]  Eli Yablonovitch,et al.  Electron-spin-resonance transistors for quantum computing in silicon-germanium heterostructures , 1999, quant-ph/9905096.

[8]  C. Monroe,et al.  Experimental entanglement of four particles , 2000, Nature.

[9]  Colin P. Williams,et al.  Quantum clock synchronization based on shared prior entanglement , 2000, Physical review letters.

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

[11]  Jonathan A. Jones,et al.  Implementation of a quantum search algorithm on a quantum computer , 1998, Nature.

[12]  N. Gershenfeld,et al.  Quantum Computing with Molecules , 1998 .

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

[14]  Steane,et al.  Simple quantum error-correcting codes. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[15]  S. Lloyd Quantum-Mechanical Computers , 1995 .

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

[17]  Raymond Laflamme,et al.  Quantum Computers, Factoring, and Decoherence , 1995, Science.

[18]  Gadiel Seroussi,et al.  Efficient Quantum Algorithms for Estimating Gauss Sums , 2002, quant-ph/0207131.

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

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

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

[22]  Jonathan A. Jones,et al.  Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer , 1998 .

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

[24]  P. Joyez,et al.  Manipulating the Quantum State of an Electrical Circuit , 2002, Science.

[25]  King,et al.  Demonstration of a fundamental quantum logic gate. , 1995, Physical review letters.

[26]  D. Gottesman Theory of fault-tolerant quantum computation , 1997, quant-ph/9702029.

[27]  N. Gershenfeld,et al.  Experimental Implementation of Fast Quantum Searching , 1998 .

[28]  Peter W. Shor,et al.  Fault-tolerant quantum computation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

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

[31]  Frederic T. Chong,et al.  Building quantum wires: the long and the short of it , 2003, 30th Annual International Symposium on Computer Architecture, 2003. Proceedings..

[32]  B. E. Kane,et al.  Hydrogenic spin quantum computing in silicon: a digital approach. , 2002, Physical review letters.

[33]  C. Monroe,et al.  Architecture for a large-scale ion-trap quantum computer , 2002, Nature.

[34]  J. Preskill Reliable quantum computers , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[35]  Andrew M. Childs,et al.  Robustness of adiabatic quantum computation , 2001, quant-ph/0108048.

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