Tensor Network Rewriting Strategies for Satisfiability and Counting

@inproceedings{Beaudrap2020TensorNR,
  title={Tensor Network Rewriting Strategies for Satisfiability and Counting},
  author={J. Niel de Beaudrap and Aleks Kissinger and Konstantinos Meichanetzidis},
  booktitle={QPL},
  year={2020}
}
We provide a graphical treatment of SAT and \#SAT on equal footing. Instances of \#SAT can be represented as tensor networks in a standard way. These tensor networks are interpreted by diagrams of the ZH-calculus: a system to reason about tensors over $\mathbb{C}$ in terms of diagrams built from simple generators, in which computation may be carried out by \emph{transformations of diagrams alone}. In general, nodes of ZH diagrams take parameters over $\mathbb{C}$ which determine the tensor… 

Figures from this paper

Classifying Complexity with the ZX-Calculus: Jones Polynomials and Potts Partition Functions

This work presents simplifying rewrites for the case of qutrits, which are of independent interest in the field of quantum circuit optimisation and further champions the ZX-calculus as a suitable and unifying language for studying the complexity of classical and quantum problems.

Simplification Strategies for the Qutrit ZX-Calculus

The main contribution of this work is the derivation of efficient rewrite strategies for the stabiliser fragment of the qutrit ZX-calculus, which constitutes a first non-trivial step towards the simplification ofqutrit quantum circuits.

Well-tempered ZX and ZH calculi

The ZX calculus is a mathematical tool to represent and analyse quantum operations by manipulating diagrams which in effect represent tensor networks. Two families of nodes of these networks are ones

Circuit Extraction for ZX-diagrams can be #P-hard

This paper proves that any oracle that takes as input a ZX-diagram description of a unitary and produces samples of the output of the associated quantum computation enables efficient probabilistic solutions to NP-complete problems.

Tropical Tensor Network for Ground States of Spin Glasses.

The approach brings together the concepts from graphical models, tensor networks, differentiable programming, and quantum circuit simulation, and easily utilizes the computational power of graphical processing units (GPUs).

The ZX& calculus: A complete graphical calculus for classical circuits using spiders

  • Cole Comfort
  • Mathematics
    Electronic Proceedings in Theoretical Computer Science
  • 2021
It is shown that in the case of TOF, freely adding a counit, constructing the category of quantum channels, and computing the discrete Cartesian completion are all equivalent to partial functions between powers of the two element set.

An Algebraic Axiomatisation of ZX-calculus

  • Quanlong Wang
  • Mathematics
    Electronic Proceedings in Theoretical Computer Science
  • 2021
In this paper we give an algebraic complete axiomatisation of ZX-calculus in the sense that there are only ring operations involved for phases, without any need of trigonometry functions such as sin

ZX-calculus for the working quantum computer scientist

This review discusses Clifford computation and graphically prove the Gottesman-Knill theorem, a recently introduced extension of the ZX-calculus that allows for convenient reasoning about Toffoli gates, and the recent completeness theorems that show that, in principle, all reasoning about quantum computation can be done using Zx-diagrams.

References

SHOWING 1-10 OF 17 REFERENCES

The complexity of tensor calculus

Evaluating well-formed tensor formulas with explicit tensor entries is shown complete for $\bigoplusP$, for NP, and for #P as the semiring varies, and the permanent of a matrix is shown expressible as the value of a tensor formula.

Fast counting with tensor networks

The heuristics for the solution of #P-hard counting boolean satisfiability (#SAT) problems, namely monotone #1-in-3SAT and #Cubic-Vertex-Cover, are employed and find that they outperform state-of-the-art solvers by a significant margin.

An exact tensor network for the 3SAT problem

It is shown that for a 3SAT instance with n bits, it is enough to perform a polynomial number of contractions of the tensor network structure associated to the computation of local observables to obtain one of the explicit solutions to the problem, if any.

Hyper-optimized tensor network contraction

This work implements new randomized protocols that find very high quality contraction paths for arbitrary and large tensor networks, and introduces a hyper-optimization approach, where both the method applied and its algorithmic parameters are tuned during the path finding.

ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity

A new graphical calculus is presented that is sound and complete for universal quantum computation by demonstrating the reduction of any diagram to an easily describable normal form, which suggests that this calculus will be significantly more convenient for reasoning about the interplay between classical non-linear behaviour and purely quantum operations.

Interacting Quantum Observables: Categorical Algebra and Diagrammatics

The ZX-calculus is introduced, an intuitive and universal graphical calculus for multi-qubit systems, which greatly simplifies derivations in the area of quantum computation and information and axiomatize phase shifts within this framework.

Completeness of the Phase-free ZH-calculus

The fragment of the ZH-calculus that is phase-free is studied, and thus is closer aligned to physically implementable maps and the completeness result follows by reducing to Vilmart's rule-set for the phase- free $\Delta$ZX-Calculus.

The ZX& calculus: A complete graphical calculus for classical circuits using spiders

  • Cole Comfort
  • Mathematics
    Electronic Proceedings in Theoretical Computer Science
  • 2021
It is shown that in the case of TOF, freely adding a counit, constructing the category of quantum channels, and computing the discrete Cartesian completion are all equivalent to partial functions between powers of the two element set.

The Nature of Computation

The authors explain why the P vs. NP problem is so fundamental, and why it is so hard to resolve, and lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing.

The complexity of theorem-proving procedures

  • S. Cook
  • Mathematics, Computer Science
    STOC
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a