Towards Robust Quantum Computation

Quantum computation is a subject of much theoretical promise, but has not been realized in large scale, despite the discovery of fault-tolerant procedures to overcome decoherence. Part of the reason is that the theoretically modest requirements still present daunting experimental challenges. The goal of this Dissertation is to reduce various resources required for robust quantum computation, focusing on quantum error correcting codes and solution NMR quantum computation. A variety of techniques have been developed, including high rate quantum codes for amplitude damping, relaxed criteria for quantum error correction, systematic construction of fault-tolerant gates, recipes for quantum process tomography, techniques in bulk thermal state computation, and efficient decoupling techniques to implement selective coupled logic gates. A detailed experimental study of a quantum error correcting code in NMR is also presented. The Dissertation clarifies and extends results previously reported in quant-ph/9610043, quant-ph/9704002, quant-ph/9811068, quant-ph/9904100, quant-ph/9906112, quant-ph/0002039. Additionally, a procedure for quantum process tomography using maximally entangled states, and a review on NMR quantum computation are included.

[1]  N. Gershenfeld,et al.  Bulk Spin-Resonance Quantum Computation , 1997, Science.

[2]  P. Knight,et al.  Quantum error correction in the presence of spontaneous emission. , 1996, quant-ph/9603022.

[3]  G. Bodenhausen,et al.  Principles of nuclear magnetic resonance in one and two dimensions , 1987 .

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

[5]  Timothy F. Havel,et al.  EXPERIMENTAL QUANTUM ERROR CORRECTION , 1998, quant-ph/9802018.

[6]  R. Cleve,et al.  Information-theoretic interpretation of quantum error-correcting codes , 1997, quant-ph/9702031.

[7]  Timothy F. Havel,et al.  Nuclear magnetic resonance spectroscopy: an experimentally accessible paradigm for quantum computing , 1997, quant-ph/9709001.

[8]  M. Nielsen,et al.  Information-theoretic approach to quantum error correction and reversible measurement , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[9]  J. Preskill.  Work: Quantum Information and Computation , 1998 .

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

[11]  D. Leung,et al.  Bulk quantum computation with nuclear magnetic resonance: theory and experiment , 1998, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[12]  A. Calderbank,et al.  Quantum Error Correction and Orthogonal Geometry , 1996, quant-ph/9605005.

[13]  Debbie W. Leung,et al.  Efficient implementation of coupled logic gates for quantum computation , 2000 .

[14]  Debbie W. Leung,et al.  Realization of quantum process tomography in NMR , 2000, quant-ph/0012032.

[15]  А Е Китаев,et al.  Квантовые вычисления: алгоритмы и исправление ошибок@@@Quantum computations: algorithms and error correction , 1997 .

[16]  U. Vazirani,et al.  Scalable NMR Quantum Computation , 1998, quant-ph/9804060.

[17]  Ekert,et al.  Quantum Error Correction for Communication. , 1996 .

[18]  G. Hardy,et al.  An Introduction to the Theory of Numbers , 1938 .

[19]  H. Carr,et al.  The Principles of Nuclear Magnetism , 1961 .

[20]  F. Yamaguchi,et al.  Crystal lattice quantum computer , 1999 .

[21]  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.

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

[23]  Pérès.  Separability Criterion for Density Matrices. , 1996, Physical review letters.

[24]  Charles H. Bennett,et al.  Mixed-state entanglement and quantum error correction. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[25]  B. Muzykantskii,et al.  ON QUANTUM NOISE , 1995 .

[26]  C. Slichter.  Principles of magnetic resonance , 1963 .

[27]  Griffiths,et al.  Semiclassical Fourier transform for quantum computation. , 1995, Physical review letters.

[28]  R. Cleve,et al.  SUBSTITUTING QUANTUM ENTANGLEMENT FOR COMMUNICATION , 1997, quant-ph/9704026.

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

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

[31]  N. Sloane,et al.  Quantum error correction via codes over GF(4) , 1996, Proceedings of IEEE International Symposium on Information Theory.

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

[33]  Gottesman.  Class of quantum error-correcting codes saturating the quantum Hamming bound. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[34]  Daniel Gottesman,et al.  Stabilizer Codes and Quantum Error Correction , 1997, quant-ph/9705052.

[35]  E. Knill.  Non-binary unitary error bases and quantum codes , 1996, quant-ph/9608048.

[36]  DiVincenzo,et al.  Fault-Tolerant Error Correction with Efficient Quantum Codes. , 1996, Physical review letters.

[37]  Isaac L. Chuang,et al.  Prescription for experimental determination of the dynamics of a quantum black box , 1997 .

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

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

[40]  Charles H. Bennett,et al.  Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. , 1992, Physical review letters.

[41]  Man-Duen Choi.  Completely positive linear maps on complex matrices , 1975 .

[42]  R. Schumann.  Quantum Information Theory , 2000, quant-ph/0010060.

[43]  V. Roychowdhury,et al.  On Universal and Fault-Tolerant Quantum Computing , 1999, quant-ph/9906054.

[44]  A. Ekert,et al.  Universality in quantum computation , 1995, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[45]  Debbie Leung,et al.  Experimental realization of a two-bit phase damping quantum code , 1999 .

[46]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[47]  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.

[48]  D. Leung,et al.  Methodology for quantum logic gate construction , 2000, quant-ph/0002039.

[49]  P. Mansfield,et al.  Pulsed NMR in solids , 1971 .

[50]  D. Coppersmith.  An approximate Fourier transform useful in quantum factoring , 2002, quant-ph/0201067.

[51]  E Knill,et al.  Efficient refocusing of one-spin and two-spin interactions for NMR quantum computation. , 1999, Journal of magnetic resonance.

[52]  Chuang,et al.  Quantum bit regeneration. , 1996, Physical review letters.

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

[54]  H. Davenport.  Multiplicative Number Theory , 1967 .

[55]  R Freeman,et al.  Pulse sequences for NMR quantum computers: how to manipulate nuclear spins while freezing the motion of coupled neighbours , 1999 .

[56]  Richard Jozsa.  Quantum Effects in Algorithms , 1998, QCQC.

[57]  R. Feynman.  Quantum mechanical computers , 1986 .

[58]  Charles J. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[59]  W. Wootters,et al.  A single quantum cannot be cloned , 1982, Nature.

[60]  M. B. Ruskai,et al.  A Characterization of Completely-Positive Trace-Preserving Maps on 2x2 Matrices , 2000 .

[61]  Asher Peres.  Error Symmetrization in Quantum Computers , 1996 .

[62]  D. DiVincenzo,et al.  Problem of equilibration and the computation of correlation functions on a quantum computer , 1998, quant-ph/9810063.

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

[64]  Schumacher,et al.  Sending entanglement through noisy quantum channels. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[65]  W. Louisell.  Quantum Statistical Properties of Radiation , 1973 .

[66]  A. Barenco.  A universal two-bit gate for quantum computation , 1995, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[67]  K. Kraus,et al.  States, effects, and operations : fundamental notions of quantum theory : lectures in mathematical physics at the University of Texas at Austin , 1983 .

[68]  DiVincenzo.  Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.

[69]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[70]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

[71]  R. Paley.  On Orthogonal Matrices , 1933 .

[72]  Laflamme,et al.  Perfect Quantum Error Correcting Code. , 1996, Physical review letters.

[73]  Debbie W. Leung,et al.  Quantum algorithms which accept hot qubit inputs , 1999 .

[74]  Lloyd,et al.  Almost any quantum logic gate is universal. , 1995, Physical review letters.

[75]  J. Sylvester.  LX. Thoughts on inverse orthogonal matrices, simultaneous signsuccessions, and tessellated pavements in two or more colours, with applications to Newton's rule, ornamental tile-work, and the theory of numbers , 1867 .

[76]  Raymond Laflamme,et al.  A Theory of Quantum Error-Correcting Codes , 1996 .

[77]  Reck,et al.  Experimental realization of any discrete unitary operator. , 1994, Physical review letters.

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

[79]  Samuel L. Braunstein.  Quantum error correction of dephasing in 3 qubits , 1996 .

[80]  J. I. Cirac,et al.  Enforcing Coherent Evolution in Dissipative Quantum Dynamics , 1996, Science.

[81]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[82]  R. Cleve,et al.  Quantum algorithms revisited , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[83]  I. L. Chuang,et al.  Approximate quantum error correction can lead to better codes , 1997 .

[84]  P. Benioff.  The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines , 1980 .

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

[86]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[87]  D. Gottesman.  The Heisenberg Representation of Quantum Computers , 1998, quant-ph/9807006.

[88]  Shor,et al.  Good quantum error-correcting codes exist. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[89]  E. Knill,et al.  EFFECTIVE PURE STATES FOR BULK QUANTUM COMPUTATION , 1997, quant-ph/9706053.

[90]  Debbie W. Leung,et al.  Bosonic quantum codes for amplitude damping , 1997 .

[91]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

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

[93]  Timothy F. Havel,et al.  Ensemble quantum computing by NMR spectroscopy , 1997, Proc. Natl. Acad. Sci. USA.

[94]  Alain Tapp,et al.  Quantum Entanglement and the Communication Complexity of the Inner Product Function , 1998, QCQC.

[95]  E. Knill,et al.  Resilient Quantum Computation , 1998 .

[96]  P. Zoller,et al.  Complete Characterization of a Quantum Process: The Two-Bit Quantum Gate , 1996, quant-ph/9611013.