Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)

We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state |0>, and qubit measurement in the computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state rho, which should be regarded as a parameter of the model. Our goal is to determine for which rho universal quantum computation (UQC) can be efficiently simulated. To answer this question, we construct purification protocols that consume several copies of rho and produce a single output qubit with higher polarization. The protocols allow one to increase the polarization only along certain "magic" directions. If the polarization of rho along a magic direction exceeds a threshold value (about 65%), the purification asymptotically yields a pure state, which we call a magic state. We show that the Clifford group operations combined with magic states preparation are sufficient for UQC. The connection of our results with the Gottesman-Knill theorem is discussed.

[1]  Frank Verstraete,et al.  Matrix product state representations , 2006, Quantum Inf. Comput..

[2]  F. Verstraete,et al.  Criticality, the area law, and the computational power of projected entangled pair states. , 2006, Physical review letters.

[3]  F. Verstraete,et al.  Quantum phase transitions in matrix product systems. , 2005, Physical review letters.

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

[5]  J I Cirac,et al.  Renormalization-group transformations on quantum states. , 2004, Physical review letters.

[6]  Michael Levin,et al.  String-net condensation: A physical mechanism for topological phases , 2004, cond-mat/0404617.

[7]  F. Verstraete,et al.  Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions , 2004, cond-mat/0407066.

[8]  Julia Kempe,et al.  The Complexity of the Local Hamiltonian Problem , 2004, FSTTCS.

[9]  J. Ignacio Cirac,et al.  New frontiers in quantum information with atoms and ions , 2004 .

[10]  Julia Kempe,et al.  Quantum random walks: An introductory overview , 2003, quant-ph/0303081.

[11]  C. Monroe,et al.  Quantum dynamics of single trapped ions , 2003 .

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

[13]  H. Briegel,et al.  Persistent entanglement in arrays of interacting particles. , 2000, Physical review letters.

[14]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[15]  D. DiVincenzo,et al.  The Physical Implementation of Quantum Computation , 2000, quant-ph/0002077.

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

[17]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[18]  J. F. Poyatos,et al.  Quantum Reservoir Engineering with Laser Cooled Trapped Ions. , 1996, Physical review letters.

[19]  M. Fannes,et al.  Finitely correlated states on quantum spin chains , 1992 .

[20]  C. cohen-tannoudji,et al.  Atom-photon interactions , 1992 .

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

[22]  John Ziman,et al.  Models of disorder , 1979 .

[23]  Neil J. A. Sloane,et al.  The theory of error-correcting codes (north-holland , 1977 .

[24]  G. Lindblad.  On the generators of quantum dynamical semigroups , 1976 .