On the theory of matchgate computations

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 305-318

  Cai, Jin Yi ^a   Choudhary, Vinay ^a   Lu, Pinyan ^b  

^a University of Wisconsin   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL METHODS; PROBLEM SOLVING; QUANTUM COMPUTERS;

HOLOGRAPHIC ALGORITHMS; MATCHGATE COMPUTATIONS; MATCHGATE MATRICES;

MATRIX ALGEBRA;

EID: 34748872769     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2007.22     Document Type: Conference Paper

References (16)

1. Jin-Yi Cai and Vinay Choudhary. Some Results on Matchgates and Holographic Algorithms. In Proceedings of ICALP 2006, Part I. LNCS vol. 4051. pp 703-714. Also available at ECCC TR06-048, 2006.
2. Jin-Yi Cai and V. Choudhary. Valiant's Holant Theorem and Matchgate Tensors (Extended Abstract). In Proceedings of TAMC 2006: LNCS vol. 3959, pp 248-261. Also available at ECCC Report TR05-118.
3. J-Y. Cai and Pinyan Lu. On Symmetric Signatures in Holographic Algorithms. In the proceedings of STAGS 2007, LNCS Vol 4393, pp 429-440. Also available at on Computational Complexity ECCC Report TR06-135.
4. Jin-Yi Cai and Pinyan Lu. Holographic Algorithms: From Art to Science. To appear in STOC 2007. Also available at ECCC Report TR06-145.
5. Jin-Yi Cai and Pinyan Lu. Bases Collapse in Holographic Algorithms. In these proceedings. Also available at ECCC Report TR07-003.
6. P. W. Kasteleyn. The statistics of dimers on a lattice. Physica, 27: 1209-1225 (1961).
7. P. W. Kasteleyn. Graph Theory and Crystal Physics. In Graph Theory and Theoretical Physics, (F. Harary, ed.), Academic Press, London, 43-110 (1967).
8. E. Knill. Fermionic Linear Optics and Matchgates. At http://arxiv.org/ abs/quant-ph/0108033
9. K. Murota. Matrices and Matroids for Systems Analysis, Springer, Berlin, 2000.
10. H. N. V. Temperley and M. E. Fisher. Dimer problem in statistical mechanics - an exact result. Philosophical Magazine 6: 1061-1063 (1961).
11. L. G. Valiant. Expressiveness of Matchgates. Theoretical Computer Science, 281(1): 457-471 (2002). See also 299: 795 (2003).
12. L. G. Valiant. Quantum circuits that can be simulated classically in polynomial time. SIAM Journal of Computing, 31(4): 1229-1254 (2002).
13. L. G. Valiant. Holographic Algorithms (Extended Abstract). In Proc. 45th IEEE Symposium on Foundations of Computer Science, 2004, 306-315. A more detailed version appeared in ECCC Report TR05-099.
14. L. G. Valiant. Holographic circuits. In Proc. 32nd International Colloquium on Automata, Languages and Programming, 1-15, 2005.
15. L. G. Valiant. Completeness for parity problems. In Proc. 11th International Computing and Combinatorics Conference, 2005.
16. L. G. Valiant. Accidental Algorithms. In Proc. 47th Annual IEEE Symposium on Foundations of Computer Science 2006, 509-517.