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

by   Alex Townsend-Teague, et al.

The ZX-calculus is a graphical language which allows for reasoning about suitably represented tensor networks - namely ZX-diagrams - in terms of rewrite rules. Here, we focus on problems which amount to exactly computing a scalar encoded as a closed tensor network. In general, such problems are #P-hard. However, there are families of such problems which are known to be in P when the dimension is below a certain value. By expressing problem instances from these families as ZX-diagrams, we see that the easy instances belong to the stabilizer fragment of the ZX-calculus. Building on previous work on efficient simplification of qubit stabilizer diagrams, we present simplifying rewrites for the case of qutrits, which are of independent interest in the field of quantum circuit optimisation. Finally, we look at the specific examples of evaluating the Jones polynomial and of counting graph-colourings. Our exposition further champions the ZX-calculus as a suitable and unifying language for studying the complexity of a broad range of classical and quantum problems.



There are no comments yet.


page 1

page 2

page 3

page 4


Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus

We present a new circuit-to-circuit optimisation routine based on an equ...

Tensor Network Rewriting Strategies for Satisfiability and Counting

We provide a graphical treatment of SAT and #SAT on equal footing. Insta...

Colored props for large scale graphical reasoning

The prop formalism allows representation of processes withstring diagram...

Coend Calculus and Open Diagrams

Morphisms in a monoidal category are usually interpreted as processes or...

Open Diagrams via Coend Calculus

Morphisms in a monoidal category are usually interpreted as processes, a...

BDD-based reasoning in the fluent calculus - first results

The paper reports on first preliminary results and insights gained in a ...

Analyzing the barren plateau phenomenon in training quantum neural network with the ZX-calculus

In this paper, we propose a general scheme to analyze the barren plateau...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.