The ZX-calculus as a Language for Topological Quantum Computation

• URL: http://arxiv.org/abs/2211.03855v3
• Date: Tue, 15 Aug 2023 12:18:52 GMT
• Title: The ZX-calculus as a Language for Topological Quantum Computation
• Authors: Fatimah Rita Ahmadi and Aleks Kissinger
• Abstract summary: Unitary fusion categories formalise the theory of topological quantum computation. We represent generators for the Fibonacci and Ising models. We give derivations of the single-qubit braid equations for Fibonacci anyons and the single- and two-qubit braid equations for Ising anyons.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Unitary fusion categories formalise the algebraic theory of topological quantum computation. These categories come naturally enriched in a subcategory of the category of Hilbert spaces, and by looking at this subcategory, one can identify a collection of generators for implementing quantum computation. We represent such generators for the Fibonacci and Ising models, namely the encoding of qubits and the associated braid group representations, with the ZX-calculus and show that in both cases, the Yang-Baxter equation is directly connected to an important rule in the complete ZX-calculus known as the P-rule, which enables one to interchange the phase gates defined with respect to complementary bases. In the Ising case, this reduces to a familiar rule relating two distinct Euler decompositions of the Hadamard gate as $\pi/2$ Z- and X-phase gates, whereas in the Fibonacci case, we give a previously unconsidered exact solution of the P-rule involving the Golden ratio. We demonstrate the utility of these representations by giving graphical derivations of the single-qubit braid equations for Fibonacci anyons and the single- and two-qubit braid equations for Ising anyons. We furthermore present a fully graphical procedure for simulating and simplifying braids with the ZX-representation of Fibonacci anyons.

Related papers

• Diagonal Coset Approach to Topological Quantum Computation with Fibonacci Anyons [0.0]
  We investigate a promising conformal field theory realization scheme for topological quantum computation based on the Fibonacci anyons. The quantum gates are realized by braiding of these anyons.
  arXiv  Detail & Related papers  (2024-04-02T09:44:02Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Enriching Diagrams with Algebraic Operations [49.1574468325115]
  We extend diagrammatic reasoning in monoidal categories with algebraic operations and equations. We show how this construction can be used for diagrammatic reasoning of noise in quantum systems.
  arXiv  Detail & Related papers  (2023-10-17T14:12:39Z)
• Conformal field theory from lattice fermions [77.34726150561087]
  We provide a rigorous lattice approximation of conformal field theories given in terms of lattice fermions in 1+1-dimensions. We show how these results lead to explicit error estimates pertaining to the quantum simulation of conformal field theories.
  arXiv  Detail & Related papers  (2021-07-29T08:54:07Z)
• A Graphical Calculus for Quantum Computing with Multiple Qudits using Generalized Clifford Algebras [0.0]
  We show that it is feasible to envision implementing the braid operators for quantum computation, by showing that they are 2-local operators. We derive several new identities for the braid elements, which are key to our proofs. In terms of quantum computation, we show that it is feasible to envision implementing the braid operators for quantum computation.
  arXiv  Detail & Related papers  (2021-03-30T05:19:49Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Graphical Calculi and their Conjecture Synthesis [0.0]
  This thesis introduces such inference and verification frameworks, in doing so forging novel links between graphical calculi and fields such as Algebraic Geometry and Galois Theory. The calculus RING is initial among ring-based qubit graphical calculi, and in turn inspired the introduction and classification of phase homomorphism pairs also presented here. The second is the calculus ZQ, an edge-decorated calculus which naturally expresses arbitrary qubit rotations, eliminating the need for non-linear rules such as (EU) of ZX.
  arXiv  Detail & Related papers  (2020-10-08T11:54:44Z)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)
• Compiling single-qubit braiding gate for Fibonacci anyons topological quantum computation [0.0]
  Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence. Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons.
  arXiv  Detail & Related papers  (2020-08-08T15:34:03Z)
• Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus [0.0]
  We establish a correspondence between the ZH-calculus and the path-sum formalism. We introduce and prove several new simplification rules for the ZH-calculus. The relatively opaque path-sum rules are shown to arise naturally from two powerful families of rewrite rules.
  arXiv  Detail & Related papers  (2020-03-30T15:38:05Z)
• 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.