The ZX-calculus as a language for topological quantum computation

被引:0
|
作者
Ahmadi, Fatimah Rita [1 ]
Kissinger, Aleks [1 ]
机构
[1] Univ Oxford, Dept Comp Sci, Oxford, England
关键词
topological quantum computation; fusion category; ZX-calculus; anyon; braiding; ANYONS;
D O I
10.1088/1751-8121/acef7e
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
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.
引用
收藏
页数:25
相关论文
共 50 条
  • [1] The ZX-calculus is incomplete for quantum mechanics
    20153201123367
    (1) Scherenbergstr. 22, Berlin; 10439, Germany; (2) Department of Computer Science, Univeristy of Oxford, Oxford, United Kingdom, 1600, (Open Publishing Association):
  • [2] The ZX-calculus is incomplete for quantum mechanics
    de Witt, Christian Schroeder
    Zamdzhiev, Vladimir
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (172): : 285 - 292
  • [3] Quantum Algorithms and Oracles with the Scalable ZX-calculus
    Carette, Titouan
    D'Anello, Yohann
    Perdrix, Simon
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2021, (343): : 193 - 209
  • [4] The ZX-calculus is complete for stabilizer quantum mechanics
    Backens, Miriam
    NEW JOURNAL OF PHYSICS, 2014, 16
  • [5] Application of ZX-calculus to quantum architecture searchApplication of ZX-calculus to quantum architecture searchT. Ewen et al.
    Tom Ewen
    Ivica Turkalj
    Patrick Holzer
    Mark-Oliver Wolf
    Quantum Machine Intelligence, 2025, 7 (1)
  • [6] Application of ZX-calculus to quantum architecture search
    Ewen, Tom
    Turkalj, Ivica
    Holzer, Patrick
    Wolf, Mark-Oliver
    QUANTUM MACHINE INTELLIGENCE, 2025, 7 (01)
  • [7] Equivalence Checking of Quantum Circuits With the ZX-Calculus
    Peham, Tom
    Burgholzer, Lukas
    Wille, Robert
    IEEE JOURNAL ON EMERGING AND SELECTED TOPICS IN CIRCUITS AND SYSTEMS, 2022, 12 (03) : 662 - 675
  • [8] Categorifying the ZX-calculus
    Cicala, Daniel
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2018, (266): : 294 - 314
  • [9] COMPLETENESS OF THE ZX-CALCULUS
    Jeandel, Emmanuel
    Perdrix, Simon
    Vilmart, Renaud
    LOGICAL METHODS IN COMPUTER SCIENCE, 2020, 16 (02) : 11:1 - 11:72
  • [10] An Algebraic Axiomatisation of ZX-calculus
    Wang, Quanlong
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2021, (340): : 303 - 332