Bases collapse in holographic algorithms

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 292-304

  Cai, Jin Yi ^a   Lu, Pinyan ^b  

^a University of Wisconsin Madison   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HOLOGRAPHY; LINEAR SYSTEMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; THEOREM PROVING;

BASIS FOLDING THEOREM; HOLOGRAPHIC ALGORITHMS; POLYNOMIAL TIME COMPUTATIONS;

COMPUTATIONAL METHODS;

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

References (21)

1. J-Y. Cai and Vinay Choudhary. Some Results on Matchgates and Holographic Algorithms. In Proceedings of ICALP 2006, Part I. Lecture Notes in Computer Science vol. 4051. pp 703-714. Also available at Electronic Colloquium on Computational Complexity TR06-048, 2006.
2. J-Y. Cai and Vinay Choudhary. Valiant's Holant Theorem and Matchgate Tensors (Extended Abstract). In Proceedings of TAMC 2006: Lecture Notes in Computer Science vol. 3959, pp 248-261. Also available at Electronic Colloquium on Computational Complexity Report TR05-118.
3. J-Y. Cai, Vinay Choudhary and Pinyan Lu. On the Theory of Matchgate Computations. To appear in these proceedings. A preliminary version is also available at Electronic Colloquium on Computational Complexity Report TR06-018.
4. 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 Electronic Colloquium on Computational Complexity Report TR06-135.
5. J-Y. Cai and Pinyan Lu. Holographic Algorithms: From Art to Science. To appaer in STOC 2007. Also available at Electronic Colloquium on Computational Complexity Report TR06-145.
6. J-Y. Cai and Pinyan Lu. On Block-wise Symmetric Signatures for Matchgates. Available at Electronic Colloquium on Computational Complexity Report TR07-019.
7. J-Y Cai and Pinyan Lu. Holographic Algorithms: The Power of Dimensionality Resolved. Available at Electronic Colloquium on Computational Complexity Report TR07-020.
8. C. T. J. Dodson and T. Poston. Tensor Geometry, Graduate Texts in Mathematics 130, Second edition, Springer-Verlag, New York, 1991.
9. D. Lichtenstein. Planar formulae and their uses. SIAM J. Comput. 11, 2:329-343.
10. M. Jerrum. Two-dimensional monomer-dimer systems are computationally intractable. J. Stat. Phys. 48 (1987) 121-134; erratum, 59 (1990) 1087-1088
11. P. W. Kasteleyn. The statistics of dimers on a lattice. Physica, 27: 1209-1225 (1961).
12. P. W. Kasteleyn. Graph Theory and Crystal Physics. In Graph Theory and Theoretical Physics, (F. Harary, ed.), Academic Press, London, 43-110 (1967).
13. E. Knill. Fermionic Linear Optics and Matchgates. At http://arxiv.org/ abs/quant-ph/0108033
14. K. Murota. Matrices and Matroids for Systems Analysis, Springer, Berlin, 2000.
15. H. N. V. Temperley and M. E. Fisher. Dimer problem in statistical mechanics - an exact result. Philosophical Magazine 6: 1061-1063 (1961).
16. L. G. Valiant. Quantum circuits that can be simulated classically in polynomial time. SIAM Journal of Computing, 31(4): 1229-1254 (2002).
17. L. G. Valiant. Expressiveness of Matchgates. Theoretical Computer Science, 281(1): 457-471 (2002).
18. 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 Electronic Colloquium on Computational Complexity Report TR05-099.
19. L. G. Valiant. Holographic circuits. In Proc. 32nd International Colloquium on Automata, Languages and Programming, 2005, 1-15.
20. L. G. Valiant. Completeness for parity problems. In Proc. 11th International Computing and Combinatorics Conference, 2005, 1-8.
21. L. G. Valiant. Accidental Algorithms. In Proc. 47th Annual IEEE Symposium on Foundations of Computer Science 2006, 509-517.