Matchgate and space-bounded quantum computations are equivalent

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 466, Issue 2115, 2010, Pages 809-830

  Jozsa, Richard ^a   Kraus, Barbara ^b   Miyake, Akimasa ^b,c   Watrous, John ^d  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b UNIVERSITY OF INNSBRUCK   (Austria)

^c PERIMETER INSTITUTE FOR THEORETICAL PHYSICS   (Canada)

^d UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Quantum computational complexity; Quantum matchgates; Space bounded computation

Indexed keywords

COMPUTATIONAL LINGUISTICS; EQUIVALENT CIRCUITS; QUANTUM COMPUTERS; QUANTUM ELECTRONICS; SPIN DYNAMICS;

ALGEBRAIC CONSTRAINTS; BOUNDED COMPUTATION; COMPUTATIONAL POWER; INTERACTING FERMIONS; MATCHGATES; NEAREST-NEIGHBOUR; PERFECT MATCHINGS; POLYNOMIAL-TIME; QUANTUM COMPUTATION; QUANTUM COMPUTATIONAL COMPLEXITY; QUANTUM GATES; SPIN CHAINS; TWO-QUBIT; UNITARY GATES;

COMPUTATIONAL COMPLEXITY;

EID: 77749285710     PISSN: 13645021     EISSN: 14712946     Source Type: Journal    
DOI: 10.1098/rspa.2009.0433     Document Type: Article

References (31)

1. Aaronson, S. & Gottesman, D. 2004 Improved simulation of stabilizer circuits. Phys. Rev. A 70, 052328. (doi:10.1103/PhysRevA.70. 052328)
2. Arora, S. & Barak, B. 2009 Computational complexity - a modern approach. Cambridge, UK: Cambridge University Press.
3. Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D., Margolus, N., Shor, P., Sleator, T., Smolin, J. & Weinfurter, H. 1995 Elementary gates for quantum computation. Phys. Rev. A 52, 3457. (doi:10.1103/ PhysRevA.52.3457)
4. Beenakker, C. W. J., DiVincenzo, D. P., Emary, C. & Kindermann, M. 2004 Charge detection enables free-electron quantum computation. Phys. Rev. Lett. 93, 020501. (doi:10.1103/PhysRevLett.93.020501)
5. Bernstein, E. & Vazirani, U. 1997 Quantum complexity theory. SIAM J. Comp. 26, 1411-1473. (doi:10.1137/S0097539796300921)
6. Bravyi, S. 2006 Universal quantum computation with the v =5/2 fractional quantum Hall state. Phys. Rev. A 73, 042313. (doi:10.1103/PhysRevA.73.042313)
7. Clark, S., Jozsa, R. & Linden, N. 2008 Generalized Clifford groups and simulation of associated quantum circuits. Quantum. Inf. Comput. 8, 106-126.
8. Gottesman, D. 1997 Stabilizer codes and quantum error correction. PhD thesis, California Institute of Technology, Pasadena, CA.
9. Hoffman, D., Raffenetti, R. & Ruedenberg, K. 1972 Generalization of Euler angles to N-dimensional orthogonal matrices. J. Mathem. Phys. 13, 528-532. (doi:10.1063/1.1666011)
10. Jordan, P. & Wigner, E. 1928 Über das Paulische Äquivalenzverbot. Z. Phys. 47, 631-651. (doi:10.1007/ BF01331938)
11. Jozsa, R. 2008 Mathematical methods in computer science - Essays in memory of Thomas Beth. (eds B. Festschrift, J. Calmet, W. Geiselmann & J. Mueller-Quade). Lecture Notes in Computer Science, no. 5393, pp. 43-49. Berlin, Germany: Springer.
12. Jozsa, R. & Linden, N. 2003 On the role of entanglement in quantum-computational speed-up. Proc. R. Soc. Lond. A 459, 2011-2032. (doi:10.1098/rspa.2002.1097)
13. Jozsa, R. & Miyake, A. 2008 Matchgates and classical simulation of quantum circuits. Proc. R. Soc. A 464, 3089-3106. (doi:10.1098/rspa.2008.0189)
14. Kitaev, A. 2003 Fault-tolerant quantum computation by anyons. Ann. Phys. 303, 2-30. (doi:10.1016/S0003-4916(02)00018-0)
15. Knill, E. 2001 Fermionic linear optics and matchgates. (http://arxiv.org/abs/quant-ph/0108033)
16. McKague, M., Mosca, M. & Gisin, N. 2009 Simulating quantum systems using real Hilbert spaces. Phys. Rev. Lett. 102, 020505. (doi:10.1103/PhysRevLett.102.020505)
17. Moore, G. & Read, N. 1991 Nonabelions in the fractional quantum Hall effect. Nucl. Phys. B 360, 362. (doi:10.1016/0550-3213(91)90407-O)
18. Nayak, C. & Wilczek, F. 1996 Dimensional spinor braiding statistics in paired quantum Hall states. Nucl. Phys. B 479, 529-553.
19. Nielsen, M. & Chuang, I. 2000 Quantum computation and quantum information. Cambridge, UK: Cambridge University Press.
20. Papadimitriou, C. 1994 Computational complexity. Reading, MA: Addison-Wesley.
21. Press, W., Teukolsky, S., Vetterling, W. & Flannery, B. 2007 Numerical recipes 3rd edition: the art of scientific computing, Section 22.3. Cambridge, UK: Cambridge University Press.
22. Shi, Y. 2003 Both Toffoli and Controlled-Not need little help to do universal quantum computation. Quantum. Inf. Comput. 3, 84-92.
23. Terhal, B. & DiVincenzo, D. 2002 Classical simulation of noninteracting-fermion quantum circuits. Phys. Rev. A 65, 032325. (doi:10.1103/PhysRevA.65.032325)
24. Valiant, L. 2002 Quantum circuits that can be simulated classically in polynomial time. SIAM J. Comput. 31, 1229-1254. (doi:10.1137/S0097539700377025)
25. Van den Nest, M. 2008 Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond. (http://arxiv.org/abs/0811.0898).
26. Verstraete, F., Cirac, J. I. & Latorre, J. I. 2009 Quantum circuits for strongly correlated quantum systems. Phys. Rev. A 79, 032316. (doi:10.1103/PhysRevA.79.032316)
27. Verstraete, F., Cirac, J. I. & Murg, V. 2008 Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems. Adv. Phys. 57, 143-224. (doi:10.1080/14789940801912366)
28. Vidal, G. 2003 Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 91, 147902. (doi:10.1103/PhysRevLett.91.147902)
29. Watrous, J. 1999 Space-bounded quantum complexity. J. Comp. Syst. Sci. 59, 281-326. (doi:10.1006/jcss.1999.1655)
30. Watrous, J. 2003 On the complexity of simulating space-bounded quantum computations. Comput. complex. 12, 48-84. (doi:10.1007/s00037-003- 0177-8)
31. Watrous, J. 2009 Quantum computational complexity. In Encyclopaedia of Complexity and System Science. Berlin, Germany: Springer.