Fault-Tolerant Quantum Computation with Higher-Dimensional Systems

Instead of a quantum computer where the fundamental units are 2-dimensional qubits, we can consider a quantum computer made up of d-dimensional systems. There is a straightforward generalization of the class of stabilizer codes to d-dimensional systems, and I will discuss the theory of fault-tolerant computation using such codes. I prove that universal fault-tolerant computation is possible with any higher-dimensional stabilizer code for prime d.

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

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

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

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

[5]  E. Knill Group representations, error bases and quantum codes , 1996, quant-ph/9608049.

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

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

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

[9]  N. J. A. Sloane,et al.  Quantum Error Correction Via Codes Over GF(4) , 1998, IEEE Trans. Inf. Theory.

[10]  Eric M. Rains Nonbinary quantum codes , 1999, IEEE Trans. Inf. Theory.