Expressiveness of matchgates

Theoretical Computer Science

Volumn 289, Issue 1, 2002, Pages 457-471

  Valiant, Leslie G ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATION THEORY; COMPUTER SIMULATION; LOGIC GATES; POLYNOMIALS; QUANTUM THEORY;

MATCHGATES;

COMPUTER CIRCUITS;

EID: 0037163969     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00325-5     Document Type: Article

References (9)

1. Barenco A.et al. Elementary gates for quantum computation. Phys. Rev. A. 52(5):1995;3457-3467.
2. Brualdi R.A., Ryser H.J. Combinatorial Matrix Theory. 1991;Cambridge University Press, Cambridge.
3. Deutsch D. Quantum computational networks. Proc. R. Soc. Lond. A. 425:1989;73-90.
4. Murota K. Matrices and Matroids for Systems Analysis. 2000;Springer, Berlin.
5. Nielsen M.A., Chuang I.L. Quantum Computation and Quantum Information. 2000;Cambridge University Press, Cambridge.
6. Savage J.E. Models of Computation. 1998;Addison-Wesley, Reading, MA.
7. Shor P.W. Algorithms for quantum computation: discrete logarithms and factoring. SIAM J. Comput. 26(5):1997;1489-1509.
8. Skyum S., Valiant L.G. A complexity theory based on boolean algebra. J. ACM. 32(2):1985;484-502.
9. L.G. Valiant, Quantum circuits that can be simulated classicially in polynomial time, SIAM J. Computing, to appear; Extended abstract in Proc. 33rd ACM Symp. on Theory of Computing, ACM Press, New York, 2001 pp. 114-123.