Notes

References

[1] Aspect A, Dalibard J, and Roger G, Experimental Test of Bell’s Inequalities
Using Time-Verying Analyzers, Physical Review Letters, Vol. 49,
1982, pp. 1804-1807.

[2] Ashikhmin A, and Knill E, Nonbinary Quantum Stabilizer Codes, IEEE
Trans. Inform. Theory, Vol. 47, 2001, pp. 3065-3072.

[3] Barenco A, Bennett C H, Cleve R, DiVincenzo D P, Margolus N, Shor P,
Sleator T, Smolin J, and Weinfurter H, Elementary Gates for Quantum
Computation, Physical Review A, Vol. 52, 1995, pp. 3457-3488.

[4] Bell J, On the Einstein-Podolsky-Rosen Paradox, Physics, Vol. 1, 1964,
pp. 195-200.

[5] Bennett C H, Brassard G, Crepeau C, Jozsa R, Peres A, and Wooters A
K, Teleporting an Unknown Quantum State via Dual Classical and EPR
Channels, Physical Review Letters, Vol. 70, 1993, pp. 1895-1899.

[6] Bennett C H, Logical Reversibility of Computation, IBM J. Res. Develop.,
17, 525, 1973.

[7] Bergholm V, Vatiainen J J, M¨ott¨onen M, and Salomaa M M, Quantum
circuits with uniformly controlled one-qubit gates, Phys. Review A, 71,
052330, 2005.

[8] Bergholm V, Vatiainen J J, M¨ott¨onen M, and Salomaa M M, Quantum
circuits for general multiqubit gates, Phys. Review Letters, 93, 13, 2004.

[9] Blasiak, Horzela, Penson, Solomon, and Duchamp, Combinatorics and
Boson normal ordering: A gentle introduction, quant-ph/07043119, - ’A
very elegant way of storing and tackling information about sequences is
attained through their generating function.’

[10] Bose R C, and Ray-Choudhuri D K, On a class of error correcting binary
group codes, Information and Control, Vol. 3, 1960, pp. 68-79.

[11] Bouwmeester D, Ekert A, and Zeilinger A, The Physics of Quantum Information,
Springer, 2001, p. 163.

[12] Calderbank A R, Rains E M, Shor P W, and Sloane N J A, Quantum Error
Correction and Orthogonal Geometry, Physical Review Letters, Vol. 78,
1995, pp. 405-408.

[13] Calderbank A R, Rains E M, Shor P W, and Sloane N J A, Quantum
Error Correction via Codes over GF(4), IEEE Trans. Inform. Theory,
Vol. 44, 1998, pp. 1369-1387.

[14] Calderbank A R, and Shor P W, Good Quantum Error-Correcting Codes
exist, Physical Review A, Vol. 54, 1996, pp. 1098-1105.

[15] Cameron P J, Combinatorics: Topics, Techniques, Algorithms, Cambridge
University Press, 1994.
200

[16] Carmelo Interlando J, Byrne E, and Rosenthal J, The Gate Complexity
of Syndrome Decoding of Hamming Codes, Proceedings of the Tenth International
Conference on Applications of Computer Algebra, Beaumont,
Texas, 2004, pp. 33-37.

[17] Cirac J L, and Zoller P, Quantum Computations with Cold Trapped Ions,
Phys. Rev. Lett., Vol. 74, 1995, p. 4091-4094.

[18] Clarisse L, Ghosh S, Severini S, and Sudbery A, The disentangling power
of unitaries, quant-ph/0611075, 2006.

[19] Cleve R, and Gottesman D, Efficient computations of encodings for quantum
error correction, Phys. Rev. A, Vol. 56, 1997, pp. 76-82. LANL eprint,
quant-ph/9607030.

[20] Cleve R, Quantum Stabilizer Codes and Classical Linear Codes, Phys.
Rev. A, Vol. 55, 1997, pp. 4054-4059. LANL e-print, quant-ph/9612048.

[21] Cleve R, An Introduction to Quantum Complexity Theory, Collected Papers
on Quantum Computation and Quantum Information Theory, eds.
C. Macchiavello, G.M. Palma, and A. Zeilinger, World Scientific, Singapore,
2000. LANL e-print, quant-ph/9906111.

[22] Chuang I L, and Yamamoto Y, Quantum Bit Regeneration, Phys. Rev.
Letters, Vol. 76, 1996, pp. 4281-4284.

[23] Chuang I L, and Yamamoto Y, Creation of a persistent quantum bit using
error correction, Phys. Rev. A, Vol. 55, 1997, pp. 114-127.
201

[24] Deutsch D, Quantum theory, the Church-Turing principle and the universal
quantum computer, Proc. Roy. Soc. Lond. A, Vol. 400, 1985, pp.97-117.

[25] Deutsch D, Quantum Computational Networks Proc. Roy. Soc. Lond. A,
Vol. 425, 1989, pp. 73-90.

[26] Deutsch D, Barenco A, and Ekert A, Universality in Quantum Computation,
Proc. Roy. Soc. Lond. A, Vol. 449, 1995, pp. 669-677.

[27] DiVincenzo D P, Quantum Gates and Circuits, Proceedings of the ITP
Conference on Quantum Coherence and Decoherence, Proc. Roy. Soc.
Lond. A, Vol. 454, 1998, pp. 261-276. LANL e-print, quant-ph/9705009.

[28] Erdmann K, and Wildon M J, Introduction to Lie Algebras, Springer,
2006.

[29] Feynman R P, Simulating physics with computers. Int. J. Theor. Phys.
Vol. 21, 1982, pp. 467-488.

[30] Fowler A G, Dervitt S J, and Hollenberg L C L, Implementation of Shor’s
algorithm on a linear nearest neighbour qubit array, quant-ph/0402196,
2004.

[31] Gottesman D, A Class of Quantum Error-Correcting Codes saturating the
Quantum Hamming bound, Phys. Rev. A, Vol. 54, 1996, pp. 1862-1968.

[32] Gottesman D, Stabilizer Codes and Quantum Error Correction, Ph.D.
Thesis, Calif. Inst. Technol., Pasadena, CA, 1997.
202

[33] Gottesman D, Fault-Tolerant Quantum Computation with Higher-
Dimensional Systems, Quantum Computing and Quantum Communications,
Proceedings of the 1st NASA International Conference on Quantum
Computing and Quantum Communications (QCQC), Palm Springs,
California, ed. C. Williams, New York, NY, Springer-Verlag, 1998, pp.
302-313. LANL e-print, quant-ph/9802007.

[34] Gottesman D, The Heisenberg Representation of Quantum Computers,
Group22: Proceedings of the XXII International Colloquium on Group
Theoretical Methods in Physics, eds. S. P. Corney, R. Delbourgo, and P.
D. Jarvis, Cambridge, MA, International Press, 1999, pp. 32-43. LANL
e-print, quant-ph/9807006.

[35] Graham R L, Knuth D E, and Patashnik O, Concrete Mathematics,
3rd ed., Addison-Wesley, 1994.

[36] Grassl M, R¨otteler M, and Beth T, Efficient Quantum Circuits for Non-
Qubit Quantum Error-Correcting Codes, International Journal of Foundations
of Computer Science, Vol. 14, No. 5, 2003, pp. 757-775. LANL
e-print, quant-ph/0211014.

[37] Gershenfeld N, and Chuang I, Bulk Spin Resonance Quantum Computation,
Science Vol. 275, 1997, pp.350-356.

[38] http://mathworld.wolfram.com/IrreducibleRepresentation.html.

[39] Hamming R W, Error Detecting and Error Correcting Codes, Bell System
Technical Journal, Vol. 26, 1950, pp. 147-160.

[40] Hardy Y, and SteebWH, Decomposing the SWAP quantum gate, J. Phys.
A: Math. Gen. 39, 2006.

[41] Herstein I N, Topics in Algebra, 2nd ed., Wiley and Sons, 1975.

[42] Hill C D, Robust CNOT gates from almost any interaction, quantph/
0610059, 2006.

[43] Hocquenghem A, Codes correcteurs d’erreurs, Chiffres (Paris), Vol. 2,
1959, pp. 147-156.

[44] Hoffman D G, Leonard D A, Linder C C, Phelps K T, Rodger C A, Wall
J R, Coding Theory; The Essentials, Marcel Dekker, Inc., 1991, p. 38.

[45] Khaneja N, Brockett R, and Glaser S J, Time optimal control in spin
systems, Phys. Review A, 63, 032308, 2001.

[46] Klappenecker A, and R¨otteler M, Unitary Error Bases: Constructions,
Equivalence and Applications, Lecture Notes in Computer Science, 2003,
2643, pages 139-149.

[47] Klappenecker A, and R¨otteler M, Beyond Stabilizer Codes I: Nice Error
Bases, IEEE Trans. Inform. Theory, Vol. 48, 2002, pp. 2392-2395. LANL
e-print, quant-ph/0010082.

[48] Klappenecker A, and R¨otteler M, Beyond Stabilizer Codes II: Clifford
Codes, IEEE Trans. Inform. Theory, Vol. 48, 2002, pp. 2396-2399. LANL
e-print, quant-ph/0010076.

[49] Klappenecker A, and R¨otteler M, On the monomiality of nice error bases,
IEEE Trans. Inform. Theory, Vol. 51, 2005, pp. 1084-1089. LANL e-print,
quant-ph/0301078.

[50] Knill E, Group representations, error bases and quantum codes, Los
Alamos National Laboratory Report LAUR-96-2807, 1996.

[51] Knill E, Non-binary Unitary Error Bases and Quantum Codes, Los
Alamos National Laboratory Report LAUR-96-2717, 1996, quantph/
9608048.

[52] Knill E, and Laflamme R, A theory of quantum error-correcting codes,
Physical Review A, Vol. 55, No. 2, 1997, pp. 900-911.

[53] Liang L, and Li C, Realization of quantum SWAP gate between flying and
stationary qubits, Phys. Review A, 72, 024303, 2005.

[54] Lu F, and Marinescu D C, Quantum Error Correction of Time-Correlated
Errors, quant-ph/06052206.

[55] Lu C J, and Tsai S C, The Periodic Property of Binomial Coefficients
Modulo m and Its Applications, 10th SIAM Conference on Discrete Mathematics,
Minneapolis, Minnesota, USA, 2000.

[56] http://www.maplesoft.com/

[57] MacWilliams F J, and Sloane N J A, The Theory of Error-Coreecting
Codes, North-Holland, Amsterdam, 1997.

[58] Monroe C, Meekhof D, King B, Itano W, and Wineland D, Demonstration
of a Fundamental Quantum Logic Gate, Phys. Rev. Lett., Vol 75, 1995,
pp. 4714-4717.

[59] Nielsen M A, A geometric approach to quantum circuit lower bounds,
quant-ph/0502070.

[60] Nielsen M A, and Chuang I L, Quantum Computations and Quantum
Information, Cambridge University Press, 2000.

[61] Nielsen M A, and Chuang I L, Quantum Computations and Quantum
Information, Cambridge University Press, 2000, p. 23.

[62] Nielsen M A, and Chuang I L, Quantum Computations and Quantum
Information, Cambridge University Press, 2000, p. 159.

[63] Nielsen M A, and Chuang I L, Quantum Computations and Quantum
Information, Cambridge University Press, 2000, p. 191.

[64] Nielsen M A, and Chuang I L, Quantum Computations and Quantum
Information, Cambridge University Press, 2000, p. 205.

[65] Nielsen M A, and Chuang I L, Quantum Computations and Quantum
Information, Cambridge University Press, 2000, p. 436.

[66] Nielsen A M, Knill E, and Laflamme R, Complete Quantum Teleportation
using Nuclear Magnetic Resonance, Nature, Vol. 396, No. 7706, 1998,
pp. 52-55.

[67] Petkovsek M, Wilf H, and Zeilberger D, A = B,
www.cis.upenn.edu/ wilf/AeqB.html.

[68] http://en.wikipedia.org/wiki/Separable polynomial.

[69] Plenio M B, and Knight P L, Realistic lower bounds for the factorisation
time of large numbers on a quantum computer, Physical Review A,
Vol. 53, 1996, pp. 2986-2990.

[70] Preskill J, Quantum Computing: Pro and Con, Proc. Roy. Soc. Lond. A
Vol. 454, 1998, pp. 469-486. LANL e-print, quant-ph/9705032.

[71] Rains E M, Nonbinary quantum codes, IEEE Trans. Inform. Theory, Vol.
45, 1999, pp. 1827-1832.

[72] Rosen K H, Handbook of Discrete and Combinatorial Mathematics, CRC
Press, 2000.

[73] Schlingemann D, Problem 6 in open problems in Quantum Information
Theory, www.imaph.tu-bs.de/problems/

[74] Shannon C E, A Mathematical Theory of Communication, Bell System
Technical Journal, Vol. 27, 1995, pp. 379-423.

[75] Schumacher B, Quantum Coding, Phys. Rev. A, Vol. 51, 1995, pp. 2738-
2747.

[76] Sedl´ak M, and Plesch M, Towards optimization of quantum circuits,
quant-ph/0607123.

[77] Shende V, Markov I L, and Bullock S, Synthesis of Quantum Logic Circuits,
IEEE Trans. on Computer-Aid Design, 25, no. 6, p. 100, 2006.

[78] Shende V, Markov I L, and Bullock S, Minimal universal two-qubit
controlled-NOT-based circuits, Phys. Review A, 69, 062321, 2004.

[79] Shor P W, Scheme for reducing decoherence in quantum computer memory,
Physical Review A, Vol. 52, 1995, pp. 2493-2496.

[80] Shor P W, Polynomial-Time Algorithms for Prime Factorization and Discrete
Logarithms on a Quantum Computer, Proceedings of the 35th Annual
Symposium on Foundations of Computer Science, 1994.

[81] Shor P W, and Laflamme R, Quantum Analog of the MacWilliams Identities
for Classical Coding Theory, Phys. Rev. Lett., Vol. 78, 1997, pp. 1600-
1602.

[82] Steane A M, Quantum Reed-Muller Codes, IEEE Trans. Inform. Theory,
Vol. 45, No.5, 1999, pp. 1701-1703. LANL e-print, quant-ph/9608026.

[83] Steane A M, Multiple Particle Interference and Quantum Error Correction,
Proc. Roy. Soc. Lond. A, Vol. 452, 1996, pp. 2551-2577. LANL
e-print, quant-ph/9601029.

[84] Steane A M, How to build a 300 bit, 1 Gop quantum computer, LANL
e-print, quant-ph/0412165.
208

[85] Testolin M J, Hill C D, Wellard C J, and Hollenberg L C L, A precise
CNOT gate in the presence of large fabrication induced variations of the
exchange interaction strength, e-print: quant-ph/0701165.

[86] Toffoli T, Reversible computing, Automata Languages and Programming,
Seventh Colloquium, Lecture Notes in Computer Science, Vol. 84, de
Bakker J W and van Leeuwen J, eds., Springer, 1985, pp. 632-644.

[87] Turchette Q, Hood C J, Lange W, Mabuchi H, and Kimble H J, Measurement
of Conditional phase Shifts for Quantum Logic, Phys. Rev. Lett.,
Vol. 75, 1995, pp. 4710-4713.

[88] Turing A M, On computable numbers, with an application to the Entscheidungsproblem,
Proc. Lond. Math. Sco. 2, 42:230, 1936.

[89] http://en.wikipedia.org/wiki/Church-Turing thesis

[90] Vatan F, and Williams C, Optimal quantum circuits for general two-qubit
gates, Phys. Rev. A 69, 032315, 2004.

[91] Vidal G, and Dawson C M, Universal quantum circuit for two-qubit tranformations
with three controlled-NOT gates, Phys. Rev. A 69, 2004.

[92] Vlasov A Y, Algebras and universal quantum computations with higher
dimensional systems, Proc. SPIE, Vol. 5128, 2003, pp. 29-36, LANL eprint,
quant-ph/0210049.

[93] Petkovsek M, Wilf H, and Zeilberger D, A=B,
http://www.math.upenn.edu/wilf/AeqB.html.

[94] Wilf H, generatingfunctionology, http://www.math.upenn.edu/wilf/gfology2.pdf.

[95] Werner R, All teleportation and dense coding schemes, J. Phys. A, vol.
34, pp. 7081-7094, 2001, quant-ph/0003070.

[96] Weyl H, The Thoery of Groups and Quantum Mechanics, Dover Publications,
New York, 1931.

[97] Zanardi P, Zalka C, and Faoro L, Entangling power of quantum evolutions,
Phys. Review A, 62, 030301, 2000.
210