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

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.

[1]  A. Kissinger,et al.  ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity , 2018, QPL.

[2]  Quanlong Wang.  Qutrit ZX-calculus is Complete for Stabilizer Quantum Mechanics , 2018, 1803.00696.

[3]  Bob Coecke,et al.  Interacting quantum observables: categorical algebra and diagrammatics , 2009, ArXiv.

[4]  Lucas Dixon,et al.  Graphical reasoning in compact closed categories for quantum computation , 2009, Annals of Mathematics and Artificial Intelligence.

[5]  J. V. D. Wetering.  ZX-calculus for the working quantum computer scientist , 2020, 2012.13966.

[6]  Johnnie Gray,et al.  Hyper-optimized tensor network contraction , 2020, Quantum.

[7]  Scott Aaronson,et al.  Improved Simulation of Stabilizer Circuits , 2004, ArXiv.

[8]  S. Kourtis,et al.  Evaluating the Jones polynomial with tensor networks. , 2018, Physical review. E.

[9]  Dorit Aharonov,et al.  A Polynomial Quantum Algorithm for Approximating the Jones Polynomial , 2008, Algorithmica.

[10]  Eric C. Rowell,et al.  Mathematics of Topological Quantum Computing , 2017, 1705.06206.

[11]  Greg Kuperberg,et al.  How Hard Is It to Approximate the Jones Polynomial? , 2009, Theory Comput..

[12]  Quanlong Wang,et al.  Equivalence of Local Complementation and Euler Decomposition in the Qutrit ZX-calculus , 2017, 1704.05955.

[13]  John Preskill,et al.  Topological Quantum Computation , 1998, QCQC.

[14]  Jiannis K. Pachos,et al.  Introduction to Topological Quantum Computation , 2012 .

[15]  A. Kissinger,et al.  Tensor Network Rewriting Strategies for Satisfiability and Counting , 2020, QPL.

[16]  Pierre McKenzie,et al.  The complexity of tensor calculus , 2002, computational complexity.

[17]  Aleks Kissinger,et al.  Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus , 2019, Quantum.

[18]  Miriam Backens,et al.  There and back again: A circuit extraction tale , 2021, Quantum.

[19]  Edward Witten,et al.  Quantum field theory and the Jones polynomial , 1989 .

[20]  D. Welsh,et al.  On the computational complexity of the Jones and Tutte polynomials , 1990, Mathematical Proceedings of the Cambridge Philosophical Society.