Holographic algorithms: From art to science

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 401-410

  Cai, Jin Yi ^a   Lu, Pinyan ^b  

^a University of Wisconsin Madison   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Holographic algorithms; Matchgates; Signatures

Indexed keywords

DECISION THEORY; HOLOGRAPHY; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

HOLOGRAPHIC ALGORITHMS; MATCHGATES; POLYNOMIAL TIME DECISION ALGORITHMS; SIGNATURES;

ALGORITHMS;

EID: 35448949525     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250850     Document Type: Conference Paper

References (37)

1. S. Aaronson and D. Gottesman. Improved simulation of stabilizer circuits. Phys. Rev. A 70, 052328 (2004).
2. Bach, E. and Shallit, J. Algorithmic Number Theory, Vol. 1: Efficient Algorithms. MIT Press, 1996.
3. J-Y. Cai and Vinay Choudhary. Some Results on Matchgates and Holographic Algorithms. In Proceedings of ICALP 2006, Part I. LNCS vol. 4051. pp 703-714.
4. Also available at ECCC TR-06-048, 2006.
5. J-Y. Cai and Vinay Choudhary. Valiant's Holant Theorem and Matchgate Tensors. In Proceedings of TAMC 2006: LNCS vol. 3959, pp 248-261.
6. Also available at ECCC Report TR05-118.
7. J-Y. Cai, Vinay Choudhary and Pinyan Lu. On the Theory of Matchgate Computations. To appear in IEEE Conference on Computational Complexity 2007. Available at ECCC Report TR06-018.
8. J-Y. Cai and Pinyan Lu. On Symmetric Signatures in Holographic Algorithms. In Proc. of STACS 2007. LNCS Vol. 4393, pp 429-440. Available at ECCC Report TR06-135.
9. J-Y. Cai and Pinyan Lu. Bases Collapse in Holographic Algorithms. To appear in IEEE Conference on Computational Complexity 2007.
10. Also at ECCC TR07-003.
11. J-Y. Cai and Pinyan Lu. Holographic Algorithms: The Power of Dimensionality Resolved. Submitted.
12. Also at ECCC TR07-020.
13. J-Y. Cai and Pinyan Lu. On Block-wise Symmetric Signatures for Matchgates. Submitted.
14. Also at ECCC TR07-019.
15. E. Farhi, J. Goldstone, S. Gutmann and M. Sipser. Quantum Computation by Adiabatic Evolution. http://arxiv.org/abs/quant-ph/0001106 (January 2000)
16. W. Foody and A. Hedayat. On theory and applications of BIB designs with repeated blocks, Annals Statist., 5 (1977), pp. 932-945.
17. W. Foody and A. Hedayat. Note: Correction to "On Theory and Application of BIB Designs with Repeated Blocks". Annals of Statistics, Vol. 7, No. 4 (Jul., 1979), p. 925.
18. D. Gottesman. The Heisenberg Representation of Quantum Computers. At http://arxiv.org/abs/quant-ph/9807006.
19. R. L. Graham, S.-Y. R. Li, and W.-C. W. Li. On the Structure of t-Designs. SIAM. J. on Algebraic and Discrete Methods 1, 8 (1980).
20. N. Linial and B. Rothschild. Incidence Matrices of Subsets-A Rank Formula. SIAM. J. on Algebraic and Discrete Methods 2, 333 (1981).
21. D. Lichtenstein. Planar formulae and their uses. SIAM J. Comput. 11, 2:329-343.
22. M. Jerrum. Two-dimensional monomer-dimer systems are computationally intractable. J. Stat. Phys. 48 (1987) 121-134; erratum, 59 (1990) 1087-1088
23. P. W. Kasteleyn. The statistics of dimers on a lattice. Physica, 27: 1209-1225 (1961).
24. P. W. Kasteleyn. Graph Theory and Crystal Physics. In Graph Theory and Theoretical Physics, Academic Press, 43-110 (1967).
25. M. Kneser. "Aufgabe 360". Jahresbericht der Deutschen Mathematiker-Vereinigung, 2. Abteilung 58: 27. 1955.
26. E. Knill. Fermionic Linear Optics and Matchgates. At http://arxiv.org/ abs/quant-ph/0108033
27. L. Lovász. "Kneser's conjecture, chromatic number, and homotopy". Journal of Combinatorial Theory, Series A 25: 319-324. 1978.
28. J. Matoušek. "A combinatorial proof of Kneser's conjecture". Combinatorica 24 (1): 163-170. 2004.
29. K. Murota. Matrices and Matroids for Systems Analysis, Springer, Berlin, 2000.
30. H. N. V. Temperley and M. E. Fisher. Dimer problem in statistical mechanics - an exact result. Philosophical Magazine 6: 1061-1063 (1961).
31. S. P. Vadhan. The complexity of counting in sparse, regular, and planar graphs, SIAM J. on Computing 31 (2001) 398-427.
32. L. G. Valiant. Quantum circuits that can be simulated classically in polynomial time. SIAM Journal of Computing, 31(4): 1229-1254 (2002).
33. L. G. Valiant. Expressiveness of Matchgates. Theoretical Computer Science, 281(1): 457-471 (2002).
34. L. G. Valiant. Holographic Algorithms (Extended Abstract). In Proc. 45th IEEE Symposium on Foundations of Computer Science, 2004, 306-315. A more detailed version at ECCC TR05-099.
35. L. G. Valiant. Holographic circuits. In Proc. 32nd International Colloquium on Automata, Languages and Programming, 2005, 1-15.
36. L. G. Valiant. Completeness for parity problems. In Proc. 11th International Computing and Combinatorics Conference (COCOON), LNCS, Vol. 3595, pp 1-8, (2005).
37. L. G. Valiant. Accidental Algorithms. In Proc. of FOCS 2006, 509-517.