References

  1. Miriam Backens & Aleks Kissinger (2018): ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity.
  2. Bob Coecke & Ross Duncan (2011): Interacting quantum observables: categorical algebra and diagrammatics. New Journal of Physics 13(4), pp. 043016, doi:10.1088/1367-2630/13/4/043016.
  3. Cole Comfort (2020): The ZX& calculus: A complete graphical calculus for classical circuits using spiders.
  4. Stephen A. Cook (1971): The Complexity of Theorem-Proving Procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 71. Association for Computing Machinery, New York, NY, USA, pp. 151158, doi:10.1145/800157.805047.
  5. Carsten Damm, Markus Holzer & Pierre McKenzie (2002): The complexity of tensor calculus. computational complexity 11(1), pp. 54–89, doi:10.1007/s00037-000-0170-4.
  6. Artur García-Sáez & José I. Latorre (2012): An Exact Tensor Network for the 3SAT Problem. Quantum Info. Comput. 12(34), pp. 283292.
  7. Johnnie Gray & Stefanos Kourtis (2020): Hyper-optimized tensor network contraction.
  8. Aleks Kissinger & John van de Wetering (2019): PyZX: Large Scale Automated Diagrammatic Reasoning.
  9. Stefanos Kourtis, Claudio Chamon, Eduardo R. Mucciolo & Andrei E. Ruckenstein (2019): Fast counting with tensor networks. SciPost Phys. 7, pp. 60, doi:10.21468/SciPostPhys.7.5.060. Available at https://scipost.org/10.21468/SciPostPhys.7.5.060.
  10. M. Levin & C. P. Nave (2007): Tensor Renormalization Group Approach to Two-Dimensional Classical Lattice Models. Phys. Rev. Lett. 99(12), pp. 120601, doi:10.1103/PhysRevLett.99.120601.
  11. Cristopher Moore & Stephan Mertens (2011): The Nature of Computation. Oxford University Press, Inc., USA, doi:10.1093/acprof:oso/9780199233212.001.0001.
  12. Pranay Patil, Stefanos Kourtis, Claudio Chamon, Eduardo R. Mucciolo & Andrei E. Ruckenstein (2019): Obstacles to quantum annealing in a planar embedding of XORSAT.
  13. Federico Ricci-Tersenghi (2010): Being Glassy Without Being Hard to Solve. Science 330(6011), pp. 1639–1640, doi:10.1126/science.1189804. Available at https://science.sciencemag.org/content/330/6011/1639.
  14. B. A. Trakhtenbrot (1984): A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms. Annals of the History of Computing 6(4), pp. 384–400, doi:10.1109/MAHC.1984.10036.
  15. Leslie G Valiant (1979): The complexity of enumeration and reliability problems. SIAM Journal on Computing 8(3), pp. 410–421, doi:10.1137/0208032.
  16. F. Verstraete & J. I. Cirac (2004): Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions. arXiv:cond-mat/0407066. Available at http://arxiv.org/abs/cond-mat/0407066.
  17. John van de Wetering & Sal Wolffs (2019): Completeness of the Phase-free ZH-calculus.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org