Matchgates and classical simulation of quantum circuits

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

Volumn 464, Issue 2100, 2008, Pages 3089-3106

  Jozsa, Richard ^a   Miyake, Akimasa ^b,c  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b UNIVERSITY OF INNSBRUCK   (Austria)

^c ERICH SCHMID INSTITUTE OF MATERIALS SCIENCE   (Austria)

Author keywords

Classical simulation; Clifford algebras; Matchgates; Quantum circuits; Quantum computational complexity

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; LOGIC CIRCUITS; PACKET NETWORKS; QUANTUM COMPUTERS; THEOREM PROVING;

CLASSICAL SIMULATION; CLIFFORD ALGEBRAS; MATCHGATES; QUANTUM CIRCUITS; QUANTUM COMPUTATIONAL COMPLEXITY;

QUANTUM EFFICIENCY;

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

References (32)

1. Bravyi, S. 2005 Lagrangian representation for fermionic linear optics. Quant. Inf. Comp. 5, 216-238.
2. Bravyi, S. 2008 Contraction of matchgate tensor networks on nonplanar graphs. (http://arXiv. org/abs/0801.2989)
3. Bravyi, S. & Kitaev, A. 2002 Fermionic quantum computation. Ann. Phys. 298, 210-226. (doi:10. 1006/aphy.2002.6254)
4. Cai, J.-Y. & Choudhary, V. 2006 Valiant's Holant theorem and matchgate tensors. Lect. Notes Comput. Sci. 3959, 248 261. (doi:10.1007/11750321)
5. Cai, J.-Y., Choudhary, V. & Lu, P. 2007 On the theory of matchgate computations. In Proc. 22nd Ann. IEEE Conf. Computational Complexity, San Diego, CA, 13-16 June 2007. (doi:10.1109/ CCC.2007.22)
6. Cleve, R. & Watrous, J. 2000 Fast parallel circuits for the quantum fourier transform. In Proc. 41st Annual Symp. on Foundations of Computer Science, pp. 526-536. (doi:10.1109/SFCS.2000. 892140)
7. Deutsch, D. & Jozsa, R. 1992 Rapid solution of problems by quantum computation. Proc. R. Soc. A 439, 553-558. (doi:10.1098/rspa.1992. 0167)
8. DiVincenzo, D. & Terhal, B. 2005 Fermionic linear optics revisited. Found. Phys. 35, 1967-1984. (doi:10.1007/s10701-005-8657-0)
9. Gottesrnan, D. 1997 Stabilizer codes and quantum error correction. PhD thesis, California Institute of Technology, Pasadena, CA.
10. Hoffman, D., Raffenetti, R. & Ruedenberg, K. 1972 Generalisation of Euler angles to N dimensional orthogonal matrices. J. Math. Phys. 13, 528 532. (doi:10.1063/1.1666011)
11. Jerrum, M. 2003 Counting, sampling and integrating: algorithms and complexity. Basel, Switzerland: Birkhauser.
12. Jordan, P. & Wigner, E. 1928 Über das Paulische Äquivalenz verbot. Z. Phys. 47, 631-651. (doi:10. 1007/BF01331938)
13. Jozsa, R. 2006 On the simulation of quantum circuits. (http://arXiv.org/abs/quant-ph/0603163)
14. Kasteleyn, P. 1961 The statistics of dimers on a lattice. Physica 27, 1209-1225. (doi: 10.1016/00318914(61)90063-5)
15. Kempe, J., Bacon, D., DiVincenzo, D. P. & Whaley, K. B. 2001 Encoded universality from a single physical interaction. Quant. Inf. Comp. 1, 33-55.
16. Knill, E. 2001 Fermionic linear optics and matchgates. (http://arXiv.org/abs/quant-ph/0108033)
17. Markov, I. L. & Shi, Y. 2008 Simulating quantum computation by contracting tensor networks. SIAM J. Comput. 38, 963-981. (doi:10.1137/050644756)
18. Nielsen, M. & Chuang, I. 2000 Quantum computation and quantum information. Cambridge, UK: Cambridge University Press.
19. Papadimitriou, C. 1994 Computational complexity. Reading, MA: Addison-Wesley.
20. Plenio, M. B. 2007 Remarks on duality transformations and generalised stabiliser states. J. Mod. Opt. 54, 2193-2201.
21. Raz, R. 1999 Exponential separation of quantum and classical communication complexity. In Proc. 31st Annual ACM Symp. Theory of Computing, pp. 358-367. New York, NY: ACM Press.
22. Shor, P. 1997 Polynomial time algorithms for prime factorisation and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484-1509. (doi:10.1137/S0097539795293172)
23. Simon, D. 1997 On the power of quantum computation. SIAM J. Comput. 26, 1474-1483. (doi:10. 1137/S0097539796298637)
24. Somma, R., Barnum, H., Ortiz, G. & Knill, E. 2006 Efficient solvability of Hamiltonians and limits on the power of some quantum computational models. Phys. Rev. Lett. 97, 190 501. (doi:10. 1103/PhysRevLett.97.190501)
25. Temperley, H. & Fisher, M. E. 1961 Dimer problems in statistical mechanics - an exact result. Philos. Mag. 6, 1061-1063. (doi:10.1080/14786436108243366)
26. Terhal, B. & DiVincenzo, D. 2002 Classical simulation of nonintercating-fermion quantum circuits. Phys. Rev. A 65, 032325/1-032325/10. (doi:10.1103/PhysRevA.65.032325)
27. Terhal, B. & DiVincenzo, D. 2004 Adaptive quantum computation, constant depth circuits and Arthur-Merlin games. Quant. Inf. Comp. 4, 134-145.
28. Valiant, L. 2002 Quantum circuits that can be simulated classically in polynomial time. SIAM J. Comput. 31, 1229-1254. (doi:10.1137/S0097539700377025)
29. Valiant, L. 2007 Holographic algorithms. SIAM J. Comput. 37, 1565-1594. (doi:10.1137/ 070682575)
30. Verstraete, F., Cirac, J. I. & Latorre, J. I. 2008 Quantum circuits for strongly correlated quantum systems. (http://arXiv.org/abs/0804.1888)
31. Watrous, J. In press. Quantum computational complexity. In Springer Encyclopedia of Complexity and Systems Sciences. (http://arXiv.org/abs/0804. 3401)
32. Yoran, N. & Short, A. 2006 Classical simulation of limited-width cluster-state quantum computation. Phys. Rev. Lett. 96, 170503. (doi:10.1103/PhysRevLett.96.170503)