4.4 Article

Tensor Network Contractions for #SAT

Related references

Note: Only part of the references are listed.
Article Mathematics, Applied

Generalized counting constraint satisfaction problems with determinantal circuits

Jason Morton et al.

LINEAR ALGEBRA AND ITS APPLICATIONS (2015)

Article Physics, Multidisciplinary

Matrix-Product Operators and States: NP-Hardness and Undecidability

M. Kliesch et al.

PHYSICAL REVIEW LETTERS (2014)

Article Multidisciplinary Sciences

Solving search problems by strongly simulating quantum circuits

T. H. Johnson et al.

SCIENTIFIC REPORTS (2013)

Article Physics, Multidisciplinary

Ground-state spin logic

J. D. Whitfield et al.

Article Physics, Multidisciplinary

Algebraically contractible topological tensor network states

S. J. Denny et al.

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL (2012)

Article Optics

Undecidability in tensor network states

Jason Morton et al.

PHYSICAL REVIEW A (2012)

Article Physics, Multidisciplinary

Virtual Parallel Computing and a Search Algorithm Using Matrix Product States

Claudio Chamon et al.

PHYSICAL REVIEW LETTERS (2012)

Article Physics, Multidisciplinary

Quantum measurement occurrence is undecidable

J. Eisert et al.

PHYSICAL REVIEW LETTERS (2012)

Article Physics, Mathematical

Tensor Network States and Geometry

G. Evenbly et al.

JOURNAL OF STATISTICAL PHYSICS (2011)

Article Nanoscience & Nanotechnology

Categorical Tensor Network States

Jacob D. Biamonte et al.

AIP ADVANCES (2011)

Article Physics, Fluids & Plasmas

Dynamical simulations of classical stochastic systems using matrix product states

T. H. Johnson et al.

PHYSICAL REVIEW E (2010)

Article Mathematics, Applied

Counting truth assignments of formulas of bounded tree-width or clique-width

E. Fischer et al.

DISCRETE APPLIED MATHEMATICS (2008)

Article Computer Science, Theory & Methods

Simulating quantum computation by contracting tensor networks

Igor L. Markov et al.

SIAM JOURNAL ON COMPUTING (2008)

Article Computer Science, Information Systems

Solving #SAT using vertex covers

Naomi Nishimura et al.

ACTA INFORMATICA (2007)

Article Computer Science, Theory & Methods

Computational complexity of counting problems on 3-regular planar graphs

Mingji Xia et al.

THEORETICAL COMPUTER SCIENCE (2007)

Article Physics, Multidisciplinary

Novel schemes for measurement-based quantum computation

D. Gross et al.

PHYSICAL REVIEW LETTERS (2007)

Article Optics

Atemporal diagrams for quantum circuits

Robert B. Griffiths et al.

PHYSICAL REVIEW A (2006)

Article Computer Science, Theory & Methods

The complexity of the local Hamiltonian problem

J Kempe et al.

SIAM JOURNAL ON COMPUTING (2006)