Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus

• URL: http://arxiv.org/abs/2302.12135v2
• Date: Thu, 27 Apr 2023 15:45:51 GMT
• Title: Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
• Authors: Boldizs\'ar Po\'or, Quanlong Wang, Razin A. Shaikh, Lia Yeh, Richie Yeung, Bob Coecke
• Abstract summary: The ZX-calculus is a universal graphical language for qubit quantum computation. The ZW-calculus is an alternative universal graphical language that is also complete for qubit quantum computing. By combining these two calculi, a new calculus has emerged for qubit quantum computation, the ZXW-calculus.
• Score: 0.2348805691644085
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The ZX-calculus is a universal graphical language for qubit quantum computation, meaning that every linear map between qubits can be expressed in the ZX-calculus. Furthermore, it is a complete graphical rewrite system: any equation involving linear maps that is derivable in the Hilbert space formalism for quantum theory can also be derived in the calculus by rewriting. It has widespread usage within quantum industry and academia for a variety of tasks such as quantum circuit optimisation, error-correction, and education. The ZW-calculus is an alternative universal graphical language that is also complete for qubit quantum computing. In fact, its completeness was used to prove that the ZX-calculus is universally complete. This calculus has advanced how quantum circuits are compiled into photonic hardware architectures in the industry. Recently, by combining these two calculi, a new calculus has emerged for qubit quantum computation, the ZXW-calculus. Using this calculus, graphical-differentiation, -integration, and -exponentiation were made possible, thus enabling the development of novel techniques in the domains of quantum machine learning and quantum chemistry. Here, we generalise the ZXW-calculus to arbitrary finite dimensions, that is, to qudits. Moreover, we prove that this graphical rewrite system is complete for any finite dimension. This is the first completeness result for any universal graphical language beyond qubits.

Related papers

• ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces [0.09831489366502298]
  The ZX-calculus is a graphical language for quantum computing and quantum information theory. We prove completeness of finite-dimensional ZX-calculus, incorporating only the mixed-dimensional Z-spider and the qudit X-spider as generators. Our approach builds on the completeness of another graphical language, the finite-dimensional ZW-calculus, with direct translations between these two calculi.
  arXiv  Detail & Related papers  (2024-05-17T16:35:07Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• Completeness of the ZX-calculus [0.3655021726150367]
  We give the first complete axiomatisation of the ZX-calculus for the overall pure qubit quantum mechanics. This paves the way for automated pictorial quantum computing, with the aid of some software like Quantomatic.
  arXiv  Detail & Related papers  (2022-09-29T16:01:47Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Qudit lattice surgery [91.3755431537592]
  We observe that lattice surgery, a model of fault-tolerant qubit computation, generalises straightforwardly to arbitrary finite-dimensional qudits. We relate the model to the ZX-calculus, a diagrammatic language based on Hopf-Frobenius algebras.
  arXiv  Detail & Related papers  (2022-04-27T23:41:04Z)
• LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits [58.720142291102135]
  We introduce the LOv-calculus, a graphical language for reasoning about linear optical quantum circuits. Two LOv-circuits represent the same quantum process if and only if one can be transformed into the other with the rules of the LOv-calculus.
  arXiv  Detail & Related papers  (2022-04-25T16:59:26Z)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• Qufinite ZX-calculus: a unified framework of qudit ZX-calculi [0.3655021726150367]
  We generalise qubit ZX-calculus to qudit ZX-calculus in any finite dimension. We propose a graphical formalism called qufinite ZX-calculus as a unified framework for all qudit ZX-calculi.
  arXiv  Detail & Related papers  (2021-04-13T18:10:13Z)
• ZX-calculus for the working quantum computer scientist [0.0]
  The ZX-calculus is a graphical language for reasoning about quantum computation. This review gives a gentle introduction to the ZX-calculus suitable for those familiar with the basics of quantum computing. The latter sections give a condensed overview of the literature on the ZX-calculus.
  arXiv  Detail & Related papers  (2020-12-27T15:54:25Z)
• Entanglement and Quaternions: The graphical calculus ZQ [0.0]
  We introduce the graphical calculus ZQ, which uses quaternions to represent arbitrary rotations. We show that this calculus is sound and complete for qubit quantum computing, while also showing that a fully spider-based representation would have been impossible.
  arXiv  Detail & Related papers  (2020-03-22T21:34:59Z)
• PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations [77.34726150561087]
  We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations. We equip the language with an equational theory, which is proved to be sound and complete. We consider applications like the implementation of controlled permutations and the unrolling of loops.
  arXiv  Detail & Related papers  (2020-02-21T16:15:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.