Holographic circuits

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1-15

  Valiant, Leslie G ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS; POLYNOMIALS;

COMPLEXITY CLASSES; HOLOGRAPHIC CIRCUITS; LINEAR SUPERPOSITIONS;

HOLOGRAPHY;

EID: 26444545481     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_1     Document Type: Conference Paper

References (17)

1. [BBC+95] A. Barenco, et al., Elementary gates for quantum computation, Phys.Rev. A52 (1995) 3457.
2. [BD97] R. Bubley and M. Dyer, Graph orientations with no sink and an approximation for a hard case of #SAT, In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 248-257, New Orleans, Louisiana a, 5-7 January 1997
3. [BD+02] M.J. Bremmer, C.M. Dawson, J.L. Dodd, A. Gilchrist, A.W. Harrow, D. Mortimer, M.A. Nielsen, and T.J. Osborne, A Practical scheme for quantum computation with any two-qubit entangling gate, Phys. Rev. Lett., 89, 247902 (2002).
4. [BR92] R.A. Brualdi and H.J. Ryser, Combinatorial Matrix Theory, Cambridge University Press, Cambridge, 1991.
5. [BB02] J.L. Brylinski and R. Brylinski, Universal quantum gates, in Mathematics of Quantum Computation, Chapman & Hall/CRC Press,Boca Raton, Florida, 2002 (edited by R. Brylinski and G. Chen).
6. [CN01] M. A. Chuang and I. L. Nielsen, Quantum Computation and Quantum Information. Cambridge University Press, 2001.
7. [EWD+01] P. Echternach, et al. Universal quantum gates for single Cooper pair box bases quantum computing, Quantum Information and Computation, (2001) 143-150. (Also quant-ph/0112025.)
8. [GM94] G. Gallbiati and P. Maftioli, Discrete Applied Math. v51 (1994) 269-275.
9. [GPS01] G.-M. Greuel, G. Pfister, and H. Schönemann, Singular 2.0: A Computer Algebra System for Polynomial Computations. Centre for Computer Algebra, University of Kaiserslautern, (2001).
10. [HS90] H.B. Hunt III and R.E. Stearns. The complexity of very simple boolean formulas with applications. SIAM J. Comput. 19:1 (1990) 44-70.
11. [L97] P.D. Lax, Linear Algebra, Wiley, New York, 1997.
12. [M00] K. Murota, Matrices and Matroids for Systems Analysis, Springer-Verlag, Berlin, 2000.
13. [P95] C.H. Papadimitriou. Computational Complexity, Addison Wesley, 1995.
14. [V02a] L. G. Valiant, Quantum circuits that can be simulated classically in polynomial time. SIAM J. on Computing, 31:4 (2002) 1229-1254.
15. [V02b] L. G. Valiant. Expressiveness of matchgates, Theoretical Computer Science, 289:1(2002) 457-471.
16. [V04] L.G. Valiant. Holographic algorithms, Proc. 45th Annual IEEE Symp. on Foundations of Computer Science (2004) IEEE Press, 306-315.
17. [V05] L.G. Valiant, Completeness for parity problems, manuscript, 2005.