Tensor Network Rewriting Strategies for Satisfiability and Counting

In: Proceedings of the Third Annual ACM Symposium on Theory of Computing

Stephen A. Cook (1971): The Complexity of Theorem-Proving Procedures · 1971

Earlier work this paper cites.

SIAM Journal on Computing

Leslie G Valiant (1979): The complexity of enumeration and reliability problems · 1979

Earlier work this paper cites.

Annals of the History of Computing

B. A. Trakhtenbrot (1984): A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms · 1984

Earlier work this paper cites.

computational complexity

Carsten Damm, Markus Holzer & Pierre McKenzie (2002): The complexity of tensor calculus · 2002

Earlier work this paper cites.

arXiv:cond-mat/0407066

F. Verstraete & J. I. Cirac (2004): Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions · 2004

Earlier work this paper cites.

Phys. Rev. Lett

M. Levin & C. P. Nave (2007): Tensor Renormalization Group Approach to Two-Dimensional Classical Lattice Models · 2007

Earlier work this paper cites.

New Journal of Physics

Bob Coecke & Ross Duncan (2011): Interacting quantum observables: categorical algebra and diagrammatics · 2011

Cited alongside, same era.

Oxford University Press, Inc., USA, 10.1093/acprof:oso/9780199233212.001.0001

Cristopher Moore & Stephan Mertens (2011): The Nature of Computation · 2011

Cited alongside, same era.

Quantum Info. Comput

Artur García-Sáez & José I. Latorre (2012): An Exact Tensor Network for the 3SAT Problem · 2012

Cited alongside, same era.

Miriam Backens & Aleks Kissinger (2018): ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity

2018

Cited alongside, same era.

Aleks Kissinger & John van de Wetering (2019): PyZX: Large Scale Automated Diagrammatic Reasoning

2019

Cited alongside, same era.

SciPost Phys

Stefanos Kourtis, Claudio Chamon, Eduardo R. Mucciolo & Andrei E. Ruckenstein (2019): Fast counting with tensor networks · 2019

Later among the works it cites.

Pranay Patil, Stefanos Kourtis, Claudio Chamon, Eduardo R. Mucciolo & Andrei E. Ruckenstein (2019): Obstacles to quantum annealing in a planar embedding of XORSAT

2019

Later among the works it cites.

John van de Wetering & Sal Wolffs (2019): Completeness of the Phase-free ZH-calculus

2019

Later among the works it cites.

Cole Comfort (2020): The ZX& calculus: A complete graphical calculus for classical circuits using spiders

2020

Closest in time.

Johnnie Gray & Stefanos Kourtis (2020): Hyper-optimized tensor network contraction

2020

Closest in time.