ZX-calculus publications

2025

• Fault Tolerance by Construction
  Benjamin Rodatz, Boldizsár Poór and Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2506.17181
  Keywords: Error Correcting Codes, Floquet Codes, Clifford Fragment, Applied, ZX-calculus.

  A key challenge in fault-tolerant quantum computing is synthesising and optimising circuits in a noisy environment, as traditional techniques often fail to account for the effect of noise on circuits. In this work, we propose a framework for designing fault-tolerant quantum circuits that are correct by construction. The framework starts with idealised specifications of fault-tolerant gadgets and refines them using provably sound basic transformations. To reason about manipulating circuits while preserving their error correction properties, we define fault equivalence; two circuits are considered fault-equivalent if all undetectable faults on one circuit have a corresponding fault on the other. This guarantees that the effect of undetectable faults on both circuits is the same. We argue that fault equivalence is a concept that is already implicitly present in the literature. Many problems, such as state preparation and syndrome extraction, can be naturally expressed as finding an implementable circuit that is fault-equivalent to an idealised specification. To utilize fault equivalence in a computationally tractable manner, we adapt the ZX calculus, a diagrammatic language for quantum computing. We restrict its rewrite system to not only preserve the underlying linear map but also fault equivalence, i.e. the circuit's behaviour under noise. Enabled by our framework, we verify, optimise and synthesise new and efficient circuits for syndrome extraction and cat state preparation. We anticipate that fault equivalence can capture and unify different approaches in fault-tolerant quantum computing, paving the way for an end-to-end circuit compilation framework.

  @article{rodatz2025fault,
      author = {Rodatz, Benjamin and Po{\'o}r, Boldizs{\'a}r and Kissinger, Aleks},
      title = {{Fault Tolerance by Construction}},
      year = {2025},
      journal = {arXiv preprint arXiv:2506.17181},
      urldate = {2025-06-20},
      link = {http://arxiv.org/abs/2506.17181},
      keywords = {Error Correcting Codes, Floquet Codes, Clifford Fragment, Applied, ZX-calculus},
      abstract = {A key challenge in fault-tolerant quantum computing is synthesising and optimising circuits in a noisy environment, as traditional techniques often fail to account for the effect of noise on circuits. In this work, we propose a framework for designing fault-tolerant quantum circuits that are correct by construction. The framework starts with idealised specifications of fault-tolerant gadgets and refines them using provably sound basic transformations.   To reason about manipulating circuits while preserving their error correction properties, we define fault equivalence; two circuits are considered fault-equivalent if all undetectable faults on one circuit have a corresponding fault on the other. This guarantees that the effect of undetectable faults on both circuits is the same. We argue that fault equivalence is a concept that is already implicitly present in the literature. Many problems, such as state preparation and syndrome extraction, can be naturally expressed as finding an implementable circuit that is fault-equivalent to an idealised specification.   To utilize fault equivalence in a computationally tractable manner, we adapt the ZX calculus, a diagrammatic language for quantum computing. We restrict its rewrite system to not only preserve the underlying linear map but also fault equivalence, i.e. the circuit's behaviour under noise. Enabled by our framework, we verify, optimise and synthesise new and efficient circuits for syndrome extraction and cat state preparation. We anticipate that fault equivalence can capture and unify different approaches in fault-tolerant quantum computing, paving the way for an end-to-end circuit compilation framework.},
      video = {https://www.youtube.com/watch?v=vrIJc50vuDo}
  }
  

  Copy to Clipboard

• Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation
  Daniel Litinski
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2506.13619
  Keywords: Error Correcting Codes, Photons, Pauli Fusion, Applied, ZX-Supported.

  We introduce a construction for protocols for fault-tolerant quantum computing based on code concatenation and transversal gates. These protocols can be interpreted as families of quantum circuits of low-weight stabilizer measurements without strict locality constraints, effectively implementing concatenated codes. However, we primarily study these protocols in the context of photonic fusion-based quantum computing (FBQC), where they yield families of fusion networks with constant-sized resource states. Their high erasure thresholds relative to their resource-state cost establish them as promising candidates to replace surface codes in the context of FBQC. Examples include protocol families using 8-, 10- and 12-qubit resource states, with erasure thresholds of 13.8%, 19.1% and 11.5%, and footprint-per-logical-qubit scaling as \(\mathcal{O}(d)\), \(\mathcal{O}(d^{1.46})\) and \(\mathcal{O}(d^{0.58})\), respectively, where \(d\) is the code distance. We also present techniques for performing logical operations, decoding, and implementing the protocols in photonic hardware. Although we focus on photonic FBQC, these ideas may also be of interest in other settings.

  @article{litinski2025blocklet,
      author = {Litinski, Daniel},
      title = {{Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation}},
      year = {2025},
      journal = {arXiv preprint arXiv:2506.13619},
      urldate = {2025-06-16},
      link = {http://arxiv.org/abs/2506.13619},
      keywords = {Error Correcting Codes,  Photons, Pauli Fusion, Applied, ZX-Supported},
      abstract = {We introduce a construction for protocols for fault-tolerant quantum computing based on code concatenation and transversal gates. These protocols can be interpreted as families of quantum circuits of low-weight stabilizer measurements without strict locality constraints, effectively implementing concatenated codes. However, we primarily study these protocols in the context of photonic fusion-based quantum computing (FBQC), where they yield families of fusion networks with constant-sized resource states. Their high erasure thresholds relative to their resource-state cost establish them as promising candidates to replace surface codes in the context of FBQC. Examples include protocol families using 8-, 10- and 12-qubit resource states, with erasure thresholds of 13.8%, 19.1% and 11.5%, and footprint-per-logical-qubit scaling as $\mathcal{O}(d)$, $\mathcal{O}(d^{1.46})$ and $\mathcal{O}(d^{0.58})$, respectively, where $d$ is the code distance. We also present techniques for performing logical operations, decoding, and implementing the protocols in photonic hardware. Although we focus on photonic FBQC, these ideas may also be of interest in other settings.}
  }
  

  Copy to Clipboard

• Roughening Transition in Quantum Circuits
  Hyunsoo Ha, David A. Huse and Grace M. Sommers
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2506.11187
  Keywords: Entanglement, MBQC, Condensed matter, Applied, ZX-calculus.

  We explore a roughening phase transition that occurs in the entanglement dynamics of certain quantum circuits. Viewing entanglement as the free energy of a membrane in a circuit-defined random environment, there is a competition between membrane smoothing due to lattice pinning and roughening due to disorder in the circuit. In particular, we investigate the randomness-induced roughening transition of the entanglement membrane in a (3+1)-dimensional Clifford circuit model, by calculating the entanglement entropy for various bipartitions. We further construct a scaling theory for membranes tilted away from lattice planes, uncovering new scaling forms and a crossover to a previously unexplored critical "tilted regime".

  @article{ha2025roughening,
      author = {Ha, Hyunsoo and A. Huse, David and M. Sommers, Grace},
      title = {{Roughening Transition in Quantum Circuits}},
      year = {2025},
      journal = {arXiv preprint arXiv:2506.11187},
      urldate = {2025-06-12},
      link = {http://arxiv.org/abs/2506.11187},
      keywords = {Entanglement, MBQC, Condensed matter, Applied, ZX-calculus},
      abstract = {We explore a roughening phase transition that occurs in the entanglement dynamics of certain quantum circuits. Viewing entanglement as the free energy of a membrane in a circuit-defined random environment, there is a competition between membrane smoothing due to lattice pinning and roughening due to disorder in the circuit. In particular, we investigate the randomness-induced roughening transition of the entanglement membrane in a (3+1)-dimensional Clifford circuit model, by calculating the entanglement entropy for various bipartitions. We further construct a scaling theory for membranes tilted away from lattice planes, uncovering new scaling forms and a crossover to a previously unexplored critical "tilted regime".}
  }
  

  Copy to Clipboard

• Optimizing State Preparation for Variational Quantum Regression on NISQ Hardware
  Frans Perkkola, Ilmo Salmeperä, Arianne Meijer-van de Griend, C. -C. Joseph Wang, Ryan S. Bennink and Jukka K. Nurminen
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2505.17713
  Keywords: Optimisation, Variational Circuits, ZX-Supported.

  The execution of quantum algorithms on modern hardware is often constrained by noise and qubit decoherence, limiting the circuit depth and the number of gates that can be executed. Circuit optimization techniques help mitigate these limitations, enhancing algorithm feasibility. In this work, we implement, optimize, and execute a variational quantum regression algorithm using a novel state preparation method. By leveraging ZX-calculus-based optimization techniques, such as Pauli pushing, phase folding, and Hadamard pushing, we achieve a more efficient circuit design. Our results demonstrate that these optimizations enable the successful execution of the quantum regression algorithm on current hardware. Furthermore, the techniques presented are broadly applicable to other quantum circuits requiring arbitrary real-valued state preparation, advancing the practical implementation of quantum algorithms.

  @article{perkkola2025optimizing,
      author = {Perkkola, Frans and Salmeper{\"a}, Ilmo and Meijer-van de Griend, Arianne and -C. Joseph Wang, C. and S. Bennink, Ryan and K. Nurminen, Jukka},
      title = {{Optimizing State Preparation for Variational Quantum Regression on NISQ Hardware}},
      year = {2025},
      journal = {arXiv preprint arXiv:2505.17713},
      urldate = {2025-05-23},
      link = {http://arxiv.org/abs/2505.17713},
      keywords = {Optimisation, Variational Circuits, ZX-Supported},
      abstract = {The execution of quantum algorithms on modern hardware is often constrained by noise and qubit decoherence, limiting the circuit depth and the number of gates that can be executed. Circuit optimization techniques help mitigate these limitations, enhancing algorithm feasibility. In this work, we implement, optimize, and execute a variational quantum regression algorithm using a novel state preparation method. By leveraging ZX-calculus-based optimization techniques, such as Pauli pushing, phase folding, and Hadamard pushing, we achieve a more efficient circuit design. Our results demonstrate that these optimizations enable the successful execution of the quantum regression algorithm on current hardware. Furthermore, the techniques presented are broadly applicable to other quantum circuits requiring arbitrary real-valued state preparation, advancing the practical implementation of quantum algorithms.}
  }
  

  Copy to Clipboard

• Dynamical codes for hardware with noisy readouts
  Peter-Jan H. S. Derks, Alex Townsend-Teague, Jens Eisert, Markus S. Kesselring, Oscar Higgott and Benjamin J. Brown
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2505.07658
  Keywords: Error Correcting Codes, Applied, ZX-calculus, Floquet Codes.

  Dynamical stabilizer codes may offer a practical route to large-scale quantum computation. Such codes are defined by a schedule of error-detecting measurements, which allows for flexibility in their construction. In this work, we ask how best to optimise the measurement schedule of dynamically condensed colour codes in various limits of noise bias. We take a particular focus on the setting where measurements introduce more noise than unitary and idling operations - a noise model relevant to some hardware proposals. For measurement-biased noise models, we improve code performance by strategically repeating measurements within the schedule. For unbiased or \(Z\)-biased noise models, we find repeating measurements offers little improvement - somewhat contrary to our expectations - and investigate why this is. To perform this analysis, we generalise a metric called the teraquop footprint to the teraquop volume. This is the product of the number of qubits and number of rounds of measurements required such that the probability of a spacelike or timelike logical error occurring is less than \(10^{-12}\). In most cases, we find differences in performance are primarily due to the number of rounds of measurements required, rather than the number of qubits - emphasising the importance of using the teraquop volume in the analysis. Additionally, our results provide another example of the importance of making use of correlated errors when decoding, in that using belief matching rather than minimum-weight perfect matching can turn a worst-performing code under a given noise model into a best-performing code.

  @article{h.s.derks2025dynamical,
      author = {H. S. Derks, Peter-Jan and Townsend-Teague, Alex and Eisert, Jens and S. Kesselring, Markus and Higgott, Oscar and J. Brown, Benjamin},
      title = {{Dynamical codes for hardware with noisy readouts}},
      year = {2025},
      journal = {arXiv preprint arXiv:2505.07658},
      urldate = {2025-05-12},
      link = {http://arxiv.org/abs/2505.07658},
      keywords = {Error Correcting Codes, Applied, ZX-calculus, Floquet Codes},
      abstract = {Dynamical stabilizer codes may offer a practical route to large-scale quantum computation. Such codes are defined by a schedule of error-detecting measurements, which allows for flexibility in their construction. In this work, we ask how best to optimise the measurement schedule of dynamically condensed colour codes in various limits of noise bias. We take a particular focus on the setting where measurements introduce more noise than unitary and idling operations - a noise model relevant to some hardware proposals. For measurement-biased noise models, we improve code performance by strategically repeating measurements within the schedule. For unbiased or $Z$-biased noise models, we find repeating measurements offers little improvement - somewhat contrary to our expectations - and investigate why this is. To perform this analysis, we generalise a metric called the teraquop footprint to the teraquop volume. This is the product of the number of qubits and number of rounds of measurements required such that the probability of a spacelike or timelike logical error occurring is less than $10^{-12}$. In most cases, we find differences in performance are primarily due to the number of rounds of measurements required, rather than the number of qubits - emphasising the importance of using the teraquop volume in the analysis. Additionally, our results provide another example of the importance of making use of correlated errors when decoding, in that using belief matching rather than minimum-weight perfect matching can turn a worst-performing code under a given noise model into a best-performing code.}
  }
  

  Copy to Clipboard

• From Fermions to Qubits: A ZX-Calculus Perspective
  Haytham McDowall-Rose, Razin A. Shaikh and Lia Yeh
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2505.06212
  Keywords: Scalable ZX, Fermionic quantum computing, Triangle, Algebraic ZX, ZW-calculus.

  Mapping fermionic systems to qubits on a quantum computer is often the first step for algorithms in quantum chemistry and condensed matter physics. However, it is difficult to reconcile the many different approaches that have been proposed, such as those based on binary matrices, ternary trees, and stabilizer codes. This challenge is further exacerbated by the many ways to describe them -- transformation of Majorana operators, action on Fock states, encoder circuits, and stabilizers of local encodings -- making it challenging to know when the mappings are equivalent. In this work, we present a graphical framework for fermion-to-qubit mappings that streamlines and unifies various representations through the ZX-calculus. To start, we present the correspondence between linear encodings of the Fock basis and phase-free ZX-diagrams. The commutation rules of scalable ZX-calculus allows us to convert the fermionic operators to Pauli operators under any linear encoding. Next, we give a translation from ternary tree mappings to scalable ZX-diagrams, which not only directly represents the encoder map as a CNOT circuit, but also retains the same structure as the tree. Consequently, we graphically prove that ternary tree transformations are equivalent to linear encodings, a recent result by Chiew et al. The scalable ZX representation moreover enables us to construct an algorithm to directly compute the binary matrix for any ternary tree mapping. Lastly, we present the graphical representation of local fermion-to-qubit encodings. Its encoder ZX-diagram has the same connectivity as the interaction graph of the fermionic Hamiltonian and also allows us to easily identify stabilizers of the encoding.

  @article{mcdowall-rose2025from,
      author = {McDowall-Rose, Haytham and A. Shaikh, Razin and Yeh, Lia},
      title = {{From Fermions to Qubits: A ZX-Calculus Perspective}},
      year = {2025},
      journal = {arXiv preprint arXiv:2505.06212},
      urldate = {2025-05-09},
      link = {http://arxiv.org/abs/2505.06212},
      keywords = {Scalable ZX, Fermionic quantum computing, Triangle, Algebraic ZX, ZW-calculus},
      abstract = {Mapping fermionic systems to qubits on a quantum computer is often the first step for algorithms in quantum chemistry and condensed matter physics. However, it is difficult to reconcile the many different approaches that have been proposed, such as those based on binary matrices, ternary trees, and stabilizer codes. This challenge is further exacerbated by the many ways to describe them -- transformation of Majorana operators, action on Fock states, encoder circuits, and stabilizers of local encodings -- making it challenging to know when the mappings are equivalent. In this work, we present a graphical framework for fermion-to-qubit mappings that streamlines and unifies various representations through the ZX-calculus.   To start, we present the correspondence between linear encodings of the Fock basis and phase-free ZX-diagrams. The commutation rules of scalable ZX-calculus allows us to convert the fermionic operators to Pauli operators under any linear encoding. Next, we give a translation from ternary tree mappings to scalable ZX-diagrams, which not only directly represents the encoder map as a CNOT circuit, but also retains the same structure as the tree. Consequently, we graphically prove that ternary tree transformations are equivalent to linear encodings, a recent result by Chiew et al. The scalable ZX representation moreover enables us to construct an algorithm to directly compute the binary matrix for any ternary tree mapping. Lastly, we present the graphical representation of local fermion-to-qubit encodings. Its encoder ZX-diagram has the same connectivity as the interaction graph of the fermionic Hamiltonian and also allows us to easily identify stabilizers of the encoding.},
      video = {https://www.youtube.com/watch?v=dqkOF1WCxNU}
  }
  

  Copy to Clipboard

• 2D Quon Language: Unifying Framework for Cliffords, Matchgates, and Beyond
  Byungmin Kang, Chen Zhao, Zhengwei Liu, Xun Gao and Soonwon Choi
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2505.06336
  Keywords: Clifford Fragment, ZX-supported.

  Simulating generic quantum states and dynamics is practically intractable using classical computers. However, certain special classes -- namely Clifford and matchgate circuits -- permit efficient computation. They provide invaluable tools for studying many-body physics, quantum chemistry, and quantum computation. While both play foundational roles across multiple disciplines, the origins of their tractability seem disparate, and their relationship remain unclear. A deeper understanding of such tractable classes could expand their scope and enable a wide range of new applications. In this work, we make progress toward the unified understanding of the Clifford and matchgate -- these two classes are, in fact, distinct special cases of a single underlying structure. Specifically, we introduce the 2D Quon language, which combines Majorana worldlines with their underlying spacetime topology to diagrammatically represent quantum processes and tensor networks. In full generality, the 2D Quon language is universal -- capable of representing arbitrary quantum states, dynamics, or tensor networks -- yet they become especially powerful in describing Clifford and matchgate classes. Each class can be efficiently characterized in a visually recognizable manner using the Quon framework. This capability naturally gives rise to several families of efficiently computable tensor networks introduced in this work: punctured matchgates, hybrid Clifford-matchgate-MPS, and ansatze generated from factories of tractable networks. All of these exhibit high non-Cliffordness, high non-matchgateness, and large bipartite entanglement entropy. We discuss a range of applications of our approach, from recovering well-known results such as the Kramers-Wannier duality and the star-triangle relation of the Ising model, to enabling variational optimization with novel ansatz states.

  @article{kang20252d,
      author = {Kang, Byungmin and Zhao, Chen and Liu, Zhengwei and Gao, Xun and Choi, Soonwon},
      title = {{2D Quon Language: Unifying Framework for Cliffords, Matchgates, and Beyond}},
      year = {2025},
      journal = {arXiv preprint arXiv:2505.06336},
      urldate = {2025-05-09},
      link = {http://arxiv.org/abs/2505.06336},
      keywords = {Clifford Fragment, ZX-supported},
      abstract = {Simulating generic quantum states and dynamics is practically intractable using classical computers. However, certain special classes -- namely Clifford and matchgate circuits -- permit efficient computation. They provide invaluable tools for studying many-body physics, quantum chemistry, and quantum computation. While both play foundational roles across multiple disciplines, the origins of their tractability seem disparate, and their relationship remain unclear. A deeper understanding of such tractable classes could expand their scope and enable a wide range of new applications. In this work, we make progress toward the unified understanding of the Clifford and matchgate -- these two classes are, in fact, distinct special cases of a single underlying structure. Specifically, we introduce the 2D Quon language, which combines Majorana worldlines with their underlying spacetime topology to diagrammatically represent quantum processes and tensor networks. In full generality, the 2D Quon language is universal -- capable of representing arbitrary quantum states, dynamics, or tensor networks -- yet they become especially powerful in describing Clifford and matchgate classes. Each class can be efficiently characterized in a visually recognizable manner using the Quon framework. This capability naturally gives rise to several families of efficiently computable tensor networks introduced in this work: punctured matchgates, hybrid Clifford-matchgate-MPS, and ansatze generated from factories of tractable networks. All of these exhibit high non-Cliffordness, high non-matchgateness, and large bipartite entanglement entropy. We discuss a range of applications of our approach, from recovering well-known results such as the Kramers-Wannier duality and the star-triangle relation of the Ising model, to enabling variational optimization with novel ansatz states.}
  }
  

  Copy to Clipboard

• Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
  Andreas Bauer and Julio C. Magdalena de la Fuente
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2505.05175
  Keywords: Error Correcting Codes, ZX-calculus, Clifford+T, Applied.

  We introduce a family of scalable planar fault-tolerant circuits that implement logical non-Clifford operations on a 2D color code, such as a logical \(T\) gate or a logical non-Pauli measurement that prepares a magic \(|T\rangle\) state. The circuits are relatively simple, consisting only of physical \(T\) gates, \(CX\) gates, and few-qubit measurements. They can be implemented with an array of qubits on a 2D chip with nearest-neighbor couplings, and no wire crossings. The construction is based on a spacetime path integral representation of a non-Abelian 2+1D topological phase, which is related to the 3D color code. We turn the path integral into a circuit by expressing it as a spacetime \(ZX\) tensor network, and then traversing it in some chosen time direction. We describe in detail how fault tolerance is achieved using a "just-in-time" decoding strategy, for which we repurpose and extend state-of-the-art color-code matching decoders.

  @article{bauer2025planar,
      author = {Bauer, Andreas and C. Magdalena de la Fuente, Julio},
      title = {{Planar fault-tolerant circuits for non-Clifford gates on the 2D color code}},
      year = {2025},
      journal = {arXiv preprint arXiv:2505.05175},
      urldate = {2025-05-08},
      link = {http://arxiv.org/abs/2505.05175},
      keywords = {Error Correcting Codes, ZX-calculus, Clifford+T, Applied},
      abstract = {We introduce a family of scalable planar fault-tolerant circuits that implement logical non-Clifford operations on a 2D color code, such as a logical $T$ gate or a logical non-Pauli measurement that prepares a magic $|T\rangle$ state. The circuits are relatively simple, consisting only of physical $T$ gates, $CX$ gates, and few-qubit measurements. They can be implemented with an array of qubits on a 2D chip with nearest-neighbor couplings, and no wire crossings. The construction is based on a spacetime path integral representation of a non-Abelian 2+1D topological phase, which is related to the 3D color code. We turn the path integral into a circuit by expressing it as a spacetime $ZX$ tensor network, and then traversing it in some chosen time direction. We describe in detail how fault tolerance is achieved using a "just-in-time" decoding strategy, for which we repurpose and extend state-of-the-art color-code matching decoders.}
  }
  

  Copy to Clipboard

• Engineering CSS surgery: compiling any CNOT in any code
  Clément Poirson, Joschka Roffe and Robert I. Booth
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2505.01370
  Keywords: Lattice Surgery, Error Correcting Codes, ZX-calculus, Category Theory, Applied.

  We introduce a framework for implementing logic in CSS-style quantum error correction codes, building on the surgery methods of Cowtan and Burton [CB24]. Our approach offers a systematic methodology for designing and analysing surgery protocols. At the physical level, we introduce the concept of subcodes, which encapsulate all the necessary data for performing surgery. At the logical level, leveraging homological algebra, subcodes enable us to track the logical operations induced by any surgery protocol, regardless of the choice of logical operator basis. In particular, we make no assumptions on the structure of the logical operators of the code, thereby eschewing the irreducibility assumption that has been necessary in other formulations of surgery for CSS codes [Coh+22; Cro+24; ZL24]. As a proof of concept, we develop a surgery protocol inspired by lattice surgery that implements a logical CNOT gate between any two logical qubits. Applicable to any CSS code, this protocol is highly versatile and facilitates the process of fault-tolerant design.

  @article{poirson2025engineering,
      author = {Poirson, Cl{\'e}ment and Roffe, Joschka and I. Booth, Robert},
      title = {{Engineering CSS surgery: compiling any CNOT in any code}},
      year = {2025},
      journal = {arXiv preprint arXiv:2505.01370},
      urldate = {2025-05-02},
      link = {http://arxiv.org/abs/2505.01370},
      keywords = {Lattice Surgery, Error Correcting Codes, ZX-calculus, Category Theory, Applied},
      abstract = {We introduce a framework for implementing logic in CSS-style quantum error correction codes, building on the surgery methods of Cowtan and Burton [CB24]. Our approach offers a systematic methodology for designing and analysing surgery protocols. At the physical level, we introduce the concept of subcodes, which encapsulate all the necessary data for performing surgery. At the logical level, leveraging homological algebra, subcodes enable us to track the logical operations induced by any surgery protocol, regardless of the choice of logical operator basis. In particular, we make no assumptions on the structure of the logical operators of the code, thereby eschewing the irreducibility assumption that has been necessary in other formulations of surgery for CSS codes [Coh+22; Cro+24; ZL24]. As a proof of concept, we develop a surgery protocol inspired by lattice surgery that implements a logical CNOT gate between any two logical qubits. Applicable to any CSS code, this protocol is highly versatile and facilitates the process of fault-tolerant design.},
      video = {https://www.youtube.com/watch?v=WSlw1vFNAjU}
  }
  

  Copy to Clipboard

• Improved T counts and active volume estimates for high-level arithmetic subroutines
  Sam Heavey
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2504.19626
  Keywords: Surface Code, Lattice Surgery, Optimisation, Applied, ZX-calculus.

  Surface code based quantum computers show great promise for fault-tolerant quantum computing, but most architectures needlessly increase the spacetime volume of a computation due to qubits sitting idly during a computation. Active volume architectures, with long-range connectivity, aim to remove idle spacetime volume leaving only the spacetime volume that logically contributes to a computation. In this work we optimise and derive the active volumes for several industry-leading low- and high-level arithmetic subroutines and achieve significant T-count reductions. We discuss a simple method for estimating and optimising active volumes using orientated ZX diagrams. We also demonstrate that circuit structure, beyond gate counts alone, impacts the active volume of a subroutine and therefore should be taken into consideration when designing circuits.

  @article{heavey2025improved,
      author = {Heavey, Sam},
      title = {{Improved T counts and active volume estimates for high-level arithmetic subroutines}},
      year = {2025},
      journal = {arXiv preprint arXiv:2504.19626},
      urldate = {2025-04-28},
      link = {http://arxiv.org/abs/2504.19626},
      keywords = {Surface Code, Lattice Surgery, Optimisation, Applied, ZX-calculus},
      abstract = {Surface code based quantum computers show great promise for fault-tolerant quantum computing, but most architectures needlessly increase the spacetime volume of a computation due to qubits sitting idly during a computation. Active volume architectures, with long-range connectivity, aim to remove idle spacetime volume leaving only the spacetime volume that logically contributes to a computation. In this work we optimise and derive the active volumes for several industry-leading low- and high-level arithmetic subroutines and achieve significant T-count reductions. We discuss a simple method for estimating and optimising active volumes using orientated ZX diagrams. We also demonstrate that circuit structure, beyond gate counts alone, impacts the active volume of a subroutine and therefore should be taken into consideration when designing circuits.}
  }
  

  Copy to Clipboard

• Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure
  Fernando Lima and Arcesio Castañeda Medina
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2504.16004
  Keywords: Classical Simulation, Optimisation, Automation, PyZX, ZX-calculus.

  Classical simulation of quantum circuits is a pivotal part of the quantum computing landscape, specially within the NISQ era, where the constraints imposed by available hardware are unavoidable. The Gottesman-Knill theorem further motivates this argument by accentuating the importance of Clifford circuits and their role on this topic of simulation. In this work, we propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary, these ranging from fully classical emulation, hybrid quantum-classical execution or even quantum algorithm simplification. To further complement this analysis, we make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section. To achieve this, we present a novel procedure for parsing ZX diagrams, that not only allows for the detection of this border but also simplifies the circuit extraction process.

  @article{lima2025clifford,
      author = {Lima, Fernando and Casta{\~n}eda Medina, Arcesio},
      title = {{Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure}},
      year = {2025},
      journal = {arXiv preprint arXiv:2504.16004},
      urldate = {2025-04-22},
      link = {http://arxiv.org/abs/2504.16004},
      keywords = {Classical Simulation, Optimisation, Automation, PyZX, ZX-calculus},
      abstract = {Classical simulation of quantum circuits is a pivotal part of the quantum computing landscape, specially within the NISQ era, where the constraints imposed by available hardware are unavoidable. The Gottesman-Knill theorem further motivates this argument by accentuating the importance of Clifford circuits and their role on this topic of simulation. In this work, we propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary, these ranging from fully classical emulation, hybrid quantum-classical execution or even quantum algorithm simplification. To further complement this analysis, we make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section. To achieve this, we present a novel procedure for parsing ZX diagrams, that not only allows for the detection of this border but also simplifies the circuit extraction process.}
  }
  

  Copy to Clipboard

• Rapidly Trainable and Shallow-Compiled Quantum Approximate Optimization Algorithm for Maximum Likelihood Detection
  Yuxiang Liu, Yinuo Qian, Lu Wang, Zaichen Zhang and Xutao Yu
  Show abstract ⇲ Show bibdata ⇲

  Physics Letters A
  Keywords: Optimisation, Variational Circuits, Automation, ZX-calculus.

  In multiple-input and multiple-output (MIMO) systems, the maximum likelihood (ML) detection problem is NP-hard and becomes increasingly complex with more transmitting antennas and symbols. The quantum approximate optimization algorithm (QAOA), a leading candidate algorithm running in the noisy intermediate-scale quantum (NISQ) devices, can show quantum advantage for approximately solving combinatorial optimization problems. In this paper, we propose an improved QAOA based maximum likelihood detection. In the proposed scheme, we use ZX-calculus to prove the parameter symmetry in QAOA circuits, which can be used to reduce the search space and accelerate the training process. Moreover, to run QAOA on quantum devices, an improved qubit mapping method with simultaneous gate absorption is proposed, which can compile the quantum circuit of the QAOA to satisfy the connectivity constraints of real quantum devices with fewer CNOT counts. In numerical experiments, our scheme accelerates parameter training by an average of 29.8% and uses fewer CNOT gates and shallower circuit depth during compilation. This demonstrates that our scheme has significant advantages over the traditional scheme.

  @article{LIU2025130541,
      author = {Yuxiang Liu and Yinuo Qian and Lu Wang and Zaichen Zhang and Xutao Yu},
      title = {Rapidly Trainable and Shallow-Compiled Quantum Approximate Optimization Algorithm for Maximum Likelihood Detection},
      year = {2025},
      journal = {Physics Letters A},
      pages = {130541},
      issn = {0375-9601},
      doi = {https://doi.org/10.1016/j.physleta.2025.130541},
      urldate = {2025-04-14},
      link = {https://www.sciencedirect.com/science/article/pii/S0375960125003214},
      keywords = {Optimisation, Variational Circuits, Automation, ZX-calculus},
      abstract = {In multiple-input and multiple-output (MIMO) systems, the maximum likelihood (ML) detection problem is NP-hard and becomes increasingly complex with more transmitting antennas and symbols. The quantum approximate optimization algorithm (QAOA), a leading candidate algorithm running in the noisy intermediate-scale quantum (NISQ) devices, can show quantum advantage for approximately solving combinatorial optimization problems. In this paper, we propose an improved QAOA based maximum likelihood detection. In the proposed scheme, we use ZX-calculus to prove the parameter symmetry in QAOA circuits, which can be used to reduce the search space and accelerate the training process. Moreover, to run QAOA on quantum devices, an improved qubit mapping method with simultaneous gate absorption is proposed, which can compile the quantum circuit of the QAOA to satisfy the connectivity constraints of real quantum devices with fewer CNOT counts. In numerical experiments, our scheme accelerates parameter training by an average of 29.8% and uses fewer CNOT gates and shallower circuit depth during compilation. This demonstrates that our scheme has significant advantages over the traditional scheme.}
  }
  

  Copy to Clipboard

• Fault-tolerant protocols through spacetime concatenation
  Yichen Xu and Arpit Dua
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2504.08918
  Keywords: Error correcting codes, Floquet Codes, ZX-calculus, Applied.

  We introduce a framework called spacetime concatenation for fault-tolerant compilation of syndrome extraction circuits of stabilizer codes. Spacetime concatenation enables efficient compilation of syndrome extraction circuits into dynamical codes through structured gadget layouts and encoding matrices, facilitating low-weight measurements while preserving logical information. Our framework uses conditions that are sufficient for fault-tolerance of the dynamical code, including not measuring logical operators and preserving the spacetime distance. We construct explicit examples of dynamical codes using this framework, including the dynamical bivariate bicycle code and a dynamical Haah code, while illustrating their fault-tolerant properties. Furthermore, we analyze the classification and resource trade-offs of dynamical codes, demonstrating their adaptability to hardware constraints, including fabrication defects and qubit dropout scenarios.

  @article{xu2025faulttolerant,
      author = {Xu, Yichen and Dua, Arpit},
      title = {{Fault-tolerant protocols through spacetime concatenation}},
      year = {2025},
      journal = {arXiv preprint arXiv:2504.08918},
      urldate = {2025-04-11},
      link = {http://arxiv.org/abs/2504.08918},
      keywords = {Error correcting codes, Floquet Codes, ZX-calculus, Applied},
      abstract = {We introduce a framework called spacetime concatenation for fault-tolerant compilation of syndrome extraction circuits of stabilizer codes. Spacetime concatenation enables efficient compilation of syndrome extraction circuits into dynamical codes through structured gadget layouts and encoding matrices, facilitating low-weight measurements while preserving logical information. Our framework uses conditions that are sufficient for fault-tolerance of the dynamical code, including not measuring logical operators and preserving the spacetime distance. We construct explicit examples of dynamical codes using this framework, including the dynamical bivariate bicycle code and a dynamical Haah code, while illustrating their fault-tolerant properties. Furthermore, we analyze the classification and resource trade-offs of dynamical codes, demonstrating their adaptability to hardware constraints, including fabrication defects and qubit dropout scenarios.}
  }
  

  Copy to Clipboard

• Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks
  Alexander Mattick, Maniraman Periyasamy, Christian Ufrecht, Abhishek Y. Dubey, Christopher Mutschler, Axel Plinge and Daniel D. Scherer
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2504.03429
  Keywords: Optimisation, Automation, PyZX, ZX-calculus.

  Quantum computing is currently strongly limited by the impact of noise, in particular introduced by the application of two-qubit gates. For this reason, reducing the number of two-qubit gates is of paramount importance on noisy intermediate-scale quantum hardware. To advance towards more reliable quantum computing, we introduce a framework based on ZX calculus, graph-neural networks and reinforcement learning for quantum circuit optimization. By combining reinforcement learning and tree search, our method addresses the challenge of selecting optimal sequences of ZX calculus rewrite rules. Instead of relying on existing heuristic rules for minimizing circuits, our method trains a novel reinforcement learning policy that directly operates on ZX-graphs, therefore allowing us to search through the space of all possible circuit transformations to find a circuit significantly minimizing the number of CNOT gates. This way we can scale beyond hard-coded rules towards discovering arbitrary optimization rules. We demonstrate our method's competetiveness with state-of-the-art circuit optimizers and generalization capabilities on large sets of diverse random circuits.

  @article{mattick2025optimizing,
      author = {Mattick, Alexander and Periyasamy, Maniraman and Ufrecht, Christian and Y. Dubey, Abhishek and Mutschler, Christopher and Plinge, Axel and D. Scherer, Daniel},
      title = {{Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks}},
      year = {2025},
      journal = {arXiv preprint arXiv:2504.03429},
      urldate = {2025-04-04},
      link = {http://arxiv.org/abs/2504.03429},
      keywords = {Optimisation, Automation, PyZX, ZX-calculus},
      abstract = {Quantum computing is currently strongly limited by the impact of noise, in particular introduced by the application of two-qubit gates. For this reason, reducing the number of two-qubit gates is of paramount importance on noisy intermediate-scale quantum hardware. To advance towards more reliable quantum computing, we introduce a framework based on ZX calculus, graph-neural networks and reinforcement learning for quantum circuit optimization. By combining reinforcement learning and tree search, our method addresses the challenge of selecting optimal sequences of ZX calculus rewrite rules. Instead of relying on existing heuristic rules for minimizing circuits, our method trains a novel reinforcement learning policy that directly operates on ZX-graphs, therefore allowing us to search through the space of all possible circuit transformations to find a circuit significantly minimizing the number of CNOT gates. This way we can scale beyond hard-coded rules towards discovering arbitrary optimization rules. We demonstrate our method's competetiveness with state-of-the-art circuit optimizers and generalization capabilities on large sets of diverse random circuits.}
  }
  

  Copy to Clipboard

• Exhaustive Search for Quantum Circuit Optimization using ZX Calculus
  Tobias Fischbach, Pierre Talbot and Pascal Bouvry
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2503.10983
  Keywords: Optimisation, Automation, PyZX.

  Quantum computers allow a near-exponential speed-up for specific applications when compared to classical computers. Despite recent advances in the hardware of quantum computers, their practical usage is still severely limited due to a restricted number of available physical qubits and quantum gates, short coherence time, and high error rates. This paper lays the foundation towards a metric independent approach to quantum circuit optimization based on exhaustive search algorithms. This work uses depth-first search and iterative deepening depth-first search. We rely on ZX calculus to represent and optimize quantum circuits through the minimization of a given metric (e.g. the T-gate and edge count). ZX calculus formally guarantees that the semantics of the original circuit is preserved. As ZX calculus is a non-terminating rewriting system, we utilise a novel set of pruning rules to ensure termination while still obtaining high-quality solutions. We provide the first formalization of quantum circuit optimization using ZX calculus and exhaustive search. We extensively benchmark our approach on 100 standard quantum circuits. Finally, our implementation is integrated in the well-known libraries PyZX and Qiskit as a compiler pass to ensure applicability of our results.

  @article{fischbach2025exhaustive,
      author = {Fischbach, Tobias and Talbot, Pierre and Bouvry, Pascal},
      title = {{Exhaustive Search for Quantum Circuit Optimization using ZX Calculus}},
      year = {2025},
      journal = {arXiv preprint arXiv:2503.10983},
      urldate = {2025-03-14},
      link = {http://arxiv.org/abs/2503.10983},
      keywords = {Optimisation, Automation, PyZX},
      abstract = {Quantum computers allow a near-exponential speed-up for specific applications when compared to classical computers. Despite recent advances in the hardware of quantum computers, their practical usage is still severely limited due to a restricted number of available physical qubits and quantum gates, short coherence time, and high error rates. This paper lays the foundation towards a metric independent approach to quantum circuit optimization based on exhaustive search algorithms. This work uses depth-first search and iterative deepening depth-first search. We rely on ZX calculus to represent and optimize quantum circuits through the minimization of a given metric (e.g. the T-gate and edge count). ZX calculus formally guarantees that the semantics of the original circuit is preserved. As ZX calculus is a non-terminating rewriting system, we utilise a novel set of pruning rules to ensure termination while still obtaining high-quality solutions. We provide the first formalization of quantum circuit optimization using ZX calculus and exhaustive search. We extensively benchmark our approach on 100 standard quantum circuits. Finally, our implementation is integrated in the well-known libraries PyZX and Qiskit as a compiler pass to ensure applicability of our results.}
  }
  

  Copy to Clipboard

• Bridging wire and gate cutting with ZX-calculus
  Marco Schumann, Tobias Stollenwerk and Alessandro Ciani
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2503.11494
  Keywords: Classical Simulation, Optimisation, ZH-calculus.

  Quantum circuit cutting refers to a series of techniques that allow one to partition a quantum computation on a large quantum computer into several quantum computations on smaller devices. This usually comes at the price of a sampling overhead, that is quantified by the \(1\)-norm of the associated decomposition. The applicability of these techniques relies on the possibility of finding decompositions of the ideal, global unitaries into quantum operations that can be simulated onto each sub-register, which should ideally minimize the \(1\)-norm. In this work, we show how these decompositions can be obtained diagrammatically using ZX-calculus expanding on the work of Ufrecht et al. [arXiv:2302.00387]. The central idea of our work is that since in ZX-calculus only connectivity matters, it should be possible to cut wires in ZX-diagrams by inserting known decompositions of the identity in standard quantum circuits. We show how, using this basic idea, many of the gate decompositions known in the literature can be re-interpreted as an instance of wire cuts in ZX-diagrams. Furthermore, we obtain improved decompositions for multi-qubit controlled-Z (MCZ) gates with \(1\)-norm equal to \(3\) for any number of qubits and any partition, which we argue to be optimal. Our work gives new ways of thinking about circuit cutting that can be particularly valuable for finding decompositions of large unitary gates. Besides, it sheds light on the question of why exploiting classical communication decreases the 1-norm of a wire cut but does not do so for certain gate decompositions. In particular, using wire cuts with classical communication, we obtain gate decompositions that do not require classical communication.

  @article{schumann2025bridging,
      author = {Schumann, Marco and Stollenwerk, Tobias and Ciani, Alessandro},
      title = {{Bridging wire and gate cutting with ZX-calculus}},
      year = {2025},
      journal = {arXiv preprint arXiv:2503.11494},
      urldate = {2025-03-14},
      link = {http://arxiv.org/abs/2503.11494},
      keywords = {Classical Simulation, Optimisation, ZH-calculus},
      abstract = {Quantum circuit cutting refers to a series of techniques that allow one to partition a quantum computation on a large quantum computer into several quantum computations on smaller devices. This usually comes at the price of a sampling overhead, that is quantified by the $1$-norm of the associated decomposition. The applicability of these techniques relies on the possibility of finding decompositions of the ideal, global unitaries into quantum operations that can be simulated onto each sub-register, which should ideally minimize the $1$-norm. In this work, we show how these decompositions can be obtained diagrammatically using ZX-calculus expanding on the work of Ufrecht et al. [arXiv:2302.00387]. The central idea of our work is that since in ZX-calculus only connectivity matters, it should be possible to cut wires in ZX-diagrams by inserting known decompositions of the identity in standard quantum circuits. We show how, using this basic idea, many of the gate decompositions known in the literature can be re-interpreted as an instance of wire cuts in ZX-diagrams. Furthermore, we obtain improved decompositions for multi-qubit controlled-Z (MCZ) gates with $1$-norm equal to $3$ for any number of qubits and any partition, which we argue to be optimal. Our work gives new ways of thinking about circuit cutting that can be particularly valuable for finding decompositions of large unitary gates. Besides, it sheds light on the question of why exploiting classical communication decreases the 1-norm of a wire cut but does not do so for certain gate decompositions. In particular, using wire cuts with classical communication, we obtain gate decompositions that do not require classical communication.},
      video = {https://www.youtube.com/watch?v=TQYUq9xcvWM}
  }
  

  Copy to Clipboard

• Graphical Stabilizer Decompositions for Multi-Control Toffoli Gate Dense Quantum Circuits
  Yves Vollmeier
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2503.03798
  Keywords: Classical Simulation, Clifford+T, Toffoli, Automation.

  In this thesis, we study concepts in quantum computing using graphical languages, specifically using the ZX-calculus. The core of the research revolves around (graphical) stabilizer decompositions. The first major focus is on the decomposition of non-stabilizer states created from star edges. We discuss previous results and then present novel decompositions that yield a theoretical improvement. The second major focus is on weighting algorithms, applied to the special class of multi-control Toffoli gate dense quantum circuits. The representation of the corresponding gates is based on star edges. The applicability of known methods, such as CNOT-grouping, traditionally used for other classes, is examined in the context of this specific class. We then present a novel weighting algorithm that attempts to determine the best vertex to decompose. A refined version is implemented to simulate a known class of quantum querying algorithms, which is used to search for causal configurations of multiloop Feynman diagrams. For this case, as well as for a generalized benchmark consisting of randomly generated quantum circuits, we demonstrate occasional improvements in the final number of terms against traditional methods. These results are discussed by considering different simplification strategies. This thesis also provides a brief but broad outline of the important preliminaries.

  @article{vollmeier2025graphical,
      author = {Vollmeier, Yves},
      title = {{Graphical Stabilizer Decompositions for Multi-Control Toffoli Gate Dense Quantum Circuits}},
      year = {2025},
      journal = {arXiv preprint arXiv:2503.03798},
      urldate = {2025-03-05},
      link = {http://arxiv.org/abs/2503.03798},
      keywords = {Classical Simulation, Clifford+T, Toffoli, Automation},
      abstract = {In this thesis, we study concepts in quantum computing using graphical languages, specifically using the ZX-calculus. The core of the research revolves around (graphical) stabilizer decompositions. The first major focus is on the decomposition of non-stabilizer states created from star edges. We discuss previous results and then present novel decompositions that yield a theoretical improvement. The second major focus is on weighting algorithms, applied to the special class of multi-control Toffoli gate dense quantum circuits. The representation of the corresponding gates is based on star edges. The applicability of known methods, such as CNOT-grouping, traditionally used for other classes, is examined in the context of this specific class. We then present a novel weighting algorithm that attempts to determine the best vertex to decompose. A refined version is implemented to simulate a known class of quantum querying algorithms, which is used to search for causal configurations of multiloop Feynman diagrams. For this case, as well as for a generalized benchmark consisting of randomly generated quantum circuits, we demonstrate occasional improvements in the final number of terms against traditional methods. These results are discussed by considering different simplification strategies. This thesis also provides a brief but broad outline of the important preliminaries.}
  }
  

  Copy to Clipboard

• Unveiling a Hidden Percolation Transition in Monitored Clifford Circuits: Inroads from ZX-Calculus
  Einat Buznach, Debanjan Chowdhury and Jonathan Ruhman
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2502.13211
  Keywords: Entanglement, Classical Simulation, Automation, PyZX, Condensed Matter, ZX-calculus.

  We revisit the measurement-induced phase transition (MPT) in Clifford circuits, which are both classically simulable and exhibit critical behavior widely believed to be distinct from classical percolation theory, using ZX-calculus. We analyze the MPT in a dynamical model composed of CNOT, SWAP, identity gates, and Bell-pair measurements, respectively, arranged randomly in a brickwork pattern. Our circuits exhibit a transition that is seemingly distinct from classical percolation based on standard arguments, that is in line with the prevailing understanding in the field. In contrast, by employing ZX-calculus based simplification techniques, we unveil a hidden percolation transition within the circuit structure. Over a range of parameters tied to the probabilities for applying different gates, we demonstrate that the classical percolation transition in the ZX-simplified network coincides with the MPT observed through mutual information. Our findings suggest that the MPT in Clifford circuits is, in fact, controlled by a classical percolation transition in disguise.

  @article{buznach2025unveiling,
      author = {Buznach, Einat and Chowdhury, Debanjan and Ruhman, Jonathan},
      title = {{Unveiling a Hidden Percolation Transition in Monitored Clifford Circuits: Inroads from ZX-Calculus}},
      year = {2025},
      journal = {arXiv preprint arXiv:2502.13211},
      urldate = {2025-02-18},
      link = {http://arxiv.org/abs/2502.13211},
      keywords = {Entanglement, Classical Simulation, Automation, PyZX, Condensed Matter, ZX-calculus},
      abstract = {We revisit the measurement-induced phase transition (MPT) in Clifford circuits, which are both classically simulable and exhibit critical behavior widely believed to be distinct from classical percolation theory, using ZX-calculus. We analyze the MPT in a dynamical model composed of CNOT, SWAP, identity gates, and Bell-pair measurements, respectively, arranged randomly in a brickwork pattern. Our circuits exhibit a transition that is seemingly distinct from classical percolation based on standard arguments, that is in line with the prevailing understanding in the field. In contrast, by employing ZX-calculus based simplification techniques, we unveil a hidden percolation transition within the circuit structure. Over a range of parameters tied to the probabilities for applying different gates, we demonstrate that the classical percolation transition in the ZX-simplified network coincides with the MPT observed through mutual information. Our findings suggest that the MPT in Clifford circuits is, in fact, controlled by a classical percolation transition in disguise.}
  }
  

  Copy to Clipboard

• Diagrammatic Quantum Circuit Compression for Hamiltonian Simulation
  Victoria Wadewitz, Aaron Szasz, Daan Camps, Katherine Klymko and Tobias Stollenwerk
  Show abstract ⇲ Show bibdata ⇲

  Software Engineering 2025 – Companion Proceedings
  Keywords: Phase Gadgets, Chemistry, Applied, Optimisation, ZX-calculus.

  One of the promising applications for early quantum computers is the simulation of of dynamical quantum systems. Due to the limited coherence time of such devices, the depth-compression of quantum circuits is crucial to facilitate useful results. It has been shown that certain quantum models can even be compressed to constant depth, meaning it is only linearly dependent on the number of qubits, but independent of the simulation time and the number of Trotter steps. This has been done by extracting the circuit structure derived from the model characteristics via Hamiltonian simulation. Based on these results, we present a diagrammatic approach to circuit compression utilizing a powerful technique for reasoning about quantum circuits called ZX-calculus. We demonstrate our approach by deriving constant-depth circuit compressions for quantum models known to be constant-depth, as well as novel models previously unstudied. Our method could serve as a first step toward the development of more advanced circuit compression methods, that could be employed to enable Hamiltonian simulation of a larger variety of quantum models, and beyond.

  @inproceedings{Wadewitz2025Diagrammatic,
      author = {Wadewitz, Victoria and Szasz, Aaron and Camps, Daan and Klymko, Katherine and Stollenwerk, Tobias},
      title = {Diagrammatic Quantum Circuit Compression for Hamiltonian Simulation},
      year = {2025},
      booktitle = {Software Engineering 2025 – Companion Proceedings},
      publisher = {Gesellschaft für Informatik, Bonn},
      issn = {1617-5468},
      doi = {10.18420/se2025-ws-24},
      urldate = {2025-02-15},
      link = {https://dl.gi.de/items/55b8918c-cccd-4b39-9b57-889735ea1c31},
      keywords = {Phase Gadgets, Chemistry, Applied, Optimisation, ZX-calculus},
      abstract = {One of the promising applications for early quantum computers is the simulation of of dynamical quantum systems. Due to the limited coherence time of such devices, the depth-compression of quantum circuits is crucial to facilitate useful results. It has been shown that certain quantum models can even be compressed to constant depth, meaning it is only linearly dependent on the number of qubits, but independent of the simulation time and the number of Trotter steps. This has been done by extracting the circuit structure derived from the model characteristics via Hamiltonian simulation. Based on these results, we present a diagrammatic approach to circuit compression utilizing a powerful technique for reasoning about quantum circuits called ZX-calculus. We demonstrate our approach by deriving constant-depth circuit compressions for quantum models known to be constant-depth, as well as novel models previously unstudied. Our method could serve as a first step toward the development of more advanced circuit compression methods, that could be employed to enable Hamiltonian simulation of a larger variety of quantum models, and beyond.}
  }
  

  Copy to Clipboard

• Efficient Heuristics for Classical Simulation of Quantum Circuits Using ZX-Calculus
  Wira Azmoon Ahmad
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford Masters Thesis
  Keywords: Classical Simulation, Automation, PyZX, Clifford+T, ZX-calculus, Master Thesis.

  Quantum circuits require validation and testing to ensure that they perform as expected. Classical simulation is a powerful tool for this purpose, but it is limited by the exponential growth of complexity with the number of qubits. Nevertheless, using the ZX-calculus, a graphical language for quantum mechanics, we can attempt to reduce how exponential this growth is. Recent developments have allowed focus to be placed on complexity being dependent on the number of T-gates that are in the circuit. Given \(t\) T-gates, if the complexity of classically simulating the circuit is \(O(2\alpha t)\), the aim is to reduce the value of \(\alpha\) as much as possible, where \(0 < \alpha < 1\). This thesis presents a heuristic approach toward exploiting the structure of the ZX-diagrams used to represent the quantum circuits, in order to reduce \(\alpha\). We conceptualise a formal definition of the heuristic method, applying it to existing approaches, and also develop new heuristics that take advantage of the structure made available in the ZX-diagrams. These heuristics perform well in practice, boosting the number of T-gates that can be simulated classically by up to three times as many on certain classes of circuits

  @mastersthesis{Ahmad2025Masters,
      author = {Ahmad, Wira Azmoon},
      title = {{Efficient Heuristics for Classical Simulation of Quantum Circuits Using ZX-Calculus}},
      year = {2025},
      school = {University of Oxford},
      urldate = {2025-02-10},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/ahmad-thesis.pdf},
      keywords = {Classical Simulation, Automation, PyZX, Clifford+T, ZX-calculus, Master Thesis},
      abstract = {Quantum circuits require validation and testing to ensure that they perform as expected. Classical simulation is a powerful tool for this purpose, but it is limited by the exponential growth of complexity with the number of qubits. Nevertheless, using the ZX-calculus, a graphical language for quantum mechanics, we can attempt to reduce how exponential this growth is. Recent developments have allowed focus to be placed on complexity being dependent on the number of T-gates that are in the circuit. Given $t$ T-gates, if the complexity of classically simulating the circuit is $O(2\alpha t)$, the aim is to reduce the value of $\alpha$ as much as possible, where $0 < \alpha < 1$. This thesis presents a heuristic approach toward exploiting the structure of the ZX-diagrams used to represent the quantum circuits, in order to reduce $\alpha$. We conceptualise a formal definition of the heuristic method, applying it to existing approaches, and also develop new heuristics that take advantage of the structure made available in the ZX-diagrams. These heuristics perform well in practice, boosting the number of T-gates that can be simulated classically by up to three times as many on certain classes of circuits}
  }
  

  Copy to Clipboard

• Quantum Computing from Graphs
  Andrey Boris Khesin
  Show abstract ⇲ Show bibdata ⇲

  Massachusetts Institute Of Technology PhD Thesis
  Keywords: ZX-calculus, Error Correcting Codes, Clifford Fragment, PhD Thesis.

  While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer codes as graphs with certain structures. Specifically, the graphs take a semi-bipartite form where input nodes map to output nodes, such that output nodes may connect to each other but input nodes may not. Intuitively, the graph's input-output edges represent information propagation of the encoder, while output-output edges represent the code's entanglement. We prove that this graph representation is in bijection with tableaus and give an efficient compilation algorithm that transforms tableaus into graphs. We show that this map is efficiently invertible, which gives a universal recipe for code construction by finding graphs with nice properties. The graph representation gives insight into both code construction and algorithms. To the former, we argue that graphs provide a flexible platform for building codes. We construct several constant-size codes and several infinite code families. We also use graphs to extend the quantum Gilbert-Varshamov bound to a three-way distance-rate-weight trade-off. To the latter, we show that key coding algorithms, distance approximation, weight reduction, and decoding, are unified as instances of a single optimization game on a graph. Moreover, key code properties such as distance, weight, and encoding circuit depth, are all controlled by the graph degree. We give efficient algorithms for producing encoding circuits whose depths scale with the degree and for implementing certain logical diagonal and Clifford gates with reduced depth. Finally, we find an efficient decoding algorithm for certain classes of graphs. These results give evidence that graphs are useful for the study of quantum computing and its implementations.

  @phdthesis{Khesin2025thesis,
      author = {Khesin, Andrey Boris},
      title = {{Quantum Computing from Graphs}},
      year = {2025},
      school = {Massachusetts Institute Of Technology},
      urldate = {2025-02-01},
      link = {https://arxiv.org/abs/2501.17959},
      keywords = {ZX-calculus, Error Correcting Codes, Clifford Fragment, PhD Thesis},
      abstract = {While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer codes as graphs with certain structures. Specifically, the graphs take a semi-bipartite form where input nodes map to output nodes, such that output nodes may connect to each other but input nodes may not. Intuitively, the graph's input-output edges represent information propagation of the encoder, while output-output edges represent the code's entanglement. We prove that this graph representation is in bijection with tableaus and give an efficient compilation algorithm that transforms tableaus into graphs. We show that this map is efficiently invertible, which gives a universal recipe for code construction by finding graphs with nice properties. The graph representation gives insight into both code construction and algorithms. To the former, we argue that graphs provide a flexible platform for building codes. We construct several constant-size codes and several infinite code families. We also use graphs to extend the quantum Gilbert-Varshamov bound to a three-way distance-rate-weight trade-off. To the latter, we show that key coding algorithms, distance approximation, weight reduction, and decoding, are unified as instances of a single optimization game on a graph. Moreover, key code properties such as distance, weight, and encoding circuit depth, are all controlled by the graph degree. We give efficient algorithms for producing encoding circuits whose depths scale with the degree and for implementing certain logical diagonal and Clifford gates with reduced depth. Finally, we find an efficient decoding algorithm for certain classes of graphs. These results give evidence that graphs are useful for the study of quantum computing and its implementations.}
  }
  

  Copy to Clipboard

• Pauli web of the $|Yångle$ state surface code injection
  Kwok Ho Wan and Zhenghao Zhong
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2501.15566
  Keywords: Surface Code, Error Correcting Codes, ZX-calculus.

  We employ ZX-calculus and Pauli web to understand the \(|Y\rangle\) state injection on the rotated surface code.

  @article{howan2025pauli,
      author = {Ho Wan, Kwok and Zhong, Zhenghao},
      title = {{Pauli web of the $|Y\rangle$ state surface code injection}},
      year = {2025},
      journal = {arXiv preprint arXiv:2501.15566},
      urldate = {2025-01-26},
      link = {http://arxiv.org/abs/2501.15566},
      keywords = {Surface Code, Error Correcting Codes, ZX-calculus},
      abstract = {We employ ZX-calculus and Pauli web to understand the $|Y\rangle$ state injection on the rotated surface code.}
  }
  

  Copy to Clipboard

2024

• Dynamic T-decomposition for classical simulation of quantum circuits
  Wira Azmoon Ahmad and Matthew Sutcliffe
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2412.17182
  Keywords: Classical Simulation, PyZX, Applied, Automation, Clifford+T.

  It is known that a quantum circuit may be simulated with classical hardware via stabilizer state (T-)decomposition in \(O(2^{\alpha t})\) time, given \(t\) non-Clifford gates and a decomposition efficiency \(\alpha\). The past years have seen a number of papers presenting new decompositions of lower \(\alpha\) to reduce this runtime and enable simulation of ever larger circuits. More recently, it has been demonstrated that well placed applications of apparently weaker (higher \(\alpha\)) decompositions can in fact result in better overall efficiency when paired with the circuit simplification strategies of ZX-calculus. In this work, we take the most generalized T-decomposition (namely vertex cutting), which achieves a poor efficiency of \(\alpha=1\), and identify common structures to which applying this can, after simplification via ZX-calculus rewriting, yield very strong effective efficiencies \(\alpha_{\text{eff}}\ll1\). By taking into account this broader scope of the ZX-diagram and incorporating the simplification facilitated by the well-motivated cuts, we derive a handful of efficient T-decompositions whose applicabilities are relatively frequent. In benchmarking these new 'dynamic' decompositions against the existing alternatives, we observe a significant reduction in overall \(\alpha\) and hence overall runtime for classical simulation, particularly for certain common circuit classes.

  @article{azmoonahmad2024dynamic,
      author = {Azmoon Ahmad, Wira and Sutcliffe, Matthew},
      title = {{Dynamic T-decomposition for classical simulation of quantum circuits}},
      year = {2024},
      journal = {arXiv preprint arXiv:2412.17182},
      urldate = {2024-12-22},
      link = {http://arxiv.org/abs/2412.17182},
      keywords = {Classical Simulation, PyZX, Applied, Automation, Clifford+T},
      abstract = {It is known that a quantum circuit may be simulated with classical hardware via stabilizer state (T-)decomposition in $O(2^{\alpha t})$ time, given $t$ non-Clifford gates and a decomposition efficiency $\alpha$. The past years have seen a number of papers presenting new decompositions of lower $\alpha$ to reduce this runtime and enable simulation of ever larger circuits. More recently, it has been demonstrated that well placed applications of apparently weaker (higher $\alpha$) decompositions can in fact result in better overall efficiency when paired with the circuit simplification strategies of ZX-calculus.   In this work, we take the most generalized T-decomposition (namely vertex cutting), which achieves a poor efficiency of $\alpha=1$, and identify common structures to which applying this can, after simplification via ZX-calculus rewriting, yield very strong effective efficiencies $\alpha_{\text{eff}}\ll1$. By taking into account this broader scope of the ZX-diagram and incorporating the simplification facilitated by the well-motivated cuts, we derive a handful of efficient T-decompositions whose applicabilities are relatively frequent. In benchmarking these new 'dynamic' decompositions against the existing alternatives, we observe a significant reduction in overall $\alpha$ and hence overall runtime for classical simulation, particularly for certain common circuit classes.},
      video = {https://www.youtube.com/watch?v=m-UVX_eO2BU}
  }
  

  Copy to Clipboard

• A Constant Measurement Quantum Algorithm for Graph Connectivity
  Maximilian Balthasar Mansky, Chonfai Kam and Claudia Linnhoff-Popien
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2411.15015
  Keywords: Protocols, Applied, MBQC, ZX-calculus.

  We introduce a novel quantum algorithm for determining graph connectedness using a constant number of measurements. The algorithm can be extended to find connected components with a linear number of measurements. It relies on non-unitary abelian gates taken from ZX calculus. Due to the fusion rule, the two-qubit gates correspond to a large single action on the qubits. The algorithm is general and can handle any undirected graph, including those with repeated edges and self-loops. The depth of the algorithm is variable, depending on the graph, and we derive upper and lower bounds. The algorithm exhibits a state decay that can be remedied with ancilla qubits. We provide a numerical simulation of the algorithm.

  @article{balthasarmansky2024constant,
      author = {Balthasar Mansky, Maximilian and Kam, Chonfai and Linnhoff-Popien, Claudia},
      title = {{A Constant Measurement Quantum Algorithm for Graph Connectivity}},
      year = {2024},
      journal = {arXiv preprint arXiv:2411.15015},
      urldate = {2024-11-22},
      link = {http://arxiv.org/abs/2411.15015},
      keywords = {Protocols, Applied, MBQC, ZX-calculus},
      abstract = {We introduce a novel quantum algorithm for determining graph connectedness using a constant number of measurements. The algorithm can be extended to find connected components with a linear number of measurements. It relies on non-unitary abelian gates taken from ZX calculus. Due to the fusion rule, the two-qubit gates correspond to a large single action on the qubits. The algorithm is general and can handle any undirected graph, including those with repeated edges and self-loops. The depth of the algorithm is variable, depending on the graph, and we derive upper and lower bounds. The algorithm exhibits a state decay that can be remedied with ancilla qubits. We provide a numerical simulation of the algorithm.}
  }
  

  Copy to Clipboard

• Universal graph representation of stabilizer codes
  Andrey Boris Khesin, Jonathan Z. Lu and Peter W. Shor
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2411.14448
  Keywords: Error Correcting Codes, Clifford Fragment, ZX-calculus.

  We introduce a representation of \([[n, k]]\) stabilizer codes as graphs with certain structures. Specifically, the graphs take a semi-bipartite form wherein \(k\) "input" nodes map to \(n\) "output" nodes, such that output nodes may connect to each other but input nodes may not. We prove by passage through the ZX Calculus that this graph representation is in bijection with tableaus and give an efficient compilation algorithm that transforms tableaus into graphs. We then show that this map is efficiently invertible, which gives a new universal recipe for code construction by way of finding graphs with sufficiently nice properties. The graph representation gives insight into both code construction and algorithms. To the former, we argue that graphs provide a flexible platform for building codes particularly at small scales. We construct as examples constant-size codes, e.g. a \([[54, 6, 5]]\) code and families of \([[n, \Theta(\frac{n}{\log n}), \Theta(\log n)]]\) and \([[n, \Omega(n^{3/5}), \Theta(n^{1/5}) ]]\) codes. We also leverage graphs in a probabilistic analysis to extend the quantum Gilbert-Varshamov bound into a three-way distance-rate-weight trade-off. To the latter, we show that key coding algorithms -- distance approximation, weight reduction, and decoding -- are unified as instances of a single optimization game on a graph. Moreover, key code properties such as distance, weight, and encoding circuit depth, are all controlled by the graph degree. Finally, we construct a simple efficient decoding algorithm and prove a performance guarantee for a certain class of graphs, including the above two families. This class contains all graphs of girth at least 9, building a bridge between stabilizer codes and extremal graph theory. These results give evidence that graphs are generically useful for the study of stabilizer codes and their practical implementations.

  @article{boriskhesin2024universal,
      author = {Boris Khesin, Andrey and Z. Lu, Jonathan and W. Shor, Peter},
      title = {{Universal graph representation of stabilizer codes}},
      year = {2024},
      journal = {arXiv preprint arXiv:2411.14448},
      urldate = {2024-11-07},
      link = {http://arxiv.org/abs/2411.14448},
      keywords = {Error Correcting Codes, Clifford Fragment, ZX-calculus},
      abstract = {We introduce a representation of $[[n, k]]$ stabilizer codes as graphs with certain structures. Specifically, the graphs take a semi-bipartite form wherein $k$ "input" nodes map to $n$ "output" nodes, such that output nodes may connect to each other but input nodes may not. We prove by passage through the ZX Calculus that this graph representation is in bijection with tableaus and give an efficient compilation algorithm that transforms tableaus into graphs. We then show that this map is efficiently invertible, which gives a new universal recipe for code construction by way of finding graphs with sufficiently nice properties. The graph representation gives insight into both code construction and algorithms. To the former, we argue that graphs provide a flexible platform for building codes particularly at small scales. We construct as examples constant-size codes, e.g. a $[[54, 6, 5]]$ code and families of $[[n, \Theta(\frac{n}{\log n}), \Theta(\log n)]]$ and $[[n, \Omega(n^{3/5}), \Theta(n^{1/5}) ]]$ codes. We also leverage graphs in a probabilistic analysis to extend the quantum Gilbert-Varshamov bound into a three-way distance-rate-weight trade-off. To the latter, we show that key coding algorithms -- distance approximation, weight reduction, and decoding -- are unified as instances of a single optimization game on a graph. Moreover, key code properties such as distance, weight, and encoding circuit depth, are all controlled by the graph degree. Finally, we construct a simple efficient decoding algorithm and prove a performance guarantee for a certain class of graphs, including the above two families. This class contains all graphs of girth at least 9, building a bridge between stabilizer codes and extremal graph theory. These results give evidence that graphs are generically useful for the study of stabilizer codes and their practical implementations.},
      video = {https://www.youtube.com/watch?v=H4OeqkILalg}
  }
  

  Copy to Clipboard

• Towards Faster Quantum Circuit Simulation Using Graph Decompositions, GNNs and Reinforcement Learning
  Alex Koziell-Pipe, Richie Yeung and Matthew Sutcliffe
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  38th Conference on Neural Information Processing Systems (NeurIPS 2024)
  Keywords: Classical Simulation, Automation, PyZX, Applied, ZX-Calculus, Clifford+T.

  In this work, we train a graph neural network with reinforcement learning to more efficiently simulate quantum circuits using the ZX-calculus. Our experiments show a marked improvement in simulation efficiency using the trained model over existing methods that do not incorporate AI. In this way, we demonstrate a machine learning model that can reason effectively within a mathematical framework such that it enhances scientific research in the important domain of quantum computing.

  @inproceedings{KoziellPipe2024Simulation,
      author = {Koziell-Pipe, Alex and Yeung, Richie and Sutcliffe, Matthew},
      title = {{Towards Faster Quantum Circuit Simulation Using Graph Decompositions, GNNs and Reinforcement Learning}},
      year = {2024},
      booktitle = {38th Conference on Neural Information Processing Systems (NeurIPS 2024)},
      urldate = {2024-11-02},
      link = {https://openreview.net/pdf?id=54060pbCKY},
      keywords = {Classical Simulation, Automation, PyZX, Applied, ZX-Calculus, Clifford+T},
      abstract = {In this work, we train a graph neural network with reinforcement learning to more efficiently simulate quantum circuits using the ZX-calculus. Our experiments show a marked improvement in simulation efficiency using the trained model over existing methods that do not incorporate AI. In this way, we demonstrate a machine learning model that can reason effectively within a mathematical framework such that it enhances scientific research in the important domain of quantum computing.},
      video = {https://www.youtube.com/watch?v=fTN_AiLbepg}
  }
  

  Copy to Clipboard

• Floquetifying stabiliser codes with distance-preserving rewrites
  Benjamin Rodatz, Boldizsár Poór and Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2410.17240
  Keywords: Error Correcting Codes, Floquet Codes, Clifford Fragment, Applied.

  The ZX calculus is a graphical language for representing and rewriting quantum circuits. While its graphical rewrite rules preserve semantics, they may not preserve other features. For example, applying rewrites to a circuit that implements an error-correcting code can change its distance. Here, we define the notion of distance-preserving rewrites that enables the transformation of error-correcting codes without changing their distance. Using these rewrites, we propose an algorithm that transforms a high-weight Pauli measurement into an equivalent quantum circuit with only single- and two-qubit operations. Since we only use distance-preserving rewrites, we guarantee that errors in the low-weight implementation do not propagate to create multiple data errors. Going further, we generalise the Floquetification procedure of [arXiv:2308.15489] to arbitrary stabiliser codes. Given a stabiliser code, we synthesise a new quantum error-correcting code which encodes the same number of qubits with at least the same distance. The number of additional qubits this method requires is linearly dependent on the weight or the largest Pauli measurement. This creates a tradeoff between easily implementable low-weight Pauli measurements at the cost of additional physical qubits.

  @article{rodatz2024floquetifying,
      author = {Rodatz, Benjamin and Po{\'o}r, Boldizs{\'a}r and Kissinger, Aleks},
      title = {{Floquetifying stabiliser codes with distance-preserving rewrites}},
      year = {2024},
      journal = {arXiv preprint arXiv:2410.17240},
      urldate = {2024-10-22},
      link = {http://arxiv.org/abs/2410.17240},
      keywords = {Error Correcting Codes, Floquet Codes, Clifford Fragment, Applied},
      abstract = {The ZX calculus is a graphical language for representing and rewriting quantum circuits. While its graphical rewrite rules preserve semantics, they may not preserve other features. For example, applying rewrites to a circuit that implements an error-correcting code can change its distance. Here, we define the notion of distance-preserving rewrites that enables the transformation of error-correcting codes without changing their distance. Using these rewrites, we propose an algorithm that transforms a high-weight Pauli measurement into an equivalent quantum circuit with only single- and two-qubit operations. Since we only use distance-preserving rewrites, we guarantee that errors in the low-weight implementation do not propagate to create multiple data errors. Going further, we generalise the Floquetification procedure of [arXiv:2308.15489] to arbitrary stabiliser codes. Given a stabiliser code, we synthesise a new quantum error-correcting code which encodes the same number of qubits with at least the same distance. The number of additional qubits this method requires is linearly dependent on the weight or the largest Pauli measurement. This creates a tradeoff between easily implementable low-weight Pauli measurements at the cost of additional physical qubits.},
      video = {https://www.youtube.com/watch?v=KrPsjIFx_Y8}
  }
  

  Copy to Clipboard

• Dynamical weight reduction of Pauli measurements
  Julio C. Magdalena de la Fuente
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2410.12527
  Keywords: MBQC, Phase gadgets, Floquet Codes, Optimisation, Applied.

  Many routines that one might want to run on a quantum computer can benefit from adaptive circuits, relying on mid-circuit measurements and feed-forward operations. Any such measurement has to be compiled into a sequence of elementary gates involving only a small number of qubits. In this work, we formalize dynamical weight reduction (DWR) schemes in which a high-weight Pauli measurement is decomposed into a sequence of measurements of smaller weight at the cost of adding additional auxiliary qubits. We first present our main method, deforming a ZX diagram that represents the measurement we want to compile. We then construct a general recipe that constructs a DWR on a given connectivity whenever the underlying connectivity graph fulfills certain necessary conditions. Further, we construct a family of DWR schemes using a given number of auxiliary qubits with indications that the schemes we present are optimal in terms of spacetime resource overheads needed for a DWR. We highlight three examples that achieve a constant time or a constant space overhead, respectively. Finally, we discuss different trade-offs of space and time overhead and how they might be chosen differently on different levels of abstraction within a (fault-tolerant) quantum computation. This work showcases the flexibility in compiling a measurement circuit in terms of lower-weight measurements using deformations of ZX diagrams and can find applications in quantum error correction, quantum simulation as well as near-term quantum computing tasks where the quality of a computation highly depends on the physical implementation of a given logical operation.

  @article{c.magdalenadelafuente2024dynamical,
      author = {C. Magdalena de la Fuente, Julio},
      title = {{Dynamical weight reduction of Pauli measurements}},
      year = {2024},
      journal = {arXiv preprint arXiv:2410.12527},
      urldate = {2024-10-16},
      link = {http://arxiv.org/abs/2410.12527},
      keywords = {MBQC, Phase gadgets, Floquet Codes, Optimisation, Applied},
      abstract = {Many routines that one might want to run on a quantum computer can benefit from adaptive circuits, relying on mid-circuit measurements and feed-forward operations. Any such measurement has to be compiled into a sequence of elementary gates involving only a small number of qubits. In this work, we formalize dynamical weight reduction (DWR) schemes in which a high-weight Pauli measurement is decomposed into a sequence of measurements of smaller weight at the cost of adding additional auxiliary qubits. We first present our main method, deforming a ZX diagram that represents the measurement we want to compile. We then construct a general recipe that constructs a DWR on a given connectivity whenever the underlying connectivity graph fulfills certain necessary conditions. Further, we construct a family of DWR schemes using a given number of auxiliary qubits with indications that the schemes we present are optimal in terms of spacetime resource overheads needed for a DWR. We highlight three examples that achieve a constant time or a constant space overhead, respectively. Finally, we discuss different trade-offs of space and time overhead and how they might be chosen differently on different levels of abstraction within a (fault-tolerant) quantum computation. This work showcases the flexibility in compiling a measurement circuit in terms of lower-weight measurements using deformations of ZX diagrams and can find applications in quantum error correction, quantum simulation as well as near-term quantum computing tasks where the quality of a computation highly depends on the physical implementation of a given logical operation.},
      video = {https://www.youtube.com/watch?v=F9TCCpZ76RA}
  }
  

  Copy to Clipboard

• Generalized flow for hypergraph measurement patterns
  Martin van IJcken
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford Masters Thesis
  Keywords: MBQC, gflow, ZH-calculus, Master Thesis.

  This dissertation explores the development of an analogue to generalized flow (gflow) for hypergraph measurement patterns using the ZH-calculus framework. The ZH-calculus, extends the ZX-calculus by efficiently describing Toffoli gates and multi-controlled Z gates. While the ZX-calculus and its gflow conditions are well-understood for graph states, no such analogue exists for hypergraphs. This dissertation establishes a necessary and sufficient condition for hypergraph measurement patterns to be deterministic. The new gflow criteria, analogous to those in graphs but adapted for hypergraphs, ensure that corrections are available for potential undesired measurements that may occur during execution of a measurement pattern.

  @mastersthesis{IJcken2024Masters,
      author = {IJcken, Martin van},
      title = {{Generalized flow for hypergraph measurement patterns}},
      year = {2024},
      school = {University of Oxford},
      urldate = {2024-10-12},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/vanijcken-thesis.pdf},
      keywords = {MBQC, gflow, ZH-calculus, Master Thesis},
      abstract = {This dissertation explores the development of an analogue to generalized flow (gflow) for hypergraph measurement patterns using the ZH-calculus framework. The ZH-calculus, extends the ZX-calculus by efficiently describing Toffoli gates and multi-controlled Z gates. While the ZX-calculus and its gflow conditions are well-understood for graph states, no such analogue exists for hypergraphs. This dissertation establishes a necessary and sufficient condition for hypergraph measurement patterns to be deterministic. The new gflow criteria, analogous to those in graphs but adapted for hypergraphs, ensure that corrections are available for potential undesired measurements that may occur during execution of a measurement pattern.}
  }
  

  Copy to Clipboard

• Categorical quantum theory and percolation methods for measurement-based quantum computing
  Joe Bacchus George
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  University of Oxford Masters Thesis
  Keywords: MBQC, Pauli Fusion, Photons, ZX-calculus, Master Thesis.

  This dissertation explores the development of an analogue to generalized flow (gflow) for hypergraph measurement patterns using the ZH-calculus framework. The ZH-calculus, extends the ZX-calculus by efficiently describing Toffoli gates and multi-controlled Z gates. While the ZX-calculus and its gflow conditions are well-understood for graph states, no such analogue exists for hypergraphs. This dissertation establishes a necessary and sufficient condition for hypergraph measurement patterns to be deterministic. The new gflow criteria, analogous to those in graphs but adapted for hypergraphs, ensure that corrections are available for potential undesired measurements that may occur during execution of a measurement pattern.

  @mastersthesis{George2024Masters,
      author = {George, Joe Bacchus},
      title = {{Categorical quantum theory and percolation methods for measurement-based quantum computing}},
      year = {2024},
      school = {University of Oxford},
      urldate = {2024-10-12},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/george-thesis.pdf},
      keywords = {MBQC, Pauli Fusion, Photons, ZX-calculus, Master Thesis},
      abstract = {This dissertation explores the development of an analogue to generalized flow (gflow) for hypergraph measurement patterns using the ZH-calculus framework. The ZH-calculus, extends the ZX-calculus by efficiently describing Toffoli gates and multi-controlled Z gates. While the ZX-calculus and its gflow conditions are well-understood for graph states, no such analogue exists for hypergraphs. This dissertation establishes a necessary and sufficient condition for hypergraph measurement patterns to be deterministic. The new gflow criteria, analogous to those in graphs but adapted for hypergraphs, ensure that corrections are available for potential undesired measurements that may occur during execution of a measurement pattern.},
      video = {https://www.youtube.com/watch?v=g-_h0nBQ7rQ}
  }
  

  Copy to Clipboard

• Fusion and flow: formal protocols to reliably build photonic graph states
  Giovanni de Felice, Boldizsár Poór, Lia Yeh and William Cashman
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2409.13541
  Keywords: Photons, Pauli Fusion, MBQC, gflow, Protocols.

  Photonics offers a promising platform for implementations of measurement-based quantum computing. Recently proposed fusion-based architectures aim to achieve universality and fault-tolerance. In these approaches, computation is carried out by performing fusion and single-qubit measurements on a resource graph state. The verification of these architectures requires linear algebraic, probabilistic, and control flow structures to be combined in a unified formal language. This paper develops a framework for photonic quantum computing by bringing together linear optics, ZX calculus, and dataflow programming. We characterize fusion measurements that induce Pauli errors and show that they are correctable using a novel flow structure for fusion networks. We prove the correctness of new repeat-until-success protocols for the realization of arbitrary fusions and provide a graph-theoretic proof of universality for linear optics with entangled photon sources. The proposed framework paves the way for the development of compilation algorithms for photonic quantum computing.

  @article{defelice2024fusion,
      author = {de Felice, Giovanni and Po{\'o}r, Boldizs{\'a}r and Yeh, Lia and Cashman, William},
      title = {{Fusion and flow: formal protocols to reliably build photonic graph states}},
      year = {2024},
      journal = {arXiv preprint arXiv:2409.13541},
      urldate = {2024-09-20},
      link = {http://arxiv.org/abs/2409.13541},
      keywords = {Photons, Pauli Fusion, MBQC, gflow, Protocols},
      abstract = {Photonics offers a promising platform for implementations of measurement-based quantum computing. Recently proposed fusion-based architectures aim to achieve universality and fault-tolerance. In these approaches, computation is carried out by performing fusion and single-qubit measurements on a resource graph state. The verification of these architectures requires linear algebraic, probabilistic, and control flow structures to be combined in a unified formal language. This paper develops a framework for photonic quantum computing by bringing together linear optics, ZX calculus, and dataflow programming. We characterize fusion measurements that induce Pauli errors and show that they are correctable using a novel flow structure for fusion networks. We prove the correctness of new repeat-until-success protocols for the realization of arbitrary fusions and provide a graph-theoretic proof of universality for linear optics with entangled photon sources. The proposed framework paves the way for the development of compilation algorithms for photonic quantum computing.},
      video = {https://www.youtube.com/watch?v=riAQLbto8Ho}
  }
  

  Copy to Clipboard

• Parallel Quantum Circuit Extraction from MBQC-Patterns
  Marcel Quanz, Korbinian Staudacher and Karl Fürlinger
  Show abstract ⇲ Show bibdata ⇲

  2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
  Keywords: MBQC, ZX-calculus, Circuit Extraction, Applied.

  In the model of measurement-based quantum computing (MBQC), computations are performed via sequential measurements on a highly entangled graph state. MBQC is a natural model for photonic quantum computing and has been shown to be useful for tasks like optimization and verification of general quantum computations. Therefore, it is often necessary to translate between MBQC and the predominantly used quantum circuit model in a fast and reliable way. While there are algorithms with linear complexity to extract quantum circuits from measurement patterns using additional ancilla qubits, efficient ancilla-free extraction has shown to be more costly. We develop strategies to parallelize an existing extraction algorithm based on ZX-calculus by exploiting the graph structure of measurement patterns and evaluate the performance on patterns obtained from a benchmark set of quantum circuits. Our results suggest that possible parallelization speedups are closely related to the graph structure of a pattern.

  @inproceedings{Quanz2024Parallel,
      author = {Quanz, Marcel and Staudacher, Korbinian and Fürlinger, Karl},
      title = {Parallel Quantum Circuit Extraction from MBQC-Patterns},
      year = {2024},
      booktitle = {2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)},
      volume = {},
      number = {},
      pages = {1078-1087},
      doi = {10.1109/IPDPSW63119.2024.00179},
      urldate = {2024-09-15},
      link = {https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=10596505&casa_token=IvO5I8HAAmsAAAAA:s1XrQZcpF079508i5_tYXIbnybpxOWLWMuGULR-iMG0gI6LUZh9bw2OHBsaAOUYTySpqIi-jHwo&tag=1},
      keywords = {MBQC, ZX-calculus, Circuit Extraction, Applied},
      abstract = {In the model of measurement-based quantum computing (MBQC), computations are performed via sequential measurements on a highly entangled graph state. MBQC is a natural model for photonic quantum computing and has been shown to be useful for tasks like optimization and verification of general quantum computations. Therefore, it is often necessary to translate between MBQC and the predominantly used quantum circuit model in a fast and reliable way. While there are algorithms with linear complexity to extract quantum circuits from measurement patterns using additional ancilla qubits, efficient ancilla-free extraction has shown to be more costly. We develop strategies to parallelize an existing extraction algorithm based on ZX-calculus by exploiting the graph structure of measurement patterns and evaluate the performance on patterns obtained from a benchmark set of quantum circuits. Our results suggest that possible parallelization speedups are closely related to the graph structure of a pattern.}
  }
  

  Copy to Clipboard

• Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation
  Matthew Sutcliffe
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2409.00828
  Keywords: Classical Simulation, Automation, PyZX, Applied, ZX-Calculus, Clifford+T.

  We introduce a novel method for strong classical simulation of quantum circuits based on optimally k-partitioning ZX-diagrams, reducing each part individually, and then efficiently cross-referencing their results to conclude the overall probability amplitude of the original circuit. We then analyse how this method fares against the alternatives for circuits of various size, shape, and interconnectedness and demonstrate how it is often liable to outperform those alternatives in speed by orders of magnitude.

  @article{sutcliffe2024smarter,
      author = {Sutcliffe, Matthew},
      title = {{Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation}},
      year = {2024},
      journal = {arXiv preprint arXiv:2409.00828},
      urldate = {2024-09-01},
      link = {http://arxiv.org/abs/2409.00828},
      keywords = {Classical Simulation, Automation, PyZX, Applied, ZX-Calculus, Clifford+T},
      abstract = {We introduce a novel method for strong classical simulation of quantum circuits based on optimally k-partitioning ZX-diagrams, reducing each part individually, and then efficiently cross-referencing their results to conclude the overall probability amplitude of the original circuit. We then analyse how this method fares against the alternatives for circuits of various size, shape, and interconnectedness and demonstrate how it is often liable to outperform those alternatives in speed by orders of magnitude.},
      video = {https://www.youtube.com/watch?v=kQoT2PXct-Y}
  }
  

  Copy to Clipboard

• Magic of the Heisenberg Picture
  Neil Dowling, Pavel Kos and Xhek Turkeshi
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2408.16047
  Keywords: Entanglement, Condensed Matter, Classical Simulation, ZX-calculus, Applied.

  Magic quantifies the non-Clifford operations required for preparing a state on quantum processors and sets bounds on the classical computational complexity of simulating quantum dynamics. We study a magic resource theory for operators, which is dual to that describing states. We identify that the stabilizer R\'enyi entropy analog in operator space is a good magic monotone satisfying the usual conditions, while inheriting efficient computability properties and providing a tight lower-bound to the minimum number of non-Clifford gates in a circuit. It is operationally well-defined as quantifying how well one can approximate an operator with one that has only few Pauli strings; analogous to the relation between entanglement entropy and tensor-network truncation. An immediate advantage is that the operator stabilizer entropies exhibit inherent locality through a Lieb-Robinson bound, making them particularly suited for studying local dynamic magic generation in many-body systems. We compute this quantity analytically in two distinct regimes. First, we show that random evolution or circuits typically have approximately maximal magic in the Heisenberg picture for all R\'enyi indices, and evaluate the Page correction. Second, harnessing both dual unitarity and ZX graphical calculus, we compute the operator stabilizer entropy evolution for an interacting integrable XXZ circuit. In this case, magic quickly saturates to a constant; a distinct Heisenberg picture phenomena and suggestive of a connection to integrability. We argue that this efficiently computable operator magic monotone reveals structural properties of many-body magic generation, and can inspire novel Clifford-assisted tensor network methods.

  @article{dowling2024magic,
      author = {Dowling, Neil and Kos, Pavel and Turkeshi, Xhek},
      title = {{Magic of the Heisenberg Picture}},
      year = {2024},
      journal = {arXiv preprint arXiv:2408.16047},
      urldate = {2024-08-28},
      link = {http://arxiv.org/abs/2408.16047},
      keywords = {Entanglement, Condensed Matter, Classical Simulation, ZX-calculus, Applied},
      abstract = {Magic quantifies the non-Clifford operations required for preparing a state on quantum processors and sets bounds on the classical computational complexity of simulating quantum dynamics. We study a magic resource theory for operators, which is dual to that describing states. We identify that the stabilizer R\'enyi entropy analog in operator space is a good magic monotone satisfying the usual conditions, while inheriting efficient computability properties and providing a tight lower-bound to the minimum number of non-Clifford gates in a circuit. It is operationally well-defined as quantifying how well one can approximate an operator with one that has only few Pauli strings; analogous to the relation between entanglement entropy and tensor-network truncation. An immediate advantage is that the operator stabilizer entropies exhibit inherent locality through a Lieb-Robinson bound, making them particularly suited for studying local dynamic magic generation in many-body systems. We compute this quantity analytically in two distinct regimes. First, we show that random evolution or circuits typically have approximately maximal magic in the Heisenberg picture for all R\'enyi indices, and evaluate the Page correction. Second, harnessing both dual unitarity and ZX graphical calculus, we compute the operator stabilizer entropy evolution for an interacting integrable XXZ circuit. In this case, magic quickly saturates to a constant; a distinct Heisenberg picture phenomena and suggestive of a connection to integrability. We argue that this efficiently computable operator magic monotone reveals structural properties of many-body magic generation, and can inspire novel Clifford-assisted tensor network methods.},
      video = {https://www.youtube.com/watch?v=gh50B8LKEpE}
  }
  

  Copy to Clipboard

• Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling
  Qunsheng Huang, David Winderl, Arianne Meijer-van de Griend and Richie Yeung
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  2024 IEEE International Conference on Quantum Computing and Engineering (QCE)
  Keywords: ZX-Supported, Optimisation, Automation.

  In quantum computing, the efficient optimization of Pauli string decompositions is a crucial aspect for the compilation of quantum circuits for many applications, such as chemistry simulations and quantum machine learning. In this paper, we propose a novel algorithm for the synthesis of trotterized time-evolution operators that results in circuits with significantly fewer gates than previous solutions. Our synthesis procedure takes the qubit connectivity of a target quantum computer into account. As a result, the generated quantum circuit does not require routing, and no additional CNOT gates are needed to run the resulting circuit on a target device. We compare our algorithm against Paulihedral and TKET, and show a significant improvement for randomized circuits and different molecular ansatzes. We also investigate the Trotter error introduced by our ordering of the terms in the Hamiltonian versus default ordering and the ordering from the baseline methods and conclude that our method on average does not increase the Trotter error.

  @inproceedings{huang2024redefining,
      author = {Huang, Qunsheng and Winderl, David and Meijer-van de Griend, Arianne and Yeung, Richie},
      title = {Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling},
      year = {2024},
      booktitle = {2024 IEEE International Conference on Quantum Computing and Engineering (QCE)},
      volume = {01},
      number = {},
      pages = {885-896},
      doi = {10.1109/QCE60285.2024.00108},
      urldate = {2024-08-01},
      link = {http://arxiv.org/abs/2408.00354},
      keywords = {ZX-Supported, Optimisation, Automation},
      abstract = {In quantum computing, the efficient optimization of Pauli string decompositions is a crucial aspect for the compilation of quantum circuits for many applications, such as chemistry simulations and quantum machine learning. In this paper, we propose a novel algorithm for the synthesis of trotterized time-evolution operators that results in circuits with significantly fewer gates than previous solutions. Our synthesis procedure takes the qubit connectivity of a target quantum computer into account. As a result, the generated quantum circuit does not require routing, and no additional CNOT gates are needed to run the resulting circuit on a target device. We compare our algorithm against Paulihedral and TKET, and show a significant improvement for randomized circuits and different molecular ansatzes. We also investigate the Trotter error introduced by our ordering of the terms in the Hamiltonian versus default ordering and the ordering from the baseline methods and conclude that our method on average does not increase the Trotter error.},
      video = {https://www.youtube.com/watch?v=LlNTQqqwn4g}
  }
  

  Copy to Clipboard

• Enhancing Encoding Rate through Alternate Floquetification
  Yabo Wang, Yunlong Xiao, Kishor Bharti and Bo Qi
  Show abstract ⇲ Show bibdata ⇲

  2024 43rd Chinese Control Conference (CCC)
  Keywords: Error Correcting Codes, Floquet Codes, Applied, ZX-Calculus.

  Quantum error correction codes protect quantum systems against environmental noise, enabling fault-tolerant quantum computing. Among various codes, color codes have received considerable attention for their geometric locality, high error thresholds, and transversal logical operators. A canonical example is the [[4,2,2]] code implemented on a square lattice, which identifies single-qubit errors through four-qubit check measurements. By applying Floquetification to the [[4,2,2]] color code, a [[12,2,2]] Floquet code based on a double hexagon lattice has recently been developed, leading to a decrease in measurement weight from four to two. However, the aforementioned improvement is offset by a decrease in the encoding rate from 1/2 to 1/6, thus requiring an increased number of physical qubits. In this work, we provide a Floquetification process tailored for the [[4,2,2]] code. This leads to a new [[10,4,2]] Floquet code on a double pentagon lattice that not only retains weight two measurements but also enhances the encoding rate compared to the [[12,2,2]] Floquet code.

  @inproceedings{wang2024enhancing,
      author = {Wang, Yabo and Xiao, Yunlong and Bharti, Kishor and Qi, Bo},
      title = {{Enhancing Encoding Rate through Alternate Floquetification}},
      year = {2024},
      booktitle = {2024 43rd Chinese Control Conference (CCC)},
      pages = {6789--6794},
      organization = {IEEE},
      doi = {10.23919/CCC63176.2024.10661713},
      urldate = {2024-07-28},
      link = {https://ieeexplore.ieee.org/abstract/document/10661713},
      keywords = {Error Correcting Codes, Floquet Codes, Applied, ZX-Calculus},
      abstract = {Quantum error correction codes protect quantum systems against environmental noise, enabling fault-tolerant quantum computing. Among various codes, color codes have received considerable attention for their geometric locality, high error thresholds, and transversal logical operators. A canonical example is the [[4,2,2]] code implemented on a square lattice, which identifies single-qubit errors through four-qubit check measurements. By applying Floquetification to the [[4,2,2]] color code, a [[12,2,2]] Floquet code based on a double hexagon lattice has recently been developed, leading to a decrease in measurement weight from four to two. However, the aforementioned improvement is offset by a decrease in the encoding rate from 1/2 to 1/6, thus requiring an increased number of physical qubits. In this work, we provide a Floquetification process tailored for the [[4,2,2]] code. This leads to a new [[10,4,2]] Floquet code on a double pentagon lattice that not only retains weight two measurements but also enhances the encoding rate compared to the [[12,2,2]] Floquet code.}
  }
  

  Copy to Clipboard

• Qubit-count optimization using ZX-calculus
  Vivien Vandaele
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2407.10171
  Keywords: Optimisation, Automation, ZX-calculus.

  We propose several methods for optimizing the number of qubits in a quantum circuit while preserving the number of non-Clifford gates. One of our approaches consists in reversing, as much as possible, the gadgetization of Hadamard gates, which is a procedure used by some \(T\)-count optimizers to circumvent Hadamard gates at the expense of additional qubits. We prove the NP-hardness of this problem and we present an algorithm for solving it. We also propose a more general approach to optimize the number of qubits by showing how it relates to the problem of finding a minimal-width path-decomposition of the graph associated with a given ZX-diagram. This approach can be used to optimize the number of qubits for any computational model that can natively be depicted in ZX-calculus, such as the Pauli Fusion computational model which can represent lattice surgery operations. We also show how this method can be used to efficiently optimize the number of qubits in a quantum circuit by using the ZX-calculus as an intermediate representation.

  @article{vandaele2024qubitcount,
      author = {Vandaele, Vivien},
      title = {{Qubit-count optimization using ZX-calculus}},
      year = {2024},
      journal = {arXiv preprint arXiv:2407.10171},
      urldate = {2024-07-14},
      link = {http://arxiv.org/abs/2407.10171},
      keywords = {Optimisation, Automation, ZX-calculus},
      abstract = {We propose several methods for optimizing the number of qubits in a quantum circuit while preserving the number of non-Clifford gates. One of our approaches consists in reversing, as much as possible, the gadgetization of Hadamard gates, which is a procedure used by some $T$-count optimizers to circumvent Hadamard gates at the expense of additional qubits. We prove the NP-hardness of this problem and we present an algorithm for solving it. We also propose a more general approach to optimize the number of qubits by showing how it relates to the problem of finding a minimal-width path-decomposition of the graph associated with a given ZX-diagram. This approach can be used to optimize the number of qubits for any computational model that can natively be depicted in ZX-calculus, such as the Pauli Fusion computational model which can represent lattice surgery operations. We also show how this method can be used to efficiently optimize the number of qubits in a quantum circuit by using the ZX-calculus as an intermediate representation.},
      video = {https://www.youtube.com/watch?v=7RkmBX_96ik}
  }
  

  Copy to Clipboard

• The XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime
  Julio C. Magdalena de la Fuente, Josias Old, Alex Townsend-Teague, Manuel Rispler, Jens Eisert and Markus Müller
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  PRX Quantum
  Keywords: Error Correcting Codes, Floquet Codes, Clifford Fragment, ZX-calculus.

  Analyzing and developing new quantum error-correcting schemes is one of the most prominent tasks in quantum computing research. In such efforts, introducing time dynamics explicitly in both analysis and design of error-correcting protocols constitutes an important cornerstone. In this work, we present a graphical formalism based on tensor networks to capture the logical action and error-correcting capabilities of any Clifford circuit with Pauli measurements. We showcase the formalism on new Floquet codes derived from topological subsystem codes, which we call XYZ ruby codes. Based on the projective symmetries of the building blocks of the tensor network we develop a framework of Pauli flows. Pauli flows allow for a graphical understanding of all quantities entering an error correction analysis of a circuit, including different types of QEC experiments, such as memory and stability experiments. We lay out how to derive a well-defined decoding problem from the tensor network representation of a protocol and its Pauli flows alone, independent of any stabilizer code or fixed circuit. Importantly, this framework applies to all Clifford protocols and encompasses both measurement- and circuit-based approaches to fault tolerance. We apply our method to our new family of dynamical codes which are in the same topological phase as the 2+1d color code, making them a promising candidate for low-overhead logical gates. In contrast to its static counterpart, the dynamical protocol applies a Z3 automorphism to the logical Pauli group every three timesteps. We highlight some of its topological properties and comment on the anyon physics behind a planar layout. Lastly, we benchmark the performance of the XYZ ruby code on a torus by performing both memory and stability experiments and find competitive circuit-level noise thresholds of 0.18%, comparable with other Floquet codes and 2+1d color codes.

  @article{c.magdalenadelafuente2024xyz,
      author = {C. Magdalena de la Fuente, Julio and Old, Josias and Townsend-Teague, Alex and Rispler, Manuel and Eisert, Jens and M{\"u}ller, Markus},
      title = {{The XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime}},
      year = {2025},
      journal = {PRX Quantum},
      volume = {6},
      issue = {1},
      month = {3},
      pages = {010360},
      numpages = {56},
      publisher = {American Physical Society},
      doi = {10.1103/PRXQuantum.6.010360},
      urldate = {2024-07-11},
      link = {http://arxiv.org/abs/2407.08566},
      keywords = {Error Correcting Codes, Floquet Codes, Clifford Fragment, ZX-calculus},
      abstract = {Analyzing and developing new quantum error-correcting schemes is one of the most prominent tasks in quantum computing research. In such efforts, introducing time dynamics explicitly in both analysis and design of error-correcting protocols constitutes an important cornerstone. In this work, we present a graphical formalism based on tensor networks to capture the logical action and error-correcting capabilities of any Clifford circuit with Pauli measurements. We showcase the formalism on new Floquet codes derived from topological subsystem codes, which we call XYZ ruby codes. Based on the projective symmetries of the building blocks of the tensor network we develop a framework of Pauli flows. Pauli flows allow for a graphical understanding of all quantities entering an error correction analysis of a circuit, including different types of QEC experiments, such as memory and stability experiments. We lay out how to derive a well-defined decoding problem from the tensor network representation of a protocol and its Pauli flows alone, independent of any stabilizer code or fixed circuit. Importantly, this framework applies to all Clifford protocols and encompasses both measurement- and circuit-based approaches to fault tolerance. We apply our method to our new family of dynamical codes which are in the same topological phase as the 2+1d color code, making them a promising candidate for low-overhead logical gates. In contrast to its static counterpart, the dynamical protocol applies a Z3 automorphism to the logical Pauli group every three timesteps. We highlight some of its topological properties and comment on the anyon physics behind a planar layout. Lastly, we benchmark the performance of the XYZ ruby code on a torus by performing both memory and stability experiments and find competitive circuit-level noise thresholds of 0.18%, comparable with other Floquet codes and 2+1d color codes.},
      video = {https://www.youtube.com/watch?v=JjcPwUOUpJk}
  }
  

  Copy to Clipboard

• Hybrid Quantum-Classical Machine Learning with String Diagrams
  Alexander Koziell-Pipe and Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2407.03673
  Keywords: Category Theory, Variational Circuits, ZX-calculus, Mixed States.

  Central to near-term quantum machine learning is the use of hybrid quantum-classical algorithms. This paper develops a formal framework for describing these algorithms in terms of string diagrams: a key step towards integrating these hybrid algorithms into existing work using string diagrams for machine learning and differentiable programming. A notable feature of our string diagrams is the use of functor boxes, which correspond to a quantum-classical interfaces. The functor used is a lax monoidal functor embedding the quantum systems into classical, and the lax monoidality imposes restrictions on the string diagrams when extracting classical data from quantum systems via measurement. In this way, our framework provides initial steps toward a denotational semantics for hybrid quantum machine learning algorithms that captures important features of quantum-classical interactions.

  @article{koziell-pipe2024hybrid,
      author = {Koziell-Pipe, Alexander and Kissinger, Aleks},
      title = {{Hybrid Quantum-Classical Machine Learning with String Diagrams}},
      year = {2024},
      journal = {arXiv preprint arXiv:2407.03673},
      urldate = {2024-07-04},
      link = {http://arxiv.org/abs/2407.03673},
      keywords = {Category Theory, Variational Circuits, ZX-calculus, Mixed States},
      abstract = {Central to near-term quantum machine learning is the use of hybrid quantum-classical algorithms. This paper develops a formal framework for describing these algorithms in terms of string diagrams: a key step towards integrating these hybrid algorithms into existing work using string diagrams for machine learning and differentiable programming. A notable feature of our string diagrams is the use of functor boxes, which correspond to a quantum-classical interfaces. The functor used is a lax monoidal functor embedding the quantum systems into classical, and the lax monoidality imposes restrictions on the string diagrams when extracting classical data from quantum systems via measurement. In this way, our framework provides initial steps toward a denotational semantics for hybrid quantum machine learning algorithms that captures important features of quantum-classical interactions.}
  }
  

  Copy to Clipboard

• Automated reasoning in quantum circuit compilation
  Dimitrios Thanos, Alejandro Villoria, Sebastiaan Brand, Arend-Jan Quist, Jingyi Mei, Tim Coopmans and Alfons Laarman
  Show abstract ⇲ Show bibdata ⇲

  Model Checking Software (SPIN)
  Keywords: ZX-Supported, Classical Simulation, Verification, Automation.

  Automated reasoning techniques have been proven of immense importance in classical applications like formal verification, circuit design and probabilistic inference. The domain of quantum computing poses new challenges of a different nature, such as the compilation of quantum circuits, which involves ``quantum-hard'' tasks such as the simulation, optimization, synthesis, and equivalence checking of quantum circuits. We ask the question of how effective the methods motivated by classical automated reasoning can be for quantum compilation. We assess their current applicability to this new domain by discussing the recent advances. In particular, we focus on three core automated reasoning approaches: decision diagrams, satisfiability and graphical calculus-based methods. In this survey, we explain in a manner accessible to those unfamiliar with quantum computing concepts how these prominent automated reasoning methods have found numerous applications in quantum circuit compilation. We find that surprisingly all considered reasoning methods, while originally developed for classical purposes, can excel at various compilation tasks for even universal quantum circuits.

  @inproceedings{thanos2024automated,
      author = {Thanos, Dimitrios and Villoria, Alejandro and Brand, Sebastiaan and Quist, Arend-Jan and Mei, Jingyi and Coopmans, Tim and Laarman, Alfons},
      title = {Automated reasoning in quantum circuit compilation},
      year = {2024},
      booktitle = {Model Checking Software (SPIN)},
      urldate = {2024-07-04},
      link = {https://spin-web.github.io/SPIN2024/assets/preproceedings/SPIN2024-paper6.pdf},
      keywords = {ZX-Supported, Classical Simulation, Verification, Automation},
      abstract = {Automated reasoning techniques have been proven of immense importance in classical applications like formal verification, circuit design and probabilistic inference. The domain of quantum computing poses new challenges of a different nature, such as the compilation of quantum circuits, which involves ``quantum-hard'' tasks such as the simulation, optimization, synthesis, and equivalence checking of quantum circuits. We ask the question of how effective the methods motivated by classical automated reasoning can be for quantum compilation. We assess their current applicability to this new domain by discussing the recent advances. In particular, we focus on three core automated reasoning approaches: decision diagrams, satisfiability and graphical calculus-based methods. In this survey, we explain in a manner accessible to those unfamiliar with quantum computing concepts how these prominent automated reasoning methods have found numerous applications in quantum circuit compilation. We find that surprisingly all considered reasoning methods, while originally developed for classical purposes, can excel at various compilation tasks for even universal quantum circuits.}
  }
  

  Copy to Clipboard

• Tensor networks for non-invertible symmetries in 3+1d and beyond
  Pranay Gorantla, Shu-Heng Shao and Nathanan Tantivasadakarn
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2406.12978
  Keywords: Tensor Networks, Condensed Matter, ZX-calculus.

  Tensor networks provide a natural language for non-invertible symmetries in general Hamiltonian lattice models. We use ZX-diagrams, which are tensor network presentations of quantum circuits, to define a non-invertible operator implementing the Wegner duality in 3+1d lattice \(\mathbb{Z}_2\) gauge theory. The non-invertible algebra, which mixes with lattice translations, can be efficiently computed using ZX-calculus. We further deform the \(\mathbb{Z}_2\) gauge theory while preserving the duality and find a model with nine exactly degenerate ground states on a torus, consistent with the Lieb-Schultz-Mattis-type constraint imposed by the symmetry. Finally, we provide a ZX-diagram presentation of the non-invertible duality operators (including non-invertible parity/reflection symmetries) of generalized Ising models based on graphs, encompassing the 1+1d Ising model, the three-spin Ising model, the Ashkin-Teller model, and the 2+1d plaquette Ising model. The mixing (or lack thereof) with spatial symmetries is understood from a unifying perspective based on graph theory.

  @article{gorantla2024tensor,
      author = {Gorantla, Pranay and Shao, Shu-Heng and Tantivasadakarn, Nathanan},
      title = {{Tensor networks for non-invertible symmetries in 3+1d and beyond}},
      year = {2024},
      journal = {arXiv preprint arXiv:2406.12978},
      urldate = {2024-06-18},
      link = {http://arxiv.org/abs/2406.12978},
      keywords = {Tensor Networks, Condensed Matter, ZX-calculus},
      abstract = {Tensor networks provide a natural language for non-invertible symmetries in general Hamiltonian lattice models. We use ZX-diagrams, which are tensor network presentations of quantum circuits, to define a non-invertible operator implementing the Wegner duality in 3+1d lattice $\mathbb{Z}_2$ gauge theory. The non-invertible algebra, which mixes with lattice translations, can be efficiently computed using ZX-calculus. We further deform the $\mathbb{Z}_2$ gauge theory while preserving the duality and find a model with nine exactly degenerate ground states on a torus, consistent with the Lieb-Schultz-Mattis-type constraint imposed by the symmetry. Finally, we provide a ZX-diagram presentation of the non-invertible duality operators (including non-invertible parity/reflection symmetries) of generalized Ising models based on graphs, encompassing the 1+1d Ising model, the three-spin Ising model, the Ashkin-Teller model, and the 2+1d plaquette Ising model. The mixing (or lack thereof) with spatial symmetries is understood from a unifying perspective based on graph theory.},
      video = {https://www.youtube.com/watch?v=A6tjao_PEK8}
  }
  

  Copy to Clipboard

• Equivalence Classes of Quantum Error-Correcting Codes
  Andrey Boris Khesin and Alexander Li
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2406.12083
  Keywords: Error Correcting Codes, Clifford Fragment.

  Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. Using ZX calculus, we represent QECC's in a form called a ZX diagram, consisting of a tensor network. In this paper, we present canonical forms for CSS codes and CSS states (which are CSS codes with 0 inputs), and we show the resulting canonical forms for the toric code and certain surface codes. Next, we introduce the notion of prime code diagrams, ZX diagrams of codes that have a single connected component with the property that no sequence of rewrite rules can split such a diagram into two connected components. We also show the Fundamental Theorem of Clifford Codes, proving the existence and uniqueness of the prime decomposition of Clifford codes. Next, we tabulate equivalence classes of ZX diagrams under a different definition of equivalence that allows output permutations and any local operations on the outputs. Possible representatives of these equivalence classes are analyzed. This work expands on previous works in exploring the canonical forms of QECC's in their ZX diagram representations.

  @article{boriskhesin2024equivalence,
      author = {Boris Khesin, Andrey and Li, Alexander},
      title = {{Equivalence Classes of Quantum Error-Correcting Codes}},
      year = {2024},
      journal = {arXiv preprint arXiv:2406.12083},
      urldate = {2024-06-17},
      link = {http://arxiv.org/abs/2406.12083},
      keywords = {Error Correcting Codes, Clifford Fragment},
      abstract = {Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. Using ZX calculus, we represent QECC's in a form called a ZX diagram, consisting of a tensor network. In this paper, we present canonical forms for CSS codes and CSS states (which are CSS codes with 0 inputs), and we show the resulting canonical forms for the toric code and certain surface codes. Next, we introduce the notion of prime code diagrams, ZX diagrams of codes that have a single connected component with the property that no sequence of rewrite rules can split such a diagram into two connected components. We also show the Fundamental Theorem of Clifford Codes, proving the existence and uniqueness of the prime decomposition of Clifford codes. Next, we tabulate equivalence classes of ZX diagrams under a different definition of equivalence that allows output permutations and any local operations on the outputs. Possible representatives of these equivalence classes are analyzed. This work expands on previous works in exploring the canonical forms of QECC's in their ZX diagram representations.}
  }
  

  Copy to Clipboard

• Genons, Double Covers and Fault-tolerant Clifford Gates
  Simon Burton, Elijah Durso-Sabina and Natalie C. Brown
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2406.09951
  Keywords: Error Correcting Codes, Braids, Clifford Fragment, ZX-Supported.

  A great deal of work has been done developing quantum codes with varying overhead and connectivity constraints. However, given the such an abundance of codes, there is a surprising shortage of fault-tolerant logical gates supported therein. We define a construction, such that given an input \([[n,k,d]]\) code, yields a \([[2n,2k,\ge d]]\) symplectic double code with naturally occurring fault-tolerant logical Clifford gates. As applied to 2-dimensional \(D(\mathbb{Z}_2)\)-topological codes with genons (twists) and domain walls, we find the symplectic double is genon free, and of possibly higher genus. Braiding of genons on the original code becomes Dehn twists on the symplectic double. Such topological operations are particularly suited for architectures with all-to-all connectivity, and we demonstrate this experimentally on Quantinuum's H1-1 trapped-ion quantum computer.

  @article{burton2024genons,
      author = {Burton, Simon and Durso-Sabina, Elijah and C. Brown, Natalie},
      title = {{Genons, Double Covers and Fault-tolerant Clifford Gates}},
      year = {2024},
      journal = {arXiv preprint arXiv:2406.09951},
      urldate = {2024-06-14},
      link = {http://arxiv.org/abs/2406.09951},
      keywords = {Error Correcting Codes, Braids, Clifford Fragment, ZX-Supported},
      abstract = {A great deal of work has been done developing quantum codes with varying overhead and connectivity constraints. However, given the such an abundance of codes, there is a surprising shortage of fault-tolerant logical gates supported therein. We define a construction, such that given an input $[[n,k,d]]$ code, yields a $[[2n,2k,\ge d]]$ symplectic double code with naturally occurring fault-tolerant logical Clifford gates. As applied to 2-dimensional $D(\mathbb{Z}_2)$-topological codes with genons (twists) and domain walls, we find the symplectic double is genon free, and of possibly higher genus. Braiding of genons on the original code becomes Dehn twists on the symplectic double. Such topological operations are particularly suited for architectures with all-to-all connectivity, and we demonstrate this experimentally on Quantinuum's H1-1 trapped-ion quantum computer.},
      video = {https://www.youtube.com/watch?v=mpdJdBFZNIA}
  }
  

  Copy to Clipboard

• The Focked-up ZX Calculus: Picturing Continuous-Variable Quantum Computation
  Razin A. Shaikh, Lia Yeh and Stefano Gogioso
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2406.02905
  Keywords: Continuous Variable, Completeness, Protocols, Clifford Fragment, Error Correcting Codes.

  While the ZX and ZW calculi have been effective as graphical reasoning tools for finite-dimensional quantum computation, the possibilities for continuous-variable quantum computation (CVQC) in infinite-dimensional Hilbert space are only beginning to be explored. In this work, we formulate a graphical language for CVQC. Each diagram is an undirected graph made of two types of spiders: the Z spider from the ZX calculus defined on the reals, and the newly introduced Fock spider defined on the natural numbers. The Z and X spiders represent functions in position and momentum space respectively, while the Fock spider represents functions in the discrete Fock basis. In addition to the Fourier transform between Z and X, and the Hermite transform between Z and Fock, we present exciting new graphical rules capturing heftier CVQC interactions. We ensure this calculus is complete for all of Gaussian CVQC interpreted in infinite-dimensional Hilbert space, by translating the completeness in affine Lagrangian relations by Booth, Carette, and Comfort. Applying our calculus for quantum error correction, we derive graphical representations of the Gottesman-Kitaev-Preskill (GKP) code encoder, syndrome measurement, and magic state distillation of Hadamard eigenstates. Finally, we elucidate Gaussian boson sampling by providing a fully graphical proof that its circuit samples submatrix hafnians.

  @article{a.shaikh2024fockedup,
      author = {A. Shaikh, Razin and Yeh, Lia and Gogioso, Stefano},
      title = {{The Focked-up ZX Calculus: Picturing Continuous-Variable Quantum Computation}},
      year = {2024},
      journal = {arXiv preprint arXiv:2406.02905},
      urldate = {2024-06-05},
      link = {http://arxiv.org/abs/2406.02905},
      keywords = {Continuous Variable, Completeness, Protocols, Clifford Fragment, Error Correcting Codes},
      abstract = {While the ZX and ZW calculi have been effective as graphical reasoning tools for finite-dimensional quantum computation, the possibilities for continuous-variable quantum computation (CVQC) in infinite-dimensional Hilbert space are only beginning to be explored. In this work, we formulate a graphical language for CVQC. Each diagram is an undirected graph made of two types of spiders: the Z spider from the ZX calculus defined on the reals, and the newly introduced Fock spider defined on the natural numbers. The Z and X spiders represent functions in position and momentum space respectively, while the Fock spider represents functions in the discrete Fock basis. In addition to the Fourier transform between Z and X, and the Hermite transform between Z and Fock, we present exciting new graphical rules capturing heftier CVQC interactions.   We ensure this calculus is complete for all of Gaussian CVQC interpreted in infinite-dimensional Hilbert space, by translating the completeness in affine Lagrangian relations by Booth, Carette, and Comfort. Applying our calculus for quantum error correction, we derive graphical representations of the Gottesman-Kitaev-Preskill (GKP) code encoder, syndrome measurement, and magic state distillation of Hadamard eigenstates. Finally, we elucidate Gaussian boson sampling by providing a fully graphical proof that its circuit samples submatrix hafnians.},
      video = {https://www.youtube.com/watch?v=12QCw7PJBU4}
  }
  

  Copy to Clipboard

• The Qudit ZH Calculus for Arbitrary Finite Fields: Universality and Application
  Dichuan Gao
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2406.02219
  Keywords: ZH-calculus, Completeness, Qudits.

  We propose a generalization of the graphical ZH calculus to qudits of prime-power dimensions \(q = p^t\), implementing field arithmetic in arbitrary finite fields. This is an extension of a previous result by Roy which implemented arithmetic of prime-sized fields; and an alternative to a result by de Beaudrap which extended the ZH to implement cyclic ring arithmetic in \(\mathbb Z / q\mathbb Z\) rather than field arithmetic in \(\mathbb F_q\). We show this generalized ZH calculus to be universal over matrices \(\mathbb C^{q^n} \to \mathbb C^{q^m}\) with entries in the ring \(\mathbb Z[\omega]\) where \(\omega\) is a \(p\)th root of unity. As an illustration of the necessity of such an extension of ZH for field rather than cyclic ring arithmetic, we offer a graphical description and proof for a quantum algorithm for polynomial interpolation. This algorithm relies on the invertibility of multiplication, and therefore can only be described in a graphical language that implements field, rather than ring, multiplication.

  @article{dichuan2024qudit,
      author = {Gao, Dichuan},
      title = {{The Qudit ZH Calculus for Arbitrary Finite Fields: Universality and Application}},
      year = {2024},
      journal = {arXiv preprint arXiv:2406.02219},
      urldate = {2024-06-04},
      link = {http://arxiv.org/abs/2406.02219},
      keywords = {ZH-calculus, Completeness, Qudits},
      abstract = {We propose a generalization of the graphical ZH calculus to qudits of prime-power dimensions $q = p^t$, implementing field arithmetic in arbitrary finite fields. This is an extension of a previous result by Roy which implemented arithmetic of prime-sized fields; and an alternative to a result by de Beaudrap which extended the ZH to implement cyclic ring arithmetic in $\mathbb Z / q\mathbb Z$ rather than field arithmetic in $\mathbb F_q$. We show this generalized ZH calculus to be universal over matrices $\mathbb C^{q^n} \to \mathbb C^{q^m}$ with entries in the ring $\mathbb Z[\omega]$ where $\omega$ is a $p$th root of unity. As an illustration of the necessity of such an extension of ZH for field rather than cyclic ring arithmetic, we offer a graphical description and proof for a quantum algorithm for polynomial interpolation. This algorithm relies on the invertibility of multiplication, and therefore can only be described in a graphical language that implements field, rather than ring, multiplication.},
      video = {https://www.youtube.com/watch?v=o4biik1qI7g}
  }
  

  Copy to Clipboard

• Application of ZX-calculus to Quantum Architecture Search
  Tom Ewen, Ivica Turkalj, Patrick Holzer and Mark-Oliver Wolf
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Quantum Machine Intelligence
  Keywords: Variational Circuits, Optimisation, Applied, Automation, PyZX, ZX-calculus, Local Complementation.

  This paper presents a novel approach to quantum architecture search by integrating the techniques of ZX-calculus with Genetic Programming (GP) to optimize the structure of parameterized quantum circuits employed in Quantum Machine Learning (QML). Recognizing the challenges in designing efficient quantum circuits for QML, we propose a GP framework that utilizes mutations defined via ZX-calculus, a graphical language that can simplify visualizing and working with quantum circuits. Our methodology focuses on evolving quantum circuits with the aim of enhancing their capability to approximate functions relevant in various machine learning tasks. We introduce several mutation operators inspired by the transformation rules of ZX-calculus and investigate their impact on the learning efficiency and accuracy of quantum circuits. The empirical analysis involves a comparative study where these mutations are applied to a diverse set of quantum regression problems, measuring performance metrics such as the percentage of valid circuits after the mutation, improvement of the objective, as well as circuit depth and width. Our results indicate that certain ZX-calculus-based mutations perform significantly better than others for Quantum Architecture Search (QAS) in all metrics considered. They suggest that ZX-diagram based QAS results in shallower circuits and more uniformly allocated gates than crude genetic optimization based on the circuit model.

  @article{ewen2024application,
      author = {Ewen, Tom and Turkalj, Ivica and Holzer, Patrick and Wolf, Mark-Oliver},
      title = {{Application of ZX-calculus to Quantum Architecture Search}},
      year = {2025},
      journal = {Quantum Machine Intelligence},
      volume = {7},
      number = {34},
      doi = {10.1007/s42484-025-00264-6},
      urldate = {2024-06-03},
      link = {http://arxiv.org/abs/2406.01095},
      keywords = {Variational Circuits, Optimisation, Applied, Automation, PyZX, ZX-calculus, Local Complementation},
      abstract = {This paper presents a novel approach to quantum architecture search by integrating the techniques of ZX-calculus with Genetic Programming (GP) to optimize the structure of parameterized quantum circuits employed in Quantum Machine Learning (QML). Recognizing the challenges in designing efficient quantum circuits for QML, we propose a GP framework that utilizes mutations defined via ZX-calculus, a graphical language that can simplify visualizing and working with quantum circuits. Our methodology focuses on evolving quantum circuits with the aim of enhancing their capability to approximate functions relevant in various machine learning tasks. We introduce several mutation operators inspired by the transformation rules of ZX-calculus and investigate their impact on the learning efficiency and accuracy of quantum circuits. The empirical analysis involves a comparative study where these mutations are applied to a diverse set of quantum regression problems, measuring performance metrics such as the percentage of valid circuits after the mutation, improvement of the objective, as well as circuit depth and width. Our results indicate that certain ZX-calculus-based mutations perform significantly better than others for Quantum Architecture Search (QAS) in all metrics considered. They suggest that ZX-diagram based QAS results in shallower circuits and more uniformly allocated gates than crude genetic optimization based on the circuit model.},
      video = {https://www.youtube.com/watch?v=7rVUGd6W7kY}
  }
  

  Copy to Clipboard

• Is Simulation the only Alternative for Effective Verification of Dynamic Quantum Circuits?
  Liam Hurwitz, Kamalika Datta, Abhoy Kole and Rolf Drechsler
  Show abstract ⇲ Show bibdata ⇲

  International Conference on Reversible Computation
  Keywords: Verification, Automation, PyZX, Applied, ZX-calculus.

  This paper investigates the verification gap of Dynamic Quantum Circuits (DQC) by analyzing state-of-the-art equivalence checking approaches. Today’s Noisy Intermediate-Scale Quantum (NISQ) devices are limited in the number of qubits. DQCs drastically reduce the number of qubits required by guiding the outcome based on the intermediate results of the computations. Investigation of feasibility of existing verification tools with respect to DQC verification is needed. In order to verify the equivalence of DQCs, verification tools often transform dynamic primitives in order to reveal the underlying functionality of the circuits. This leads to restoration of their unitary functionality and allows existing equivalence checkers to reason about DQCs. Our objective is to provide empirical data that can be used to improve these tools by examining their capabilities and effectiveness. Equivalence checking methods that use ZX-Calculus, Quantum Multi Valued Decision Diagrams (QMDD) and simulators are considered in this regard. In order to gauge the effectiveness of the present tools, we use the Bernstein–Vazirani, DeutschJozsa and Quantum Phase Estimation algorithms and their dynamic variants. Experiments reveal that the existing equivalence checking tools are limited in their effectiveness, while simulation based approaches provide correct verifications at the expense of high runtime overhead. Our results show that the different verification methods never achieves accuracy of more than 50%.

  @inproceedings{hurwitz2024simulation,
      author = {Hurwitz, Liam and Datta, Kamalika and Kole, Abhoy and Drechsler, Rolf},
      title = {Is Simulation the only Alternative for Effective Verification of Dynamic Quantum Circuits?},
      year = {2024},
      booktitle = {International Conference on Reversible Computation},
      pages = {201--217},
      organization = {Springer},
      doi = {10.1007/978-3-031-62076-8_13},
      urldate = {2024-05-29},
      link = {https://link.springer.com/chapter/10.1007/978-3-031-62076-8_13},
      keywords = {Verification, Automation, PyZX, Applied, ZX-calculus},
      abstract = {This paper investigates the verification gap of Dynamic Quantum Circuits (DQC) by analyzing state-of-the-art equivalence checking approaches. Today’s Noisy Intermediate-Scale Quantum (NISQ) devices are limited in the number of qubits. DQCs drastically reduce the number of qubits required by guiding the outcome based on the intermediate results of the computations. Investigation of feasibility of existing verification tools with respect to DQC verification is needed. In order to verify the equivalence of DQCs, verification tools often transform dynamic primitives in order to reveal the underlying functionality of the circuits. This leads to restoration of their unitary functionality and allows existing equivalence checkers to reason about DQCs. Our objective is to provide empirical data that can be used to improve these tools by examining their capabilities and effectiveness. Equivalence checking methods that use ZX-Calculus, Quantum Multi Valued Decision Diagrams (QMDD) and simulators are considered in this regard. In order to gauge the effectiveness of the present tools, we use the Bernstein–Vazirani, DeutschJozsa and Quantum Phase Estimation algorithms and their dynamic variants. Experiments reveal that the existing equivalence checking tools are limited in their effectiveness, while simulation based approaches provide correct verifications at the expense of high runtime overhead. Our results show that the different verification methods never achieves accuracy of more than 50%.}
  }
  

  Copy to Clipboard

• ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces
  Boldizsár Poór, Razin A. Shaikh and Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2405.10896
  Keywords: Completeness, Qudits, ZX-calculus, ZW-calculus.

  The ZX-calculus is a graphical language for reasoning about quantum computing and quantum information theory. As a complete graphical language, it incorporates a set of axioms rich enough to derive any equation of the underlying formalism. While completeness of the ZX-calculus has been established for qubits and the Clifford fragment of prime-dimensional qudits, universal completeness beyond two-level systems has remained unproven until now. In this paper, we present a proof establishing the 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. By proving its completeness, we lay a solid foundation for the ZX-calculus as a versatile tool not only for quantum computation but also for various fields within finite-dimensional quantum theory.

  @article{poor2024zxcalculus,
      author = {Po{\'o}r, Boldizs{\'a}r and A. Shaikh, Razin and Wang, Quanlong},
      title = {{ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces}},
      year = {2024},
      journal = {arXiv preprint arXiv:2405.10896},
      urldate = {2024-05-17},
      link = {http://arxiv.org/abs/2405.10896},
      keywords = {Completeness, Qudits, ZX-calculus, ZW-calculus},
      abstract = {The ZX-calculus is a graphical language for reasoning about quantum computing and quantum information theory. As a complete graphical language, it incorporates a set of axioms rich enough to derive any equation of the underlying formalism. While completeness of the ZX-calculus has been established for qubits and the Clifford fragment of prime-dimensional qudits, universal completeness beyond two-level systems has remained unproven until now. In this paper, we present a proof establishing the 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. By proving its completeness, we lay a solid foundation for the ZX-calculus as a versatile tool not only for quantum computation but also for various fields within finite-dimensional quantum theory.},
      video = {https://www.youtube.com/watch?v=-35o41JfwFU}
  }
  

  Copy to Clipboard

• ZX Graphical Calculus for Continuous-Variable Quantum Processes
  Hironari Nagayoshi, Warit Asavanant, Ryuhoh Ide, Kosuke Fukui, Atsushi Sakaguchi, Jun-ichi Yoshikawa, Nicolas C. Menicucci and Akira Furusawa
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2405.07246
  Keywords: Continuous Variable, ZX-calculus, MBQC, Completeness, Protocols.

  Continuous-variable (CV) quantum information processing is a promising candidate for large-scale fault-tolerant quantum computation. However, analysis of CV quantum process relies mostly on direct computation of the evolution of operators in the Heisenberg picture, and the features of CV space has yet to be thoroughly investigated in an intuitive manner. One key ingredient for further exploration of CV quantum computing is the construction of a computational model that brings visual intuition and new tools for analysis. In this paper, we delve into a graphical computational model, inspired by a similar model for qubit-based systems called the ZX calculus, that enables the representation of arbitrary CV quantum process as a simple directed graph. We demonstrate the utility of our model as a graphical tool to comprehend CV processes intuitively by showing how equivalences between two distinct quantum processes can be proven as a sequence of diagrammatic transformations in certain cases. We also examine possible applications of our model, such as measurement-based quantum computing, characterization of Gaussian and non-Gaussian processes, and circuit optimization.

  @article{nagayoshi2024zx,
      author = {Nagayoshi, Hironari and Asavanant, Warit and Ide, Ryuhoh and Fukui, Kosuke and Sakaguchi, Atsushi and Yoshikawa, Jun-ichi and C. Menicucci, Nicolas and Furusawa, Akira},
      title = {{ZX Graphical Calculus for Continuous-Variable Quantum Processes}},
      year = {2024},
      journal = {arXiv preprint arXiv:2405.07246},
      urldate = {2024-05-12},
      link = {http://arxiv.org/abs/2405.07246},
      keywords = {Continuous Variable, ZX-calculus, MBQC, Completeness, Protocols},
      abstract = {Continuous-variable (CV) quantum information processing is a promising candidate for large-scale fault-tolerant quantum computation. However, analysis of CV quantum process relies mostly on direct computation of the evolution of operators in the Heisenberg picture, and the features of CV space has yet to be thoroughly investigated in an intuitive manner. One key ingredient for further exploration of CV quantum computing is the construction of a computational model that brings visual intuition and new tools for analysis. In this paper, we delve into a graphical computational model, inspired by a similar model for qubit-based systems called the ZX calculus, that enables the representation of arbitrary CV quantum process as a simple directed graph. We demonstrate the utility of our model as a graphical tool to comprehend CV processes intuitively by showing how equivalences between two distinct quantum processes can be proven as a sequence of diagrammatic transformations in certain cases. We also examine possible applications of our model, such as measurement-based quantum computing, characterization of Gaussian and non-Gaussian processes, and circuit optimization.}
  }
  

  Copy to Clipboard

• Exact solution of long-range stabilizer Rényi entropy in the dual-unitary XXZ model
  Jordi Arnau Montañà López and Pavel Kos
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Journal of Physics A: Mathematical and Theoretical
  Keywords: Entanglement, Condensed Matter, Phase gadgets, Applied, ZX-calculus.

  Quantum systems can not be efficiently simulated classically due to the presence of entanglement and nonstabilizerness, also known as quantum magic. Here we study the generation of magic under evolution by a quantum circuit. To be able to provide exact solutions, we focus on the dual-unitary XXZ model and a measure of magic called stabilizer R\'enyi entropy (SRE). Moreover, we focus also on long-range SRE, which cannot be removed by short-depth quantum circuits. To obtain exact solutions we use a ZX-calculus representation and graphical rules for the evaluation of the required expressions. We obtain exact results for SRE after short-time evolution in the thermodynamic limit and for long-range SRE for all times and all R\'enyi parameters for a particular partition of the state. Since the numerical evaluation of these quantities is exponentially costly in the R\'enyi parameter, we verify this numerically for low R\'enyi parameters and accessible system sizes and provide numerical results for the long-range SRE in other bipartitions.

  @article{arnaumontanalopez2024exact,
      author = {Arnau Monta{\~n}{\`a} L{\'o}pez, Jordi and Kos, Pavel},
      title = {{Exact solution of long-range stabilizer R{\'e}nyi entropy in the dual-unitary XXZ model}},
      year = {2024},
      journal = {Journal of Physics A: Mathematical and Theoretical},
      volume = {57},
      number = {47},
      month = {11},
      doi = {10.1088/1751-8121/ad85b0},
      urldate = {2024-05-07},
      link = {http://arxiv.org/abs/2405.04448},
      keywords = {Entanglement, Condensed Matter, Phase gadgets, Applied, ZX-calculus},
      abstract = {Quantum systems can not be efficiently simulated classically due to the presence of entanglement and nonstabilizerness, also known as quantum magic. Here we study the generation of magic under evolution by a quantum circuit. To be able to provide exact solutions, we focus on the dual-unitary XXZ model and a measure of magic called stabilizer R\'enyi entropy (SRE). Moreover, we focus also on long-range SRE, which cannot be removed by short-depth quantum circuits. To obtain exact solutions we use a ZX-calculus representation and graphical rules for the evaluation of the required expressions. We obtain exact results for SRE after short-time evolution in the thermodynamic limit and for long-range SRE for all times and all R\'enyi parameters for a particular partition of the state. Since the numerical evaluation of these quantities is exponentially costly in the R\'enyi parameter, we verify this numerically for low R\'enyi parameters and accessible system sizes and provide numerical results for the long-range SRE in other bipartitions.},
      video = {https://www.youtube.com/watch?v=yoRfKzBmAyg}
  }
  

  Copy to Clipboard

• EPOC: A Novel Pulse Generation Framework Incorporating Advanced Synthesis Techniques for Quantum Circuits
  Jinglei Cheng, Yuchen Zhu, Yidong Zhou, Hang Ren, Zhixin Song and Zhiding Liang
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2405.03804
  Keywords: Optimisation, Automation, Applied, ZX-calculus.

  In this paper we propose EPOC, an efficient pulse generation framework for quantum circuits that combines ZX-Calculus, circuit partitioning, and circuit synthesis to accelerate pulse generation. Unlike previous works that focus on generating pulses from unitary matrices without exploring equivalent representations, EPOC employs a finer granularity approach by grouping quantum gates and decomposing the resulting unitary matrices into smaller ones using synthesis techniques. This enables increased parallelism and decreased latency in quantum pulses. EPOC also continuously optimizes the circuit by identifying equivalent representations, leading to further reductions in circuit latency while minimizing the computational overhead associated with quantum optimal control. We introduce circuit synthesis into the workflow of quantum optimal control for the first time and achieve a 31.74% reduction in latency compared to previous work and a 76.80% reduction compared to the gate-based method for creating pulses. The approach demonstrates the potential for significant performance improvements in quantum circuits while minimizing computational overhead.

  @article{cheng2024epoc:,
      author = {Cheng, Jinglei and Zhu, Yuchen and Zhou, Yidong and Ren, Hang and Song, Zhixin and Liang, Zhiding},
      title = {{EPOC: A Novel Pulse Generation Framework Incorporating Advanced Synthesis Techniques for Quantum Circuits}},
      year = {2024},
      journal = {arXiv preprint arXiv:2405.03804},
      urldate = {2024-05-06},
      link = {http://arxiv.org/abs/2405.03804},
      keywords = {Optimisation, Automation, Applied, ZX-calculus},
      abstract = {In this paper we propose EPOC, an efficient pulse generation framework for quantum circuits that combines ZX-Calculus, circuit partitioning, and circuit synthesis to accelerate pulse generation. Unlike previous works that focus on generating pulses from unitary matrices without exploring equivalent representations, EPOC employs a finer granularity approach by grouping quantum gates and decomposing the resulting unitary matrices into smaller ones using synthesis techniques. This enables increased parallelism and decreased latency in quantum pulses. EPOC also continuously optimizes the circuit by identifying equivalent representations, leading to further reductions in circuit latency while minimizing the computational overhead associated with quantum optimal control. We introduce circuit synthesis into the workflow of quantum optimal control for the first time and achieve a 31.74% reduction in latency compared to previous work and a 76.80% reduction compared to the gate-based method for creating pulses. The approach demonstrates the potential for significant performance improvements in quantum circuits while minimizing computational overhead.}
  }
  

  Copy to Clipboard

• [Video] The how and why of translating between the circuit model and the one-way model of quantum computing 🎥
  Miriam Backens
  Show abstract ⇲ Show bibdata ⇲

  FoQaCiA
  Keywords: ZX-calculus, MBQC, Circuit Extraction, gflow.

  In the one-way model of measurement based quantum computing, unlike the quantum circuit model, a computation is driven not by unitary gates but by successive adaptive single-qubit measurements on an entangled resource state. So-called flow properties ensure that a one-way computation, described by a measurement pattern, is deterministic overall (up to Pauli corrections on output qubits). Translations between quantum circuits and measurement patterns have been used to show universality of the one-way model, verify measurement patterns, optimise quantum circuits, and more. Yet while it is straightforward to translate a circuit into a measurement pattern, the question of algorithmic "circuit extraction" -- how to translate general measurement patterns with flow to ancilla-free circuits -- had long remained open for all but the simplest type of flow. In this talk, we will recap the one-way model of quantum computing and then explain how the problem of circuit extraction was resolved using the ZX-calculus as a common language for circuits and measurement patterns. We also discuss applications.

  @misc{Backens2024Video,
      author = {Backens, Miriam},
      title = {{The how and why of translating between the circuit model and the one-way model of quantum computing}},
      year = {2024},
      howpublished = {FoQaCiA},
      urldate = {2024-05-03},
      url = {https://pirsa.org/24050004},
      keywords = {ZX-calculus, MBQC, Circuit Extraction, gflow},
      abstract = {In the one-way model of measurement based quantum computing, unlike the quantum circuit model, a computation is driven not by unitary gates but by successive adaptive single-qubit measurements on an entangled resource state. So-called flow properties ensure that a one-way computation, described by a measurement pattern, is deterministic overall (up to Pauli corrections on output qubits). Translations between quantum circuits and measurement patterns have been used to show universality of the one-way model, verify measurement patterns, optimise quantum circuits, and more. Yet while it is straightforward to translate a circuit into a measurement pattern, the question of algorithmic "circuit extraction" -- how to translate general measurement patterns with flow to ancilla-free circuits -- had long remained open for all but the simplest type of flow. In this talk, we will recap the one-way model of quantum computing and then explain how the problem of circuit extraction was resolved using the ZX-calculus as a common language for circuits and measurement patterns. We also discuss applications.}
  }
  

  Copy to Clipboard

• A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
  Daniel Bochen Tan, Murphy Yuezhen Niu and Craig Gidney
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA)
  Keywords: Lattice Surgery, Surface Code, SAT, Optimisation, Automation, ZX-calculus.

  Quantum error correction is necessary for large-scale quantum computing. A promising quantum error correcting code is the surface code. For this code, fault-tolerant quantum computing (FTQC) can be performed via lattice surgery, i.e., splitting and merging patches of code. Given the frequent use of certain lattice-surgery subroutines (LaS), it becomes crucial to optimize their design in order to minimize the overall spacetime volume of FTQC. In this study, we define the variables to represent LaS and the constraints on these variables. Leveraging this formulation, we develop a synthesizer for LaS, LaSsynth, that encodes a LaS construction problem into a SAT instance, subsequently querying SAT solvers for a solution. Starting from a baseline design, we can gradually invoke the solver with shrinking spacetime volume to derive more compact designs. Due to our foundational formulation and the use of SAT solvers, LaSsynth can exhaustively explore the design space, yielding optimal designs in volume. For example, it achieves 8% and 18% volume reduction respectively over two states-of-the-art human designs for the 15-to-1 T-factory, a bottleneck in FTQC.

  @article{bochentan2024sat,
      author = {Bochen Tan, Daniel and Yuezhen Niu, Murphy and Gidney, Craig},
      title = {A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing},
      year = {2024},
      booktitle = {2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA)},
      volume = {},
      number = {},
      pages = {325-339},
      doi = {10.1109/ISCA59077.2024.00032},
      urldate = {2024-04-29},
      link = {http://arxiv.org/abs/2404.18369},
      keywords = {Lattice Surgery, Surface Code, SAT, Optimisation, Automation, ZX-calculus},
      abstract = {Quantum error correction is necessary for large-scale quantum computing. A promising quantum error correcting code is the surface code. For this code, fault-tolerant quantum computing (FTQC) can be performed via lattice surgery, i.e., splitting and merging patches of code. Given the frequent use of certain lattice-surgery subroutines (LaS), it becomes crucial to optimize their design in order to minimize the overall spacetime volume of FTQC. In this study, we define the variables to represent LaS and the constraints on these variables. Leveraging this formulation, we develop a synthesizer for LaS, LaSsynth, that encodes a LaS construction problem into a SAT instance, subsequently querying SAT solvers for a solution. Starting from a baseline design, we can gradually invoke the solver with shrinking spacetime volume to derive more compact designs. Due to our foundational formulation and the use of SAT solvers, LaSsynth can exhaustively explore the design space, yielding optimal designs in volume. For example, it achieves 8% and 18% volume reduction respectively over two states-of-the-art human designs for the 15-to-1 T-factory, a bottleneck in FTQC.},
      video = {https://www.youtube.com/watch?v=-8-6Vd3z5rc}
  }
  

  Copy to Clipboard

• Constructing $\mathrmNP^\mathord#\mathrm P$-complete problems and $\mathord#\mathrm P$-hardness of circuit extraction in phase-free ZH
  Piotr Mitosek
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2404.10913
  Keywords: ZH-calculus, SAT, Circuit Extraction.

  The ZH calculus is a graphical language for quantum computation reasoning. The phase-free variant offers a simple set of generators that guarantee universality. ZH calculus is effective in MBQC and analysis of quantum circuits constructed with the universal gate set Toffoli+H. While circuits naturally translate to ZH diagrams, finding an ancilla-free circuit equivalent to a given diagram is hard. Here, we show that circuit extraction for phase-free ZH calculus is \({\mathord{\#}\mathrm P}\)-hard, extending the existing result for ZX calculus. Another problem believed to be hard is comparing whether two diagrams represent the same process. We show that two closely related problems are \(\mathrm{NP}^{\mathord{\#}\mathrm P}\)-complete. The first problem is: given two processes represented as diagrams, determine the existence of a computational basis state on which they equalize. The second problem is checking whether the matrix representation of a given diagram contains an entry equal to a given number. Our proof adapts the proof of Cook-Levin theorem to a reduction from a non-deterministic Turing Machine with access to \({\mathord{\#}\mathrm P}\) oracle.

  @article{mitosek2024constructing,
      author = {Mitosek, Piotr},
      title = {{Constructing $\mathrm{NP}^{\mathord{\#}\mathrm P}$-complete problems and ${\mathord{\#}\mathrm P}$-hardness of circuit extraction in phase-free ZH}},
      year = {2024},
      journal = {arXiv preprint arXiv:2404.10913},
      urldate = {2024-04-16},
      link = {http://arxiv.org/abs/2404.10913},
      keywords = {ZH-calculus, SAT, Circuit Extraction},
      abstract = {The ZH calculus is a graphical language for quantum computation reasoning. The phase-free variant offers a simple set of generators that guarantee universality. ZH calculus is effective in MBQC and analysis of quantum circuits constructed with the universal gate set Toffoli+H. While circuits naturally translate to ZH diagrams, finding an ancilla-free circuit equivalent to a given diagram is hard. Here, we show that circuit extraction for phase-free ZH calculus is ${\mathord{\#}\mathrm P}$-hard, extending the existing result for ZX calculus. Another problem believed to be hard is comparing whether two diagrams represent the same process. We show that two closely related problems are $\mathrm{NP}^{\mathord{\#}\mathrm P}$-complete. The first problem is: given two processes represented as diagrams, determine the existence of a computational basis state on which they equalize. The second problem is checking whether the matrix representation of a given diagram contains an entry equal to a given number. Our proof adapts the proof of Cook-Levin theorem to a reduction from a non-deterministic Turing Machine with access to ${\mathord{\#}\mathrm P}$ oracle.},
      video = {https://www.youtube.com/watch?v=EuqikLkSHX8}
  }
  

  Copy to Clipboard

• Catalysing Completeness and Universality
  Aleks Kissinger, Neil J. Ross and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2404.09915
  Keywords: ZH-calculus, Completeness, Clifford+T, Toffoli.

  A catalysis state is a quantum state that is used to make some desired operation possible or more efficient, while not being consumed in the process. Recent years have seen catalysis used in state-of-the-art protocols for implementing magic state distillation or small angle phase rotations. In this paper we will see that we can also use catalysis to prove that certain gate sets are computationally universal, and to extend completeness results of graphical languages to larger fragments. In particular, we give a simple proof of the computational universality of the CS+Hadamard gate set using the catalysis of a \(T\) gate using a CS gate, which sidesteps the more complicated analytic arguments of the original proof by Kitaev. This then also gives us a simple self-contained proof of the computational universality of Toffoli+Hadamard. Additionally, we show that the phase-free ZH-calculus can be extended to a larger complete fragment, just by using a single catalysis rule (and one scalar rule).

  @article{kissinger2024catalysing,
      author = {Kissinger, Aleks and J. Ross, Neil and van de Wetering, John},
      title = {{Catalysing Completeness and Universality}},
      year = {2024},
      journal = {arXiv preprint arXiv:2404.09915},
      urldate = {2024-04-15},
      link = {http://arxiv.org/abs/2404.09915},
      keywords = {ZH-calculus, Completeness, Clifford+T, Toffoli},
      abstract = {A catalysis state is a quantum state that is used to make some desired operation possible or more efficient, while not being consumed in the process. Recent years have seen catalysis used in state-of-the-art protocols for implementing magic state distillation or small angle phase rotations. In this paper we will see that we can also use catalysis to prove that certain gate sets are computationally universal, and to extend completeness results of graphical languages to larger fragments. In particular, we give a simple proof of the computational universality of the CS+Hadamard gate set using the catalysis of a $T$ gate using a CS gate, which sidesteps the more complicated analytic arguments of the original proof by Kitaev. This then also gives us a simple self-contained proof of the computational universality of Toffoli+Hadamard. Additionally, we show that the phase-free ZH-calculus can be extended to a larger complete fragment, just by using a single catalysis rule (and one scalar rule).},
      video = {https://www.youtube.com/watch?v=guZ5cVECJGI}
  }
  

  Copy to Clipboard

• Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)
  Aleks Kissinger and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings of the 21st International Conference on Quantum Physics and Logic, Buenos Aires, Argentina, July 15-19, 2024
  Keywords: Error Correcting Codes, Scalable ZX, T-count, Clifford+T, Completeness.

  This is the second in a series of "graphical grokking" papers in which we study how stabiliser codes can be understood using the ZX calculus. In this paper we show that certain complex rules involving ZX diagrams, called spider nest identities, can be captured succinctly using the scalable ZX calculus, and all such identities can be proved inductively from a single new rule using the Clifford ZX calculus. This can be combined with the ZX picture of CSS codes, developed in the first "grokking" paper, to give a simple characterisation of the set of all transversal diagonal gates at the third level of the Clifford hierarchy implementable in an arbitrary CSS code.

  @inproceedings{kissinger2024scalable,
      author = {Kissinger, Aleks and van de Wetering, John},
      title = {{Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)}},
      year = {2024},
      booktitle = {Proceedings of the 21st International Conference on Quantum Physics and Logic, Buenos Aires, Argentina, July 15-19, 2024},
      editor = {D\'iaz-Caro, Alejandro and Zamdzhiev, Vladimir},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {406},
      pages = {79-95},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.406.4},
      urldate = {2024-04-11},
      link = {http://arxiv.org/abs/2404.07828},
      keywords = {Error Correcting Codes, Scalable ZX, T-count, Clifford+T, Completeness},
      abstract = {This is the second in a series of "graphical grokking" papers in which we study how stabiliser codes can be understood using the ZX calculus. In this paper we show that certain complex rules involving ZX diagrams, called spider nest identities, can be captured succinctly using the scalable ZX calculus, and all such identities can be proved inductively from a single new rule using the Clifford ZX calculus. This can be combined with the ZX picture of CSS codes, developed in the first "grokking" paper, to give a simple characterisation of the set of all transversal diagonal gates at the third level of the Clifford hierarchy implementable in an arbitrary CSS code.},
      video = {https://www.youtube.com/watch?v=l8U9pHzPHpw}
  }
  

  Copy to Clipboard

• Zero-temperature entanglement membranes in quantum circuits
  Grace M. Sommers, Sarang Gopalakrishnan, Michael J. Gullans and David A. Huse
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Phys. Rev. B
  Keywords: Entanglement, MBQC, Applied, ZX-calculus.

  In chaotic quantum systems, the entanglement of a region \(A\) can be described in terms of the surface tension of a spacetime membrane pinned to the boundary of \(A\). Here, we interpret the tension of this entanglement membrane in terms of the rate at which information "flows" across it. For any orientation of the membrane, one can define (generically nonunitary) dynamics across the membrane; we explore this dynamics in various space-time translation-invariant (STTI) stabilizer circuits in one and two spatial dimensions. We find that the flux of information across the membrane in these STTI circuits reaches a steady state. In the cases where this dynamics is nonunitary and the steady state flux is nonzero, this occurs because the dynamics across the membrane is unitary in a subspace of extensive entropy. This generalized unitarity is present in a broad class of STTI stabilizer circuits, and is also present in some special non-stabilizer models. The existence of multiple unitary (or generalized unitary) directions forces the entanglement membrane tension to be a piecewise linear function of the orientation of the membrane; in this respect, the entanglement membrane behaves like an interface in a zero-temperature classical lattice model. We argue that entanglement membranes in random stabilizer circuits that produce volume-law entanglement are also effectively at zero temperature.

  @article{m.sommers2024zerotemperature,
      author = {M. Sommers, Grace and Gopalakrishnan, Sarang and J. Gullans, Michael and A. Huse, David},
      title = {{Zero-temperature entanglement membranes in quantum circuits}},
      year = {2024},
      journal = {Phys. Rev. B},
      volume = {110},
      issue = {6},
      month = {Aug},
      pages = {064311},
      numpages = {12},
      publisher = {American Physical Society},
      doi = {10.1103/PhysRevB.110.064311},
      urldate = {2024-04-03},
      link = {http://arxiv.org/abs/2404.02975},
      keywords = {Entanglement, MBQC, Applied, ZX-calculus},
      abstract = {In chaotic quantum systems, the entanglement of a region $A$ can be described in terms of the surface tension of a spacetime membrane pinned to the boundary of $A$. Here, we interpret the tension of this entanglement membrane in terms of the rate at which information "flows" across it. For any orientation of the membrane, one can define (generically nonunitary) dynamics across the membrane; we explore this dynamics in various space-time translation-invariant (STTI) stabilizer circuits in one and two spatial dimensions. We find that the flux of information across the membrane in these STTI circuits reaches a steady state. In the cases where this dynamics is nonunitary and the steady state flux is nonzero, this occurs because the dynamics across the membrane is unitary in a subspace of extensive entropy. This generalized unitarity is present in a broad class of STTI stabilizer circuits, and is also present in some special non-stabilizer models. The existence of multiple unitary (or generalized unitary) directions forces the entanglement membrane tension to be a piecewise linear function of the orientation of the membrane; in this respect, the entanglement membrane behaves like an interface in a zero-temperature classical lattice model. We argue that entanglement membranes in random stabilizer circuits that produce volume-law entanglement are also effectively at zero temperature.},
      video = {https://www.youtube.com/watch?v=q2UvZS3OmRI}
  }
  

  Copy to Clipboard

• Measurement-Based Quantum Approximate Optimization
  Tobias Stollenwerk and Stuart Hadfield
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
  Keywords: MBQC, Optimisation, Variational Circuits, ZX-calculus.

  Parameterized quantum circuits are attractive candidates for potential quantum advantage in the near term and beyond. At the same time, as quantum computing hardware not only continues to improve but also begins to incorporate new features such as mid-circuit measurement and adaptive control, opportunities arise for innovative algorithmic paradigms. In this work we focus on measurement-based quantum computing protocols for approximate optimization, in particular related to quantum alternating operator ans\"atze (QAOA), a popular quantum circuit model approach to combinatorial optimization. For the construction and analysis of our measurement-based protocols we demonstrate that diagrammatic approaches, specifically ZX-calculus and its extensions, are effective for adapting such algorithms to the measurement-based setting. In particular we derive measurement patterns for applying QAOA to the broad and important class of QUBO problems. We further outline how for constrained optimization, hard problem constraints may be directly incorporated into our protocol to guarantee the feasibility of the solution found and avoid the need for dealing with penalties. Finally we discuss the resource requirements and tradeoffs of our approach to that of more traditional quantum circuits.

  @inproceedings{stollenwerk2024measurementbased,
      author = {Stollenwerk, Tobias and Hadfield, Stuart},
      title = {{Measurement-Based Quantum Approximate Optimization}},
      year = {2024},
      booktitle = {2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)},
      volume = {},
      number = {},
      pages = {1115-1127},
      doi = {10.1109/IPDPSW63119.2024.00183},
      urldate = {2024-03-18},
      link = {http://arxiv.org/abs/2403.11514},
      keywords = {MBQC, Optimisation, Variational Circuits, ZX-calculus},
      abstract = {Parameterized quantum circuits are attractive candidates for potential quantum advantage in the near term and beyond. At the same time, as quantum computing hardware not only continues to improve but also begins to incorporate new features such as mid-circuit measurement and adaptive control, opportunities arise for innovative algorithmic paradigms. In this work we focus on measurement-based quantum computing protocols for approximate optimization, in particular related to quantum alternating operator ans\"atze (QAOA), a popular quantum circuit model approach to combinatorial optimization. For the construction and analysis of our measurement-based protocols we demonstrate that diagrammatic approaches, specifically ZX-calculus and its extensions, are effective for adapting such algorithms to the measurement-based setting. In particular we derive measurement patterns for applying QAOA to the broad and important class of QUBO problems. We further outline how for constrained optimization, hard problem constraints may be directly incorporated into our protocol to guarantee the feasibility of the solution found and avoid the need for dealing with penalties. Finally we discuss the resource requirements and tradeoffs of our approach to that of more traditional quantum circuits.},
      video = {https://www.youtube.com/watch?v=dwLxBdhT0ZU}
  }
  

  Copy to Clipboard

• Multi-controlled Phase Gate Synthesis with ZX-calculus applied to Neutral Atom Hardware
  Korbinian Staudacher, Ludwig Schmid, Johannes Zeiher, Robert Wille and Dieter Kranzlmüller
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings of the 21st International Conference on Quantum Physics and Logic, Buenos Aires, Argentina, July 15-19, 2024
  Keywords: Optimisation, Circuit Extraction, Automation, Applied, ZX-calculus.

  Quantum circuit synthesis describes the process of converting arbitrary unitary operations into a gate sequence of a fixed universal gate set, usually defined by the operations native to a given hardware platform. Most current synthesis algorithms are designed to synthesize towards a set of single qubit rotations and an additional entangling two qubit gate, such as CX, CZ, or the Molmer Sorensen gate. However, with the emergence of neutral atom based hardware and their native support for gates with more than two qubits, synthesis approaches tailored to these new gate sets become necessary. In this work, we present an approach to synthesize multi controlled phase gates using ZX calculus. By representing quantum circuits as graph like ZX diagrams, one can utilize the distinct graph structure of diagonal gates to identify multi controlled phase gates inherently present in some quantum circuits even if none were explicitly defined in the original circuit. We evaluate the approach on a wide range of benchmark circuits and compare them to the standard Qiskit synthesis regarding its circuit execution time for neutral atom based hardware with native support of multi controlled gates. Our results show possible advantages for current state of the art hardware and represent the first exact synthesis algorithm supporting arbitrary sized multi controlled phase gates.

  @inproceedings{staudacher2024multicontrolled,
      author = {Staudacher, Korbinian and Schmid, Ludwig and Zeiher, Johannes and Wille, Robert and Kranzlm\"uller, Dieter},
      title = {Multi-controlled Phase Gate Synthesis with ZX-calculus applied to Neutral Atom Hardware},
      year = {2024},
      booktitle = {Proceedings of the 21st International Conference on Quantum Physics and Logic, Buenos Aires, Argentina, July 15-19, 2024},
      editor = {D\'iaz-Caro, Alejandro and Zamdzhiev, Vladimir},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {406},
      pages = {96-116},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.406.5},
      urldate = {2024-03-16},
      link = {http://arxiv.org/abs/2403.10864},
      keywords = {Optimisation, Circuit Extraction, Automation, Applied, ZX-calculus},
      abstract = {Quantum circuit synthesis describes the process of converting arbitrary unitary operations into a gate sequence of a fixed universal gate set, usually defined by the operations native to a given hardware platform. Most current synthesis algorithms are designed to synthesize towards a set of single qubit rotations and an additional entangling two qubit gate, such as CX, CZ, or the Molmer Sorensen gate. However, with the emergence of neutral atom based hardware and their native support for gates with more than two qubits, synthesis approaches tailored to these new gate sets become necessary. In this work, we present an approach to synthesize multi controlled phase gates using ZX calculus. By representing quantum circuits as graph like ZX diagrams, one can utilize the distinct graph structure of diagonal gates to identify multi controlled phase gates inherently present in some quantum circuits even if none were explicitly defined in the original circuit. We evaluate the approach on a wide range of benchmark circuits and compare them to the standard Qiskit synthesis regarding its circuit execution time for neutral atom based hardware with native support of multi controlled gates. Our results show possible advantages for current state of the art hardware and represent the first exact synthesis algorithm supporting arbitrary sized multi controlled phase gates.},
      video = {https://www.youtube.com/watch?v=B1P6dcJrYfk}
  }
  

  Copy to Clipboard

• Procedurally Optimised ZX-Diagram Cutting for Efficient T-Decomposition in Classical Simulation
  Matthew Sutcliffe and Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings of the 21st International Conference on Quantum Physics and Logic, Buenos Aires, Argentina, July 15-19, 2024
  Keywords: Classical Simulation, Automation, ZX-calculus.

  A quantum circuit may be strongly classically simulated with the aid of ZX-calculus by decomposing its \(t\) T-gates into a sum of \(2^{\alpha t}\) classically computable stabiliser terms. In this paper, we introduce a general procedure to find an optimal pattern of vertex cuts in a ZX-diagram to maximise its T-count reduction at the cost of the fewest cuts. Rather than reducing a Clifford+T diagram based on a fixed routine of decomposing its T-gates directly (as is the conventional approach), we focus instead on taking advantage of certain patterns and structures common to such circuits to, in effect, design by automatic procedure an arrangement of spider decompositions that is optimised for the particular circuit. In short, this works by assigning weights to vertices based on how many T-like gates they are blocking from fusing/cancelling and then appropriately propagating these weights through any neighbours which are then blocking weighted vertices from fusing, and so on. Ultimately, this then provides a set of weightings on relevant nodes, which can then each be cut, starting from the highest weighted down. While this is a heuristic approach, we show that, for circuits small enough to verify, this method achieves the most optimal set of cuts possible \(71\%\) of the time. Furthermore, there is no upper bound for the efficiency achieved by this method, allowing, in principle, an effective decomposition efficiency \(\alpha\rightarrow0\) for highly structured circuits. Even applied to random pseudo-structured circuits (produced from CNOTs, phase gates, and Toffolis), we record the number of stabiliser terms required to reduce all T-gates, via our method as compared to that of the more conventional T-decomposition approaches (with \(\alpha\approx0.47\)), and show consistent improvements of orders of magnitude, with an effective efficiency \(0.1\lesssim\alpha\lesssim0.2\).

  @inproceedings{sutcliffe2024procedurally,
      author = {Sutcliffe, Matthew and Kissinger, Aleks},
      title = {{Procedurally Optimised ZX-Diagram Cutting for Efficient T-Decomposition in Classical Simulation}},
      year = {2024},
      booktitle = {Proceedings of the 21st International Conference on Quantum Physics and Logic, Buenos Aires, Argentina, July 15-19, 2024},
      editor = {D\'iaz-Caro, Alejandro and Zamdzhiev, Vladimir},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {406},
      pages = {63-78},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.406.3},
      urldate = {2024-03-16},
      link = {http://arxiv.org/abs/2403.10964},
      keywords = {Classical Simulation, Automation, ZX-calculus},
      abstract = {A quantum circuit may be strongly classically simulated with the aid of ZX-calculus by decomposing its $t$ T-gates into a sum of $2^{\alpha t}$ classically computable stabiliser terms. In this paper, we introduce a general procedure to find an optimal pattern of vertex cuts in a ZX-diagram to maximise its T-count reduction at the cost of the fewest cuts. Rather than reducing a Clifford+T diagram based on a fixed routine of decomposing its T-gates directly (as is the conventional approach), we focus instead on taking advantage of certain patterns and structures common to such circuits to, in effect, design by automatic procedure an arrangement of spider decompositions that is optimised for the particular circuit. In short, this works by assigning weights to vertices based on how many T-like gates they are blocking from fusing/cancelling and then appropriately propagating these weights through any neighbours which are then blocking weighted vertices from fusing, and so on. Ultimately, this then provides a set of weightings on relevant nodes, which can then each be cut, starting from the highest weighted down. While this is a heuristic approach, we show that, for circuits small enough to verify, this method achieves the most optimal set of cuts possible $71\%$ of the time. Furthermore, there is no upper bound for the efficiency achieved by this method, allowing, in principle, an effective decomposition efficiency $\alpha\rightarrow0$ for highly structured circuits. Even applied to random pseudo-structured circuits (produced from CNOTs, phase gates, and Toffolis), we record the number of stabiliser terms required to reduce all T-gates, via our method as compared to that of the more conventional T-decomposition approaches (with $\alpha\approx0.47$), and show consistent improvements of orders of magnitude, with an effective efficiency $0.1\lesssim\alpha\lesssim0.2$.},
      video = {https://www.youtube.com/watch?v=WP0ZVSOsOOM}
  }
  

  Copy to Clipboard

• Complete equational theories for classical and quantum Gaussian relations
  Robert I. Booth, Titouan Carette and Cole Comfort
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2403.10479
  Keywords: Continuous Variable, Completeness, Clifford Fragment, Category Theory, Qudits.

  We give generators and relations for the hypergraph props of Gaussian relations and positive affine Lagrangian relations. The former extends Gaussian probabilistic processes by completely-uninformative priors, and the latter extends Gaussian quantum mechanics with infinitely-squeezed states. These presentations are given by adding a generator to the presentation of real affine relations and of real affine Lagrangian relations which freely codiscards effects, as well as certain rotations. The presentation of positive affine Lagrangian relations provides a rigorous justification for many common yet informal calculations in the quantum physics literature involving infinite-squeezing. Our presentation naturally extends Menicucci et al.'s graph-theoretic representation of Gaussian quantum states with a representation for Gaussian transformations. We interpret the LOv-calculus, a diagrammatic calculus for reasoning about passive linear-optical quantum circuits in our presentation of positive affine Lagrangian relations. Moreover, we show how our presentation allows for additional optical operations such as active squeezing.

  @article{i.booth2024complete,
      author = {I. Booth, Robert and Carette, Titouan and Comfort, Cole},
      title = {{Complete equational theories for classical and quantum Gaussian relations}},
      year = {2024},
      journal = {arXiv preprint arXiv:2403.10479},
      urldate = {2024-03-15},
      link = {http://arxiv.org/abs/2403.10479},
      keywords = {Continuous Variable, Completeness, Clifford Fragment, Category Theory, Qudits},
      abstract = {We give generators and relations for the hypergraph props of Gaussian relations and positive affine Lagrangian relations. The former extends Gaussian probabilistic processes by completely-uninformative priors, and the latter extends Gaussian quantum mechanics with infinitely-squeezed states. These presentations are given by adding a generator to the presentation of real affine relations and of real affine Lagrangian relations which freely codiscards effects, as well as certain rotations.   The presentation of positive affine Lagrangian relations provides a rigorous justification for many common yet informal calculations in the quantum physics literature involving infinite-squeezing. Our presentation naturally extends Menicucci et al.'s graph-theoretic representation of Gaussian quantum states with a representation for Gaussian transformations. We interpret the LOv-calculus, a diagrammatic calculus for reasoning about passive linear-optical quantum circuits in our presentation of positive affine Lagrangian relations. Moreover, we show how our presentation allows for additional optical operations such as active squeezing.},
      video = {https://www.youtube.com/watch?v=Ar_H0ra-45w}
  }
  

  Copy to Clipboard

• Fast classical simulation of quantum circuits via parametric rewriting in the ZX-calculus
  Matthew Sutcliffe and Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2403.06777
  Keywords: Classical Simulation, Applied, Automation, ZX-calculus, Local Complementation.

  The ZX-calculus is an algebraic formalism that allows quantum computations to be simplified via a small number of simple graphical rewrite rules. Recently, it was shown that, when combined with a family of "sum-over-Cliffords" techniques, the ZX-calculus provides a powerful tool for classical simulation of quantum circuits. However, for several important classical simulation tasks, such as computing the probabilities associated with many measurement outcomes of a single quantum circuit, this technique results in reductions over many very similar diagrams, where much of the same computational work is repeated. In this paper, we show that the majority of this work can be shared across branches, by developing reduction strategies that can be run parametrically on diagrams with boolean free parameters. As parameters only need to be fixed after the bulk of the simplification work is already done, we show that it is possible to perform the final stage of classical simulation quickly utilising a high degree of GPU parallelism. Using these methods, we demonstrate speedups upwards of 100x for certain classical simulation tasks vs. the non-parametric approach.

  @article{sutcliffe2024fast,
      author = {Sutcliffe, Matthew and Kissinger, Aleks},
      title = {{Fast classical simulation of quantum circuits via parametric rewriting in the ZX-calculus}},
      year = {2024},
      journal = {arXiv preprint arXiv:2403.06777},
      urldate = {2024-03-11},
      link = {http://arxiv.org/abs/2403.06777},
      keywords = {Classical Simulation, Applied, Automation, ZX-calculus, Local Complementation},
      abstract = {The ZX-calculus is an algebraic formalism that allows quantum computations to be simplified via a small number of simple graphical rewrite rules. Recently, it was shown that, when combined with a family of "sum-over-Cliffords" techniques, the ZX-calculus provides a powerful tool for classical simulation of quantum circuits. However, for several important classical simulation tasks, such as computing the probabilities associated with many measurement outcomes of a single quantum circuit, this technique results in reductions over many very similar diagrams, where much of the same computational work is repeated. In this paper, we show that the majority of this work can be shared across branches, by developing reduction strategies that can be run parametrically on diagrams with boolean free parameters. As parameters only need to be fixed after the bulk of the simplification work is already done, we show that it is possible to perform the final stage of classical simulation quickly utilising a high degree of GPU parallelism. Using these methods, we demonstrate speedups upwards of 100x for certain classical simulation tasks vs. the non-parametric approach.},
      video = {https://www.youtube.com/watch?v=WP0ZVSOsOOM}
  }
  

  Copy to Clipboard

• A Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources and Detectors
  Nicolas Heurtel
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2402.17693
  Keywords: Photons, Completeness, ZX-Supported.

  Linear optical circuits can be used to manipulate the quantum states of photons as they pass through components including beam splitters and phase shifters. Those photonic states possess a particularly high level of expressiveness, as they reside within the bosonic Fock space, an infinite-dimensional Hilbert space. However, in the domain of linear optical quantum computation, these basic components may not be sufficient to efficiently perform all computations of interest, such as universal quantum computation. To address this limitation it is common to add auxiliary sources and detectors, which enable projections onto auxiliary photonic states and thus increase the versatility of the processes. In this paper, we introduce the \(\textbf{LO}_{fi}\)-calculus, a graphical language to reason on the infinite-dimensional bosonic Fock space with circuits composed of four core elements of linear optics: the phase shifter, the beam splitter, and auxiliary sources and detectors with bounded photon number. We present an equational theory that we prove to be complete: two \(\textbf{LO}_{fi}\)-circuits represent the same quantum process if and only if one can be transformed into the other with the rules of the \(\textbf{LO}_{fi}\)-calculus. We give a unique and compact universal form for such circuits.

  @article{heurtel2024complete,
      author = {Heurtel, Nicolas},
      title = {{A Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources and Detectors}},
      year = {2024},
      journal = {arXiv preprint arXiv:2402.17693},
      urldate = {2024-02-27},
      link = {http://arxiv.org/abs/2402.17693},
      keywords = {Photons, Completeness, ZX-Supported},
      abstract = {Linear optical circuits can be used to manipulate the quantum states of photons as they pass through components including beam splitters and phase shifters. Those photonic states possess a particularly high level of expressiveness, as they reside within the bosonic Fock space, an infinite-dimensional Hilbert space. However, in the domain of linear optical quantum computation, these basic components may not be sufficient to efficiently perform all computations of interest, such as universal quantum computation. To address this limitation it is common to add auxiliary sources and detectors, which enable projections onto auxiliary photonic states and thus increase the versatility of the processes. In this paper, we introduce the $\textbf{LO}_{fi}$-calculus, a graphical language to reason on the infinite-dimensional bosonic Fock space with circuits composed of four core elements of linear optics: the phase shifter, the beam splitter, and auxiliary sources and detectors with bounded photon number. We present an equational theory that we prove to be complete: two $\textbf{LO}_{fi}$-circuits represent the same quantum process if and only if one can be transformed into the other with the rules of the $\textbf{LO}_{fi}$-calculus. We give a unique and compact universal form for such circuits.},
      video = {https://www.youtube.com/watch?v=_0l1KjI0nfA}
  }
  

  Copy to Clipboard

• All graph state verification protocols are composably secure
  Léo Colisson, Damian Markham and Raja Yehia
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2402.01445
  Keywords: Scalable ZX, Graph States, Verification, Protocols, ZX-calculus, Applied.

  Graph state verification protocols allow multiple parties to share a graph state while checking that the state is honestly prepared, even in the presence of malicious parties. Since graph states are the starting point of numerous quantum protocols, it is crucial to ensure that graph state verification protocols can safely be composed with other protocols, this property being known as composable security. Previous works [YDK21] conjectured that such a property could not be proven within the abstract cryptography framework: we disprove this conjecture by showing that all graph state verification protocols can be turned into a composably secure protocol with respect to the natural functionality for graph state preparation. Moreover, we show that any unchanged graph state verification protocols can also be considered as composably secure for a slightly different, yet useful, functionality. Finally, we show that these two results are optimal, in the sense that any such generic result, considering arbitrary black-box protocols, must either modify the protocol or consider a different functionality. Along the way, we show a protocol to generalize entanglement swapping to arbitrary graph states that might be of independent interest.

  @article{colisson2024all,
      author = {Colisson, L{\'e}o and Markham, Damian and Yehia, Raja},
      title = {{All graph state verification protocols are composably secure}},
      year = {2024},
      journal = {arXiv preprint arXiv:2402.01445},
      urldate = {2024-02-02},
      link = {http://arxiv.org/abs/2402.01445},
      keywords = {Scalable ZX, Graph States, Verification, Protocols, ZX-calculus, Applied},
      abstract = {Graph state verification protocols allow multiple parties to share a graph state while checking that the state is honestly prepared, even in the presence of malicious parties. Since graph states are the starting point of numerous quantum protocols, it is crucial to ensure that graph state verification protocols can safely be composed with other protocols, this property being known as composable security. Previous works [YDK21] conjectured that such a property could not be proven within the abstract cryptography framework: we disprove this conjecture by showing that all graph state verification protocols can be turned into a composably secure protocol with respect to the natural functionality for graph state preparation. Moreover, we show that any unchanged graph state verification protocols can also be considered as composably secure for a slightly different, yet useful, functionality. Finally, we show that these two results are optimal, in the sense that any such generic result, considering arbitrary black-box protocols, must either modify the protocol or consider a different functionality.   Along the way, we show a protocol to generalize entanglement swapping to arbitrary graph states that might be of independent interest.},
      video = {https://www.youtube.com/watch?v=slZWkYTOKnI}
  }
  

  Copy to Clipboard

• Minimality in Finite-Dimensional ZW-Calculi
  Marc de Visme and Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2401.16225
  Keywords: Completeness, ZW-calculus, Qudits.

  The ZW-calculus is a graphical language capable of representing 2-dimensional quantum systems (qubit) through its diagrams, and manipulating them through its equational theory. We extend the formalism to accommodate finite dimensional Hilbert spaces beyond qubit systems. First we define a qudit version of the language, where all systems have the same arbitrary finite dimension d, and show that the provided equational theory is both complete -- i.e. semantical equivalence is entirely captured by the equations -- and minimal -- i.e. none of the equations are consequences of the others. We then extend the graphical language further to accommodate all finite dimensional Hilbert spaces at the same time. We again show the completeness of the provided equational theory.

  @article{devisme2024minimality,
      author = {de Visme, Marc and Vilmart, Renaud},
      title = {{Minimality in Finite-Dimensional ZW-Calculi}},
      year = {2024},
      journal = {arXiv preprint arXiv:2401.16225},
      urldate = {2024-01-29},
      link = {http://arxiv.org/abs/2401.16225},
      keywords = {Completeness, ZW-calculus, Qudits},
      abstract = {The ZW-calculus is a graphical language capable of representing 2-dimensional quantum systems (qubit) through its diagrams, and manipulating them through its equational theory. We extend the formalism to accommodate finite dimensional Hilbert spaces beyond qubit systems. First we define a qudit version of the language, where all systems have the same arbitrary finite dimension d, and show that the provided equational theory is both complete -- i.e. semantical equivalence is entirely captured by the equations -- and minimal -- i.e. none of the equations are consequences of the others. We then extend the graphical language further to accommodate all finite dimensional Hilbert spaces at the same time. We again show the completeness of the provided equational theory.},
      video = {https://www.youtube.com/watch?v=-lUqneUsRYk}
  }
  

  Copy to Clipboard

• Optimal compilation of parametrised quantum circuits
  John van de Wetering, Richie Yeung, Tuomas Laakkonen and Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2401.12877
  Keywords: Optimisation, Variational Circuits, ZX-calculus.

  Parametrised quantum circuits contain phase gates whose phase is determined by a classical algorithm prior to running the circuit on a quantum device. Such circuits are used in variational algorithms like QAOA and VQE. In order for these algorithms to be as efficient as possible it is important that we use the fewest number of parameters. We show that, while the general problem of minimising the number of parameters is NP-hard, when we restrict to circuits that are Clifford apart from parametrised phase gates and where each parameter is used just once, we can efficiently find the optimal parameter count. We show that when parameter transformations are required to be sufficiently well-behaved that the only rewrites that reduce parameters correspond to simple 'fusions'. Using this we find that a previous circuit optimisation strategy by some of the authors [Kissinger, van de Wetering. PRA (2019)] finds the optimal number of parameters. Our proof uses the ZX-calculus. We also prove that the standard rewrite rules of the ZX-calculus suffice to prove any equality between parametrised Clifford circuits.

  @article{vandewetering2024optimal,
      author = {van de Wetering, John and Yeung, Richie and Laakkonen, Tuomas and Kissinger, Aleks},
      title = {{Optimal compilation of parametrised quantum circuits}},
      year = {2024},
      journal = {arXiv preprint arXiv:2401.12877},
      urldate = {2024-01-23},
      link = {http://arxiv.org/abs/2401.12877},
      keywords = {Optimisation, Variational Circuits, ZX-calculus},
      abstract = {Parametrised quantum circuits contain phase gates whose phase is determined by a classical algorithm prior to running the circuit on a quantum device. Such circuits are used in variational algorithms like QAOA and VQE. In order for these algorithms to be as efficient as possible it is important that we use the fewest number of parameters. We show that, while the general problem of minimising the number of parameters is NP-hard, when we restrict to circuits that are Clifford apart from parametrised phase gates and where each parameter is used just once, we can efficiently find the optimal parameter count. We show that when parameter transformations are required to be sufficiently well-behaved that the only rewrites that reduce parameters correspond to simple 'fusions'. Using this we find that a previous circuit optimisation strategy by some of the authors [Kissinger, van de Wetering. PRA (2019)] finds the optimal number of parameters. Our proof uses the ZX-calculus. We also prove that the standard rewrite rules of the ZX-calculus suffice to prove any equality between parametrised Clifford circuits.},
      video = {https://www.youtube.com/watch?v=nhWeIdAXYyU}
  }
  

  Copy to Clipboard

• Graphical Symplectic Algebra
  Robert I. Booth, Titouan Carette and Cole Comfort
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2401.07914
  Keywords: Completeness, Category Theory, Scalable ZX, Qudits, Clifford Fragment.

  We give complete presentations for the dagger-compact props of affine Lagrangian and coisotropic relations over an arbitrary field. This provides a unified family of graphical languages for both affinely constrained classical mechanical systems, as well as odd-prime-dimensional stabiliser quantum circuits. To this end, we present affine Lagrangian relations by a particular class of undirected coloured graphs. In order to reason about composite systems, we introduce a powerful scalable notation where the vertices of these graphs are themselves coloured by graphs. In the setting of stabiliser quantum mechanics, this scalable notation gives an extremely concise description of graph states, which can be composed via ``phased spider fusion.'' Likewise, in the classical mechanical setting of electrical circuits, we show that impedance matrices for reciprocal networks are presented in essentially the same way.

  @article{i.booth2024graphical,
      author = {I. Booth, Robert and Carette, Titouan and Comfort, Cole},
      title = {{Graphical Symplectic Algebra}},
      year = {2024},
      journal = {arXiv preprint arXiv:2401.07914},
      urldate = {2024-01-15},
      link = {http://arxiv.org/abs/2401.07914},
      keywords = {Completeness, Category Theory, Scalable ZX, Qudits, Clifford Fragment},
      abstract = {We give complete presentations for the dagger-compact props of affine Lagrangian and coisotropic relations over an arbitrary field. This provides a unified family of graphical languages for both affinely constrained classical mechanical systems, as well as odd-prime-dimensional stabiliser quantum circuits. To this end, we present affine Lagrangian relations by a particular class of undirected coloured graphs. In order to reason about composite systems, we introduce a powerful scalable notation where the vertices of these graphs are themselves coloured by graphs. In the setting of stabiliser quantum mechanics, this scalable notation gives an extremely concise description of graph states, which can be composed via ``phased spider fusion.'' Likewise, in the classical mechanical setting of electrical circuits, we show that impedance matrices for reciprocal networks are presented in essentially the same way.},
      video = {https://www.youtube.com/watch?v=QJcEeZsL2S8}
  }
  

  Copy to Clipboard

• Differentiation of Linear Optical Circuits
  Giovanni de Felice and Christopher Cortlett
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2401.07997
  Keywords: Photons, Applied, Variational Circuits, ZX-Supported.

  Experimental setups based on linear optical circuits and single photon sources offer a promising platform for near-term quantum machine learning. However, current applications are all based on support vector machines and gradient-free optimization methods. Differentiating an optical circuit over a phase parameter poses difficulty because it results in an operator on the Fock space which is not unitary. In this paper, we show that the derivative of the expectation values of a linear optical circuit can be computed by sampling from a larger circuit, using one additional photon. In order to express the derivative in terms of expectation values, we develop a circuit extraction procedure based on unitary dilation. We end by showing that the full gradient of a universal programmable interferometer can be estimated using polynomially many queries to a boson sampling device. This is in contrast to the qubit setting, where exponentially many parameters are needed to cover the space of unitaries. Our algorithm enables applications of photonic technologies to machine learning, quantum chemistry and optimization, powered by gradient descent.

  @article{defelice2024differentiation,
      author = {de Felice, Giovanni and Cortlett, Christopher},
      title = {{Differentiation of Linear Optical Circuits}},
      year = {2024},
      journal = {arXiv preprint arXiv:2401.07997},
      urldate = {2024-01-15},
      link = {http://arxiv.org/abs/2401.07997},
      keywords = {Photons, Applied, Variational Circuits, ZX-Supported},
      abstract = {Experimental setups based on linear optical circuits and single photon sources offer a promising platform for near-term quantum machine learning. However, current applications are all based on support vector machines and gradient-free optimization methods. Differentiating an optical circuit over a phase parameter poses difficulty because it results in an operator on the Fock space which is not unitary. In this paper, we show that the derivative of the expectation values of a linear optical circuit can be computed by sampling from a larger circuit, using one additional photon. In order to express the derivative in terms of expectation values, we develop a circuit extraction procedure based on unitary dilation. We end by showing that the full gradient of a universal programmable interferometer can be estimated using polynomially many queries to a boson sampling device. This is in contrast to the qubit setting, where exponentially many parameters are needed to cover the space of unitaries. Our algorithm enables applications of photonic technologies to machine learning, quantum chemistry and optimization, powered by gradient descent.}
  }
  

  Copy to Clipboard

• [Video] ZXLive - An Interactive GUI for the ZX Calculus 🎥
  Razin Shaikh
  Show abstract ⇲ Show bibdata ⇲

  ZX seminar
  Keywords: ZX-calculus, Automation, PyZX.

  ZXLive is a user-friendly, interactive tool designed for reasoning with the ZX calculus. It offers a simple interface to draw ZX diagrams or import them from various file formats. Once you have your diagram, switch to proof mode where you can easily apply the ZX rules and construct proofs. The tool supports exporting proofs to Tikzit for adding it into papers. These proofs can also be saved as lemmas, which can be used later as rewrite rules in other proofs. With support for custom rewrites, you can add new rules to ZXLive that are relevant for your current project. Beyond the vanilla ZX calculus, ZXLive supports the generators and rewrite rules of ZH, ZW, and ZXW calculi. ZXLive is available as an open-source project on GitHub: https://github.com/Quantomatic/zxlive. Under the hood, it is powered by PyZX, which is an open-source python library for ZX. Along with being a useful tool for ZX practitioners, ZXLive is also a great educational tool for learning and experimenting with the ZX calculus.

  @misc{Shaikh2024Video,
      author = {Shaikh, Razin},
      title = {{ZXLive - An Interactive GUI for the ZX Calculus}},
      year = {2024},
      howpublished = {ZX seminar},
      urldate = {2024-01-09},
      url = {https://www.youtube.com/watch?v=J--c2q-KOc8},
      keywords = {ZX-calculus, Automation, PyZX},
      abstract = {ZXLive is a user-friendly, interactive tool designed for reasoning with the ZX calculus. It offers a simple interface to draw ZX diagrams or import them from various file formats. Once you have your diagram, switch to proof mode where you can easily apply the ZX rules and construct proofs. The tool supports exporting proofs to Tikzit for adding it into papers. These proofs can also be saved as lemmas, which can be used later as rewrite rules in other proofs. With support for custom rewrites, you can add new rules to ZXLive that are relevant for your current project. Beyond the vanilla ZX calculus, ZXLive supports the generators and rewrite rules of ZH, ZW, and ZXW calculi. 
  ZXLive is available as an open-source project on GitHub: https://github.com/Quantomatic/zxlive. Under the hood, it is powered by PyZX, which is an open-source python library for ZX. Along with being a useful tool for ZX practitioners, ZXLive is also a great educational tool for learning and experimenting with the ZX calculus.}
  }
  

  Copy to Clipboard

2023

• Nonunitary gates using measurements only
  Daniel Azses, Jonathan Ruhman and Eran Sela
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Phys. Rev. Lett.
  Keywords: MBQC, PyZX, ZX-calculus.

  Measurement-based quantum computation (MBQC) is a universal platform to realize unitary gates, only using measurements which act on a pre-prepared entangled resource state. By deforming the measurement bases, as well as the geometry of the resource state, we show that MBQC circuits always transmit and act on the input state but generally realize nonunitary logical gates. In contrast to the stabilizer formalism which is often used for unitary gates, we find that ZX calculus is an ideal computation method of these nonunitary gates. As opposed to unitary gates, nonunitary gates can not be applied with certainty, due to the randomness of quantum measurements. We maximize the success probability of realizing nonunitary gates, and discuss applications including imaginary time evolution, which we demonstrate on a noisy intermediate scale quantum device.

  @article{azses2023nonunitary,
      author = {Azses, Daniel and Ruhman, Jonathan and Sela, Eran},
      title = {{Nonunitary gates using measurements only}},
      year = {2024},
      journal = {Phys. Rev. Lett.},
      volume = {133},
      issue = {26},
      month = {Dec},
      pages = {260603},
      numpages = {8},
      publisher = {American Physical Society},
      doi = {10.1103/PhysRevLett.133.260603},
      urldate = {2023-12-28},
      link = {http://arxiv.org/abs/2312.17325},
      keywords = {MBQC, PyZX, ZX-calculus},
      abstract = {Measurement-based quantum computation (MBQC) is a universal platform to realize unitary gates, only using measurements which act on a pre-prepared entangled resource state. By deforming the measurement bases, as well as the geometry of the resource state, we show that MBQC circuits always transmit and act on the input state but generally realize nonunitary logical gates. In contrast to the stabilizer formalism which is often used for unitary gates, we find that ZX calculus is an ideal computation method of these nonunitary gates. As opposed to unitary gates, nonunitary gates can not be applied with certainty, due to the randomness of quantum measurements. We maximize the success probability of realizing nonunitary gates, and discuss applications including imaginary time evolution, which we demonstrate on a noisy intermediate scale quantum device.},
      video = {https://www.youtube.com/watch?v=-ccLsj4McpA}
  }
  

  Copy to Clipboard

• Graphical CSS Code Transformation Using ZX Calculus
  Sarah Meng Li
  Show abstract ⇲ Show bibdata ⇲

  University of Waterloo Masters Thesis
  Keywords: Error Correcting Codes, Clifford Fragment, ZX-calculus, Master Thesis.

  In this work, we present a generic approach to transform CSS codes by building upon their equivalence to phase-free ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic transformations between encoding maps associated with different codes. As a motivating example, we give explicit transformations between the Steane code and the quantum Reed-Muller code, since by switching between these two codes, one can obtain a fault-tolerant universal gate set. To this end, we propose a bidirectional rewrite rule to find a (not necessarily transversal) physical implementation for any logical ZX diagram in any CSS code. We then focus on two code transformation techniques: code morphing, a procedure that transforms a code while retaining its fault-tolerant gates, and gauge fixing, where complimentary codes can be obtained from a common subsystem code (e.g., the Steane and the quantum Reed-Muller codes from the J15, 1, 3, 3K code). We provide explicit graphical derivations for these techniques and show how ZX and graphical encoder maps relate several equivalent perspectives on these code-transforming operations

  @mastersthesis{Li2023Masters,
      author = {Li, Sarah Meng},
      title = {{Graphical CSS Code Transformation Using ZX Calculus}},
      year = {2023},
      school = {University of Waterloo},
      urldate = {2023-12-23},
      link = {https://uwspace.uwaterloo.ca/bitstream/handle/10012/20193/Li_SarahMeng.pdf?sequence=1&isAllowed=y},
      keywords = {Error Correcting Codes, Clifford Fragment, ZX-calculus, Master Thesis},
      abstract = {In this work, we present a generic approach to transform CSS codes by building upon their equivalence to phase-free ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic transformations between encoding maps associated with different codes. As a motivating example, we give explicit transformations between the Steane code and the quantum Reed-Muller code, since by switching between these two codes, one can obtain a fault-tolerant universal gate set. To this end, we propose a bidirectional rewrite rule to find a (not necessarily transversal) physical implementation for any logical ZX diagram in any CSS code. We then focus on two code transformation techniques: code morphing, a procedure that transforms a code while retaining its fault-tolerant gates, and gauge fixing, where complimentary codes can be obtained from a common subsystem code (e.g., the Steane and the quantum Reed-Muller codes from the J15, 1, 3, 3K code). We provide explicit graphical derivations for these techniques and show how ZX and graphical encoder maps relate several equivalent perspectives on these code-transforming operations}
  }
  

  Copy to Clipboard

• The geometry of quantum computing
  E. Ercolessi, R. Fioresi and T. Weber
  Show abstract ⇲ Show bibdata ⇲

  International Journal of Geometric Methods in Modern Physics
  Keywords: Frobenius algebras, Category Theory, Foundations, ZX-calculus.

  In this expository paper we present a brief introduction to the geometrical modeling of some quantum computing problems. After a brief introduction to establish the terminology, we focus on quantum information geometry and ZX-calculus, establishing a connection between quantum computing questions and quantum groups, i.e. Hopf algebras.

  @article{Ercolessi2023Geometry,
      author = {Ercolessi, E. and Fioresi, R. and Weber, T.},
      title = {The geometry of quantum computing},
      year = {2023},
      journal = {International Journal of Geometric Methods in Modern Physics},
      volume = {0},
      number = {0},
      pages = {2440011},
      doi = {10.1142/S0219887824400115},
      urldate = {2023-12-22},
      link = {http://arxiv.org/abs/2312.14807},
      keywords = {Frobenius algebras, Category Theory, Foundations, ZX-calculus},
      abstract = {In this expository paper we present a brief introduction to the geometrical modeling of some quantum computing problems. After a brief introduction to establish the terminology, we focus on quantum information geometry and ZX-calculus, establishing a connection between quantum computing questions and quantum groups, i.e. Hopf algebras.}
  }
  

  Copy to Clipboard

• Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus
  Jordi Riu, Jan Nogué, Gerard Vilaplana, Artur Garcia-Saez and Marta P. Estarellas
  Show abstract ⇲ Show bibdata ⇲

  Quantum
  Keywords: Optimisation, Automation, PyZX, ZX-calculus.

  We propose a novel Reinforcement Learning (RL) method for optimizing quantum circuits using the graph-like representation of a ZX-diagram. The agent, trained using the Proximal Policy Optimization (PPO) algorithm, employs Graph Neural Networks to approximate the policy and value functions. We test our approach for two differentiated circuit size regimes of increasing relevance, and benchmark it against the best-performing ZX-calculus based algorithm of the PyZX library, a state-of-the-art tool for circuit optimization in the field. We demonstrate that the agent can generalize the strategies learned from 5-qubit circuits to 20-qubit circuits of up to 450 Clifford gates, with enhanced compressions with respect to its counterpart while remaining competitive in terms of computational performance.

  @article{riu2023reinforcement,
      author = {Riu, Jordi and Nogu{\'e}, Jan and Vilaplana, Gerard and Garcia-Saez, Artur and P. Estarellas, Marta},
      title = {{Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus}},
      year = {2025},
      journal = {{Quantum}},
      volume = {9},
      month = {5},
      pages = {1758},
      publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
      issn = {2521-327X},
      doi = {10.22331/q-2025-05-28-1758},
      urldate = {2023-12-18},
      link = {http://arxiv.org/abs/2312.11597},
      keywords = {Optimisation, Automation, PyZX, ZX-calculus},
      abstract = {We propose a novel Reinforcement Learning (RL) method for optimizing quantum circuits using the graph-like representation of a ZX-diagram. The agent, trained using the Proximal Policy Optimization (PPO) algorithm, employs Graph Neural Networks to approximate the policy and value functions. We test our approach for two differentiated circuit size regimes of increasing relevance, and benchmark it against the best-performing ZX-calculus based algorithm of the PyZX library, a state-of-the-art tool for circuit optimization in the field. We demonstrate that the agent can generalize the strategies learned from 5-qubit circuits to 20-qubit circuits of up to 450 Clifford gates, with enhanced compressions with respect to its counterpart while remaining competitive in terms of computational performance.}
  }
  

  Copy to Clipboard

• Towards Efficient Verification of Dynamic Quantum Circuits using ZX-Calculus
  Liam Hurwitz
  Show abstract ⇲ Show bibdata ⇲

  University of Bremen Masters Thesis
  Keywords: Verification, Automation, PyZX, Applied, ZX-calculus, Master Thesis.

  This thesis conducts an experimental evaluation of state-of-the-art equivalence checkers for quantum circuits. The primary objective is to provide empirical data that can be used to improve these tools by critically examining their performance and accuracy. Equivalence checking methods such as ZX-Calculus and Quantum Multi Valued Decision Diagrams (QMDD) were assessed in terms of their effectiveness and efficiency in verifying the equivalence of static and dynamic quantum circuits. By analyzing the strengths and weaknesses of these tools, the study provides in- sights for enhancing their performance and developing better methodologies for quantum circuit equivalence checking. The significance of this research lies in addressing the verification gap of quantum circuits, particularly for dynamic quantum circuits. As the number of qubits in quantum circuits increases, it becomes increasingly important to develop efficient and accurate tools for verifying the equivalence of quantum circuits. Recent developments, such as the introduction of the IBM Condor, a 1,121 qubit quantum processor, further emphasize the need for memory-efficient equivalence checking of quantum circuits.

  @mastersthesis{Hurwitz2024Towards,
      author = {Hurwitz, Liam},
      title = {{Towards Efficient Verification of Dynamic Quantum Circuits using ZX-Calculus}},
      year = {2023},
      school = {University of Bremen},
      urldate = {2023-12-11},
      link = {https://nc.uni-bremen.de/index.php/s/LQG23EGRRpXp2Ds},
      keywords = {Verification, Automation, PyZX, Applied, ZX-calculus, Master Thesis},
      abstract = {This thesis conducts an experimental evaluation of state-of-the-art equivalence checkers for quantum circuits. The primary objective is to provide empirical data that can be used to improve these tools by critically examining their performance and accuracy. Equivalence checking methods such as ZX-Calculus and Quantum Multi Valued Decision Diagrams (QMDD) were assessed in terms of their effectiveness and efficiency in verifying the equivalence of static and dynamic quantum circuits. By analyzing the strengths and weaknesses of these tools, the study provides in- sights for enhancing their performance and developing better methodologies for quantum circuit equivalence checking. The significance of this research lies in addressing the verification gap of quantum circuits, particularly for dynamic quantum circuits. As the number of qubits in quantum circuits increases, it becomes increasingly important to develop efficient and accurate tools for verifying the equivalence of quantum circuits. Recent developments, such as the introduction of the IBM Condor, a 1,121 qubit quantum processor, further emphasize the need for memory-efficient equivalence checking of quantum circuits.}
  }
  

  Copy to Clipboard

• Quantum Picturalism: Learning Quantum Theory in High School
  Selma Dündar-Coecke, Lia Yeh, Caterina Puca, Sieglinde M. -L. Pfaendler, Muhammad Hamza Waseem, Thomas Cervoni, Aleks Kissinger, Stefano Gogioso and Bob Coecke
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  2023 IEEE International Conference on Quantum Computing and Engineering (QCE), 2023, pp. 21-32
  Keywords: ZX-calculus.

  Quantum theory is often regarded as challenging to learn and teach, with advanced mathematical prerequisites ranging from complex numbers and probability theory to matrix multiplication, vector space algebra and symbolic manipulation within the Hilbert space formalism. It is traditionally considered an advanced undergraduate or graduate-level subject. In this work, we challenge the conventional view by proposing "Quantum Picturalism" as a new approach to teaching the fundamental concepts of quantum theory and computation. We establish the foundations and methodology for an ongoing educational experiment to investigate the question "From what age can students learn quantum theory if taught using a diagrammatic approach?". We anticipate that the primary benefit of leveraging such a diagrammatic approach, which is conceptually intuitive yet mathematically rigorous, will be eliminating some of the most daunting barriers to teaching and learning this subject while enabling young learners to reason proficiently about high-level problems. We posit that transitioning from symbolic presentations to pictorial ones will increase the appeal of STEM education, attracting more diverse audience.

  @article{dundar-coecke2023quantum,
      author = {D{\"u}ndar-Coecke, Selma and Yeh, Lia and Puca, Caterina and M. -L. Pfaendler, Sieglinde and Hamza Waseem, Muhammad and Cervoni, Thomas and Kissinger, Aleks and Gogioso, Stefano and Coecke, Bob},
      title = {{Quantum Picturalism: Learning Quantum Theory in High School}},
      year = {2023},
      journal = {2023 IEEE International Conference on Quantum Computing and Engineering (QCE), 2023, pp. 21-32},
      volume = {3},
      number = {},
      pages = {21--32},
      doi = {10.1109/QCE57702.2023.20321},
      urldate = {2023-12-06},
      link = {http://arxiv.org/abs/2312.03653},
      keywords = {ZX-calculus},
      abstract = {Quantum theory is often regarded as challenging to learn and teach, with advanced mathematical prerequisites ranging from complex numbers and probability theory to matrix multiplication, vector space algebra and symbolic manipulation within the Hilbert space formalism. It is traditionally considered an advanced undergraduate or graduate-level subject.   In this work, we challenge the conventional view by proposing "Quantum Picturalism" as a new approach to teaching the fundamental concepts of quantum theory and computation. We establish the foundations and methodology for an ongoing educational experiment to investigate the question "From what age can students learn quantum theory if taught using a diagrammatic approach?". We anticipate that the primary benefit of leveraging such a diagrammatic approach, which is conceptually intuitive yet mathematically rigorous, will be eliminating some of the most daunting barriers to teaching and learning this subject while enabling young learners to reason proficiently about high-level problems. We posit that transitioning from symbolic presentations to pictorial ones will increase the appeal of STEM education, attracting more diverse audience.},
      video = {https://www.youtube.com/watch?v=Je2I-Z74p7k}
  }
  

  Copy to Clipboard

• Causal flow preserving optimisation of quantum circuits in the ZX-calculus
  Calum Holker
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2312.02793
  Keywords: Optimisation, MBQC, gflow, Local Complementation, PyZX, Automation, ZX-calculus.

  Optimising quantum circuits to minimise resource usage is crucial, particularly in the context of near term hardware which is limited by quantum volume. This paper introduces an optimisation algorithm which aims to minimise non-Clifford gate count and two-qubit gate count by building on ZX-calculus-based strategies. By translating a circuit into a ZX-diagram it can be simplified before being extracted back into a circuit. I assert that simplifications preserve a graph-theoretic property called causal flow. This has the advantage that qubit lines are well defined throughout, permitting a trivial extraction procedure and in turn enabling the calculation of an individual transformation's impact on the resulting circuit. A general procedure for a decision strategy is introduced, inspired by an existing heuristic based method. Both phase teleportation and the neighbour unfusion rule are generalised. In particular, allowing unfusion of multiple neighbours is shown to lead to significant improvements in optimisation. When run on a set of benchmark circuits, the algorithm developed reduces the two-qubit gate count by an average of 19.6%, beating both the previous best ZX-based strategy (14.2%) and non-ZX strategy (18.9%). This lays a foundation for multiple avenues of improvement. A particularly effective strategy for optimising QFT circuits is also noted, resulting in exactly one two-qubit gate per non-Clifford gate.

  @article{holker2023causal,
      author = {Holker, Calum},
      title = {{Causal flow preserving optimisation of quantum circuits in the ZX-calculus}},
      year = {2023},
      journal = {arXiv preprint arXiv:2312.02793},
      urldate = {2023-12-05},
      link = {http://arxiv.org/abs/2312.02793},
      keywords = {Optimisation, MBQC, gflow, Local Complementation, PyZX, Automation, ZX-calculus},
      abstract = {Optimising quantum circuits to minimise resource usage is crucial, particularly in the context of near term hardware which is limited by quantum volume. This paper introduces an optimisation algorithm which aims to minimise non-Clifford gate count and two-qubit gate count by building on ZX-calculus-based strategies. By translating a circuit into a ZX-diagram it can be simplified before being extracted back into a circuit. I assert that simplifications preserve a graph-theoretic property called causal flow. This has the advantage that qubit lines are well defined throughout, permitting a trivial extraction procedure and in turn enabling the calculation of an individual transformation's impact on the resulting circuit. A general procedure for a decision strategy is introduced, inspired by an existing heuristic based method. Both phase teleportation and the neighbour unfusion rule are generalised. In particular, allowing unfusion of multiple neighbours is shown to lead to significant improvements in optimisation. When run on a set of benchmark circuits, the algorithm developed reduces the two-qubit gate count by an average of 19.6%, beating both the previous best ZX-based strategy (14.2%) and non-ZX strategy (18.9%). This lays a foundation for multiple avenues of improvement. A particularly effective strategy for optimising QFT circuits is also noted, resulting in exactly one two-qubit gate per non-Clifford gate.},
      video = {https://www.youtube.com/watch?v=9wO_-QcSAaM}
  }
  

  Copy to Clipboard

• Optimizing ZX-Diagrams with Deep Reinforcement Learning
  Maximilian Nägele and Florian Marquardt
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Machine Learning: Science and Technology
  Keywords: Optimisation, Automation, ZX-calculus.

  ZX-diagrams are a powerful graphical language for the description of quantum processes with applications in fundamental quantum mechanics, quantum circuit optimization, tensor network simulation, and many more. The utility of ZX-diagrams relies on a set of local transformation rules that can be applied to them without changing the underlying quantum process they describe. These rules can be exploited to optimize the structure of ZX-diagrams for a range of applications. However, finding an optimal sequence of transformation rules is generally an open problem. In this work, we bring together ZX-diagrams with reinforcement learning, a machine learning technique designed to discover an optimal sequence of actions in a decision-making problem and show that a trained reinforcement learning agent can significantly outperform other optimization techniques like a greedy strategy or simulated annealing. The use of graph neural networks to encode the policy of the agent enables generalization to diagrams much bigger than seen during the training phase.

  @article{nagele2023optimizing,
      author = {N{\"a}gele, Maximilian and Marquardt, Florian},
      title = {{Optimizing ZX-Diagrams with Deep Reinforcement Learning}},
      year = {2024},
      journal = {Machine Learning: Science and Technology},
      volume = {5},
      number = {3},
      month = {9},
      doi = {10.1088/2632-2153/ad76f7},
      urldate = {2023-11-30},
      link = {http://arxiv.org/abs/2311.18588},
      keywords = {Optimisation, Automation, ZX-calculus},
      abstract = {ZX-diagrams are a powerful graphical language for the description of quantum processes with applications in fundamental quantum mechanics, quantum circuit optimization, tensor network simulation, and many more. The utility of ZX-diagrams relies on a set of local transformation rules that can be applied to them without changing the underlying quantum process they describe. These rules can be exploited to optimize the structure of ZX-diagrams for a range of applications. However, finding an optimal sequence of transformation rules is generally an open problem. In this work, we bring together ZX-diagrams with reinforcement learning, a machine learning technique designed to discover an optimal sequence of actions in a decision-making problem and show that a trained reinforcement learning agent can significantly outperform other optimization techniques like a greedy strategy or simulated annealing. The use of graph neural networks to encode the policy of the agent enables generalization to diagrams much bigger than seen during the training phase.},
      video = {https://www.youtube.com/watch?v=jVu-7MBImvs}
  }
  

  Copy to Clipboard

• VyZX: Formal Verification of a Graphical Quantum Language
  Adrian Lehmann, Ben Caldwell, Bhakti Shah and Robert Rand
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2311.11571
  Keywords: Verification, Automation, ZX-calculus, Category Theory.

  Mathematical representations of graphs often resemble adjacency matrices or lists, representations that facilitate whiteboard reasoning and algorithm design. In the realm of proof assistants, inductive representations effectively define semantics for formal reasoning. This highlights a gap where algorithm design and proof assistants require a fundamentally different structure of graphs, particularly for process theories which represent programs using graphs. To address this gap, we present VyZX, a verified library for reasoning about inductively defined graphical languages. These inductive constructs arise naturally from category theory definitions. A key goal for VyZX is to Verify the ZX-calculus, a graphical language for reasoning about quantum computation. The ZX-calculus comes with a collection of diagrammatic rewrite rules that preserve the graph's semantic interpretation. We show how inductive graphs in VyZX are used to prove the correctness of the ZX-calculus rewrite rules and apply them in practice using standard proof assistant techniques. VyZX integrates easily with the proof engineer's workflow through visualization and automation.

  @article{lehmann2023vyzx,
      author = {Lehmann, Adrian and Caldwell, Ben and Shah, Bhakti and Rand, Robert},
      title = {{VyZX: Formal Verification of a Graphical Quantum Language}},
      year = {2023},
      journal = {arXiv preprint arXiv:2311.11571},
      urldate = {2023-11-20},
      link = {http://arxiv.org/abs/2311.11571},
      keywords = {Verification, Automation, ZX-calculus, Category Theory},
      abstract = {Mathematical representations of graphs often resemble adjacency matrices or lists, representations that facilitate whiteboard reasoning and algorithm design. In the realm of proof assistants, inductive representations effectively define semantics for formal reasoning. This highlights a gap where algorithm design and proof assistants require a fundamentally different structure of graphs, particularly for process theories which represent programs using graphs. To address this gap, we present VyZX, a verified library for reasoning about inductively defined graphical languages. These inductive constructs arise naturally from category theory definitions. A key goal for VyZX is to Verify the ZX-calculus, a graphical language for reasoning about quantum computation. The ZX-calculus comes with a collection of diagrammatic rewrite rules that preserve the graph's semantic interpretation. We show how inductive graphs in VyZX are used to prove the correctness of the ZX-calculus rewrite rules and apply them in practice using standard proof assistant techniques. VyZX integrates easily with the proof engineer's workflow through visualization and automation.},
      video = {https://www.youtube.com/watch?v=5cwd9u8jivo}
  }
  

  Copy to Clipboard

• Minimal Equational Theories for Quantum Circuits
  Alexandre Clément, Noé Delorme and Simon Perdrix
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2311.07476
  Keywords: ZX-Supported, Completeness, Category Theory, Mixed States.

  We introduce the first minimal and complete equational theory for quantum circuits. Hence, we show that any true equation on quantum circuits can be derived from simple rules, all of them being standard except a novel but intuitive one which states that a multi-control \(2\pi\) rotation is nothing but the identity. Our work improves on the recent complete equational theories for quantum circuits, by getting rid of several rules including a fairly unpractical one. One of our main contributions is to prove the minimality of the equational theory, i.e. none of the rules can be derived from the other ones. More generally, we demonstrate that any complete equational theory on quantum circuits (when all gates are unitary) requires rules acting on an unbounded number of qubits. Finally, we also simplify the complete equational theories for quantum circuits with ancillary qubits and/or qubit discarding.

  @article{clement2023minimal,
      author = {Cl{\'e}ment, Alexandre and Delorme, No{\'e} and Perdrix, Simon},
      title = {{Minimal Equational Theories for Quantum Circuits}},
      year = {2023},
      journal = {arXiv preprint arXiv:2311.07476},
      urldate = {2023-11-13},
      link = {http://arxiv.org/abs/2311.07476},
      keywords = {ZX-Supported, Completeness, Category Theory, Mixed States},
      abstract = {We introduce the first minimal and complete equational theory for quantum circuits. Hence, we show that any true equation on quantum circuits can be derived from simple rules, all of them being standard except a novel but intuitive one which states that a multi-control $2\pi$ rotation is nothing but the identity. Our work improves on the recent complete equational theories for quantum circuits, by getting rid of several rules including a fairly unpractical one. One of our main contributions is to prove the minimality of the equational theory, i.e. none of the rules can be derived from the other ones. More generally, we demonstrate that any complete equational theory on quantum circuits (when all gates are unitary) requires rules acting on an unbounded number of qubits. Finally, we also simplify the complete equational theories for quantum circuits with ancillary qubits and/or qubit discarding.},
      video = {https://www.youtube.com/watch?v=3q8eqihdtTs}
  }
  

  Copy to Clipboard

• Enriching Diagrams with Algebraic Operations
  Alejandro Villoria, Henning Basold and Alfons Laarman
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Foundations of Software Science and Computation Structures
  Keywords: Category Theory, Mixed States, ZX-calculus.

  In this paper, we extend diagrammatic reasoning in monoidal categories with algebraic operations and equations. We achieve this by considering monoidal categories that are enriched in the category of Eilenberg-Moore algebras for a monad. Under the condition that this monad is monoidal and affine, we construct an adjunction between symmetric monoidal categories and symmetric monoidal categories enriched over algebras for the monad. This allows us to devise an extension, and its semantics, of the ZX-calculus with probabilistic choices by freely enriching over convex algebras, which are the algebras of the finite distribution monad. We show how this construction can be used for diagrammatic reasoning of noise in quantum systems.

  @inproceedings{10.1007/978-3-031-57228-9_7,
      author = {Villoria, Alejandro and Basold, Henning and Laarman, Alfons},
      title = {Enriching Diagrams with Algebraic Operations},
      year = {2024},
      booktitle = {Foundations of Software Science and Computation Structures},
      editor = {Kobayashi, Naoki
  and Worrell, James},
      pages = {121--143},
      publisher = {Springer Nature Switzerland},
      address = {Cham},
      isbn = {978-3-031-57228-9},
      doi = {10.1007/978-3-031-57228-9_7},
      urldate = {2023-10-17},
      link = {http://arxiv.org/abs/2310.11288},
      keywords = {Category Theory, Mixed States, ZX-calculus},
      abstract = {In this paper, we extend diagrammatic reasoning in monoidal categories with algebraic operations and equations. We achieve this by considering monoidal categories that are enriched in the category of Eilenberg-Moore algebras for a monad. Under the condition that this monad is monoidal and affine, we construct an adjunction between symmetric monoidal categories and symmetric monoidal categories enriched over algebras for the monad. This allows us to devise an extension, and its semantics, of the ZX-calculus with probabilistic choices by freely enriching over convex algebras, which are the algebras of the finite distribution monad. We show how this construction can be used for diagrammatic reasoning of noise in quantum systems.},
      video = {https://www.youtube.com/watch?v=yJCaEdw_Ots}
  }
  

  Copy to Clipboard

• Flexible entangled state generation in linear optics
  Brendan Pankovich, Alex Neville, Angus Kan, Srikrishna Omkar, Kwok Ho Wan and Kamil Brádler
  Show abstract ⇲ Show bibdata ⇲

  Phys. Rev. A
  Keywords: ZX-calculus, Graph States, Photons, Applied.

  Fault-tolerant quantum computation can be achieved by creating constant-sized, entangled resource states and performing entangling measurements on subsets of their qubits. Linear optical quantum computers can be designed based on this approach, even though entangling operations at the qubit level are non-deterministic in this platform. Probabilistic generation and measurement of entangled states must be pushed beyond the required threshold by some combination of scheme optimisation, introduction of redundancy and auxiliary state assistance. We report progress in each of these areas. We explore multi-qubit fusion measurements on dual-rail photonic qubits and their role in measurement-based resource state generation, showing that it is possible to boost the success probability of photonic GHZ state analysers with single photon auxiliary states. By incorporating generators of basic entangled "seed" states, we provide a method that simplifies the process of designing and optimising generators of complex, encoded resource states by establishing links to ZX diagrams.

  @article{pankovich2023flexible,
      author = {Pankovich, Brendan and Neville, Alex and Kan, Angus and Omkar, Srikrishna and Ho Wan, Kwok and Br{\'a}dler, Kamil},
      title = {{Flexible entangled state generation in linear optics}},
      year = {2024},
      journal = {Phys. Rev. A},
      volume = {110},
      issue = {3},
      month = {Sep},
      pages = {032402},
      numpages = {17},
      publisher = {American Physical Society},
      doi = {10.1103/PhysRevA.110.032402},
      urldate = {2023-10-10},
      link = {http://arxiv.org/abs/2310.06832},
      keywords = {ZX-calculus, Graph States, Photons, Applied},
      abstract = {Fault-tolerant quantum computation can be achieved by creating constant-sized, entangled resource states and performing entangling measurements on subsets of their qubits. Linear optical quantum computers can be designed based on this approach, even though entangling operations at the qubit level are non-deterministic in this platform. Probabilistic generation and measurement of entangled states must be pushed beyond the required threshold by some combination of scheme optimisation, introduction of redundancy and auxiliary state assistance. We report progress in each of these areas. We explore multi-qubit fusion measurements on dual-rail photonic qubits and their role in measurement-based resource state generation, showing that it is possible to boost the success probability of photonic GHZ state analysers with single photon auxiliary states. By incorporating generators of basic entangled "seed" states, we provide a method that simplifies the process of designing and optimising generators of complex, encoded resource states by establishing links to ZX diagrams.}
  }
  

  Copy to Clipboard

• Completeness of qufinite ZXW calculus, a graphical language for mixed-dimensional quantum computing
  Quanlong Wang and Boldizsár Poór
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2309.13014
  Keywords: ZW-calculus, ZX-calculus, Qudits, Completeness.

  Finite-dimensional quantum theory serves as the theoretical foundation for quantum information and computation based on 2-dimensional qubits, d-dimensional qudits, and their interactions. The qufinite ZX calculus has been used as a framework for mixed-dimensional quantum computing; however, it lacked the crucial property of completeness, which ensures that the calculus incorporates a set of rules rich enough to prove any equation. The ZXW calculus is a complete language for qudit quantum computing with applications previously unreachable solely with the ZX or ZW calculus. In this paper, we introduce the qufinite ZXW calculus, a unification of all qudit ZXW calculi in a single framework for mixed-dimensional quantum computing. We provide a set of rewrite rules and a unique normal form that make the calculus complete for finite-dimensional quantum theory. This work paves the way for the optimization of mixed dimensional circuits and tensor networks appearing in different areas of quantum computing including quantum chemistry, compilation, and quantum many-body systems.

  @article{wang2023completeness,
      author = {Wang, Quanlong and Po{\'o}r, Boldizs{\'a}r},
      title = {{Completeness of qufinite ZXW calculus, a graphical language for mixed-dimensional quantum computing}},
      year = {2023},
      journal = {arXiv preprint arXiv:2309.13014},
      urldate = {2023-09-22},
      link = {http://arxiv.org/abs/2309.13014},
      keywords = {ZW-calculus, ZX-calculus, Qudits, Completeness},
      abstract = {Finite-dimensional quantum theory serves as the theoretical foundation for quantum information and computation based on 2-dimensional qubits, d-dimensional qudits, and their interactions. The qufinite ZX calculus has been used as a framework for mixed-dimensional quantum computing; however, it lacked the crucial property of completeness, which ensures that the calculus incorporates a set of rules rich enough to prove any equation. The ZXW calculus is a complete language for qudit quantum computing with applications previously unreachable solely with the ZX or ZW calculus. In this paper, we introduce the qufinite ZXW calculus, a unification of all qudit ZXW calculi in a single framework for mixed-dimensional quantum computing. We provide a set of rewrite rules and a unique normal form that make the calculus complete for finite-dimensional quantum theory. This work paves the way for the optimization of mixed dimensional circuits and tensor networks appearing in different areas of quantum computing including quantum chemistry, compilation, and quantum many-body systems.},
      video = {https://www.youtube.com/watch?v=AhEEOqpzADY}
  }
  

  Copy to Clipboard

• Reinforcement Learning based Circuit Compilation via ZX-calculus
  Jan Nogué Gómez
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Universitat de Barcelona Masters Thesis
  Keywords: ZX-Calculus, Automation, PyZX, Optimisation, Master Thesis.

  ZX-calculus is a formalism that can be used for quantum circuit compilation and optimization. We developed a Reinforcement Learning approach for enhanced circuit optimization via the ZX-diagram graph representation of the quantum circuit. The agent is trained using the well-established Proximal Policy Optimization (PPO) algorithm, and it uses Conditional Action Trees to perform Invalid Action Masking to reduce the space of actions available to the agent and speed up its training. Additionally, we also design and implement a Genetic Algorithm for the same task. Both the genetic algorithm and the most widely used ZX-calculus-based library for circuit optimization, the PyZX library, are used to benchmark our RL approach. We find our RL algorithm to be competitive against both approaches, but further exploration is required.

  @mastersthesis{gomez2023masters,
      author = {G{\'o}mez, Jan Nogu{\'e}},
      title = {{Reinforcement Learning based Circuit Compilation via ZX-calculus}},
      year = {2023},
      school = {Universitat de Barcelona},
      urldate = {2023-08-28},
      link = {https://diposit.ub.edu/dspace/bitstream/2445/202911/1/Memoria_TFM-JanNogue.pdf},
      keywords = {ZX-Calculus, Automation, PyZX, Optimisation, Master Thesis},
      abstract = {ZX-calculus is a formalism that can be used for quantum circuit compilation and optimization. We developed a Reinforcement Learning approach for enhanced circuit optimization via the ZX-diagram graph representation of the quantum circuit. The agent is trained using the well-established Proximal Policy Optimization (PPO) algorithm, and it uses Conditional Action Trees to perform Invalid Action Masking to reduce the space of actions available to the agent and speed up its training. Additionally, we also design and implement a Genetic Algorithm for the same task. Both the genetic algorithm and the most widely used ZX-calculus-based library for circuit optimization, the PyZX library, are used to benchmark our RL approach. We find our RL algorithm to be competitive against both approaches, but further exploration is required.},
      video = {https://www.youtube.com/watch?v=PwqKvMNVzj0}
  }
  

  Copy to Clipboard

• Teaching small transformers to rewrite ZX diagrams
  Richie Yeung, Konstantinos Meichanetzidis, Alexandre Krajenbrink and François Charton
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  MathAI submission
  Keywords: Optimisation, Automation, ZX-calculus.

  ZX calculus is a graphical language for reasoning about linear maps. Maps are represented as graphs, and reasoning amounts to graph rewrites. The main applications of ZX calculus are in quantum computation. We train small transformers to simplify ZX graphs, i.e. perform resource optimisation of quantum circuits. Preliminary experiments show that transformers can be trained to simplify CNOT and Clifford circuits with high accuracy. These are the simplest kinds of ZX graphs, in the sense that there exists an efficient rewrite strategy. We also show evidence that transformers learn to simplify the more complex Clifford+T graphs, for which in general there does not exist an efficient simplification algorithm.

  @article{yeung2023teaching,
      author = {Yeung, Richie and Meichanetzidis, Konstantinos and Krajenbrink, Alexandre and Charton, Fran{\c{c}}ois},
      title = {{Teaching small transformers to rewrite ZX diagrams}},
      year = {2024},
      journal = {MathAI submission},
      urldate = {2023-08-28},
      link = {https://mathai2023.github.io/papers/34.pdf},
      keywords = {Optimisation, Automation, ZX-calculus},
      abstract = {ZX calculus is a graphical language for reasoning about linear maps. Maps are represented as graphs, and reasoning amounts to graph rewrites. The main applications of ZX calculus are in quantum computation. We train small transformers to simplify ZX graphs, i.e. perform resource optimisation of quantum circuits. Preliminary experiments show that transformers can be trained to simplify CNOT and Clifford circuits with high accuracy. These are the simplest kinds of ZX graphs, in the sense that there exists an efficient rewrite strategy. We also show evidence that transformers learn to simplify the more complex Clifford+T graphs, for which in general there does not exist an efficient simplification algorithm.},
      video = {https://www.youtube.com/watch?v=gW_ZzRoIUMU}
  }
  

  Copy to Clipboard

• Fault-tolerant complexes
  Hector Bombin, Chris Dawson, Terry Farrelly, Yehua Liu, Naomi Nickerson, Mihir Pant, Fernando Pastawski and Sam Roberts
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2308.07844
  Keywords: Error Correcting Codes, Lattice Surgery, Automation, Surface Code, Applied, ZX-calculus.

  Fault-tolerant complexes describe surface-code fault-tolerant protocols from a single geometric object. We first introduce fusion complexes that define a general family of fusion-based quantum computing (FBQC) fault-tolerant quantum protocols based on surface codes. We show that any 3-dimensional cell complex where each edge has four incident faces gives a valid fusion complex. This construction enables an automated search for fault tolerance schemes, allowing us to identify 627 examples within a moderate search time. We implement this using the open-source software tool Gavrog and present threshold results for a variety of schemes, finding fusion networks with higher erasure and Pauli thresholds than those existing in the literature. We then define more general structures we call fault-tolerant complexes that provide a homological description of fault tolerance from a large family of low-level error models, which include circuit-based computation, floquet-based computation, and FBQC with multi-qubit measurements. This extends the applicability of homological descriptions of fault tolerance, and enables the generation of many new schemes which have not been previously identified. We also define families of fault-tolerant complexes for color codes and 3d single-shot subsystem codes, which enables similar constructive methods, and we present several new examples of each.

  @article{bombin2023faulttolerant,
      author = {Bombin, Hector and Dawson, Chris and Farrelly, Terry and Liu, Yehua and Nickerson, Naomi and Pant, Mihir and Pastawski, Fernando and Roberts, Sam},
      title = {{Fault-tolerant complexes}},
      year = {2023},
      journal = {arXiv preprint arXiv:2308.07844},
      urldate = {2023-08-15},
      link = {http://arxiv.org/abs/2308.07844},
      keywords = {Error Correcting Codes, Lattice Surgery, Automation, Surface Code, Applied, ZX-calculus},
      abstract = {Fault-tolerant complexes describe surface-code fault-tolerant protocols from a single geometric object. We first introduce fusion complexes that define a general family of fusion-based quantum computing (FBQC) fault-tolerant quantum protocols based on surface codes. We show that any 3-dimensional cell complex where each edge has four incident faces gives a valid fusion complex. This construction enables an automated search for fault tolerance schemes, allowing us to identify 627 examples within a moderate search time. We implement this using the open-source software tool Gavrog and present threshold results for a variety of schemes, finding fusion networks with higher erasure and Pauli thresholds than those existing in the literature. We then define more general structures we call fault-tolerant complexes that provide a homological description of fault tolerance from a large family of low-level error models, which include circuit-based computation, floquet-based computation, and FBQC with multi-qubit measurements. This extends the applicability of homological descriptions of fault tolerance, and enables the generation of many new schemes which have not been previously identified. We also define families of fault-tolerant complexes for color codes and 3d single-shot subsystem codes, which enables similar constructive methods, and we present several new examples of each.},
      video = {https://www.youtube.com/watch?v=wCwkOX03hq8}
  }
  

  Copy to Clipboard

• Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
  Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  Logical Methods in Computer Science
  Keywords: ZH-calculus, Sum-Over-Paths, Completeness, Clifford+T, Toffoli.

  The "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification of such systems. We give here a new set of rewrite rules for the formalism, and show that it is complete for "Toffoli-Hadamard", the simplest approximately universal fragment of quantum mechanics. We show that the rewriting is terminating, but not confluent (which is expected from the universality of the fragment). We do so using the connection between Sum-over-Paths and graphical language ZH-calculus, and also show how the axiomatisation translates into the latter. We provide generalisations of the presented rewrite rules, that can prove useful when trying to reduce terms in practice, and we show how to graphically make sense of these new rules. We show how to enrich the rewrite system to reach completeness for the dyadic fragments of quantum computation, used in particular in the Quantum Fourier Transform, and obtained by adding phase gates with dyadic multiples of \(\pi\) to the Toffoli-Hadamard gate-set. Finally, we show how to perform sums and concatenation of arbitrary terms, something which is not native in a system designed for analysing gate-based quantum computation, but necessary when considering Hamiltonian-based quantum computation.

  @article{vilmart2023rewriting,
      author = {Renaud Vilmart},
      title = {{Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of
  Quantum Computing}},
      year = {2024},
      journal = {{Logical Methods in Computer Science}},
      volume = {{Volume 20, Issue 1}},
      month = {3},
      doi = {10.46298/lmcs-20(1:20)2024},
      urldate = {2023-07-26},
      link = {http://arxiv.org/abs/2307.14223},
      url = {https://lmcs.episciences.org/13200},
      keywords = {ZH-calculus, Sum-Over-Paths, Completeness, Clifford+T, Toffoli},
      abstract = {The "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification of such systems. We give here a new set of rewrite rules for the formalism, and show that it is complete for "Toffoli-Hadamard", the simplest approximately universal fragment of quantum mechanics. We show that the rewriting is terminating, but not confluent (which is expected from the universality of the fragment). We do so using the connection between Sum-over-Paths and graphical language ZH-calculus, and also show how the axiomatisation translates into the latter. We provide generalisations of the presented rewrite rules, that can prove useful when trying to reduce terms in practice, and we show how to graphically make sense of these new rules. We show how to enrich the rewrite system to reach completeness for the dyadic fragments of quantum computation, used in particular in the Quantum Fourier Transform, and obtained by adding phase gates with dyadic multiples of $\pi$ to the Toffoli-Hadamard gate-set. Finally, we show how to perform sums and concatenation of arbitrary terms, something which is not native in a system designed for analysing gate-based quantum computation, but necessary when considering Hamiltonian-based quantum computation.}
  }
  

  Copy to Clipboard

• Floquetifying the Colour Code
  Alex Townsend-Teague, Julio Magdalena de la Fuente and Markus Kesselring
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023
  Keywords: Error Correcting Codes, Floquet codes, ZX-calculus, Applied, Clifford Fragment.

  Floquet codes are a recently discovered type of quantum error correction code. They can be thought of as generalising stabilizer codes and subsystem codes, by allowing the logical Pauli operators of the code to vary dynamically over time. In this work, we use the ZX-calculus to create new Floquet codes that are in a definable sense equivalent to known stabilizer codes. In particular, we find a Floquet code that is equivalent to the colour code, but has the advantage that all measurements required to implement it are of weight one or two. Notably, the qubits can even be laid out on a square lattice. This circumvents current difficulties with implementing the colour code fault-tolerantly, while preserving its advantages over other well-studied codes, and could furthermore allow one to benefit from extra features exclusive to Floquet codes. On a higher level, as in arXiv:2303.08829, this work shines a light on the relationship between 'static' stabilizer and subsystem codes and 'dynamic' Floquet codes; at first glance the latter seems a significant generalisation of the former, but in the case of the codes that we find here, the difference is essentially just a few basic ZX-diagram deformations.

  @inproceedings{townsend-teague2023floquetifying,
      author = {Townsend-Teague, Alex and Magdalena de la Fuente, Julio and Kesselring, Markus},
      title = {{Floquetifying the Colour Code}},
      year = {2023},
      booktitle = {Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023},
      editor = {Mansfield, Shane and Val\^iron, Benoit and Zamdzhiev, Vladimir},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {384},
      pages = {265-303},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.384.14},
      urldate = {2023-07-20},
      link = {http://arxiv.org/abs/2307.11136},
      keywords = {Error Correcting Codes, Floquet codes, ZX-calculus, Applied, Clifford Fragment},
      abstract = {Floquet codes are a recently discovered type of quantum error correction code. They can be thought of as generalising stabilizer codes and subsystem codes, by allowing the logical Pauli operators of the code to vary dynamically over time. In this work, we use the ZX-calculus to create new Floquet codes that are in a definable sense equivalent to known stabilizer codes. In particular, we find a Floquet code that is equivalent to the colour code, but has the advantage that all measurements required to implement it are of weight one or two. Notably, the qubits can even be laid out on a square lattice. This circumvents current difficulties with implementing the colour code fault-tolerantly, while preserving its advantages over other well-studied codes, and could furthermore allow one to benefit from extra features exclusive to Floquet codes. On a higher level, as in arXiv:2303.08829, this work shines a light on the relationship between 'static' stabilizer and subsystem codes and 'dynamic' Floquet codes; at first glance the latter seems a significant generalisation of the former, but in the case of the codes that we find here, the difference is essentially just a few basic ZX-diagram deformations.},
      video = {https://www.youtube.com/watch?v=pP1DaKxlC_8}
  }
  

  Copy to Clipboard

• The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality
  Patrick Roy, John van de Wetering and Lia Yeh
  Show abstract ⇲ Show bibdata ⇲

  Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023
  Keywords: Qudits, ZH-calculus, Completeness, Toffoli.

  We introduce the qudit ZH-calculus and show how to generalise the phase-free qubit rules to qudits. We prove that for prime dimensions \(d\), the phase-free qudit ZH-calculus is universal for matrices over the ring \(\mathbb{Z}[e^{2\pi i/d}]\). For qubits, there is a strong connection between phase-free ZH-diagrams and Toffoli+Hadamard circuits, a computationally universal fragment of quantum circuits. We generalise this connection to qudits, by finding that the two-qudit \(|0\rangle\)-controlled \(X\) gate can be used to construct all classical reversible qudit logic circuits in any odd qudit dimension, which for qubits requires the three-qubit Toffoli gate. We prove that our construction is asymptotically optimal up to a logarithmic term. Twenty years after the celebrated result by Shi proving universality of Toffoli+Hadamard for qubits, we prove that circuits of \(|0\rangle\)-controlled \(X\) and Hadamard gates are approximately universal for qudit quantum computing for any odd prime \(d\), and moreover that phase-free ZH-diagrams correspond precisely to such circuits allowing postselections.

  @inproceedings{roy2023qudit,
      author = {Roy, Patrick and van de Wetering, John and Yeh, Lia},
      title = {{The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality}},
      year = {2023},
      booktitle = {Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023},
      editor = {Mansfield, Shane and Val\^iron, Benoit and Zamdzhiev, Vladimir},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {384},
      pages = {142-170},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.384.9},
      urldate = {2023-07-19},
      link = {http://arxiv.org/abs/2307.10095},
      keywords = {Qudits, ZH-calculus, Completeness, Toffoli},
      abstract = {We introduce the qudit ZH-calculus and show how to generalise the phase-free qubit rules to qudits. We prove that for prime dimensions $d$, the phase-free qudit ZH-calculus is universal for matrices over the ring $\mathbb{Z}[e^{2\pi i/d}]$. For qubits, there is a strong connection between phase-free ZH-diagrams and Toffoli+Hadamard circuits, a computationally universal fragment of quantum circuits. We generalise this connection to qudits, by finding that the two-qudit $|0\rangle$-controlled $X$ gate can be used to construct all classical reversible qudit logic circuits in any odd qudit dimension, which for qubits requires the three-qubit Toffoli gate. We prove that our construction is asymptotically optimal up to a logarithmic term. Twenty years after the celebrated result by Shi proving universality of Toffoli+Hadamard for qubits, we prove that circuits of $|0\rangle$-controlled $X$ and Hadamard gates are approximately universal for qudit quantum computing for any odd prime $d$, and moreover that phase-free ZH-diagrams correspond precisely to such circuits allowing postselections.}
  }
  

  Copy to Clipboard

• Graphical CSS Code Transformation Using ZX Calculus
  Jiaxin Huang, Sarah Meng Li, Lia Yeh, Aleks Kissinger, Michele Mosca and Michael Vasmer
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023
  Keywords: Error Correcting Codes, Clifford Fragment.

  In this work, we present a generic approach to transform CSS codes by building upon their equivalence to phase-free ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic transformations between encoding maps associated with different codes. As a motivating example, we give explicit transformations between the Steane code and the quantum Reed-Muller code, since by switching between these two codes, one can obtain a fault-tolerant universal gate set. To this end, we propose a bidirectional rewrite rule to find a (not necessarily transversal) physical implementation for any logical ZX diagram in any CSS code. We then focus on two code transformation techniques: \(\textit{code morphing}\), a procedure that transforms a code while retaining its fault-tolerant gates, and \(\textit{gauge fixing}\), where complimentary codes can be obtained from a common subsystem code (e.g., the Steane and the quantum Reed-Muller codes from the [[15,1,3,3]] code). We provide explicit graphical derivations for these techniques and show how ZX and graphical encoder maps relate several equivalent perspectives on these code transforming operations.

  @inproceedings{huang2023graphical,
      author = {Huang, Jiaxin and Li, Sarah Meng and Yeh, Lia and Kissinger, Aleks and Mosca, Michele and Vasmer, Michael},
      title = {{Graphical CSS Code Transformation Using ZX Calculus}},
      year = {2023},
      booktitle = {Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023},
      editor = {Mansfield, Shane and Val\^iron, Benoit and Zamdzhiev, Vladimir},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {384},
      pages = {1-19},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.384.1},
      urldate = {2023-07-05},
      link = {http://arxiv.org/abs/2307.02437},
      keywords = {Error Correcting Codes, Clifford Fragment},
      abstract = {In this work, we present a generic approach to transform CSS codes by building upon their equivalence to phase-free ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic transformations between encoding maps associated with different codes. As a motivating example, we give explicit transformations between the Steane code and the quantum Reed-Muller code, since by switching between these two codes, one can obtain a fault-tolerant universal gate set. To this end, we propose a bidirectional rewrite rule to find a (not necessarily transversal) physical implementation for any logical ZX diagram in any CSS code.   We then focus on two code transformation techniques: $\textit{code morphing}$, a procedure that transforms a code while retaining its fault-tolerant gates, and $\textit{gauge fixing}$, where complimentary codes can be obtained from a common subsystem code (e.g., the Steane and the quantum Reed-Muller codes from the [[15,1,3,3]] code). We provide explicit graphical derivations for these techniques and show how ZX and graphical encoder maps relate several equivalent perspectives on these code transforming operations.},
      video = {https://www.youtube.com/watch?v=ZhfQxdjodNs}
  }
  

  Copy to Clipboard

• Contraction of ZX diagrams with triangles via stabiliser decompositions
  Mark Koch, Richie Yeung and Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Physica Scripta
  Keywords: Classical Simulation, Triangle, Automation, ZX-calculus, Variational Circuits, Applied.

  Recent advances in classical simulation of Clifford+T circuits make use of the ZX calculus to iteratively decompose and simplify magic states into stabiliser terms. We improve on this method by studying stabiliser decompositions of ZX diagrams involving the triangle operation. We show that this technique greatly speeds up the simulation of quantum circuits involving multi-controlled gates which can be naturally represented using triangles. We implement our approach in the QuiZX library and demonstrate a significant simulation speed-up (up to multiple orders of magnitude) for random circuits and a variation of previously used benchmarking circuits. Furthermore, we use our software to contract diagrams representing the gradient variance of parametrised quantum circuits, which yields a tool for the automatic numerical detection of the barren plateau phenomenon in ans\"atze used for quantum machine learning. Compared to traditional statistical approaches, our method yields exact values for gradient variances and only requires contracting a single diagram. The performance of this tool is competitive with tensor network approaches, as demonstrated with benchmarks against the quimb library.

  @article{koch2023speedy,
      author = {Koch, Mark and Yeung, Richie and Wang, Quanlong},
      title = {{Contraction of ZX diagrams with triangles via stabiliser decompositions}},
      year = {2024},
      journal = {Physica Scripta},
      doi = {10.1088/1402-4896/ad6fd8},
      urldate = {2023-07-04},
      link = {http://arxiv.org/abs/2307.01803},
      keywords = {Classical Simulation, Triangle, Automation, ZX-calculus, Variational Circuits, Applied},
      abstract = {Recent advances in classical simulation of Clifford+T circuits make use of the ZX calculus to iteratively decompose and simplify magic states into stabiliser terms. We improve on this method by studying stabiliser decompositions of ZX diagrams involving the triangle operation. We show that this technique greatly speeds up the simulation of quantum circuits involving multi-controlled gates which can be naturally represented using triangles. We implement our approach in the QuiZX library and demonstrate a significant simulation speed-up (up to multiple orders of magnitude) for random circuits and a variation of previously used benchmarking circuits. Furthermore, we use our software to contract diagrams representing the gradient variance of parametrised quantum circuits, which yields a tool for the automatic numerical detection of the barren plateau phenomenon in ans\"atze used for quantum machine learning. Compared to traditional statistical approaches, our method yields exact values for gradient variances and only requires contracting a single diagram. The performance of this tool is competitive with tensor network approaches, as demonstrated with benchmarks against the quimb library.},
      video = {https://www.youtube.com/watch?v=8L6jqiNg9iM}
  }
  

  Copy to Clipboard

• Dynamic Quantum Circuit Optimization by ZX-calculus using Qsyn
  Cheng-Hua (Anita) Lu
  Show abstract ⇲ Show bibdata ⇲

  National Taiwan University Masters Thesis
  Keywords: ZX-Calculus, Optimisation, PyZX, Automation, Master Thesis.

  Quantum circuit optimization plays a crucial role in improving the efficiency and performance of quantum computing systems. In this thesis, we present a comprehensive study on optimizing quantum circuits by integrating decomposition level adjustment and dynamic reduction algorithms. To facilitate the implementation and analysis of these algorithms, we have developed a novel quantum circuit optimization framework called Qsyn in CH. Qsyn is very efficient in terms of the execution time and provides the flexibilities in exploring various optimization strategies. We demonstrate the effectiveness of our approach by applying it to a diverse set of test cases. Our experimental results show that our algorithm can lead to significant Improvements in quantum circuit gate count, 2-qubit-gate count, and circuit depth. The reduction rate are 11.5%, 10.5%, and 14.8%, respectively, when compared to the existing approaches. Furthermore, Qsyn is much faster than the widely used quantum circuit optimization tool, PyZX, particularly for large-scale circuits. The results highlight the superiority of Qsyn and its suitability for optimizing quantum circuits in both quality and computational efficiency. Overall, this thesis contributes to the field of quantum circuit optimization by providing a powerful tool and an optimized workflow that enable more effective and scalable quantum circuit optimization.

  @mastersthesis{Lu2023Masters,
      author = {Lu, Cheng-Hua (Anita)},
      title = {{Dynamic Quantum Circuit Optimization by ZX-calculus using Qsyn}},
      year = {2023},
      school = {National Taiwan University},
      urldate = {2023-07-01},
      link = {https://tdr.lib.ntu.edu.tw/retrieve/0e101289-c84b-4f05-8a0a-5878ba5fc6aa/ntu-111-2.pdf},
      keywords = {ZX-Calculus, Optimisation, PyZX, Automation, Master Thesis},
      abstract = {Quantum circuit optimization plays a crucial role in improving the efficiency and performance of quantum computing systems. In this thesis, we present a comprehensive study on optimizing quantum circuits by integrating decomposition level adjustment and dynamic reduction algorithms. To facilitate the implementation and analysis of these algorithms, we have developed a novel quantum circuit optimization framework called Qsyn in CH. Qsyn is very efficient in terms of the execution time and provides the flexibilities in exploring various optimization strategies. We demonstrate the effectiveness of our approach by applying it to a diverse set of test cases. Our experimental results show that our algorithm can lead to significant Improvements in quantum circuit gate count, 2-qubit-gate count, and circuit depth. The reduction rate are 11.5%, 10.5%, and 14.8%, respectively, when compared to the existing approaches. Furthermore, Qsyn is much faster than the widely used quantum circuit optimization tool, PyZX, particularly for large-scale circuits. The results highlight the superiority of Qsyn and its suitability for optimizing quantum circuits in both quality and computational efficiency. Overall, this thesis contributes to the field of quantum circuit optimization by providing a powerful tool and an optimized workflow that enable more effective and scalable quantum circuit optimization.}
  }
  

  Copy to Clipboard

• Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes
  Matthew Amy
  Show abstract ⇲ Show bibdata ⇲

  Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023
  Keywords: ZH-calculus, Completeness, Sum-Over-Paths.

  Vilmart recently gave a complete equational theory for the balanced sum-over-paths over Toffoli-Hadamard circuits, and by extension Clifford+\(\mathrm{diag}(1, \zeta_{2^k})\) circuits. Their theory is based on the phase-free ZH-calculus which crucially omits the average rule of the full ZH-calculus, dis-allowing the local summation of amplitudes. Here we study the question of completeness in unbalanced path sums which naturally support local summation. We give a concrete syntax for the unbalanced sum-over-paths and show that, together with symbolic multilinear algebra and the interference rule, various formulations of the average and ortho rules of the ZH-calculus are sufficient to give complete equational theories over arbitrary rings and fields.

  @inproceedings{amy2023complete,
      author = {Amy, Matthew},
      title = {{Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes}},
      year = {2023},
      booktitle = {Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023},
      editor = {Mansfield, Shane and Val\^iron, Benoit and Zamdzhiev, Vladimir},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {384},
      pages = {127-141},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.384.8},
      urldate = {2023-06-28},
      link = {http://arxiv.org/abs/2306.16369},
      keywords = {ZH-calculus, Completeness, Sum-Over-Paths},
      abstract = {Vilmart recently gave a complete equational theory for the balanced sum-over-paths over Toffoli-Hadamard circuits, and by extension Clifford+$\mathrm{diag}(1, \zeta_{2^k})$ circuits. Their theory is based on the phase-free ZH-calculus which crucially omits the average rule of the full ZH-calculus, dis-allowing the local summation of amplitudes. Here we study the question of completeness in unbalanced path sums which naturally support local summation. We give a concrete syntax for the unbalanced sum-over-paths and show that, together with symbolic multilinear algebra and the interference rule, various formulations of the average and ortho rules of the ZH-calculus are sufficient to give complete equational theories over arbitrary rings and fields.}
  }
  

  Copy to Clipboard

• Three-qubit Deutsch–Jozsa in measurement-based quantum computing
  M. Schwetz and R. M. Noack
  Show abstract ⇲ Show bibdata ⇲

  International Journal of Quantum Information
  Keywords: MBQC, Protocols, Applied, ZX-calculus.

  Measurement-based quantum computing (MBQC), an alternate paradigm for formulating quantum algorithms, can lead to potentially more flexible and efficient implementations as well as to theoretical insights on the role of entanglement in a quantum algorithm. Using the recently developed ZX-calculus, we outline a general scheme for reformulating quantum circuits as MBQC implementations. After illustrating the method using the two-qubit Deutsch-Jozsa algorithm, we derive a ZX graph-diagram that encodes a general MBQC implementation for the three-qubit Deutsch-Jozsa algorithm. This graph describes an 11-qubit cluster state on which single-qubit measurements are used to execute the algorithm. Particular sets of choices of the axes for the measurements can be used to implement any realization of the oracle. In addition, we derive an equivalent lattice cluster state for the algorithm.

  @article{doi:10.1142/S0219749923500466,
      author = {Schwetz, M. and Noack, R. M.},
      title = {Three-qubit Deutsch–Jozsa in measurement-based quantum computing},
      year = {2023},
      journal = {International Journal of Quantum Information},
      volume = {0},
      number = {0},
      pages = {2350046},
      doi = {10.1142/S0219749923500466},
      urldate = {2023-06-23},
      link = {http://arxiv.org/abs/2306.13372},
      keywords = {MBQC, Protocols, Applied, ZX-calculus},
      abstract = {Measurement-based quantum computing (MBQC), an alternate paradigm for formulating quantum algorithms, can lead to potentially more flexible and efficient implementations as well as to theoretical insights on the role of entanglement in a quantum algorithm. Using the recently developed ZX-calculus, we outline a general scheme for reformulating quantum circuits as MBQC implementations. After illustrating the method using the two-qubit Deutsch-Jozsa algorithm, we derive a ZX graph-diagram that encodes a general MBQC implementation for the three-qubit Deutsch-Jozsa algorithm. This graph describes an 11-qubit cluster state on which single-qubit measurements are used to execute the algorithm. Particular sets of choices of the axes for the measurements can be used to implement any realization of the oracle. In addition, we derive an equivalent lattice cluster state for the algorithm.}
  }
  

  Copy to Clipboard

• The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
  Boldizsár Poór, Robert I. Booth, Titouan Carette, John van de Wetering and Lia Yeh
  Show abstract ⇲ Show bibdata ⇲

  Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023
  Keywords: Qudits, Completeness, Clifford Fragment, Optimisation, PyZX, Tempered, ZX-calculus.

  We present a smorgasbord of results on the stabiliser ZX-calculus for odd prime-dimensional qudits (i.e. qupits). We derive a simplified rule set that closely resembles the original rules of qubit ZX-calculus. Using these rules, we demonstrate analogues of the spider-removing local complementation and pivoting rules. This allows for efficient reduction of diagrams to the affine with phases normal form. We also demonstrate a reduction to a unique form, providing an alternative and simpler proof of completeness. Furthermore, we introduce a different reduction to the graph state with local Cliffords normal form, which leads to a novel layered decomposition for qupit Clifford unitaries. Additionally, we propose a new approach to handle scalars formally, closely reflecting their practical usage. Finally, we have implemented many of these findings in DiZX, a new open-source Python library for qudit ZX-diagrammatic reasoning.

  @inproceedings{poor2023qupit,
      author = {Poór, Boldizsár and Booth, Robert I. and Carette, Titouan and van de Wetering, John and Yeh, Lia},
      title = {{The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification}},
      year = {2023},
      booktitle = {Proceedings of the Twentieth International Conference on Quantum Physics and Logic,
  Paris, France, 17-21st July 2023},
      editor = {Mansfield, Shane and Val\^iron, Benoit and Zamdzhiev, Vladimir},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {384},
      pages = {220-264},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.384.13},
      urldate = {2023-06-08},
      link = {http://arxiv.org/abs/2306.05204},
      keywords = {Qudits, Completeness, Clifford Fragment, Optimisation, PyZX, Tempered, ZX-calculus},
      abstract = {We present a smorgasbord of results on the stabiliser ZX-calculus for odd prime-dimensional qudits (i.e. qupits). We derive a simplified rule set that closely resembles the original rules of qubit ZX-calculus. Using these rules, we demonstrate analogues of the spider-removing local complementation and pivoting rules. This allows for efficient reduction of diagrams to the affine with phases normal form. We also demonstrate a reduction to a unique form, providing an alternative and simpler proof of completeness. Furthermore, we introduce a different reduction to the graph state with local Cliffords normal form, which leads to a novel layered decomposition for qupit Clifford unitaries. Additionally, we propose a new approach to handle scalars formally, closely reflecting their practical usage. Finally, we have implemented many of these findings in DiZX, a new open-source Python library for qudit ZX-diagrammatic reasoning.}
  }
  

  Copy to Clipboard

• Quantum Circuit Optimization of Arithmetic circuits using ZX Calculus
  Aravind Joshi, Akshara Kairali, Renju Raju, Adithya Athreya, Reena Monica P, Sanjay Vishwakarma and Srinjoy Ganguly
  Show abstract ⇲ Show bibdata ⇲

  International Journal of Innovative Technology and Exploring Engineering
  Keywords: Optimisation, PyZX, Automation, Applied, ZX-calculus.

  Quantum computing is an emerging technology in which quantum mechanical properties are suitably utilized to perform certain compute-intensive operations faster than classical computers. Quantum algorithms are designed as a combination of quantum circuits that each require a large number of quantum gates, which is a challenge considering the limited number of qubit resources available in quantum computing systems. Our work proposes a technique to optimize quantum arithmetic algorithms by reducing the hardware resources and the number of qubits based on ZX calculus. We have utilised ZX calculus rewrite rules for the optimization of fault-tolerant quantum multiplier circuits where we are able to achieve a significant reduction in the number of ancilla bits and T-gates as compared to the originally required numbers to achieve fault-tolerance. Our work is the first step in the series of arithmetic circuit optimization using graphical rewrite tools and it paves the way for advancing the optimization of various complex quantum circuits and establishing the potential for new applications of the same.

  @article{joshi2023quantum,
      author = {Joshi, Aravind and Kairali, Akshara and Raju, Renju and Athreya, Adithya and Monica P, Reena and Vishwakarma, Sanjay and Ganguly, Srinjoy},
      title = {{Quantum Circuit Optimization of Arithmetic circuits using ZX Calculus}},
      year = {2024},
      journal = {International Journal of Innovative Technology and Exploring Engineering},
      volume = {13},
      issue = {2},
      doi = {10.35940/ijitee.B9794.13020124},
      urldate = {2023-06-04},
      link = {http://arxiv.org/abs/2306.02264},
      keywords = {Optimisation, PyZX, Automation, Applied, ZX-calculus},
      abstract = {Quantum computing is an emerging technology in which quantum mechanical properties are suitably utilized to perform certain compute-intensive operations faster than classical computers. Quantum algorithms are designed as a combination of quantum circuits that each require a large number of quantum gates, which is a challenge considering the limited number of qubit resources available in quantum computing systems. Our work proposes a technique to optimize quantum arithmetic algorithms by reducing the hardware resources and the number of qubits based on ZX calculus. We have utilised ZX calculus rewrite rules for the optimization of fault-tolerant quantum multiplier circuits where we are able to achieve a significant reduction in the number of ancilla bits and T-gates as compared to the originally required numbers to achieve fault-tolerance. Our work is the first step in the series of arithmetic circuit optimization using graphical rewrite tools and it paves the way for advancing the optimization of various complex quantum circuits and establishing the potential for new applications of the same.}
  }
  

  Copy to Clipboard

• Light-Matter Interaction in the ZXW Calculus
  Giovanni de Felice, Razin A. Shaikh, Boldizsár Poór, Lia Yeh, Quanlong Wang and Bob Coecke
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023
  Keywords: Photons, ZW-calculus, Fermionic quantum computing, Algebraic ZX, Qudits, Qudits.

  In this paper, we develop a graphical calculus to rewrite photonic circuits involving light-matter interactions and non-linear optical effects. We introduce the infinite ZW calculus, a graphical language for linear operators on the bosonic Fock space which captures both linear and non-linear photonic circuits. This calculus is obtained by combining the QPath calculus, a diagrammatic language for linear optics, and the recently developed qudit ZXW calculus, a complete axiomatisation of linear maps between qudits. It comes with a 'lifting' theorem allowing to prove equalities between infinite operators by rewriting in the ZXW calculus. We give a method for representing bosonic and fermionic Hamiltonians in the infinite ZW calculus. This allows us to derive their exponentials by diagrammatic reasoning. Examples include phase shifts and beam splitters, as well as non-linear Kerr media and Jaynes-Cummings light-matter interaction.

  @inproceedings{defelice2023lightmatter,
      author = {de Felice, Giovanni and Shaikh, Razin A. and Poór, Boldizsár and Yeh, Lia and Wang, Quanlong and Coecke, Bob},
      title = {{Light-Matter Interaction in the ZXW Calculus}},
      year = {2023},
      booktitle = {Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023},
      editor = {Mansfield, Shane and Val\^iron, Benoit and Zamdzhiev, Vladimir},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {384},
      pages = {20-46},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.384.2},
      urldate = {2023-06-03},
      link = {http://arxiv.org/abs/2306.02114},
      keywords = {Photons, ZW-calculus, Fermionic quantum computing, Algebraic ZX, Qudits, Qudits},
      abstract = {In this paper, we develop a graphical calculus to rewrite photonic circuits involving light-matter interactions and non-linear optical effects. We introduce the infinite ZW calculus, a graphical language for linear operators on the bosonic Fock space which captures both linear and non-linear photonic circuits. This calculus is obtained by combining the QPath calculus, a diagrammatic language for linear optics, and the recently developed qudit ZXW calculus, a complete axiomatisation of linear maps between qudits. It comes with a 'lifting' theorem allowing to prove equalities between infinite operators by rewriting in the ZXW calculus. We give a method for representing bosonic and fermionic Hamiltonians in the infinite ZW calculus. This allows us to derive their exponentials by diagrammatic reasoning. Examples include phase shifts and beam splitters, as well as non-linear Kerr media and Jaynes-Cummings light-matter interaction.},
      video = {https://www.youtube.com/watch?v=nOli0jB2hoY}
  }
  

  Copy to Clipboard

• Design Automation Tools and Software for Quantum Computing
  Lukas Burgholzer
  Show abstract ⇲ Show bibdata ⇲

  Johannes Kepler University Linz PhD Thesis
  Keywords: ZX-calculus, Verification, PyZX, Automation, Variational Circuits, PhD Thesis.

  This thesis aims to leverage this latent potential by developing and providing design automation methods and software for quantum computing that explicitly utilize core data structures (such as decision diagrams) or methods (such as dedicated reasoning engines). To this end, it focuses on three major design tasks in quantum software development, namely, classical simulation of quantum circuits, compilation of quantum circuits, and verification of quantum circuits. Each of these tasks plays a critical role in the development of quantum software, and they require careful consideration and attention to detail. The proposed solutions demonstrate significant improvements in efficiency, scalability, as well as reliability for all tasks and illustrate the immense benefits of leveraging existing knowledge and expertise in classical circuit and system design rather than starting from scratch. All tools and software solutions developed as part of this thesis are made available as open-source packages and constitute the backbone of the Munich Quantum Toolkit (MQT). Therefore, this thesis significantly advances the state of the art in quantum computing and demonstrates the importance of design automation methods for future advancements.

  @phdthesis{Burgholzer2023thesis,
      author = {Burgholzer,  Lukas},
      title = {{Design Automation Tools and Software for Quantum Computing}},
      year = {2023},
      school = {Johannes Kepler University Linz},
      urldate = {2023-06-01},
      link = {https://epub.jku.at/obvulihs/content/titleinfo/9034721/full.pdf},
      keywords = {ZX-calculus, Verification, PyZX, Automation, Variational Circuits, PhD Thesis},
      abstract = {This thesis aims to leverage this latent potential by developing and providing design automation methods and software for quantum computing that explicitly utilize core data structures (such as decision diagrams) or methods (such as dedicated reasoning engines). To this end, it focuses on three major design tasks in quantum software development, namely, classical simulation of quantum circuits, compilation of quantum circuits, and verification of quantum circuits. Each of these tasks plays a critical role in the development of quantum software, and they require careful consideration and attention to detail. The proposed solutions demonstrate significant improvements in efficiency, scalability, as well as reliability for all tasks and illustrate the immense benefits of leveraging existing knowledge and expertise in classical circuit and system design rather than starting from scratch. All tools and software solutions developed as part of this thesis are made available as open-source packages and constitute the backbone of the Munich Quantum Toolkit (MQT). Therefore, this thesis significantly advances the state of the art in quantum computing and demonstrates the importance of design automation methods for future advancements.}
  }
  

  Copy to Clipboard

• Non-stabilizerness and entanglement from cat-state injection
  Filipa C R Peres, Rafael Wagner and Ernesto F Galvão
  Show abstract ⇲ Show bibdata ⇲

  New Journal of Physics
  Keywords: Classical Simulation, ZX-calculus, Applied, Automation.

  Recently, cat states have been used to heuristically improve the runtime of a classical simulator of quantum circuits based on the diagrammatic ZX-calculus. Here we explore the use of cat-state injection within the quantum circuit model. We introduce a new family of cat states \(\left| \mathrm{cat}_m^* \right>\), and describe circuit gadgets using them to concurrently inject non-stabilizerness (also known as magic) and entanglement into any quantum circuit. We provide numerical evidence that cat-state injection does not lead to speed-up in classical simulation. On the other hand, we show that our gadgets can be used to widen the scope of compelling applications of cat states. Specifically, we show how to leverage them to achieve savings in the number of injected qubits, and also to induce scrambling dynamics in otherwise non-entangling Clifford circuits in a controlled manner.

  @article{Peres_2024,
      author = {Filipa C R Peres and Rafael Wagner and Ernesto F Galvão},
      title = {Non-stabilizerness and entanglement from cat-state injection},
      year = {2024},
      journal = {New Journal of Physics},
      volume = {26},
      number = {1},
      month = {jan},
      pages = {013051},
      publisher = {IOP Publishing},
      doi = {10.1088/1367-2630/ad1b80},
      urldate = {2023-05-31},
      link = {http://arxiv.org/abs/2305.19988},
      url = {https://dx.doi.org/10.1088/1367-2630/ad1b80},
      keywords = {Classical Simulation, ZX-calculus, Applied, Automation},
      abstract = {Recently, cat states have been used to heuristically improve the runtime of a classical simulator of quantum circuits based on the diagrammatic ZX-calculus. Here we explore the use of cat-state injection within the quantum circuit model. We introduce a new family of cat states $\left| \mathrm{cat}_m^* \right>$, and describe circuit gadgets using them to concurrently inject non-stabilizerness (also known as magic) and entanglement into any quantum circuit. We provide numerical evidence that cat-state injection does not lead to speed-up in classical simulation. On the other hand, we show that our gadgets can be used to widen the scope of compelling applications of cat states. Specifically, we show how to leverage them to achieve savings in the number of injected qubits, and also to induce scrambling dynamics in otherwise non-entangling Clifford circuits in a controlled manner.}
  }
  

  Copy to Clipboard

• Speeding up quantum circuits simulation using ZX-Calculus
  Tristan Cam and Simon Martiel
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2305.02669
  Keywords: Classical Simulation, Tensor Networks, Local Complementation, Automation, Applied, ZX-calculus.

  We present a simple and efficient way to reduce the contraction cost of a tensor network to simulate a quantum circuit. We start by interpreting the circuit as a ZX-diagram. We then use simplification and local complementation rules to sparsify it. We find that optimizing graph-like ZX-diagrams improves existing state of the art contraction cost by several order of magnitude. In particular, we demonstrate an average contraction cost 1180 times better for Sycamore circuits of depth 20, and up to 4200 times better at peak performance.

  @article{cam2023speeding,
      author = {Cam, Tristan and Martiel, Simon},
      title = {{Speeding up quantum circuits simulation using ZX-Calculus}},
      year = {2023},
      journal = {arXiv preprint arXiv:2305.02669},
      urldate = {2023-05-04},
      link = {http://arxiv.org/abs/2305.02669},
      keywords = {Classical Simulation, Tensor Networks, Local Complementation, Automation, Applied, ZX-calculus},
      abstract = {We present a simple and efficient way to reduce the contraction cost of a tensor network to simulate a quantum circuit. We start by interpreting the circuit as a ZX-diagram. We then use simplification and local complementation rules to sparsify it. We find that optimizing graph-like ZX-diagrams improves existing state of the art contraction cost by several order of magnitude. In particular, we demonstrate an average contraction cost 1180 times better for Sycamore circuits of depth 20, and up to 4200 times better at peak performance.}
  }
  

  Copy to Clipboard

• Scaling W State Circuits in the qudit Clifford Hierarchy
  Lia Yeh
  Show abstract ⇲ Show bibdata ⇲

  Companion Proceedings of the 7th International Conference on the Art, Science, and Engineering of Programming
  Keywords: Qudits, Optimisation, ZW-calculus, ZX-calculus.

  We identify a novel qudit gate which we call the \(\sqrt[d]{Z}\) gate. This is an alternate generalization of the qutrit \(T\) gate to any odd prime dimension \(d\), in the \(d^{\text{th}}\) level of the Clifford hierarchy. Using this gate which is efficiently realizable fault-tolerantly should a certain conjecture hold, we deterministically construct in the Clifford+\(\sqrt[d]{Z}\) gate set, \(d\)-qubit \(W\) states in the qudit \(\{ |0\rangle , |1\rangle \}\) subspace. For qutrits, this gives deterministic and fault-tolerant constructions for the qubit \(W\) state of sizes three with \(T\) count 3, six, and powers of three. Furthermore, we adapt these constructions to recursively scale the \(W\) state size to arbitrary size \(N\), in \(O(N)\) gate count and \(O(\text{log }N)\) depth. This is moreover deterministic for any size qubit \(W\) state, and for any prime \(d\)-dimensional qudit \(W\) state, size a power of \(d\). For these purposes, we devise constructions of the \( |0\rangle \)-controlled Pauli \(X\) gate and the controlled Hadamard gate in any prime qudit dimension. These decompositions, for which exact synthesis is unknown in Clifford+\(T\) for \(d > 3\), may be of independent interest.

  @inproceedings{yeh2023scaling,
      author = {Yeh, Lia},
      title = {Scaling W State Circuits in the qudit Clifford Hierarchy},
      year = {2023},
      booktitle = {Companion Proceedings of the 7th International Conference on the Art, Science, and Engineering of Programming},
      series = {Programming '23},
      pages = {90–100},
      numpages = {11},
      publisher = {Association for Computing Machinery},
      address = {New York, NY, USA},
      isbn = {9798400707551},
      location = {, Tokyo, Japan, },
      doi = {10.1145/3594671.3594687},
      urldate = {2023-04-25},
      link = {http://arxiv.org/abs/2304.12504},
      url = {https://doi.org/10.1145/3594671.3594687},
      keywords = {Qudits, Optimisation, ZW-calculus, ZX-calculus},
      abstract = {We identify a novel qudit gate which we call the $\sqrt[d]{Z}$ gate. This is an alternate generalization of the qutrit $T$ gate to any odd prime dimension $d$, in the $d^{\text{th}}$ level of the Clifford hierarchy. Using this gate which is efficiently realizable fault-tolerantly should a certain conjecture hold, we deterministically construct in the Clifford+$\sqrt[d]{Z}$ gate set, $d$-qubit $W$ states in the qudit $\{ |0\rangle , |1\rangle \}$ subspace. For qutrits, this gives deterministic and fault-tolerant constructions for the qubit $W$ state of sizes three with $T$ count 3, six, and powers of three.   Furthermore, we adapt these constructions to recursively scale the $W$ state size to arbitrary size $N$, in $O(N)$ gate count and $O(\text{log }N)$ depth. This is moreover deterministic for any size qubit $W$ state, and for any prime $d$-dimensional qudit $W$ state, size a power of $d$.   For these purposes, we devise constructions of the $ |0\rangle $-controlled Pauli $X$ gate and the controlled Hadamard gate in any prime qudit dimension. These decompositions, for which exact synthesis is unknown in Clifford+$T$ for $d > 3$, may be of independent interest.}
  }
  

  Copy to Clipboard

• The Algebra for Stabilizer Codes
  Cole Comfort
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2304.10584
  Keywords: Clifford Fragment, Qudits, Error Correcting Codes, Spekkens Toy Model, Category Theory, Completeness, Mixed States.

  There is a bijection between odd prime dimensional qudit pure stabilizer states modulo invertible scalars and affine Lagrangian subspaces of finite dimensional symplectic \(\mathbb{F}_p\)-vector spaces. In the language of the stabilizer formalism, full rank stabilizer tableaus are exactly the bases for affine Lagrangian subspaces. This correspondence extends to an isomorphism of props where the composition of stabilizer circuits becomes the relational composition of affine subspaces and the tensor product becomes the direct sum. In this paper, we extend this correspondence between stabilizer circuits and tableaus to the mixed setting; by regarding stabilizer codes as affine coisotropic susbspaces (again only in odd prime qudit dimension/for qubit CSS codes). We show that by splitting the projector for a stabilizer code we recover the error detection protocol and the error correction protocol with affine classical processing power.

  @article{comfort2023algebrfor,
      author = {Comfort, Cole},
      title = {{The Algebra for Stabilizer Codes}},
      year = {2023},
      journal = {arXiv preprint arXiv:2304.10584},
      urldate = {2023-04-20},
      link = {http://arxiv.org/abs/2304.10584},
      keywords = {Clifford Fragment, Qudits, Error Correcting Codes, Spekkens Toy Model, Category Theory, Completeness, Mixed States },
      abstract = {There is a bijection between odd prime dimensional qudit pure stabilizer states modulo invertible scalars and affine Lagrangian subspaces of finite dimensional symplectic $\mathbb{F}_p$-vector spaces. In the language of the stabilizer formalism, full rank stabilizer tableaus are exactly the bases for affine Lagrangian subspaces. This correspondence extends to an isomorphism of props where the composition of stabilizer circuits becomes the relational composition of affine subspaces and the tensor product becomes the direct sum. In this paper, we extend this correspondence between stabilizer circuits and tableaus to the mixed setting; by regarding stabilizer codes as affine coisotropic susbspaces (again only in odd prime qudit dimension/for qubit CSS codes). We show that by splitting the projector for a stabilizer code we recover the error detection protocol and the error correction protocol with affine classical processing power.},
      video = {https://www.youtube.com/watch?v=80rx6LzWCWo}
  }
  

  Copy to Clipboard

• Towards a generic compilation approach for quantum circuits through resynthesis
  Arianne Meijer - van de Griend
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2304.08814
  Keywords: ZX-Supported, Optimisation, Applied, Phase gadgets.

  In this paper, we propose a generic quantum circuit resynthesis approach for compilation. We use an intermediate representation consisting of Paulistrings over {Z, I} and {X, I} called a ``mixed ZX-phase polynomial``. From this universal representation, we generate a completely new circuit such that all multi-qubit gates (CNOTs) are satisfying a given quantum architecture. Moreover, we attempt to minimize the amount of generated gates. The proposed algorithms generate fewer CNOTs than similar previous methods on different connectivity graphs ranging from 5-20 qubits. In most cases, the CNOT counts are also lower than Qiskit's. For large circuits, containing >= 100 Paulistrings, our proposed algorithms even generate fewer CNOTs than the TKET compiler. Additionally, we give insight into the trade-off between compilation time and final CNOT count.

  @article{meijer-vandegriend2023generic,
      author = {Meijer - van de Griend, Arianne},
      title = {{Towards a generic compilation approach for quantum circuits through resynthesis}},
      year = {2023},
      journal = {arXiv preprint arXiv:2304.08814},
      urldate = {2023-04-18},
      link = {http://arxiv.org/abs/2304.08814},
      keywords = {ZX-Supported, Optimisation, Applied, Phase gadgets},
      abstract = {In this paper, we propose a generic quantum circuit resynthesis approach for compilation. We use an intermediate representation consisting of Paulistrings over {Z, I} and {X, I} called a ``mixed ZX-phase polynomial``. From this universal representation, we generate a completely new circuit such that all multi-qubit gates (CNOTs) are satisfying a given quantum architecture. Moreover, we attempt to minimize the amount of generated gates.   The proposed algorithms generate fewer CNOTs than similar previous methods on different connectivity graphs ranging from 5-20 qubits. In most cases, the CNOT counts are also lower than Qiskit's. For large circuits, containing >= 100 Paulistrings, our proposed algorithms even generate fewer CNOTs than the TKET compiler.   Additionally, we give insight into the trade-off between compilation time and final CNOT count.}
  }
  

  Copy to Clipboard

• A ZX-Calculus Approach to Concatenated Graph Codes
  Zipeng Wu, Song Cheng and Bei Zeng
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2304.08363
  Keywords: Error Correcting Codes, Graph States, Local Complementation, ZX-calculus, Applied.

  Quantum Error-Correcting Codes (QECCs) are vital for ensuring the reliability of quantum computing and quantum communication systems. Among QECCs, stabilizer codes, particularly graph codes, have attracted considerable attention due to their unique properties and potential applications. Concatenated codes, whichcombine multiple layers of quantum codes, offer a powerful technique for achieving high levels of error correction with a relatively low resource overhead. In this paper, we examine the concatenation of graph codes using the powerful and versatile graphical language of ZX-calculus. We establish a correspondence between the encoding map and ZX-diagrams, and provide a simple proof of the equivalence between encoding maps in the Pauli X basis and the graphic operation "generalized local complementation" (GLC) as previously demonstrated in [J. Math. Phys. 52, 022201]. Our analysis reveals that the resulting concatenated code remains a graph code only when the encoding qubits of the same inner code are not directly connected. When they are directly connected, additional Clifford operations are necessary to transform the concatenated code into a graphcode, thus generalizing the results in [J. Math. Phys. 52, 022201]. We further explore concatenated graph codesin different bases, including the examination of holographic codes as concatenated graph codes. Our findings showcase the potential of ZX-calculus in advancing the field of quantum error correction.

  @article{wu2023zxcalculus,
      author = {Wu, Zipeng and Cheng, Song and Zeng, Bei},
      title = {{A ZX-Calculus Approach to Concatenated Graph Codes}},
      year = {2023},
      journal = {arXiv preprint arXiv:2304.08363},
      urldate = {2023-04-17},
      link = {http://arxiv.org/abs/2304.08363},
      keywords = {Error Correcting Codes, Graph States, Local Complementation, ZX-calculus, Applied},
      abstract = {Quantum Error-Correcting Codes (QECCs) are vital for ensuring the reliability of quantum computing and quantum communication systems. Among QECCs, stabilizer codes, particularly graph codes, have attracted considerable attention due to their unique properties and potential applications. Concatenated codes, whichcombine multiple layers of quantum codes, offer a powerful technique for achieving high levels of error correction with a relatively low resource overhead. In this paper, we examine the concatenation of graph codes using the powerful and versatile graphical language of ZX-calculus. We establish a correspondence between the encoding map and ZX-diagrams, and provide a simple proof of the equivalence between encoding maps in the Pauli X basis and the graphic operation "generalized local complementation" (GLC) as previously demonstrated in [J. Math. Phys. 52, 022201]. Our analysis reveals that the resulting concatenated code remains a graph code only when the encoding qubits of the same inner code are not directly connected. When they are directly connected, additional Clifford operations are necessary to transform the concatenated code into a graphcode, thus generalizing the results in [J. Math. Phys. 52, 022201]. We further explore concatenated graph codesin different bases, including the examination of holographic codes as concatenated graph codes. Our findings showcase the potential of ZX-calculus in advancing the field of quantum error correction.},
      video = {https://www.youtube.com/watch?v=mbqx0OudY5c}
  }
  

  Copy to Clipboard

• Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
  Tommy McElvanney and Miriam Backens
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023
  Keywords: MBQC, gflow, Local Complementation, ZX-calculus.

  In the one-way model of measurement-based quantum computation (MBQC), computation proceeds via measurements on a resource state. So-called flow conditions ensure that the overall computation is deterministic in a suitable sense, with Pauli flow being the most general of these. Computations, represented as measurement patterns, may be rewritten to optimise resource use and for other purposes. Such rewrites need to preserve the existence of flow to ensure the new pattern can still be implemented deterministically. The majority of existing work in this area has focused on rewrites that reduce the number of qubits, yet it can be beneficial to increase the number of qubits for certain kinds of optimisation, as well as for obfuscation. In this work, we introduce several ZX-calculus rewrite rules that increase the number of qubits and preserve the existence of Pauli flow. These rules can be used to transform any measurement pattern into a pattern containing only (general or Pauli) measurements within the XY-plane. We also give the first flow-preserving rewrite rule that allows measurement angles to be changed arbitrarily, and use this to prove that the `neighbour unfusion' rule of Staudacher et al. preserves the existence of Pauli flow. This implies it may be possible to reduce the runtime of their two-qubit-gate optimisation procedure by removing the need to regularly run the costly gflow-finding algorithm.

  @inproceedings{mcelvanney2023flowpreserving,
      author = {McElvanney, Tommy and Backens, Miriam },
      title = {{Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation}},
      year = {2023},
      booktitle = {Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023},
      editor = {Mansfield, Shane and Val\^iron, Benoit and Zamdzhiev, Vladimir},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {384},
      pages = {203-219},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.384.12},
      urldate = {2023-04-17},
      link = {http://arxiv.org/abs/2304.08166},
      keywords = {MBQC, gflow, Local Complementation, ZX-calculus},
      abstract = {In the one-way model of measurement-based quantum computation (MBQC), computation proceeds via measurements on a resource state. So-called flow conditions ensure that the overall computation is deterministic in a suitable sense, with Pauli flow being the most general of these. Computations, represented as measurement patterns, may be rewritten to optimise resource use and for other purposes. Such rewrites need to preserve the existence of flow to ensure the new pattern can still be implemented deterministically. The majority of existing work in this area has focused on rewrites that reduce the number of qubits, yet it can be beneficial to increase the number of qubits for certain kinds of optimisation, as well as for obfuscation.   In this work, we introduce several ZX-calculus rewrite rules that increase the number of qubits and preserve the existence of Pauli flow. These rules can be used to transform any measurement pattern into a pattern containing only (general or Pauli) measurements within the XY-plane. We also give the first flow-preserving rewrite rule that allows measurement angles to be changed arbitrarily, and use this to prove that the `neighbour unfusion' rule of Staudacher et al. preserves the existence of Pauli flow. This implies it may be possible to reduce the runtime of their two-qubit-gate optimisation procedure by removing the need to regularly run the costly gflow-finding algorithm.},
      video = {https://www.youtube.com/watch?v=rKbtnOgzKZQ}
  }
  

  Copy to Clipboard

• Simple Qudit ZX and ZH Calculi, via Integrals
  Niel de Beaudrap and Richard D. P. East
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)
  Keywords: Tempered, ZX-calculus, ZH-calculus, Scalars, Qudits.

  The ZX calculus and the ZH calculus use diagrams to denote and to compute properties of quantum operations, and other multi-linear operators described by tensor networks. These calculi involve 'rewrite rules', which are algebraic manipulations of the tensor networks through transformations of diagrams. The way in which diagrams denote tensor networks is through a semantic map, which assigns a meaning to each diagram in a compositional way. Slightly different semantic maps, which may prove more convenient for one purpose or another (e.g., analysing unitary circuits versus analysing counting complexity), give rise to slightly different rewrite systems. Through a simple application of measure theory on discrete sets, we describe a semantic map for ZX and ZH diagrams for qudits of any dimension D>1, well-suited to represent unitary circuits, and admitting simple rewrite rules. In doing so, we reproduce the 'well-tempered' semantics of [arXiv:2006.02557] for ZX and ZH diagrams in the case D=2. We demonstrate rewrite rules for the 'stabiliser fragment' of the ZX calculus and a 'multicharacter fragment' of the ZH calculus; and demonstrate relationships which would allow the two calculi to be used interoperably as a single 'ZXH calculus'.

  @inproceedings{debeaudrap2023simple,
      author = {de Beaudrap, Niel and East, Richard D. P.},
      title = {{Simple Qudit ZX and ZH Calculi, via Integrals}},
      year = {2024},
      booktitle = {49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024)},
      editor = {Kr\'{a}lovi\v{c}, Rastislav and Ku\v{c}era, Anton{\'\i}n},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {306},
      pages = {20:1--20:20},
      publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-335-5},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.MFCS.2024.20},
      urldate = {2023-04-06},
      link = {http://arxiv.org/abs/2304.03310},
      url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.20},
      keywords = {Tempered, ZX-calculus, ZH-calculus, Scalars, Qudits},
      abstract = {The ZX calculus and the ZH calculus use diagrams to denote and to compute properties of quantum operations, and other multi-linear operators described by tensor networks. These calculi involve 'rewrite rules', which are algebraic manipulations of the tensor networks through transformations of diagrams. The way in which diagrams denote tensor networks is through a semantic map, which assigns a meaning to each diagram in a compositional way. Slightly different semantic maps, which may prove more convenient for one purpose or another (e.g., analysing unitary circuits versus analysing counting complexity), give rise to slightly different rewrite systems. Through a simple application of measure theory on discrete sets, we describe a semantic map for ZX and ZH diagrams for qudits of any dimension D>1, well-suited to represent unitary circuits, and admitting simple rewrite rules. In doing so, we reproduce the 'well-tempered' semantics of [arXiv:2006.02557] for ZX and ZH diagrams in the case D=2. We demonstrate rewrite rules for the 'stabiliser fragment' of the ZX calculus and a 'multicharacter fragment' of the ZH calculus; and demonstrate relationships which would allow the two calculi to be used interoperably as a single 'ZXH calculus'.},
      video = {https://www.youtube.com/watch?v=2vb-OZ24qJo}
  }
  

  Copy to Clipboard

• Picturing Counting Reductions with the ZH-Calculus
  Tuomas Laakkonen, Konstantinos Meichanetzidis and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲

  Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023
  Keywords: Classical Simulation, SAT, ZH-calculus, Applied.

  Counting the solutions to Boolean formulae defines the problem #SAT, which is complete for the complexity class #P. We use the ZH-calculus, a universal and complete graphical language for linear maps which naturally encodes counting problems in terms of diagrams, to give graphical reductions from #SAT to several related counting problems. Some of these graphical reductions, like to #2SAT, are substantially simpler than known reductions via the matrix permanent. Additionally, our approach allows us to consider the case of counting solutions modulo an integer on equal footing. Finally, since the ZH-calculus was originally introduced to reason about quantum computing, we show that the problem of evaluating ZH-diagrams in the fragment corresponding to the Clifford+T gateset, is in \(FP^{\#P}\). Our results show that graphical calculi represent an intuitive and useful framework for reasoning about counting problems.

  @inproceedings{EPTCS384.6,
      author = {Laakkonen, Tuomas and Meichanetzidis, Konstantinos and van de Wetering, John},
      title = {{Picturing Counting Reductions with the ZH-Calculus}},
      year = {2023},
      booktitle = {Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023},
      editor = {Mansfield, Shane and Val\^iron, Benoit and Zamdzhiev, Vladimir},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {384},
      pages = {89-113},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.384.6},
      urldate = {2023-04-05},
      link = {http://arxiv.org/abs/2304.02524},
      keywords = {Classical Simulation, SAT, ZH-calculus, Applied},
      abstract = {Counting the solutions to Boolean formulae defines the problem #SAT, which is complete for the complexity class #P. We use the ZH-calculus, a universal and complete graphical language for linear maps which naturally encodes counting problems in terms of diagrams, to give graphical reductions from #SAT to several related counting problems. Some of these graphical reductions, like to #2SAT, are substantially simpler than known reductions via the matrix permanent. Additionally, our approach allows us to consider the case of counting solutions modulo an integer on equal footing. Finally, since the ZH-calculus was originally introduced to reason about quantum computing, we show that the problem of evaluating ZH-diagrams in the fragment corresponding to the Clifford+T gateset, is in $FP^{\#P}$. Our results show that graphical calculi represent an intuitive and useful framework for reasoning about counting problems.}
  }
  

  Copy to Clipboard

• A Recursively Partitioned Approach to Architecture-Aware ZX Polynomial Synthesis and Optimization
  David Winderl, Qunsheng Huang and Christian B. Mendl
  Show abstract ⇲ Show bibdata ⇲

  2023 IEEE International Conference on Quantum Computing and Engineering (QCE)
  Keywords: Optimisation, Phase Gadgets, Variational Circuits, Automation, Applied, ZX-calculus.

  The synthesis of quantum circuits from phase gadgets in the ZX-calculus facilitates quantum circuit optimization. Our work provides an alternative formulation for the architecture-aware synthesis algorithm of PauliOpt by replacing the stochastic approach of PauliOpt with a heuristic based search and utilizes a divide and conquer method to synthesize an optimized circuit from a ZX polynomial. We provide a comparison of our algorithm with PauliOpt and other state-of-the-art optimization libraries. While we note poorer performance for highly structured circuits, as in the QAOA formulation for Max-Cut, we demonstrate a significant advantage for randomized circuits, which highlights the advantages of utilizing an architecture-aware methodology.

  @inproceedings{winderl2023recursively,
      author = {Winderl, David and Huang, Qunsheng and Mendl, Christian B.},
      title = {A Recursively Partitioned Approach to Architecture-Aware ZX Polynomial Synthesis and Optimization},
      year = {2023},
      booktitle = {2023 IEEE International Conference on Quantum Computing and Engineering (QCE)},
      volume = {01},
      number = {},
      pages = {837-847},
      doi = {10.1109/QCE57702.2023.00098},
      urldate = {2023-03-30},
      link = {http://arxiv.org/abs/2303.17366},
      keywords = {Optimisation, Phase Gadgets, Variational Circuits, Automation, Applied, ZX-calculus},
      abstract = {The synthesis of quantum circuits from phase gadgets in the ZX-calculus facilitates quantum circuit optimization. Our work provides an alternative formulation for the architecture-aware synthesis algorithm of PauliOpt by replacing the stochastic approach of PauliOpt with a heuristic based search and utilizes a divide and conquer method to synthesize an optimized circuit from a ZX polynomial. We provide a comparison of our algorithm with PauliOpt and other state-of-the-art optimization libraries. While we note poorer performance for highly structured circuits, as in the QAOA formulation for Max-Cut, we demonstrate a significant advantage for randomized circuits, which highlights the advantages of utilizing an architecture-aware methodology.}
  }
  

  Copy to Clipboard

• The Zeta Calculus
  Nicklas Botö and Fabian Forslund
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2303.17399
  Keywords: Protocols, Category Theory, Verification, ZX-calculus.

  We propose a quantum programming language that generalizes the \(\lambda\)-calculus. The language is non-linear; duplicated variables denote, not cloning of quantum data, but sharing a qubit's state; that is, producing an entangled pair of qubits whose amplitudes are identical with respect to a chosen basis. The language has two abstraction operators, \(\zeta\) and \(\xi\), corresponding to the Z- and X-bases; each abstraction operator is also parameterised by a phase, indicating a rotation that is applied to the input before it is shared. We give semantics for the language in the ZX-calculus and prove its equational theory sound. We show how this language can provide a good representation of higher-order functions in the quantum world.

  @article{boto2023zetcalculus,
      author = {Bot{\"o}, Nicklas and Forslund, Fabian},
      title = {{The Zeta Calculus}},
      year = {2023},
      journal = {arXiv preprint arXiv:2303.17399},
      urldate = {2023-03-30},
      link = {http://arxiv.org/abs/2303.17399},
      keywords = {Protocols, Category Theory, Verification, ZX-calculus},
      abstract = {We propose a quantum programming language that generalizes the $\lambda$-calculus. The language is non-linear; duplicated variables denote, not cloning of quantum data, but sharing a qubit's state; that is, producing an entangled pair of qubits whose amplitudes are identical with respect to a chosen basis. The language has two abstraction operators, $\zeta$ and $\xi$, corresponding to the Z- and X-bases; each abstraction operator is also parameterised by a phase, indicating a rotation that is applied to the input before it is shared. We give semantics for the language in the ZX-calculus and prove its equational theory sound. We show how this language can provide a good representation of higher-order functions in the quantum world.},
      video = {https://www.youtube.com/watch?v=iUHEy3PZCso}
  }
  

  Copy to Clipboard

• Unifying flavors of fault tolerance with the ZX calculus
  Hector Bombin, Daniel Litinski, Naomi Nickerson, Fernando Pastawski and Sam Roberts
  Show abstract ⇲ Show bibdata ⇲

  Quantum
  Keywords: Surface Code, Lattice Surgery, Error Correcting Codes, Pauli Fusion, ZX-calculus.

  There are several models of quantum computation which exhibit shared fundamental fault-tolerance properties. This article makes commonalities explicit by presenting these different models in a unifying framework based on the ZX calculus. We focus on models of topological fault tolerance - specifically surface codes - including circuit-based, measurement-based and fusion-based quantum computation, as well as the recently introduced model of Floquet codes. We find that all of these models can be viewed as different flavors of the same underlying stabilizer fault-tolerance structure, and sustain this through a set of local equivalence transformations which allow mapping between flavors. We anticipate that this unifying perspective will pave the way to transferring progress among the different views of stabilizer fault-tolerance and help researchers familiar with one model easily understand others.

  @article{bombin2023unifying,
      author = {Bombin, Hector and Litinski, Daniel and Nickerson, Naomi and Pastawski, Fernando and Roberts, Sam},
      title = {{Unifying flavors of fault tolerance with the ZX calculus}},
      year = {2024},
      journal = {{Quantum}},
      volume = {8},
      month = {6},
      pages = {1379},
      publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
      issn = {2521-327X},
      doi = {10.22331/q-2024-06-18-1379},
      urldate = {2023-03-15},
      link = {http://arxiv.org/abs/2303.08829},
      keywords = {Surface Code, Lattice Surgery, Error Correcting Codes, Pauli Fusion, ZX-calculus},
      abstract = {There are several models of quantum computation which exhibit shared fundamental fault-tolerance properties. This article makes commonalities explicit by presenting these different models in a unifying framework based on the ZX calculus. We focus on models of topological fault tolerance - specifically surface codes - including circuit-based, measurement-based and fusion-based quantum computation, as well as the recently introduced model of Floquet codes. We find that all of these models can be viewed as different flavors of the same underlying stabilizer fault-tolerance structure, and sustain this through a set of local equivalence transformations which allow mapping between flavors. We anticipate that this unifying perspective will pave the way to transferring progress among the different views of stabilizer fault-tolerance and help researchers familiar with one model easily understand others.}
  }
  

  Copy to Clipboard

• Modular decoding: parallelizable real-time decoding for quantum computers
  Héctor Bombín, Chris Dawson, Ye-Hua Liu, Naomi Nickerson, Fernando Pastawski and Sam Roberts
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2303.04846
  Keywords: Surface Code, Lattice Surgery, Error Correcting Codes, Applied, ZX-calculus.

  Universal fault-tolerant quantum computation will require real-time decoding algorithms capable of quickly extracting logical outcomes from the stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks which is remarkably effective. This decomposition of the global decoding problem into sub-tasks mirrors the logical-block-network structure of a fault-tolerant quantum circuit. We identify the buffering condition as a key requirement controlling decoder quality; it demands a sufficiently large separation (buffer) between a correction committed by a decoding sub-task and the data unavailable to it. We prove that the fault distance of the protocol is preserved if the buffering condition is satisfied. Finally, we implement edge-vertex modular decoding and apply it on a variety of quantum circuits, including the Clifford component of the 15-to-1 magic-state distillation protocol. Monte Carlo simulations on a range of buffer sizes provide quantitative evidence that buffers are both necessary and sufficient to guarantee decoder accuracy. Our results show that modular decoding meets all the practical requirements necessary to support real-world fault-tolerant quantum computers.

  @article{bombin2023modular,
      author = {Bomb{\'i}n, H{\'e}ctor and Dawson, Chris and Liu, Ye-Hua and Nickerson, Naomi and Pastawski, Fernando and Roberts, Sam},
      title = {{Modular decoding: parallelizable real-time decoding for quantum computers}},
      year = {2023},
      journal = {arXiv preprint arXiv:2303.04846},
      urldate = {2023-03-08},
      link = {http://arxiv.org/abs/2303.04846},
      keywords = {Surface Code, Lattice Surgery, Error Correcting Codes, Applied, ZX-calculus},
      abstract = {Universal fault-tolerant quantum computation will require real-time decoding algorithms capable of quickly extracting logical outcomes from the stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks which is remarkably effective. This decomposition of the global decoding problem into sub-tasks mirrors the logical-block-network structure of a fault-tolerant quantum circuit. We identify the buffering condition as a key requirement controlling decoder quality; it demands a sufficiently large separation (buffer) between a correction committed by a decoding sub-task and the data unavailable to it. We prove that the fault distance of the protocol is preserved if the buffering condition is satisfied. Finally, we implement edge-vertex modular decoding and apply it on a variety of quantum circuits, including the Clifford component of the 15-to-1 magic-state distillation protocol. Monte Carlo simulations on a range of buffer sizes provide quantitative evidence that buffers are both necessary and sufficient to guarantee decoder accuracy. Our results show that modular decoding meets all the practical requirements necessary to support real-world fault-tolerant quantum computers.}
  }
  

  Copy to Clipboard

• Quantum Circuit Completeness: Extensions and Simplifications
  Alexandre Clément, Noé Delorme, Simon Perdrix and Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  International Conference on Computer Science Logic CSL 2024
  Keywords: Completeness, Mixed States, Universal Fragment, Toffoli, ZX-Supported.

  Although quantum circuits have been ubiquitous for decades in quantum computing, the first complete equational theory for quantum circuits has only recently been introduced. Completeness guarantees that any true equation on quantum circuits can be derived from the equational theory. Our contribution is twofold: (i) We simplify this equational theory by proving that several rules can be derived from the remaining ones. In particular, two out of the three most intricate rules are removed, the third one being slightly simplified. (ii) We extend the complete equational theory to quantum circuits with ancillae or qubit discarding, to represent respectively quantum computations using an additional workspace, and hybrid quantum computations. We show that the remaining intricate rule can be greatly simplified in these more expressive settings. The development of simple and complete equational theories for expressive quantum circuit models opens new avenues for reasoning about quantum circuits. It provides strong formal foundations for various compiling tasks such as circuit optimisation, hardware constraint satisfaction and verification.

  @inproceedings{clement2024quantum,
      author = {Cl{\'e}ment, Alexandre and Delorme, No{\'e} and Perdrix, Simon and Vilmart, Renaud},
      title = {Quantum Circuit Completeness: Extensions and Simplifications},
      year = {2024},
      booktitle = {International Conference on Computer Science Logic CSL 2024},
      doi = {10.4230/LIPIcs.CSL.2024.20},
      urldate = {2023-03-06},
      link = {http://arxiv.org/abs/2303.03117},
      keywords = {Completeness, Mixed States, Universal Fragment, Toffoli, ZX-Supported},
      abstract = {Although quantum circuits have been ubiquitous for decades in quantum computing, the first complete equational theory for quantum circuits has only recently been introduced. Completeness guarantees that any true equation on quantum circuits can be derived from the equational theory. Our contribution is twofold: (i) We simplify this equational theory by proving that several rules can be derived from the remaining ones. In particular, two out of the three most intricate rules are removed, the third one being slightly simplified. (ii) We extend the complete equational theory to quantum circuits with ancillae or qubit discarding, to represent respectively quantum computations using an additional workspace, and hybrid quantum computations. We show that the remaining intricate rule can be greatly simplified in these more expressive settings. The development of simple and complete equational theories for expressive quantum circuit models opens new avenues for reasoning about quantum circuits. It provides strong formal foundations for various compiling tasks such as circuit optimisation, hardware constraint satisfaction and verification.}
  }
  

  Copy to Clipboard

• Basic ZX-calculus for students and professionals
  Bob Coecke
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2303.03163
  Keywords: ZX-calculus, MBQC, Graph States, Protocols.

  These are the lecture notes of guest lectures for Artur Ekert's course Introduction to Quantum Information at the Mathematical Institute of Oxford University, Hilary Term 2023. Some basic familiarity with Dirac notation is assumed. For the readers of Quantum in Pictures (QiP) who have some basic quantum background, these notes also constitute the shortest path to an explanation of how what they learn in QIP relates to the traditional quantum formalism.

  @article{coecke2023basic,
      author = {Coecke, Bob},
      title = {{Basic ZX-calculus for students and professionals}},
      year = {2023},
      journal = {arXiv preprint arXiv:2303.03163},
      urldate = {2023-03-06},
      link = {http://arxiv.org/abs/2303.03163},
      keywords = {ZX-calculus, MBQC, Graph States, Protocols},
      abstract = {These are the lecture notes of guest lectures for Artur Ekert's course Introduction to Quantum Information at the Mathematical Institute of Oxford University, Hilary Term 2023. Some basic familiarity with Dirac notation is assumed. For the readers of Quantum in Pictures (QiP) who have some basic quantum background, these notes also constitute the shortest path to an explanation of how what they learn in QIP relates to the traditional quantum formalism.}
  }
  

  Copy to Clipboard

• Resource efficient method for representation and measurement of constrained electronic structure states with a quantum computer
  Kaur Kristjuhan and Mark Nicholas Jones
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2303.01122
  Keywords: ZX-Supported, Chemistry, Applied.

  We present a novel method for improving the quantum simulation of the ground state energy of molecules. We perform a pre-processing step classically, which reduces the dimensionality of the problem by generating a custom mapping which excludes states which violate problem constraints. Subsequently, a specialized measurement scheme is used to extract the expectation value of the problem Hamiltonian through this mapping. We demonstrate that this method reduces the amount of quantum resources needed to run a Variational Quantum Eigensolver (VQE) algorithm without making any approximations to the physics of the quantum chemistry problem.

  @article{kristjuhan2023resource,
      author = {Kristjuhan, Kaur and Nicholas Jones, Mark},
      title = {{Resource efficient method for representation and measurement of constrained electronic structure states with a quantum computer}},
      year = {2023},
      journal = {arXiv preprint arXiv:2303.01122},
      urldate = {2023-03-02},
      link = {http://arxiv.org/abs/2303.01122},
      keywords = {ZX-Supported, Chemistry, Applied},
      abstract = {We present a novel method for improving the quantum simulation of the ground state energy of molecules. We perform a pre-processing step classically, which reduces the dimensionality of the problem by generating a custom mapping which excludes states which violate problem constraints. Subsequently, a specialized measurement scheme is used to extract the expectation value of the problem Hamiltonian through this mapping. We demonstrate that this method reduces the amount of quantum resources needed to run a Variational Quantum Eigensolver (VQE) algorithm without making any approximations to the physics of the quantum chemistry problem.}
  }
  

  Copy to Clipboard

• Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States
  Léo Colisson, Garazi Muguruza and Florian Speelman
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2303.01476
  Keywords: ZX-Supported, Cryptography, Applied.

  We provide a generic construction to turn any classical Zero-Knowledge (ZK) protocol into a composable (quantum) oblivious transfer (OT) protocol, mostly lifting the round-complexity properties and security guarantees (plain-model/statistical security/unstructured functions...) of the ZK protocol to the resulting OT protocol. Such a construction is unlikely to exist classically as Cryptomania is believed to be different from Minicrypt. In particular, by instantiating our construction using Non-Interactive ZK (NIZK), we provide the first round-optimal (2-message) quantum OT protocol secure in the random oracle model, and round-optimal extensions to string and k-out-of-n OT. At the heart of our construction lies a new method that allows us to prove properties on a received quantum state without revealing (too much) information on it, even in a non-interactive way and/or with statistical guarantees when using an appropriate classical ZK protocol. We can notably prove that a state has been partially measured (with arbitrary constraints on the set of measured qubits), without revealing any additional information on this set. This notion can be seen as an analog of ZK to quantum states, and we expect it to be of independent interest as it extends complexity theory to quantum languages, as illustrated by the two new complexity classes we introduce, ZKstateQIP and ZKstateQMA.

  @article{colisson2023oblivious,
      author = {Colisson, L{\'e}o and Muguruza, Garazi and Speelman, Florian},
      title = {{Oblivious Transfer from Zero-Knowledge Proofs, or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States}},
      year = {2023},
      journal = {arXiv preprint arXiv:2303.01476},
      urldate = {2023-03-02},
      link = {http://arxiv.org/abs/2303.01476},
      keywords = {ZX-Supported, Cryptography, Applied},
      abstract = {We provide a generic construction to turn any classical Zero-Knowledge (ZK) protocol into a composable (quantum) oblivious transfer (OT) protocol, mostly lifting the round-complexity properties and security guarantees (plain-model/statistical security/unstructured functions...) of the ZK protocol to the resulting OT protocol. Such a construction is unlikely to exist classically as Cryptomania is believed to be different from Minicrypt.   In particular, by instantiating our construction using Non-Interactive ZK (NIZK), we provide the first round-optimal (2-message) quantum OT protocol secure in the random oracle model, and round-optimal extensions to string and k-out-of-n OT.   At the heart of our construction lies a new method that allows us to prove properties on a received quantum state without revealing (too much) information on it, even in a non-interactive way and/or with statistical guarantees when using an appropriate classical ZK protocol. We can notably prove that a state has been partially measured (with arbitrary constraints on the set of measured qubits), without revealing any additional information on this set. This notion can be seen as an analog of ZK to quantum states, and we expect it to be of independent interest as it extends complexity theory to quantum languages, as illustrated by the two new complexity classes we introduce, ZKstateQIP and ZKstateQMA.}
  }
  

  Copy to Clipboard

• Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
  Boldizsár Poór, Quanlong Wang, Razin A. Shaikh, Lia Yeh, Richie Yeung and Bob Coecke
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  Keywords: ZW-calculus, Completeness, ZX-calculus, Qudits.

  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.

  @inproceedings{poor2023completeness,
      author = {Poór, Boldizsár and Wang, Quanlong and Shaikh, Razin A. and Yeh, Lia and Yeung, Richie and Coecke, Bob},
      title = {{Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus}},
      year = {2023},
      booktitle = {2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
      volume = {},
      number = {},
      pages = {1-14},
      doi = {10.1109/LICS56636.2023.10175672},
      urldate = {2023-02-23},
      link = {http://arxiv.org/abs/2302.12135},
      keywords = {ZW-calculus, Completeness, ZX-calculus, Qudits},
      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.},
      video = {https://www.youtube.com/watch?v=qsg52sVZcEg}
  }
  

  Copy to Clipboard

• Complete Graphical Language for Hermiticity-Preserving Superoperators
  Titouan Carette, Timothée Hoffreumon, Émile Larroque and Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  Keywords: ZW-calculus, Completeness, Category Theory, Mixed States.

  Universal and complete graphical languages have been successfully designed for pure state quantum mechanics, corresponding to linear maps between Hilbert spaces, and mixed states quantum mechanics, corresponding to completely positive superoperators. In this paper, we go one step further and present a universal and complete graphical language for Hermiticity-preserving superoperators. Such a language opens the possibility of diagrammatic compositional investigations of antilinear transformations featured in various physical situations, such as the Choi-Jamio{\l}kowski isomorphism, spin-flip, or entanglement witnesses. Our construction relies on an extension of the ZW-calculus exhibiting a normal form for Hermitian matrices.

  @inproceedings{carette2023complete,
      author = {Carette, Titouan and Hoffreumon, Timothée and Larroque, Émile and Vilmart, Renaud},
      title = {Complete Graphical Language for Hermiticity-Preserving Superoperators},
      year = {2023},
      booktitle = {2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
      volume = {},
      number = {},
      pages = {1-22},
      doi = {10.1109/LICS56636.2023.10175712},
      urldate = {2023-02-08},
      link = {http://arxiv.org/abs/2302.04212},
      keywords = {ZW-calculus, Completeness, Category Theory, Mixed States},
      abstract = {Universal and complete graphical languages have been successfully designed for pure state quantum mechanics, corresponding to linear maps between Hilbert spaces, and mixed states quantum mechanics, corresponding to completely positive superoperators. In this paper, we go one step further and present a universal and complete graphical language for Hermiticity-preserving superoperators. Such a language opens the possibility of diagrammatic compositional investigations of antilinear transformations featured in various physical situations, such as the Choi-Jamio{\l}kowski isomorphism, spin-flip, or entanglement witnesses. Our construction relies on an extension of the ZW-calculus exhibiting a normal form for Hermitian matrices.}
  }
  

  Copy to Clipboard

• Cutting multi-control quantum gates with ZX calculus
  Christian Ufrecht, Maniraman Periyasamy, Sebastian Rietsch, Daniel D. Scherer, Axel Plinge and Christopher Mutschler
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Quantum
  Keywords: ZH-calculus, Classical Simulation, Applied.

  Circuit cutting, the decomposition of a quantum circuit into independent partitions, has become a promising avenue towards experiments with larger quantum circuits in the noisy-intermediate scale quantum (NISQ) era. While previous work focused on cutting qubit wires or two-qubit gates, in this work we introduce a method for cutting multi-controlled Z gates. We construct a decomposition and prove the upper bound \(\mathcal{O}(6^{2K})\) on the associated sampling overhead, where \(K\) is the number of cuts in the circuit. This bound is independent of the number of control qubits but can be further reduced to \(\mathcal{O}(4.5^{2K})\) for the special case of CCZ gates. Furthermore, we evaluate our proposal on IBM hardware and experimentally show noise resilience due to the strong reduction of CNOT gates in the cut circuits.

  @article{ufrecht2023cutting,
      author = {Ufrecht, Christian and Periyasamy, Maniraman and Rietsch, Sebastian and Scherer, Daniel D. and Plinge, Axel and Mutschler, Christopher},
      title = {Cutting multi-control quantum gates with {ZX} calculus},
      year = {2023},
      journal = {{Quantum}},
      volume = {7},
      month = {10},
      pages = {1147},
      publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
      issn = {2521-327X},
      doi = {10.22331/q-2023-10-23-1147},
      urldate = {2023-02-01},
      link = {http://arxiv.org/abs/2302.00387},
      url = {https://doi.org/10.22331/q-2023-10-23-1147},
      keywords = {ZH-calculus, Classical Simulation, Applied},
      abstract = {Circuit cutting, the decomposition of a quantum circuit into independent partitions, has become a promising avenue towards experiments with larger quantum circuits in the noisy-intermediate scale quantum (NISQ) era. While previous work focused on cutting qubit wires or two-qubit gates, in this work we introduce a method for cutting multi-controlled Z gates. We construct a decomposition and prove the upper bound $\mathcal{O}(6^{2K})$ on the associated sampling overhead, where $K$ is the number of cuts in the circuit. This bound is independent of the number of control qubits but can be further reduced to $\mathcal{O}(4.5^{2K})$ for the special case of CCZ gates. Furthermore, we evaluate our proposal on IBM hardware and experimentally show noise resilience due to the strong reduction of CNOT gates in the cut circuits.},
      video = {https://www.youtube.com/watch?v=YPtEIuapWww}
  }
  

  Copy to Clipboard

• CSS code surgery as a universal construction
  Alexander Cowtan and Simon Burton
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Quantum
  Keywords: Error Correcting Codes, Category Theory, ZX-Supported.

  We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes, and describe code surgery between such codes using a specific colimit in the category of chain complexes. As well as describing a surgery operation, this gives a general recipe for new codes. As an application we describe how to `merge' and `split' along a shared \(\overline{X}\) or \(\overline{Z}\) operator between arbitrary CSS codes in a fault-tolerant manner, so long as the participating qubits satisfy a technical condition related to gauge fixing. We prove that such merges and splits on LDPC codes yield codes which are themselves LDPC.

  @article{cowtan2023css,
      author = {Cowtan, Alexander and Burton, Simon},
      title = {{CSS code surgery as a universal construction}},
      year = {2024},
      journal = {{Quantum}},
      volume = {8},
      month = {5},
      pages = {1344},
      publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
      issn = {2521-327X},
      doi = {10.22331/q-2024-05-14-1344},
      urldate = {2023-01-31},
      link = {http://arxiv.org/abs/2301.13738},
      keywords = {Error Correcting Codes, Category Theory, ZX-Supported},
      abstract = {We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes, and describe code surgery between such codes using a specific colimit in the category of chain complexes. As well as describing a surgery operation, this gives a general recipe for new codes. As an application we describe how to `merge' and `split' along a shared $\overline{X}$ or $\overline{Z}$ operator between arbitrary CSS codes in a fault-tolerant manner, so long as the participating qubits satisfy a technical condition related to gauge fixing. We prove that such merges and splits on LDPC codes yield codes which are themselves LDPC.},
      video = {https://www.youtube.com/watch?v=XPY53T7DkXc}
  }
  

  Copy to Clipboard

• Towards a Curry-Howard Correspondence for Quantum Computation
  Kostia Chardonnet
  Show abstract ⇲ Show bibdata ⇲

  Université Paris-Saclay PhD Thesis
  Keywords: ZX-calculus, Category Theory, Completeness, Verification, PhD Thesis.

  In this thesis, we are interested in the development of a Curry-Howard correspondence for quantum computing, allowing to represent quantum types and quantum control-flow. In the standard model of Quantum Computation, a classical computer is linked to a quantum coprocessor. The classical computer can then send instructions to allocate, update, or read quantum registers. The programs executed by the coprocessor are represented by a quantum circuit: a sequence of instructions that applies unitary operations to the input quantum bits. While the model is universal, in the sense that it can represent any unitary operations, it stays limited: it lacks of proper representation of non-causal execution flow. Normally, to represent branching, one can use a type system featuring a coproduct, allowing for the choice between two possible executions, but quantum circuits only feature qubits and tensors thereof. On the other hand, types and strongly related to logic via the Curry-Howard correspondence which states that types of programs correspond to formulas and programs to proofs, while the program evaluation is matched with the proof simplification. While this correspondence has been extended to multiple setting in classical computer, it has yet to emerge in quantum computing. To address those problems we follow two different approaches: the first one, through the development of a linear and reversible programming language, capturing a subset of quantum computing, along with a Curry-Howard correspondence with the logic µMALL. The language comes in two versions: one representing exactly complete, reversible functions while the other one can represent partial functions. Both version comes with an expressivity result: in the former, one can capture the whole class of Primitive Recursive Functions, while in the later any Turing Machine we show how to capture any Turing Machine. The second approach follows the development of token-based semantics, inspired by Girard’s Geometry of Interaction, for graphical language for quantum computation. In this approach, a token-based semantics was given for the ZX-Calculus: a graphical language for quantum computation capable of representing any linear operators. We show how the token-based semantics matches the denotational one. We extend the ZX-Calculus with a coproduct and an explicit tensor in the development of the Many-Worlds Calculus. This new languages comes with a token-based semantics and an equational theory. We show how quantum control can be represented in this system. Finally, the programming language is modified to be able to realize pure quantum computation and the graphical language is then used as a denotational model for it.

  @phdthesis{Chardonnet2023thesis,
      author = {Chardonnet, Kostia},
      title = {{Towards a Curry-Howard Correspondence for Quantum Computation}},
      year = {2023},
      school = {Universit\'e Paris-Saclay},
      urldate = {2023-01-27},
      link = {https://theses.hal.science/tel-03959403/document},
      keywords = {ZX-calculus, Category Theory, Completeness, Verification, PhD Thesis},
      abstract = {In this thesis, we are interested in the development of a Curry-Howard correspondence for quantum computing, allowing to represent quantum types and quantum control-flow. In the standard model of Quantum Computation, a classical computer is linked to a quantum coprocessor. The classical computer can then send instructions to allocate, update, or read quantum registers. The programs executed by the coprocessor are represented by a quantum circuit: a sequence of instructions that applies unitary operations to the input quantum bits. While the model is universal, in the sense that it can represent any unitary operations, it stays limited: it lacks of proper representation of non-causal execution flow. Normally, to represent branching, one can use a type system featuring a coproduct, allowing for the choice between two possible executions, but quantum circuits only feature qubits and tensors thereof. On the other hand, types and strongly related to logic via the Curry-Howard correspondence which states that types of programs correspond to formulas and programs to proofs, while the program evaluation is matched with the proof simplification. While this correspondence has been extended to multiple setting in classical computer, it has yet to emerge in quantum computing. To address those problems we follow two different approaches: the first one, through the development of a linear and reversible programming language, capturing a subset of quantum computing, along with a Curry-Howard correspondence with the logic µMALL. The language comes in two versions: one representing exactly complete, reversible functions while the other one can represent partial functions. Both version comes with an expressivity result: in the former, one can capture the whole class of Primitive Recursive Functions, while in the later any Turing Machine we show how to capture any Turing Machine. The second approach follows the development of token-based semantics, inspired by Girard’s Geometry of Interaction, for graphical language for quantum computation. In this approach, a token-based semantics was given for the ZX-Calculus: a graphical language for quantum computation capable of representing any linear operators. We show how the token-based semantics matches the denotational one. We extend the ZX-Calculus with a coproduct and an explicit tensor in the development of the Many-Worlds Calculus. This new languages comes with a token-based semantics and an equational theory. We show how quantum control can be represented in this system. Finally, the programming language is modified to be able to realize pure quantum computation and the graphical language is then used as a denotational model for it. }
  }
  

  Copy to Clipboard

• Equivariant quantum graph circuits: constructions for universal approximation over graphs
  Péter Mernyei, Konstantinos Meichanetzidis and İsmail \̇lkan Ceylan
  Show abstract ⇲ Show bibdata ⇲

  Quantum Machine Intelligence
  Keywords: ZX-calculus, Variational Circuits, Graph States, Applied.

  We investigate quantum circuits for graph representation learning, and propose equivariant quantum graph circuits (EQGCs), as a class of parameterized quantum circuits with strong relational inductive bias for learning over graph-structured data. Conceptually, EQGCs serve as a unifying framework for quantum graph representation learning, allowing us to define several interesting subclasses subsuming existing proposals. In terms of the representation power, we prove that the subclasses of interest are universal approximators for functions over the bounded graph domain. This theoretical perspective on quantum graph machine learning methods opens many directions for further work, and could lead to models with capabilities beyond those of classical approaches. We also provide experimental evidence, and observe that the performance of EQGCs scales well with the depth of the model.

  @article{mernyei2023equivariant,
      author = {Mernyei, P{\'e}ter and Meichanetzidis, Konstantinos and Ceylan, {\.I}smail {\.I}lkan},
      title = {Equivariant quantum graph circuits: constructions for universal approximation over graphs},
      year = {2023},
      journal = {Quantum Machine Intelligence},
      volume = {5},
      number = {1},
      pages = {6},
      publisher = {Springer},
      doi = {10.1007/s42484-022-00086-w},
      urldate = {2023-01-24},
      link = {https://link.springer.com/article/10.1007/s42484-022-00086-w},
      keywords = {ZX-calculus, Variational Circuits, Graph States, Applied},
      abstract = {We investigate quantum circuits for graph representation learning, and propose equivariant quantum graph circuits (EQGCs), as a class of parameterized quantum circuits with strong relational inductive bias for learning over graph-structured data. Conceptually, EQGCs serve as a unifying framework for quantum graph representation learning, allowing us to define several interesting subclasses subsuming existing proposals. In terms of the representation power, we prove that the subclasses of interest are universal approximators for functions over the bounded graph domain. This theoretical perspective on quantum graph machine learning methods opens many directions for further work, and could lead to models with capabilities beyond those of classical approaches. We also provide experimental evidence, and observe that the performance of EQGCs scales well with the depth of the model.}
  }
  

  Copy to Clipboard

• Towards a compiler toolchain for quantum programs
  Agustín Borgna
  Show abstract ⇲ Show bibdata ⇲

  Loria, Université de Lorraine PhD Thesis
  Keywords: ZX-calculus, Scalable ZX, Mixed States, Protocols, PyZX, Automation, Optimisation, Category Theory, Circuit Extraction, Applied, PhD Thesis.

  In this thesis, we present various contributions to the different stages of a quantum compiler toolchain. Our first contribution is the definition of a new intermediate representation for quantum programs based on an extension of the ZX calculus called Scalable ZX (SZX), which allows us to compactly represent quantum circuits repeated structure. We introduce a non-trivial fragment of the Proto-Quipper-D language and present its encoding into families of such SZX-diagrams, that can be used to optimize recurrent segments of the program in a single optimization pass. This intermediate representation can then be transformed into a ZX diagram or a quantum circuit to continue the compilation process. This work was first presented at the International Workshop on Programming Languages for Quantum Computing (PLanQC 2022), and a full version was published in the proceedings of the Quantum Physics and Logic Conference (QPL 2022). A second contribution of this work is the definition of a new optimization procedure for quantum circuits containing both quantum and classical segments, based on the method by Duncan et al. We are able to use an extension of the ZX calculus called ZX Ground to represent such hybrid programs, and optimize programs that encode some communication between the quantum and classical components. A preliminary version of this work was first presented in the proceedings of the International Workshop on Quantum Compilation (IWQC 2020), and finally published at the Asian Symposium on Programming Languages and Systems (APLAS 2021). We have implemented our optimization procedure as an extension of the ZX-diagram manipulation tool pyzx, and upstreamed some of the changes to the main repository. Finally, our last contribution pertains to the detection of classical segments in a hybrid quantum-classical circuit. Some automated optimization processes such as the one we present may produce circuits that computes quantumly some operations that could be performed classically using fewer resources. We formalise the classicalisation problem and present an efficient heuristic to detect such segments. This work was developed jointly with the optimization procedure for hybrid quantum-classical circuits, and a succinct version was published along it at APLAS 2021.

  @phdthesis{Borgna2023thesis,
      author = {Borgna, Agust\'in},
      title = {{Towards a compiler toolchain for quantum programs}},
      year = {2023},
      school = {Loria, Universit\'e de Lorraine},
      urldate = {2023-01-13},
      link = {https://lmf.cnrs.fr/downloads/Perso/thesis-aborgna.pdf},
      keywords = {ZX-calculus, Scalable ZX, Mixed States, Protocols, PyZX, Automation, Optimisation, Category Theory, Circuit Extraction, Applied, PhD Thesis},
      abstract = {In this thesis, we present various contributions to the different stages of a quantum compiler toolchain. Our first contribution is the definition of a new intermediate representation for quantum programs based on an extension of the ZX calculus called Scalable ZX (SZX), which allows us to compactly represent quantum circuits repeated structure. We introduce a non-trivial fragment of the Proto-Quipper-D language and present its encoding into families of such SZX-diagrams, that can be used to optimize recurrent segments of the program in a single optimization pass. This intermediate representation can then be transformed into a ZX diagram or a quantum circuit to continue the compilation process. This work was first presented at the International Workshop on Programming Languages for Quantum Computing (PLanQC 2022), and a full version was published in the proceedings of the Quantum Physics and Logic Conference (QPL 2022). A second contribution of this work is the definition of a new optimization procedure for quantum circuits containing both quantum and classical segments, based on the method by Duncan et al. We are able to use an extension of the ZX calculus called ZX Ground to represent such hybrid programs, and optimize programs that encode some communication between the quantum and classical components. A preliminary version of this work was first presented in the proceedings of the International Workshop on Quantum Compilation (IWQC 2020), and finally published at the Asian Symposium on Programming Languages and Systems (APLAS 2021). We have implemented our optimization procedure as an extension of the ZX-diagram manipulation tool pyzx, and upstreamed some of the changes to the main repository. Finally, our last contribution pertains to the detection of classical segments in a hybrid quantum-classical circuit. Some automated optimization processes such as the one we present may produce circuits that computes quantumly some operations that could be performed classically using fewer resources. We formalise the classicalisation problem and present an efficient heuristic to detect such segments. This work was developed jointly with the optimization procedure for hybrid quantum-classical circuits, and a succinct version was published along it at APLAS 2021.}
  }
  

  Copy to Clipboard

• Graphical quantum Clifford-encoder compilers from the ZX calculus
  Andrey Boris Khesin, Jonathan Z. Lu and Peter W. Shor
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2301.02356
  Keywords: Error Correcting Codes, ZX-calculus, Applied.

  We present a quantum compilation algorithm that maps Clifford encoders, an equivalence class of quantum circuits that arise universally in quantum error correction, into a representation in the ZX calculus. In particular, we develop a canonical form in the ZX calculus and prove canonicity as well as efficient reducibility of any Clifford encoder into the canonical form. The diagrams produced by our compiler explicitly visualize information propagation and entanglement structure of the encoder, revealing properties that may be obscured in the circuit or stabilizer-tableau representation.

  @article{boriskhesin2023graphical,
      author = {Boris Khesin, Andrey and Z. Lu, Jonathan and W. Shor, Peter},
      title = {{Graphical quantum Clifford-encoder compilers from the ZX calculus}},
      year = {2023},
      journal = {arXiv preprint arXiv:2301.02356},
      urldate = {2023-01-06},
      link = {http://arxiv.org/abs/2301.02356},
      keywords = {Error Correcting Codes, ZX-calculus, Applied},
      abstract = {We present a quantum compilation algorithm that maps Clifford encoders, an equivalence class of quantum circuits that arise universally in quantum error correction, into a representation in the ZX calculus. In particular, we develop a canonical form in the ZX calculus and prove canonicity as well as efficient reducibility of any Clifford encoder into the canonical form. The diagrams produced by our compiler explicitly visualize information propagation and entanglement structure of the encoder, revealing properties that may be obscured in the circuit or stabilizer-tableau representation.}
  }
  

  Copy to Clipboard

• Encoding High-level Quantum Programs as SZX-diagrams
  Augustin Borgna and Rafael Romero
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022
  Keywords: Scalable ZX, ZX-calculus, Protocols.

  The Scalable ZX-calculus is a compact graphical language used to reason about linear maps between quantum states. These diagrams have multiple applications, but they frequently have to be constructed in a case-by-case basis. In this work we present a method to encode quantum programs implemented in a fragment of the linear dependently typed Proto-Quipper-D language as families of SZX-diagrams. We define a subset of translatable Proto-Quipper-D programs and show that our procedure is able to encode non-trivial algorithms as diagrams that grow linearly on the size of the program.

  @inproceedings{borgna2023encoding,
      author = {Borgna, Augustin and Romero, Rafael},
      title = {Encoding High-level Quantum Programs as SZX-diagrams},
      year = {2023},
      booktitle = {Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022},
      editor = {Gogioso, Stefano and Hoban, Matty},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {394},
      pages = {141-169},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.394.9},
      link = {http://arxiv.org/abs/2206.09376},
      keywords = {Scalable ZX, ZX-calculus, Protocols},
      abstract = {The Scalable ZX-calculus is a compact graphical language used to reason about linear maps between quantum states. These diagrams have multiple applications, but they frequently have to be constructed in a case-by-case basis. In this work we present a method to encode quantum programs implemented in a fragment of the linear dependently typed Proto-Quipper-D language as families of SZX-diagrams. We define a subset of translatable Proto-Quipper-D programs and show that our procedure is able to encode non-trivial algorithms as diagrams that grow linearly on the size of the program.},
      video = {https://www.youtube.com/watch?v=umYCWcBtXhs}
  }
  

  Copy to Clipboard

• Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus
  Titouan Carette, Etienne Moutot, Thomas Perez and Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
  Keywords: ZW-calculus, Completeness, Classical Simulation, Applied.

  We exhibit a strong connection between the matchgate formalism introduced by Valiant and the ZW-calculus of Coecke and Kissinger. This connection provides a natural compositional framework for matchgate theory as well as a direct combinatorial interpretation of the diagrams of ZW-calculus through the perfect matchings of their underlying graphs. We identify a precise fragment of ZW-calculus, the planar W-calculus, that we prove to be complete and universal for matchgates, that are linear maps satisfying the matchgate identities. Computing scalars of the planar W-calculus corresponds to counting perfect matchings of planar graphs, and so can be carried in polynomial time using the FKT algorithm, making the planar W-calculus an efficiently simulable fragment of the ZW-calculus, in a similar way that the Clifford fragment is for ZX-calculus. This work opens new directions for the investigation of the combinatorial properties of ZW-calculus as well as the study of perfect matching counting through compositional diagrammatical technics.

  @inproceedings{carette2023compositionality,
      author = {Carette, Titouan and Moutot, Etienne and Perez, Thomas and Vilmart, Renaud},
      title = {{Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus}},
      year = {2023},
      booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
      editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {261},
      pages = {120:1--120:17},
      publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-278-5},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.ICALP.2023.120},
      link = {http://arxiv.org/abs/2302.08767},
      url = {https://drops.dagstuhl.de/opus/volltexte/2023/18172},
      keywords = {ZW-calculus, Completeness, Classical Simulation, Applied},
      abstract = {We exhibit a strong connection between the matchgate formalism introduced by Valiant and the ZW-calculus of Coecke and Kissinger. This connection provides a natural compositional framework for matchgate theory as well as a direct combinatorial interpretation of the diagrams of ZW-calculus through the perfect matchings of their underlying graphs.   We identify a precise fragment of ZW-calculus, the planar W-calculus, that we prove to be complete and universal for matchgates, that are linear maps satisfying the matchgate identities. Computing scalars of the planar W-calculus corresponds to counting perfect matchings of planar graphs, and so can be carried in polynomial time using the FKT algorithm, making the planar W-calculus an efficiently simulable fragment of the ZW-calculus, in a similar way that the Clifford fragment is for ZX-calculus. This work opens new directions for the investigation of the combinatorial properties of ZW-calculus as well as the study of perfect matching counting through compositional diagrammatical technics.}
  }
  

  Copy to Clipboard

2022

• Classically Simulating Quantum Supremacy IQP Circuits trough a Random Graph Approach
  Julien Codsi and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2212.08609
  Keywords: Classical Simulation, Clifford+T, Automation, ZX-calculus, Applied.

  Quantum Supremacy is a demonstration of a computation by a quantum computer that can not be performed by the best classical computer in a reasonable time. A well-studied approach to demonstrating this on near-term quantum computers is to use random circuit sampling. It has been suggested that a good candidate for demonstrating quantum supremacy with random circuit sampling is to use \emph{IQP circuits}. These are quantum circuits where the unitary it implements is diagonal. In this paper we introduce improved techniques for classically simulating random IQP circuits. We find a simple algorithm to calculate an amplitude of an \(n\)-qubit IQP circuit with dense random two-qubit interactions in time \(O(\frac{\log^2 n}{n} 2^n )\), which for sparse circuits (where each qubit interacts with \(O(\log n)\) other qubits) runs in \(o(2^n/\text{poly}(n))\) for any given polynomial. Using a more complicated stabiliser decomposition approach we improve the algorithm for dense circuits to \(O\left(\frac{(\log n)^{4-\beta}}{n^{2-\beta}} 2^n \right)\) where \(\beta \approx 0.396\). We benchmarked our algorithm and found that we can simulate up to 50-qubit circuits in a couple of minutes on a laptop. We estimate that 70-qubit circuits are within reach for a large computing cluster.

  @article{codsi2022classically,
      author = {Codsi, Julien and van de Wetering, John},
      title = {{Classically Simulating Quantum Supremacy IQP Circuits trough a Random Graph Approach}},
      year = {2022},
      journal = {arXiv preprint arXiv:2212.08609},
      urldate = {2022-12-16},
      link = {http://arxiv.org/abs/2212.08609},
      keywords = {Classical Simulation, Clifford+T, Automation, ZX-calculus, Applied},
      abstract = {Quantum Supremacy is a demonstration of a computation by a quantum computer that can not be performed by the best classical computer in a reasonable time. A well-studied approach to demonstrating this on near-term quantum computers is to use random circuit sampling. It has been suggested that a good candidate for demonstrating quantum supremacy with random circuit sampling is to use \emph{IQP circuits}. These are quantum circuits where the unitary it implements is diagonal. In this paper we introduce improved techniques for classically simulating random IQP circuits. We find a simple algorithm to calculate an amplitude of an $n$-qubit IQP circuit with dense random two-qubit interactions in time $O(\frac{\log^2 n}{n} 2^n )$, which for sparse circuits (where each qubit interacts with $O(\log n)$ other qubits) runs in $o(2^n/\text{poly}(n))$ for any given polynomial. Using a more complicated stabiliser decomposition approach we improve the algorithm for dense circuits to $O\left(\frac{(\log n)^{4-\beta}}{n^{2-\beta}} 2^n \right)$ where $\beta \approx 0.396$. We benchmarked our algorithm and found that we can simulate up to 50-qubit circuits in a couple of minutes on a laptop. We estimate that 70-qubit circuits are within reach for a large computing cluster.}
  }
  

  Copy to Clipboard

• Quantum algorithms for energy management optimization problems
  Margarita Veshchezerova
  Show abstract ⇲ Show bibdata ⇲

  Loria, Université de Lorraine PhD Thesis
  Keywords: ZX-calculus, Applied, Variational Circuits, PhD Thesis.

  This thesis is dedicated to the application of quantum algorithms to combinatorial optimization problems issued from the field of energy management. We consider several ptimization problems related to the charge of electric vehicles from the perspective of quantum heuristics such as QAOA and Quantum Annealing. From a theoretical perspective, this work presents new results derived for the graphical framework for quantum computing called ZX-calculus.

  @phdthesis{Veshchezerova2022thesis,
      author = {Veshchezerova, Margarita},
      title = {{Quantum algorithms for energy management optimization problems}},
      year = {2022},
      school = {Loria, Universit\'e de Lorraine},
      urldate = {2022-12-16},
      link = {http://docnum.univ-lorraine.fr/public/DDOC_T_2022_0346_VESHCHEZEROVA.pdf},
      keywords = {ZX-calculus, Applied, Variational Circuits, PhD Thesis},
      abstract = {This thesis is dedicated to the application of quantum algorithms to combinatorial optimization problems issued from the field of energy management. We consider several ptimization problems related to the charge of electric vehicles from the perspective of quantum heuristics such as QAOA and Quantum Annealing. From a theoretical perspective, this work presents new results derived for the graphical framework for quantum computing called ZX-calculus.}
  }
  

  Copy to Clipboard

• A Graphical #SAT Algorithm for Formulae with Small Clause Density
  Tuomas Laakkonen, Konstantinos Meichanetzidis and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲

  Proceedings of the 21st International Conference on Quantum Physics and Logic, Buenos Aires, Argentina, July 15-19, 2024
  Keywords: Classical Simulation, ZH-calculus, SAT, Applied.

  We study the counting version of the Boolean satisfiability problem \#SAT using the ZH-calculus, a graphical language originally introduced to reason about quantum circuits. Using this we find a natural extension of \#SAT which we call \(\#SAT_\pm\), where variables are additionally labeled by phases, which is GapP-complete. Using graphical reasoning, we find a reduction from \#SAT to \(\#2SAT_\pm\) in the ZH-calculus. We observe that the DPLL algorithm for #2SAT can be adapted to \(\#2SAT_\pm\) directly and hence that Wahlstrom's \(O^*(1.2377^n)\) upper bound applies to \(\#2SAT_\pm\) as well. Combining this with our reduction from \#SAT to \(\#2SAT_\pm\) gives us novel upper bounds in terms of clauses and variables that are better than \(O^*(2^n)\) for small clause densities of \(\frac{m}{n} < 2.25\). This is to our knowledge the first non-trivial upper bound for \#SAT that is independent of clause size. Our algorithm improves on Dubois' upper bound for \(\#kSAT\) whenever \(\frac{m}{n} < 1.85\) and \(k \geq 4\), and the Williams' average-case analysis whenever \(\frac{m}{n} < 1.21\) and \(k \geq 6\). We also obtain an unconditional upper bound of \(O^*(1.88^m)\) for \(\#4SAT\) in terms of clauses only, and find an improved bound on \(\#3SAT\) for \(1.2577 < \frac{m}{n} \leq \frac{7}{3}\). Our results demonstrate that graphical reasoning can lead to new algorithmic insights, even outside the domain of quantum computing that the calculus was intended for.

  @inproceedings{laakkonen2022graphical,
      author = {Laakkonen, Tuomas and Meichanetzidis, Konstantinos and van de Wetering, John},
      title = {{A Graphical \#SAT Algorithm for Formulae with Small Clause Density}},
      year = {2024},
      booktitle = {Proceedings of the 21st International Conference on Quantum Physics and Logic, Buenos Aires, Argentina, July 15-19, 2024},
      editor = {D\'iaz-Caro, Alejandro and Zamdzhiev, Vladimir},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {406},
      pages = {137-161},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.406.7},
      urldate = {2022-12-15},
      link = {http://arxiv.org/abs/2212.08048},
      keywords = {Classical Simulation, ZH-calculus, SAT, Applied},
      abstract = {We study the counting version of the Boolean satisfiability problem \#SAT using the ZH-calculus, a graphical language originally introduced to reason about quantum circuits. Using this we find a natural extension of \#SAT which we call $\#SAT_\pm$, where variables are additionally labeled by phases, which is GapP-complete. Using graphical reasoning, we find a reduction from \#SAT to $\#2SAT_\pm$ in the ZH-calculus. We observe that the DPLL algorithm for #2SAT can be adapted to $\#2SAT_\pm$ directly and hence that Wahlstrom's $O^*(1.2377^n)$ upper bound applies to $\#2SAT_\pm$ as well. Combining this with our reduction from \#SAT to $\#2SAT_\pm$ gives us novel upper bounds in terms of clauses and variables that are better than $O^*(2^n)$ for small clause densities of $\frac{m}{n} < 2.25$. This is to our knowledge the first non-trivial upper bound for \#SAT that is independent of clause size. Our algorithm improves on Dubois' upper bound for $\#kSAT$ whenever $\frac{m}{n} < 1.85$ and $k \geq 4$, and the Williams' average-case analysis whenever $\frac{m}{n} < 1.21$ and $k \geq 6$. We also obtain an unconditional upper bound of $O^*(1.88^m)$ for $\#4SAT$ in terms of clauses only, and find an improved bound on $\#3SAT$ for $1.2577 < \frac{m}{n} \leq \frac{7}{3}$. Our results demonstrate that graphical reasoning can lead to new algorithmic insights, even outside the domain of quantum computing that the calculus was intended for.}
  }
  

  Copy to Clipboard

• Category Theory for Quantum Natural Language Processing
  Alexis Toumi
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford PhD Thesis
  Keywords: NLP, Category Theory, PhD Thesis, Applied.

  This thesis introduces quantum natural language processing (QNLP) models based on a simple yet powerful analogy between computational linguistics and quantum mechanics: grammar as entanglement. The grammatical structure of text and sentences connects the meaning of words in the same way that entanglement structure connects the states of quantum systems. Category theory allows to make this language-to-qubit analogy formal: it is a monoidal functor from grammar to vector spaces. We turn this abstract analogy into a concrete algorithm that translates the grammatical structure onto the architecture of parameterised quantum circuits. We then use a hybrid classical-quantum algorithm to train the model so that evaluating the circuits computes the meaning of sentences in data-driven tasks. The implementation of QNLP models motivated the development of DisCoPy (Distributional Compositional Python), the toolkit for applied category theory of which the first chapter gives a comprehensive overview. String diagrams are the core data structure of DisCoPy, they allow to reason about computation at a high level of abstraction. We show how they can encode both grammatical structures and quantum circuits, but also logical formulae, neural networks or arbitrary Python code. Monoidal functors allow to translate these abstract diagrams into concrete computation, interfacing with optimised task-specific libraries. The second chapter uses DisCopy to implement QNLP models as parameterised functors from grammar to quantum circuits. It gives a first proof-of-concept for the more general concept of functorial learning: generalising machine learning from functions to functors by learning from diagram-like data. In order to learn optimal functor parameters via gradient descent, we introduce the notion of diagrammatic differentiation: a graphical calculus for computing the gradients of parameterised diagrams.

  @phdthesis{toumi2022thesis,
      author = {Toumi, Alexis},
      title = {{Category Theory for Quantum Natural Language Processing}},
      year = {2022},
      school = {University of Oxford},
      urldate = {2022-12-13},
      link = {http://arxiv.org/abs/2212.06615},
      keywords = {NLP, Category Theory, PhD Thesis, Applied},
      abstract = {This thesis introduces quantum natural language processing (QNLP) models based on a simple yet powerful analogy between computational linguistics and quantum mechanics: grammar as entanglement. The grammatical structure of text and sentences connects the meaning of words in the same way that entanglement structure connects the states of quantum systems. Category theory allows to make this language-to-qubit analogy formal: it is a monoidal functor from grammar to vector spaces. We turn this abstract analogy into a concrete algorithm that translates the grammatical structure onto the architecture of parameterised quantum circuits. We then use a hybrid classical-quantum algorithm to train the model so that evaluating the circuits computes the meaning of sentences in data-driven tasks.   The implementation of QNLP models motivated the development of DisCoPy (Distributional Compositional Python), the toolkit for applied category theory of which the first chapter gives a comprehensive overview. String diagrams are the core data structure of DisCoPy, they allow to reason about computation at a high level of abstraction. We show how they can encode both grammatical structures and quantum circuits, but also logical formulae, neural networks or arbitrary Python code. Monoidal functors allow to translate these abstract diagrams into concrete computation, interfacing with optimised task-specific libraries.   The second chapter uses DisCopy to implement QNLP models as parameterised functors from grammar to quantum circuits. It gives a first proof-of-concept for the more general concept of functorial learning: generalising machine learning from functions to functors by learning from diagram-like data. In order to learn optimal functor parameters via gradient descent, we introduce the notion of diagrammatic differentiation: a graphical calculus for computing the gradients of parameterised diagrams.}
  }
  

  Copy to Clipboard

• How to Sum and Exponentiate Hamiltonians in ZXW Calculus
  Razin A. Shaikh, Quanlong Wang and Richie Yeung
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022
  Keywords: ZW-calculus, Algebraic ZX, Variational Circuits, Chemistry, Triangle.

  This paper develops practical summation techniques in ZXW calculus to reason about quantum dynamics, such as unitary time evolution. First we give a direct representation of a wide class of sums of linear operators, including arbitrary qubits Hamiltonians, in ZXW calculus. As an application, we demonstrate the linearity of the Schr\"odinger equation and give a diagrammatic representation of the Hamiltonian in Greene-Diniz et al (Gabriel, 2022), which is the first paper that models carbon capture using quantum computing. We then use the Cayley-Hamilton theorem to show in principle how to exponentiate arbitrary qubits Hamiltonians in ZXW calculus. Finally, we develop practical techniques and show how to do Taylor expansion and Trotterization diagrammatically for Hamiltonian simulation. This sets up the framework for using ZXW calculus to the problems in quantum chemistry and condensed matter physics.

  @inproceedings{shaikh2023sum,
      author = {Shaikh, Razin A. and Wang, Quanlong and Yeung, Richie},
      title = {How to Sum and Exponentiate Hamiltonians in ZXW Calculus},
      year = {2023},
      booktitle = {Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022},
      editor = {Gogioso, Stefano and Hoban, Matty},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {394},
      pages = {236-261},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.394.14},
      urldate = {2022-12-08},
      link = {http://arxiv.org/abs/2212.04462},
      keywords = {ZW-calculus, Algebraic ZX, Variational Circuits, Chemistry, Triangle},
      abstract = {This paper develops practical summation techniques in ZXW calculus to reason about quantum dynamics, such as unitary time evolution. First we give a direct representation of a wide class of sums of linear operators, including arbitrary qubits Hamiltonians, in ZXW calculus. As an application, we demonstrate the linearity of the Schr\"odinger equation and give a diagrammatic representation of the Hamiltonian in Greene-Diniz et al (Gabriel, 2022), which is the first paper that models carbon capture using quantum computing. We then use the Cayley-Hamilton theorem to show in principle how to exponentiate arbitrary qubits Hamiltonians in ZXW calculus. Finally, we develop practical techniques and show how to do Taylor expansion and Trotterization diagrammatically for Hamiltonian simulation. This sets up the framework for using ZXW calculus to the problems in quantum chemistry and condensed matter physics.},
      video = {https://youtu.be/_s2pOcrdmig?t=1347}
  }
  

  Copy to Clipboard

• Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array
  Alexis Shaw, Michael Bremner, Alexandru Paler, Daniel Herr and Simon J. Devitt
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2212.01550
  Keywords: Surface Code, Lattice Surgery, Applied, Error Correcting Codes, ZX-calculus.

  In this paper, we explore the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds for scalable, fault-tolerant quantum computation. To circumvent the traditionally low thresholds of small fixed-width arrays, we deliberately engineer an error bias at the lowest level of encoding using the surface code. We then address this engineered bias at a higher level of encoding using a lattice-surgery surface code bus that exploits this bias, or a repetition code to make logical qubits with unbiased errors out of biased surface code qubits. Arbitrarily low error rates can then be reached by further concatenating with other codes, such as Steane [[7,1,3]] code and the [[15,7,3]] CSS code. This enables a scalable fixed-width quantum computing architecture on a square qubit lattice that is only 19 qubits wide, given physical qubits with an error rate of \(8.0\times 10^{-4}\). This potentially eases engineering issues in systems with fine qubit pitches, such as quantum dots in silicon or gallium arsenide.

  @article{shaw2022quantum,
      author = {Shaw, Alexis and Bremner, Michael and Paler, Alexandru and Herr, Daniel and Devitt, Simon J.},
      title = {{Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array}},
      year = {2022},
      journal = {arXiv preprint arXiv:2212.01550},
      urldate = {2022-12-03},
      link = {http://arxiv.org/abs/2212.01550},
      keywords = {Surface Code, Lattice Surgery, Applied, Error Correcting Codes, ZX-calculus},
      abstract = {In this paper, we explore the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds for scalable, fault-tolerant quantum computation. To circumvent the traditionally low thresholds of small fixed-width arrays, we deliberately engineer an error bias at the lowest level of encoding using the surface code. We then address this engineered bias at a higher level of encoding using a lattice-surgery surface code bus that exploits this bias, or a repetition code to make logical qubits with unbiased errors out of biased surface code qubits. Arbitrarily low error rates can then be reached by further concatenating with other codes, such as Steane [[7,1,3]] code and the [[15,7,3]] CSS code. This enables a scalable fixed-width quantum computing architecture on a square qubit lattice that is only 19 qubits wide, given physical qubits with an error rate of $8.0\times 10^{-4}$. This potentially eases engineering issues in systems with fine qubit pitches, such as quantum dots in silicon or gallium arsenide.}
  }
  

  Copy to Clipboard

• Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections
  Daniel Litinski and Naomi Nickerson
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2211.15465
  Keywords: Surface Code, Lattice Surgery, Applied, ZX-calculus.

  In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the number of qubits multiplied by the number of non-Clifford gates. We introduce an architecture using non-2D-local connections in which the cost does not scale with the number of qubits, and instead only with the number of logical operations. Each logical operation has an associated active volume, such that the cost of a quantum computation can be quantified as a sum of active volumes of all operations. For quantum computations with thousands of logical qubits, the active volume can be orders of magnitude lower than the circuit volume. Importantly, the architecture does not require all-to-all connectivity between N logical qubits. Instead, each logical qubit is connected to O(log N) other sites. As an example, we show that, using the same number of logical qubits, a 2048-bit factoring algorithm can be executed 44 times faster than on a general-purpose architecture without non-local connections. With photonic qubits, long-range connections are available and we show how photonic components can be used to construct a fusion-based active-volume quantum computer.

  @article{litinski2022active,
      author = {Litinski, Daniel and Nickerson, Naomi},
      title = {{Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections}},
      year = {2022},
      journal = {arXiv preprint arXiv:2211.15465},
      urldate = {2022-11-28},
      link = {http://arxiv.org/abs/2211.15465},
      keywords = {Surface Code, Lattice Surgery, Applied, ZX-calculus},
      abstract = {In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the number of qubits multiplied by the number of non-Clifford gates. We introduce an architecture using non-2D-local connections in which the cost does not scale with the number of qubits, and instead only with the number of logical operations. Each logical operation has an associated active volume, such that the cost of a quantum computation can be quantified as a sum of active volumes of all operations. For quantum computations with thousands of logical qubits, the active volume can be orders of magnitude lower than the circuit volume. Importantly, the architecture does not require all-to-all connectivity between N logical qubits. Instead, each logical qubit is connected to O(log N) other sites. As an example, we show that, using the same number of logical qubits, a 2048-bit factoring algorithm can be executed 44 times faster than on a general-purpose architecture without non-local connections. With photonic qubits, long-range connections are available and we show how photonic components can be used to construct a fusion-based active-volume quantum computer.}
  }
  

  Copy to Clipboard

• A unique normal form for prime-dimensional qudit Clifford ZX-calculus
  Boldizsár Poór
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford Masters Thesis
  Keywords: Qudits, Completeness, Clifford Fragment, ZX-calculus, Master Thesis.

  In this thesis, we use a slightly modified version of the calculus presented Ref. [2]. This calculus is designed for odd prime dimensional qudits, and the modification is related to the representation of scalars. Using this calculus, we present and prove the correctness of the qudit version of local complementation and pivoting for odd prime dimensions. Moreover, we present the AP-form and its unique variant, the reduced AP-form, and show how to transform any Clifford circuit into these normal forms in the calculus. Furthermore, we present the qudit variant of the efficient weak simulation algorithm of Clifford states presented in Ref. [38]. Lastly, we also show an alternative completeness proof of the qudit ZX-calculus for odd prime dimensions using the reduced AP-form. While the completeness of the above-mentioned calculus has already been shown in Ref. [2], we aim to present a completeness proof that can be more accessible and easier to implement in practice.

  @mastersthesis{Poor2022Masters,
      author = {Po{\'o}r, Boldizs{\'a}r},
      title = {{A unique normal form for prime-dimensional qudit Clifford ZX-calculus}},
      year = {2022},
      school = {University of Oxford},
      urldate = {2022-11-25},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/poor-thesis.pdf},
      keywords = {Qudits, Completeness, Clifford Fragment, ZX-calculus, Master Thesis},
      abstract = {In this thesis, we use a slightly modified version of the calculus presented Ref. [2]. This calculus is designed for odd prime dimensional qudits, and the modification is related to the representation of scalars. Using this calculus, we present and prove the correctness of the qudit version of local complementation and pivoting for odd prime dimensions. Moreover, we present the AP-form and its unique variant, the reduced AP-form, and show how to transform any Clifford circuit into these normal forms in the calculus. Furthermore, we present the qudit variant of the efficient weak simulation algorithm of Clifford states presented in Ref. [38]. Lastly, we also show an alternative completeness proof of the qudit ZX-calculus for odd prime dimensions using the reduced AP-form. While the completeness of the above-mentioned calculus has already been shown in Ref. [2], we aim to present a completeness proof that can be more accessible and easier to implement in practice. }
  }
  

  Copy to Clipboard

• Qudit ZH-calculus
  Patrick Roy
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford Masters Thesis
  Keywords: ZH-Calculus, Qudits, Completeness, Master Thesis.

  The use of quantum graphical calculi, such as the ZX-calculus, has lead to great advances in fields such as quantum circuit optimization. Particularly the ZH-calculus has proven useful for reasoning about higher-level quantum operations, such as Toffoli and Hadamard gates, which form an approximately universal set of gates, for which the qubit ZH-calculus is complete. More recently, quantum computing based on d-ary basis states has gained traction, with the ZX- and ZW-calculi having been generalized to higher dimensions. However, no generalization of the ZH-calculus is known. Such a generalization might lead to new insights about higher-dimensional equivalents of the Toffoli-gate. In this dissertation, we provide this generalization of the qubit ZH-calculus to qudits by generalizing a classification of qubit quantum graphical calculi due to Carette and Jeandel by relaxing a condition that would have excluded a qudit ZH-calculus from being constructed. We then use this generalization to reduce the ruleset of the qubit ZH-calculus by one rule. Additionally, we give a first-of-its-kind algorithm for constructing ZH-diagrams from the matrix representation of linear maps, and use this algorithm to show that, for prime dimension, ZH-calculus is universal.

  @mastersthesis{Roy2022Masters,
      author = {Roy, Patrick},
      title = {{Qudit ZH-calculus}},
      year = {2022},
      school = {University of Oxford},
      urldate = {2022-11-24},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/roy-thesis.pdf},
      keywords = {ZH-Calculus, Qudits, Completeness, Master Thesis},
      abstract = {The use of quantum graphical calculi, such as the ZX-calculus, has lead to great advances in fields such as quantum circuit optimization. Particularly the ZH-calculus has proven useful for reasoning about higher-level quantum operations, such as Toffoli and Hadamard gates, which form an approximately universal set of gates, for which the qubit ZH-calculus is complete. More recently, quantum computing based on d-ary basis states has gained traction, with the ZX- and ZW-calculi having been generalized to higher dimensions. However, no generalization of the ZH-calculus is known. Such a generalization might lead to new insights about higher-dimensional equivalents of the Toffoli-gate. In this dissertation, we provide this generalization of the qubit ZH-calculus to qudits by generalizing a classification of qubit quantum graphical calculi due to Carette and Jeandel by relaxing a condition that would have excluded a qudit ZH-calculus from being constructed. We then use this generalization to reduce the ruleset of the qubit ZH-calculus by one rule. Additionally, we give a first-of-its-kind algorithm for constructing ZH-diagrams from the matrix representation of linear maps, and use this algorithm to show that, for prime dimension, ZH-calculus is universal.}
  }
  

  Copy to Clipboard

• Graphical calculus for Tensor Network Contractions
  Snehal Raj
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford Masters Thesis
  Keywords: ZX-Calculus, Classical Simulation, Tensor Networks, Automation, Applied, Master Thesis.

  Quantum computing is an emerging field of research that harnesses the laws of quantum mechanics to solve computationally hard problems. In addition to developing better and bigger quantum computers, a significant challenge is developing techniques to benchmark these devices. Thus, pushing the barrier of classical simulation goes hand in hand with the development of quantum computers. In this dissertation, we hope to leverage the existing work on quantum graphical languages such as the ZX-calculus to aid one of the most prominent classical simulation tools, tensor network methods. By their very nature, graphical languages have a more modular representation of quantum circuits, which could be optimized using the associated rewrite rules of the calculi. We investigate how effective the existing procedures are at enhancing tensor network contractions and propose new strategies based on our observations. Furthermore, we evaluate our strategies using a variety of circuits, including the Sycamore circuits used by Google to demonstrate quantum supremacy in 2019.

  @mastersthesis{Raj2022Masters,
      author = {Raj, Snehal},
      title = {{Graphical calculus for Tensor Network Contractions}},
      year = {2022},
      school = {University of Oxford},
      urldate = {2022-11-23},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/raj-thesis.pdf},
      keywords = {ZX-Calculus, Classical Simulation, Tensor Networks, Automation, Applied, Master Thesis},
      abstract = {Quantum computing is an emerging field of research that harnesses the laws of quantum mechanics to solve computationally hard problems. In addition to developing better and bigger quantum computers, a significant challenge is developing techniques to benchmark these devices. Thus, pushing the barrier of classical simulation goes hand in hand with the development of quantum computers. In this dissertation, we hope to leverage the existing work on quantum graphical languages such as the ZX-calculus to aid one of the most prominent classical simulation tools, tensor network methods. By their very nature, graphical languages have a more modular representation of quantum circuits, which could be optimized using the associated rewrite rules of the calculi. We investigate how effective the existing procedures are at enhancing tensor network contractions and propose new strategies based on our observations. Furthermore, we evaluate our strategies using a variety of circuits, including the Sycamore circuits used by Google to demonstrate quantum supremacy in 2019.}
  }
  

  Copy to Clipboard

• The ZX-calculus as a language for topological quantum computation
  Fatimah Rita Ahmadi and Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲

  Journal of Physics A: Mathematical and Theoretical
  Keywords: Braids, ZX-calculus, Applied.

  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.

  @article{ritaahmadi2022topological,
      author = {Ahmadi, Fatimah Rita and Kissinger, Aleks},
      title = {{The ZX-calculus as a language for topological quantum computation}},
      year = {2023},
      journal = {Journal of Physics A: Mathematical and Theoretical},
      doi = {10.1088/1751-8121/acef7e},
      urldate = {2022-11-07},
      link = {http://arxiv.org/abs/2211.03855},
      keywords = {Braids, ZX-calculus, Applied},
      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.}
  }
  

  Copy to Clipboard

• Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation of Variational Quantum Algorithms
  Tom Peham, Lukas Burgholzer and Robert Wille
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2210.12166
  Keywords: Verification, Variational Circuits, Automation, ZX-calculus, Applied.

  Variational quantum algorithms have been introduced as a promising class of quantum-classical hybrid algorithms that can already be used with the noisy quantum computing hardware available today by employing parameterized quantum circuits. Considering the non-trivial nature of quantum circuit compilation and the subtleties of quantum computing, it is essential to verify that these parameterized circuits have been compiled correctly. Established equivalence checking procedures that handle parameter-free circuits already exist. However, no methodology capable of handling circuits with parameters has been proposed yet. This work fills this gap by showing that verifying the equivalence of parameterized circuits can be achieved in a purely symbolic fashion using an equivalence checking approach based on the ZX-calculus. At the same time, proofs of inequality can be efficiently obtained with conventional methods by taking advantage of the degrees of freedom inherent to parameterized circuits. We implemented the corresponding methods and proved that the resulting methodology is complete. Experimental evaluations (using the entire parametric ansatz circuit library provided by Qiskit as benchmarks) demonstrate the efficacy of the proposed approach. The implementation is open source and publicly available as part of the equivalence checking tool QCEC (https://github.com/cda-tum/qcec) which is part of the Munich Quantum Toolkit (MQT).

  @article{peham2022equivalence,
      author = {Peham, Tom and Burgholzer, Lukas and Wille, Robert},
      title = {{Equivalence Checking of Parameterized Quantum Circuits: Verifying the Compilation of Variational Quantum Algorithms}},
      year = {2022},
      journal = {arXiv preprint arXiv:2210.12166},
      doi = {10.1145/3566097.3567932},
      urldate = {2022-10-21},
      link = {http://arxiv.org/abs/2210.12166},
      keywords = {Verification, Variational Circuits, Automation, ZX-calculus, Applied},
      abstract = {Variational quantum algorithms have been introduced as a promising class of quantum-classical hybrid algorithms that can already be used with the noisy quantum computing hardware available today by employing parameterized quantum circuits. Considering the non-trivial nature of quantum circuit compilation and the subtleties of quantum computing, it is essential to verify that these parameterized circuits have been compiled correctly. Established equivalence checking procedures that handle parameter-free circuits already exist. However, no methodology capable of handling circuits with parameters has been proposed yet. This work fills this gap by showing that verifying the equivalence of parameterized circuits can be achieved in a purely symbolic fashion using an equivalence checking approach based on the ZX-calculus. At the same time, proofs of inequality can be efficiently obtained with conventional methods by taking advantage of the degrees of freedom inherent to parameterized circuits. We implemented the corresponding methods and proved that the resulting methodology is complete. Experimental evaluations (using the entire parametric ansatz circuit library provided by Qiskit as benchmarks) demonstrate the efficacy of the proposed approach. The implementation is open source and publicly available as part of the equivalence checking tool QCEC (https://github.com/cda-tum/qcec) which is part of the Munich Quantum Toolkit (MQT).}
  }
  

  Copy to Clipboard

• Cutting-Edge Graphical Stabiliser Decompositions for Classical Simulation of Quantum Circuits
  Julien Codsi
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  University of Oxford Masters Thesis
  Keywords: ZX-Calculus, Classical Simulation, Phase Gadgets, Automation, Applied, Master Thesis.

  The aim of this thesis is to study and improve classical simulation of quan tum circuits with stabiliser decompositions by using the ZX-calculus. We propose more efficient decompositions for a large family of states in addi- tion to integrating graphs cuts to make use of potential low connectivity of ZX-diagrams. We also discovered different heuristics to speed up the simulations. Finally, we implemented our method and compared it with the state-of-the-art on different families of circuits to asses the improvements achieved by our approach.

  @mastersthesis{Codsi2022Masters,
      author = {Codsi, Julien},
      title = {{Cutting-Edge Graphical Stabiliser Decompositions for Classical Simulation of Quantum Circuits}},
      year = {2022},
      school = {University of Oxford},
      urldate = {2022-10-19},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/codsi-thesis.pdf},
      keywords = {ZX-Calculus, Classical Simulation, Phase Gadgets, Automation, Applied, Master Thesis},
      abstract = {The aim of this thesis is to study and improve classical simulation of quan tum circuits with stabiliser decompositions by using the ZX-calculus. We propose more efficient decompositions for a large family of states in addi- tion to integrating graphs cuts to make use of potential low connectivity of ZX-diagrams. We also discovered different heuristics to speed up the simulations. Finally, we implemented our method and compared it with the state-of-the-art on different families of circuits to asses the improvements achieved by our approach.},
      video = {https://www.youtube.com/watch?v=S8okYavq5CI}
  }
  

  Copy to Clipboard

• Quantum Machine Learning using the ZXW-Calculus
  Mark Koch
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford Masters Thesis
  Keywords: ZX-Calculus, ZW-Calculus, Variational Circuits, Chemistry, Applied, Master Thesis.

  The field of quantum machine learning (QML) explores how quantum computers can be used to more efficiently solve machine learning problems. As an application of hybrid quantum-classical algorithms, it promises a potential quantum advantages in the near term. In this thesis, we use the ZXW-calculus to diagrammatically analyse two key problems that QML applications face. First, we discuss algorithms to compute gradients on quantum hardware that are needed to perform gradient-based optimisation for QML. Concretely, we give new diagrammatic proofs of the common 2- and 4-term parameter shift rules used in the literature. Additionally, we derive a novel, generalised parameter shift rule with 2n terms that is applicable to gates that can be represented with n parametrised spiders in the ZXW-calculus. Furthermore, to the best of our knowledge, we give the first proof of a conjecture by Anselmetti et al. by proving a no-go theorem ruling out more efficient alternatives to the 4-term shift rule. Secondly, we analyse the gradient landscape of quantum ans\"atze for barren plateaus using both empirical and analytical techniques. Concretely, we develop a tool that automatically calculates the variance of gradients and use it to detect likely barren plateaus in commonly used quantum ans¨atze. Furthermore, we formally prove the existence or absence of barren plateaus for a selection of ans\"{a}tze using diagrammatic techniques from the ZXW-calculus.

  @mastersthesis{Koch2022Masters,
      author = {Koch, Mark},
      title = {{Quantum Machine Learning using the ZXW-Calculus}},
      year = {2022},
      school = {University of Oxford},
      urldate = {2022-10-18},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/koch-thesis.pdf},
      keywords = {ZX-Calculus, ZW-Calculus, Variational Circuits, Chemistry, Applied, Master Thesis},
      abstract = {The field of quantum machine learning (QML) explores how quantum computers can be used to more efficiently solve machine learning problems. As an application of hybrid quantum-classical algorithms, it promises a potential quantum advantages in the near term. In this thesis, we use the ZXW-calculus to diagrammatically analyse two key problems that QML applications face. First, we discuss algorithms to compute gradients on quantum hardware that are needed to perform gradient-based optimisation for QML. Concretely, we give new diagrammatic proofs of the common 2- and 4-term parameter shift rules used in the literature. Additionally, we derive a novel, generalised parameter shift rule with 2n terms that is applicable to gates that can be represented with n parametrised spiders in the ZXW-calculus. Furthermore, to the best of our knowledge, we give the first proof of a conjecture by Anselmetti et al. by proving a no-go theorem ruling out more efficient alternatives to the 4-term shift rule. Secondly, we analyse the gradient landscape of quantum ans\"atze for barren plateaus using both empirical and analytical techniques. Concretely, we develop a tool that automatically calculates the variance of gradients and use it to detect likely barren plateaus in commonly used quantum ans¨atze. Furthermore, we formally prove the existence or absence of barren plateaus for a selection of ans\"{a}tze using diagrammatic techniques from the ZXW-calculus.}
  }
  

  Copy to Clipboard

• Experimental Comparison of Ansatze for Quantum Natural Language Processing
  Nikhil Khatri
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford Masters Thesis
  Keywords: ZX-Calculus, Optimisation, NLP, Variational Circuits, Applied, Master Thesis.

  The DisCoCat model of natural language is a framework which serves as the foundation for several contemporary experiments in Quantum Natural Language Processing (QNLP). In this model, sentences are represented as string diagrams which compose the meaning of the entire sentence from the meaning of each word. An essential step in performing QNLP tasks is converting DisCoCat string diagrams into quantum circuits, through a mapping known as an ansatz. While several ans\"{a}tze have been studied in the broader quantum machine learning literature, no comparative study of ans\"{a}tze exists for the specific case of QNLP models. In this work, we implement multiple ans\"{a}tze and compare their performance on a variety of QNLP tasks. In doing so, the first experimental results for a QNLP model applied to the paraphrase identification task are presented. We propose a novel approach to overcome the out-of-vocabulary problem faced by contemporary QNLP models, and demonstrate that our proposed method outperforms naive approaches by a significant margin. Further, experimental results relating to the barren plateau phenomenon in quantum machine learning are provided. We present evidence suggesting that circuits derived from DisCoCat string diagrams for binary classification tasks are no more susceptible to the barren plateau problem than regular quantum machine learning circuits.

  @mastersthesis{Khatri2022Masters,
      author = {Khatri, Nikhil},
      title = {{ Experimental Comparison of Ansatze for Quantum Natural Language Processing}},
      year = {2022},
      school = {University of Oxford},
      urldate = {2022-10-17},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/khatri-thesis.pdf},
      keywords = {ZX-Calculus, Optimisation, NLP, Variational Circuits, Applied, Master Thesis},
      abstract = {The DisCoCat model of natural language is a framework which serves as the foundation for several contemporary experiments in Quantum Natural Language Processing (QNLP). In this model, sentences are represented as string diagrams which compose the meaning of the entire sentence from the meaning of each word. An essential step in performing QNLP tasks is converting DisCoCat string diagrams into quantum circuits, through a mapping known as an ansatz. While several ans\"{a}tze have been studied in the broader quantum machine learning literature, no comparative study of ans\"{a}tze exists for the specific case of QNLP models. In this work, we implement multiple ans\"{a}tze and compare their performance on a variety of QNLP tasks. In doing so, the first experimental results for a QNLP model applied to the paraphrase identification task are presented. We propose a novel approach to overcome the out-of-vocabulary problem faced by contemporary QNLP models, and demonstrate that our proposed method outperforms naive approaches by a significant margin. Further, experimental results relating to the barren plateau phenomenon in quantum machine learning are provided. We present evidence suggesting that circuits derived from DisCoCat string diagrams for binary classification tasks are no more susceptible to the barren plateau problem than regular quantum machine learning circuits.}
  }
  

  Copy to Clipboard

• A compiler for universal photonic quantum computers
  Felix Zilk, Korbinian Staudacher, Tobias Guggemos, Karl Fürlinger, Dieter Kranzlmüller and Philip Walther
  Show abstract ⇲ Show bibdata ⇲

  2022 IEEE/ACM Third International Workshop on Quantum Computing Software (QCS)
  Keywords: Photons, MBQC, Optimisation, PyZX, Automation, ZX-calculus.

  Photons are a natural resource in quantum information, and the last decade showed significant progress in high-quality single photon generation and detection. Furthermore, photonic qubits are easy to manipulate and do not require particularly strongly sealed environments, making them an appealing platform for quantum computing. With the one-way model, the vision of a universal and large-scale quantum computer based on photonics becomes feasible. In one-way computing, the input state is not an initial product state, but a so-called cluster state. A series of measurements on the cluster state's individual qubits and their temporal order, together with a feed-forward procedure, determine the quantum circuit to be executed. We propose a pipeline to convert a QASM circuit into a graph representation named measurement-graph (m-graph), that can be directly translated to hardware instructions on an optical one-way quantum computer. In addition, we optimize the graph using ZX-Calculus before evaluating the execution on an experimental discrete variable photonic platform.

  @inproceedings{zilk2022compiler,
      author = {Zilk, Felix and Staudacher, Korbinian and Guggemos, Tobias and Fürlinger, Karl and Kranzlmüller, Dieter and Walther, Philip},
      title = {A compiler for universal photonic quantum computers},
      year = {2022},
      booktitle = {2022 IEEE/ACM Third International Workshop on Quantum Computing Software (QCS)},
      volume = {},
      number = {},
      pages = {57-67},
      doi = {10.1109/QCS56647.2022.00012},
      urldate = {2022-10-17},
      link = {http://arxiv.org/abs/2210.09251},
      keywords = {Photons, MBQC, Optimisation, PyZX, Automation, ZX-calculus},
      abstract = {Photons are a natural resource in quantum information, and the last decade showed significant progress in high-quality single photon generation and detection. Furthermore, photonic qubits are easy to manipulate and do not require particularly strongly sealed environments, making them an appealing platform for quantum computing. With the one-way model, the vision of a universal and large-scale quantum computer based on photonics becomes feasible. In one-way computing, the input state is not an initial product state, but a so-called cluster state. A series of measurements on the cluster state's individual qubits and their temporal order, together with a feed-forward procedure, determine the quantum circuit to be executed. We propose a pipeline to convert a QASM circuit into a graph representation named measurement-graph (m-graph), that can be directly translated to hardware instructions on an optical one-way quantum computer. In addition, we optimize the graph using ZX-Calculus before evaluating the execution on an experimental discrete variable photonic platform.}
  }
  

  Copy to Clipboard

• Quantum Circuit Optimisation Through Stabiliser Reduction of Pauli Exponentials
  Oliver Cole
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford Masters Thesis
  Keywords: ZX-Calculus, Optimisation, Phase Gadgets, Automation, Applied, Master Thesis.

  Quantum circuits require careful and in-depth optimisation to be run on existing quantum computers. This project investigates the application of the Product Rotation Lemma, introduced by Will Simmons in [32], as a tool for general circuit optimisation. These optimisations exploit the initial state information to identify redundancies in the circuit. This project delves into the lemma’s applications for the Clifford-Pauli-Exponential form and its synthesis alongside the practical applications of this theory. The main contributions from this project are (1) the Pauli DAG Merging Theorem and its surrounding theory that gives simple necessary, and sufficient conditions for applying the Product Rotation Lemma in a strictly beneficial way and (2) providing results strongly indicating the feasibility of the techniques presented here as tools to be used in generic compilation procedures. This report provides proof of the novel theory coming out of this project, alongside a design and implementation of an end-to-end QASM-to-QASM compiler using staq as the base [3]. This compiler is very efficient on large circuits and provides CX count, and depth reductions of up to 42\% after existing methods are applied.

  @mastersthesis{Cole2022Masters,
      author = {Cole, Oliver},
      title = {{Quantum Circuit Optimisation Through Stabiliser Reduction of Pauli Exponentials}},
      year = {2022},
      school = {University of Oxford},
      urldate = {2022-10-16},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/cole-thesis.pdf},
      keywords = {ZX-Calculus, Optimisation, Phase Gadgets, Automation, Applied, Master Thesis},
      abstract = {Quantum circuits require careful and in-depth optimisation to be run on existing quantum computers. This project investigates the application of the Product Rotation Lemma, introduced by Will Simmons in [32], as a tool for general circuit optimisation. These optimisations exploit the initial state information to identify redundancies in the circuit. This project delves into the lemma’s applications for the Clifford-Pauli-Exponential form and its synthesis alongside the practical applications of this theory. The main contributions from this project are (1) the Pauli DAG Merging Theorem and its surrounding theory that gives simple necessary, and sufficient conditions for applying the Product Rotation Lemma in a strictly beneficial way and (2) providing results strongly indicating the feasibility of the techniques presented here as tools to be used in generic compilation procedures. This report provides proof of the novel theory coming out of this project, alongside a design and implementation of an end-to-end QASM-to-QASM compiler using staq as the base [3]. This compiler is very efficient on large circuits and provides CX count, and depth reductions of up to 42\% after existing methods are applied.}
  }
  

  Copy to Clipboard

• Graphical Stabilizer Decompositions For Counting Problems
  Tuomas Laakkonen
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford Masters Thesis
  Keywords: ZX-Calculus, ZH-calculus, Classical Simulation, SAT, Applied, Master Thesis.

  Building on the work of de Beaudrap, Kissinger, and Meichanetzidis [dKM21], in this dissertation, we examine the relationship between #SAT and the ZH calculus. We outline their reduction from \#SAT to evaluating ZH diagrams, which shows that evaluating ZH diagrams is \#P-hard, and we extend this to show that evaluating diagrams in certain fragments of the ZH calculus, is \(FP^{\#P}\)-complete. In particular, we show this holds for diagrams where all H-boxes have labels in \(\mathbb{Q}[i,\sqrt{2}]\), which includes both the Clifford+T and Toffoli-Hadamard fragments natively [BKM+21]. We show the action of the DPLL algorithm [DLL62] for SAT and its derivative CDP [BL99] for \#SAT in terms of ZH-diagrams, and use diagrammatic methods to extend CDP to treat variables and clauses equally. Combining this with an algorithm for \#2SAT by Wahlström [Wah08], we derive novel upper bounds in terms of clauses and variables for \#kSAT that are independent of \(k\), and better than brute-force for small clause densities of \(\frac{m}{n} < 2.25\). This improves on the upper bound of Dubois [Dub91] whenever \(\frac{m}{n} < 1.858\) and \(k \geq 4\), and the average-case analysis by Williams [Wil04] whenever \(\frac{m}{n} < 1.217\) and \(k \geq 6\). We also obtain an unconditional upper bound of \(O∗(1.88m)\) for \#4SAT in terms of clauses only. Finally, we find novel stabilizer decompositions of certain ZH-diagrams and use this to adapt the algorithm of Kissinger and van de Wetering [Kv21] [KvV22] for evaluating ZX-diagrams using stabilizer decompositions to evaluate \#2SAT instances. We examine the effect of different decomposition strategies on its runtime but conclude that the algorithm as given is not effective, and suggest avenues for further improvement.

  @mastersthesis{Laakkonen2022Masters,
      author = {Laakkonen, Tuomas},
      title = {{Graphical Stabilizer Decompositions For Counting Problems}},
      year = {2022},
      school = {University of Oxford},
      urldate = {2022-10-15},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/laakkonen-thesis.pdf},
      keywords = {ZX-Calculus, ZH-calculus, Classical Simulation, SAT, Applied, Master Thesis},
      abstract = {Building on the work of de Beaudrap, Kissinger, and Meichanetzidis [dKM21], in this dissertation, we examine the relationship between #SAT and the ZH calculus. We outline their reduction from \#SAT to evaluating ZH diagrams, which shows that evaluating ZH diagrams is \#P-hard, and we extend this to show that evaluating diagrams in certain fragments of the ZH calculus, is $FP^{\#P}$-complete. In particular, we show this holds for diagrams where all H-boxes have labels in $\mathbb{Q}[i,\sqrt{2}]$, which includes both the Clifford+T and Toffoli-Hadamard fragments natively [BKM+21]. We show the action of the DPLL algorithm [DLL62] for SAT and its derivative CDP [BL99] for \#SAT in terms of ZH-diagrams, and use diagrammatic methods to extend CDP to treat variables and clauses equally. Combining this with an algorithm for \#2SAT by Wahlström [Wah08], we derive novel upper bounds in terms of clauses and variables for \#kSAT that are independent of $k$, and better than brute-force for small clause densities of $\frac{m}{n} < 2.25$.
  This improves on the upper bound of Dubois [Dub91] whenever $\frac{m}{n} < 1.858$ and $k \geq 4$, and the average-case analysis by Williams [Wil04] whenever $\frac{m}{n} < 1.217$ and $k \geq 6$. We also obtain an unconditional upper bound of
  $O∗(1.88m)$ for \#4SAT in terms of clauses only.
  Finally, we find novel stabilizer decompositions of certain ZH-diagrams and use this to adapt the algorithm of Kissinger and van de Wetering [Kv21] [KvV22] for evaluating ZX-diagrams using stabilizer decompositions to evaluate \#2SAT instances. We examine the effect of different decomposition strategies on its runtime but conclude that the algorithm as given is not
  effective, and suggest avenues for further improvement.}
  }
  

  Copy to Clipboard

• Barren plateaus in quantum tensor network optimization
  Enrique Cervero Martín, Kirill Plekhanov and Michael Lubasch
  Show abstract ⇲ Show bibdata ⇲

  Quantum
  Keywords: ZX-calculus, Variational Circuits, Applied, Tensor Networks.

  We analyze the barren plateau phenomenon in the variational optimization of quantum circuits inspired by matrix product states (qMPS), tree tensor networks (qTTN), and the multiscale entanglement renormalization ansatz (qMERA). We consider as the cost function the expectation value of a Hamiltonian that is a sum of local terms. For randomly chosen variational parameters we show that the variance of the cost function gradient decreases exponentially with the distance of a Hamiltonian term from the canonical centre in the quantum tensor network. Therefore, as a function of qubit count, for qMPS most gradient variances decrease exponentially and for qTTN as well as qMERA they decrease polynomially. We also show that the calculation of these gradients is exponentially more efficient on a classical computer than on a quantum computer.

  @article{CerveroMartin2023barrenplateausin,
      author = {Cervero Mart{\'{i}}n, Enrique and Plekhanov, Kirill and Lubasch, Michael},
      title = {Barren plateaus in quantum tensor network optimization},
      year = {2023},
      journal = {{Quantum}},
      volume = {7},
      month = {4},
      pages = {974},
      publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
      issn = {2521-327X},
      doi = {10.22331/q-2023-04-13-974},
      urldate = {2022-09-01},
      link = {http://arxiv.org/abs/2209.00292},
      url = {https://doi.org/10.22331/q-2023-04-13-974},
      keywords = {ZX-calculus, Variational Circuits, Applied, Tensor Networks},
      abstract = {We analyze the barren plateau phenomenon in the variational optimization of quantum circuits inspired by matrix product states (qMPS), tree tensor networks (qTTN), and the multiscale entanglement renormalization ansatz (qMERA). We consider as the cost function the expectation value of a Hamiltonian that is a sum of local terms. For randomly chosen variational parameters we show that the variance of the cost function gradient decreases exponentially with the distance of a Hamiltonian term from the canonical centre in the quantum tensor network. Therefore, as a function of qubit count, for qMPS most gradient variances decrease exponentially and for qTTN as well as qMERA they decrease polynomially. We also show that the calculation of these gradients is exponentially more efficient on a classical computer than on a quantum computer.}
  }
  

  Copy to Clipboard

• Equivalence Checking of Quantum Circuits with the ZX-Calculus
  Tom Peham, Lukas Burgholzer and Robert Wille
  Show abstract ⇲ Show bibdata ⇲

  IEEE Journal on Emerging and Selected Topics in Circuits and Systems
  Keywords: ZX-calculus, Verification, Applied, Automation, Sum-Over-Paths.

  As state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for automated methods to design and test potential applications rises. Equivalence checking of quantum circuits is an important, yet hardly automated, task in the development of the quantum software stack. Recently, new methods have been proposed that tackle this problem from widely different perspectives. One of them is based on the ZX-calculus, a graphical rewriting system for quantum computing. However, the power and capability of this equivalence checking method has barely been explored. The aim of this work is to evaluate the ZX-calculus as a tool for equivalence checking of quantum circuits. To this end, it is demonstrated how the ZX-calculus based approach for equivalence checking can be expanded in order to verify the results of compilation flows and optimizations on quantum circuits. It is also shown that the ZX-calculus based method is not complete–especially for quantum circuits with ancillary qubits. In order to properly evaluate the proposed method, we conduct a detailed case study by comparing it to two other state-of-the-art methods for equivalence checking: one based on path-sums and another based on decision diagrams. The proposed methods have been integrated into the publicly available QCEC tool (https://github.com/cda-tum/qcec) which is part of the Munich Quantum Toolkit (MQT).

  @article{9868772,
      author = {Peham, Tom and Burgholzer, Lukas and Wille, Robert},
      title = {Equivalence Checking of Quantum Circuits with the ZX-Calculus},
      year = {2022},
      journal = {IEEE Journal on Emerging and Selected Topics in Circuits and Systems},
      volume = {},
      number = {},
      pages = {1-1},
      doi = {10.1109/JETCAS.2022.3202204},
      urldate = {2022-08-26},
      link = {https://ieeexplore.ieee.org/document/9868772/authors#authors},
      keywords = {ZX-calculus, Verification, Applied, Automation, Sum-Over-Paths},
      abstract = {As state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for automated methods to design and test potential applications rises. Equivalence checking of quantum circuits is an important, yet hardly automated, task in the development of the quantum software stack. Recently, new methods have been proposed that tackle this problem from widely different perspectives. One of them is based on the ZX-calculus, a graphical rewriting system for quantum computing. However, the power and capability of this equivalence checking method has barely been explored. The aim of this work is to evaluate the ZX-calculus as a tool for equivalence checking of quantum circuits. To this end, it is demonstrated how the ZX-calculus based approach for equivalence checking can be expanded in order to verify the results of compilation flows and optimizations on quantum circuits. It is also shown that the ZX-calculus based method is not complete–especially for quantum circuits with ancillary qubits. In order to properly evaluate the proposed method, we conduct a detailed case study by comparing it to two other state-of-the-art methods for equivalence checking: one based on path-sums and another based on decision diagrams. The proposed methods have been integrated into the publicly available QCEC tool (https://github.com/cda-tum/qcec) which is part of the Munich Quantum Toolkit (MQT).}
  }
  

  Copy to Clipboard

• Equivalence Checking Paradigms in Quantum Circuit Design: A Case Study
  Tom Peham, Lukas Burgholzer and Robert Wille
  Show abstract ⇲ Show bibdata ⇲

  Proceedings of the 59th ACM/IEEE Design Automation Conference
  Keywords: ZX-calculus, Verification, Applied.

  As state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for automated methods to design and test potential applications rises. Equivalence checking of quantum circuits is an important, yet hardly automated, task in the development of the quantum software stack. Recently, new methods have been proposed that tackle this problem from widely different perspectives. However, there is no established baseline on which to judge current and future progress in equivalence checking of quantum circuits. In order to close this gap, we conduct a detailed case study of two of the most promising equivalence checking methodologies---one based on decision diagrams and one based on the ZX-calculus---and compare their strengths and weaknesses.

  @inproceedings{10.1145/3489517.3530480,
      author = {Peham, Tom and Burgholzer, Lukas and Wille, Robert},
      title = {Equivalence Checking Paradigms in Quantum Circuit Design: A Case Study},
      year = {2022},
      booktitle = {Proceedings of the 59th ACM/IEEE Design Automation Conference},
      series = {DAC '22},
      pages = {517–522},
      numpages = {6},
      publisher = {Association for Computing Machinery},
      address = {New York, NY, USA},
      isbn = {9781450391429},
      location = {San Francisco, California},
      doi = {10.1145/3489517.3530480},
      urldate = {2022-08-23},
      link = {https://doi.org/10.1145/3489517.3530480},
      keywords = {ZX-calculus, Verification, Applied},
      abstract = {As state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for automated methods to design and test potential applications rises. Equivalence checking of quantum circuits is an important, yet hardly automated, task in the development of the quantum software stack. Recently, new methods have been proposed that tackle this problem from widely different perspectives. However, there is no established baseline on which to judge current and future progress in equivalence checking of quantum circuits. In order to close this gap, we conduct a detailed case study of two of the most promising equivalence checking methodologies---one based on decision diagrams and one based on the ZX-calculus---and compare their strengths and weaknesses.}
  }
  

  Copy to Clipboard

• Formal diagrammatic spin physics
  Richard East
  Show abstract ⇲ Show bibdata ⇲

  Université Grenoble Alpes PhD Thesis
  Keywords: ZX-calculus, ZH-calculus, Tensor Networks, PyZX, Condensed Matter, Applied, PhD Thesis.

  Diagrams are ubiquitous in physics and have catalysed progress on numerous occasions. From tensor networks and quantum circuits to Feynman diagrams, there are few areas of physics that don’t employ some informal pictorial reasoning. These diagrams represent the underlying mathematical operations and aid physical interpretation, but cannot generally be computed with directly. In this thesis the ZXH-calculus, a graphical language based on the ZX-calculus, is offered as a prototype for a formal diagrammatic calculational tool for theoretical physics involving spin. This extends the ZXH-calculus (and more broadly the ZX family of calculi to which it belongs) beyond its traditional domain which has largely been dominated by quantum computing. In order to do this the spin lattices taken from condensed matter physics are studied. It is also shown how spin-networks of the form often seen as the state-space of loop quantum gravity (LQG) can diagrammatised along with operators acting on them. To achieve this a diagrammatic form of SU(2) representation theory is outlined. Following this in condensed matter a number of results are shown. The 1D AKLT state, a symmetry protected topological state, is expressed in the ZXH-calculus by developing a representation of spins higher than 1/2 within the calculus. By exploiting the simplifying power of the ZXH-calculus rules it is shown how this representation straightforwardly recovers the AKLT matrix-product state representation, the existence of topologically protected edge states, and the non-vanishing of a string order parameter. Extending beyond these known properties, the diagrammatic approach also allows one to analytically derive that the Berry phase of any finite-length 1D AKLT chain is π. In addition, an alternative proof that the 2D AKLT state on a hexagonal lattice can be reduced to a graph state, demonstrating that it is a universal quantum computing resource. Continuing on the theme of condensed matter it is then shown how one can build 2D higher-order topological phases diagrammatically, which is used to illustrate a symmetry-breaking phase transition. Turning to LQG the first step is the analysis of Yutsis diagrams, a standard graphical calculus used in quantum chemistry and quantum gravity, which captures the main features of SU(2) representation theory. Second, it is shown how it embeds within Penrose’s binor calculus. The two are then rewritten as ZXH-diagrams. In the process we show how the SU(2) invariance of Wigner symbols is trivially provable in the ZXH-calculus. Additionally, we show how we can explicitly diagrammatically calculate 3jm, 4jm and 6j symbols. It has long been thought that quantum gravity should be closely aligned to quantum information theory. In this paper, we present a way in which this connection can be made exact, by writing the spin-networks of loop quantum gravity in the ZX-diagrammatic language of quantum computation. Finally after outlining the motivation for considering spin-networks as the quantisation of space, the geometric operators are discussed, and in specific cases diagrammatic versions of the operators are provided. More generally what is done here shows a route by which LQG can be interpreted in quantum informational terms by rewriting its kinematical states as networks of qubits in ZXH. In total these results demonstrate that the ZXH-calculus is a powerful language for representing quantum systems and even allows for the computation on physical states entirely graphically. Within condensed matter it is hoped this will pave the way to develop more efficient many-body algorithms and giving a novel diagrammatic perspective on quantum phase transitions. In LQG it is hoped this re-imagining of its state space will spur further integration of quantum information and gravity.

  @phdthesis{East2022thesis,
      author = {East, Richard},
      title = {{Formal diagrammatic spin physics}},
      year = {2022},
      school = {Universit\'e Grenoble Alpes},
      urldate = {2022-07-11},
      link = {https://tel.archives-ouvertes.fr/tel-03719945},
      keywords = {ZX-calculus, ZH-calculus, Tensor Networks, PyZX, Condensed Matter, Applied, PhD Thesis},
      abstract = {Diagrams are ubiquitous in physics and have catalysed progress on numerous occasions. From
  tensor networks and quantum circuits to Feynman diagrams, there are few areas of physics
  that don’t employ some informal pictorial reasoning. These diagrams represent the underlying
  mathematical operations and aid physical interpretation, but cannot generally be computed
  with directly. In this thesis the ZXH-calculus, a graphical language based on the ZX-calculus,
  is offered as a prototype for a formal diagrammatic calculational tool for theoretical physics
  involving spin. This extends the ZXH-calculus (and more broadly the ZX family of calculi to
  which it belongs) beyond its traditional domain which has largely been dominated by quantum
  computing. In order to do this the spin lattices taken from condensed matter physics are studied.
  It is also shown how spin-networks of the form often seen as the state-space of loop quantum
  gravity (LQG) can diagrammatised along with operators acting on them.
  To achieve this a diagrammatic form of SU(2) representation theory is outlined. Following this
  in condensed matter a number of results are shown. The 1D AKLT state, a symmetry protected
  topological state, is expressed in the ZXH-calculus by developing a representation of spins higher
  than 1/2 within the calculus. By exploiting the simplifying power of the ZXH-calculus rules it
  is shown how this representation straightforwardly recovers the AKLT matrix-product state
  representation, the existence of topologically protected edge states, and the non-vanishing of a
  string order parameter. Extending beyond these known properties, the diagrammatic approach
  also allows one to analytically derive that the Berry phase of any finite-length 1D AKLT chain
  is π. In addition, an alternative proof that the 2D AKLT state on a hexagonal lattice can be
  reduced to a graph state, demonstrating that it is a universal quantum computing resource.
  Continuing on the theme of condensed matter it is then shown how one can build 2D higher-order
  topological phases diagrammatically, which is used to illustrate a symmetry-breaking phase
  transition.
  Turning to LQG the first step is the analysis of Yutsis diagrams, a standard graphical calculus
  used in quantum chemistry and quantum gravity, which captures the main features of SU(2)
  representation theory. Second, it is shown how it embeds within Penrose’s binor calculus. The
  two are then rewritten as ZXH-diagrams. In the process we show how the SU(2) invariance
  of Wigner symbols is trivially provable in the ZXH-calculus. Additionally, we show how we
  can explicitly diagrammatically calculate 3jm, 4jm and 6j symbols. It has long been thought
  that quantum gravity should be closely aligned to quantum information theory. In this paper,
  we present a way in which this connection can be made exact, by writing the spin-networks
  of loop quantum gravity in the ZX-diagrammatic language of quantum computation. Finally
  after outlining the motivation for considering spin-networks as the quantisation of space, the
  geometric operators are discussed, and in specific cases diagrammatic versions of the operators
  are provided. More generally what is done here shows a route by which LQG can be interpreted
  in quantum informational terms by rewriting its kinematical states as networks of qubits in
  ZXH.
  In total these results demonstrate that the ZXH-calculus is a powerful language for representing
  quantum systems and even allows for the computation on physical states entirely graphically.
  Within condensed matter it is hoped this will pave the way to develop more efficient many-body
  algorithms and giving a novel diagrammatic perspective on quantum phase transitions. In
  LQG it is hoped this re-imagining of its state space will spur further integration of quantum
  information and gravity.}
  }
  

  Copy to Clipboard

• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus
  Robert Wille, Lukas Burgholzer, Stefan Hillmich, Thomas Grurl, Alexander Ploier and Tom Peham
  Show abstract ⇲ Show bibdata ⇲

  Proceedings of the 59th ACM/IEEE Design Automation Conference
  Keywords: ZX-calculus, Verification, Classical Simulation, Optimisation, Applied.

  Quantum computers promise to efficiently solve important problems classical computers never will. However, in order to capitalize on these prospects, a fully automated quantum software stack needs to be developed. This involves a multitude of complex tasks from the classical simulation of quantum circuits, over their compilation to specific devices, to the verification of the circuits to be executed as well as the obtained results. All of these tasks are highly non-trivial and necessitate efficient data structures to tackle the inherent complexity. Starting from rather straight-forward arrays over decision diagrams (inspired by the design automation community) to tensor networks and the ZX-calculus, various complementary approaches have been proposed. 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.

  @inproceedings{10.1145/3489517.3530627,
      author = {Wille, Robert and Burgholzer, Lukas and Hillmich, Stefan and Grurl, Thomas and Ploier, Alexander and Peham, Tom},
      title = {{The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus}},
      year = {2022},
      booktitle = {Proceedings of the 59th ACM/IEEE Design Automation Conference},
      series = {DAC '22},
      pages = {1367–1370},
      numpages = {4},
      publisher = {Association for Computing Machinery},
      address = {New York, NY, USA},
      isbn = {9781450391429},
      location = {San Francisco, California},
      doi = {10.1145/3489517.3530627},
      urldate = {2022-07-01},
      link = {https://doi.org/10.1145/3489517.3530627},
      keywords = {ZX-calculus, Verification, Classical Simulation, Optimisation, Applied},
      abstract = {Quantum computers promise to efficiently solve important problems classical computers never will. However, in order to capitalize on these prospects, a fully automated quantum software stack needs to be developed. This involves a multitude of complex tasks from the classical simulation of quantum circuits, over their compilation to specific devices, to the verification of the circuits to be executed as well as the obtained results. All of these tasks are highly non-trivial and necessitate efficient data structures to tackle the inherent complexity. Starting from rather straight-forward arrays over decision diagrams (inspired by the design automation community) to tensor networks and the ZX-calculus, various complementary approaches have been proposed. 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.}
  }
  

  Copy to Clipboard

• Multi-agent blind quantum computation without universal cluster state
  Shuxiang Cao
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  New Journal of Physics
  Keywords: MBQC, gflow, Applied, Graph States.

  Blind quantum computation (BQC) protocols enable quantum algorithms to be executed on third-party quantum agents while keeping the data and algorithm confidential. The previous proposals for measurement-based BQC require preparing a highly entangled cluster state. In this paper, we show that such a requirement is not necessary. Our protocol only requires pre-shared Bell pairs between delegated quantum agents, and there is no requirement for any classical or quantum information exchange between agents during the execution. Our proposal requires fewer quantum resources than previous proposals by eliminating the need for a universal cluster state.

  @article{cao2022multiagent,
      author = {Cao, Shuxiang},
      title = {{Multi-agent blind quantum computation without universal cluster state}},
      year = {2023},
      journal = {New Journal of Physics},
      volume = {25},
      number = {103028},
      month = {10},
      doi = {10.1088/1367-2630/acfab6},
      urldate = {2022-06-27},
      link = {http://arxiv.org/abs/2206.13330},
      keywords = {MBQC, gflow, Applied, Graph States},
      abstract = {Blind quantum computation (BQC) protocols enable quantum algorithms to be executed on third-party quantum agents while keeping the data and algorithm confidential. The previous proposals for measurement-based BQC require preparing a highly entangled cluster state. In this paper, we show that such a requirement is not necessary. Our protocol only requires pre-shared Bell pairs between delegated quantum agents, and there is no requirement for any classical or quantum information exchange between agents during the execution. Our proposal requires fewer quantum resources than previous proposals by eliminating the need for a universal cluster state.},
      video = {https://www.youtube.com/watch?v=xFihqZ5cIZ0}
  }
  

  Copy to Clipboard

• A Pair Measurement Surface Code on Pentagons
  Craig Gidney
  Show abstract ⇲ Show bibdata ⇲

  Quantum
  Keywords: Surface Code, ZX-calculus, Applied.

  In this paper, I present a way to compile the surface code into two-body parity measurements ("pair measurements"), where the pair measurements run along the edges of a Cairo pentagonal tiling. The resulting circuit improves on prior work by Chao et al. by using fewer pair measurements per four-body stabilizer measurement (5 instead of 6) and fewer time steps per round of stabilizer measurement (6 instead of 10). Using Monte Carlo sampling, I show that these improvements increase the threshold of the surface code when compiling into pair measurements from \(\approx 0.2\%\) to \(\approx 0.4\%\), and also that they improve the teraquop footprint at a \(0.1\%\) physical gate error rate from \(\approx6000\) qubits to \(\approx3000\) qubits. However, I also show that Chao et al's construction will have a smaller teraquop footprint for physical gate error rates below \(\approx 0.03\%\) (due to bidirectional hook errors in my construction). I also compare to the planar honeycomb code, showing that although this work does noticeably reduce the gap between the surface code and the honeycomb code (when compiling into pair measurements), the honeycomb code is still more efficient (threshold \(\approx 0.8\%\), teraquop footprint at \(0.1\%\) of \(\approx 1000\)).

  @article{Gidney2023pairmeasurement,
      author = {Gidney, Craig},
      title = {A {P}air {M}easurement {S}urface {C}ode on {P}entagons},
      year = {2023},
      journal = {{Quantum}},
      volume = {7},
      month = {10},
      pages = {1156},
      publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
      issn = {2521-327X},
      doi = {10.22331/q-2023-10-25-1156},
      urldate = {2022-06-26},
      link = {http://arxiv.org/abs/2206.12780},
      url = {https://doi.org/10.22331/q-2023-10-25-1156},
      keywords = {Surface Code, ZX-calculus, Applied},
      abstract = {In this paper, I present a way to compile the surface code into two-body parity measurements ("pair measurements"), where the pair measurements run along the edges of a Cairo pentagonal tiling. The resulting circuit improves on prior work by Chao et al. by using fewer pair measurements per four-body stabilizer measurement (5 instead of 6) and fewer time steps per round of stabilizer measurement (6 instead of 10). Using Monte Carlo sampling, I show that these improvements increase the threshold of the surface code when compiling into pair measurements from $\approx 0.2\%$ to $\approx 0.4\%$, and also that they improve the teraquop footprint at a $0.1\%$ physical gate error rate from $\approx6000$ qubits to $\approx3000$ qubits. However, I also show that Chao et al's construction will have a smaller teraquop footprint for physical gate error rates below $\approx 0.03\%$ (due to bidirectional hook errors in my construction). I also compare to the planar honeycomb code, showing that although this work does noticeably reduce the gap between the surface code and the honeycomb code (when compiling into pair measurements), the honeycomb code is still more efficient (threshold $\approx 0.8\%$, teraquop footprint at $0.1\%$ of $\approx 1000$).}
  }
  

  Copy to Clipboard

• Annealing Optimisation of Mixed ZX Phase Circuits
  Stefano Gogioso and Richie Yeung
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022
  Keywords: ZX-calculus, Applied, Phase Gadgets, Optimisation, Variational Circuits.

  We present a topology-aware optimisation technique for circuits of mixed ZX phase gadgets, based on conjugation by CX gates and simulated annealing.

  @inproceedings{gogioso2023annealing,
      author = {Gogioso, Stefano and Yeung, Richie},
      title = {Annealing Optimisation of Mixed ZX Phase Circuits},
      year = {2023},
      booktitle = {Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022},
      editor = {Gogioso, Stefano and Hoban, Matty},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {394},
      pages = {415-431},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.394.20},
      urldate = {2022-06-23},
      link = {http://arxiv.org/abs/2206.11839},
      keywords = {ZX-calculus, Applied, Phase Gadgets, Optimisation, Variational Circuits},
      abstract = {We present a topology-aware optimisation technique for circuits of mixed ZX phase gadgets, based on conjugation by CX gates and simulated annealing.},
      video = {https://youtu.be/WZgDVPXo7WQ?t=2706}
  }
  

  Copy to Clipboard

• A Complete Equational Theory for Quantum Circuits
  Alexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix and Benoît Valiron
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  Keywords: Completeness, Universal Fragment, Toffoli, ZX-Supported.

  We introduce the first complete equational theory for quantum circuits. More precisely, we introduce a set of circuit equations that we prove to be sound and complete: two circuits represent the same unitary map if and only if they can be transformed one into the other using the equations. The proof is based on the properties of multi-controlled gates -- that are defined using elementary gates -- together with an encoding of quantum circuits into linear optical circuits, which have been proved to have a complete axiomatisation.

  @inproceedings{clement2022complete,
      author = {Clément, Alexandre and Heurtel, Nicolas and Mansfield, Shane and Perdrix, Simon and Valiron, Benoît},
      title = {A Complete Equational Theory for Quantum Circuits},
      year = {2023},
      booktitle = {2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
      volume = {},
      number = {},
      pages = {1-13},
      doi = {10.1109/LICS56636.2023.10175801},
      urldate = {2022-06-21},
      link = {http://arxiv.org/abs/2206.10577},
      keywords = {Completeness, Universal Fragment, Toffoli, ZX-Supported},
      abstract = {We introduce the first complete equational theory for quantum circuits. More precisely, we introduce a set of circuit equations that we prove to be sound and complete: two circuits represent the same unitary map if and only if they can be transformed one into the other using the equations. The proof is based on the properties of multi-controlled gates -- that are defined using elementary gates -- together with an encoding of quantum circuits into linear optical circuits, which have been proved to have a complete axiomatisation.},
      video = {https://www.youtube.com/watch?v=MzUuXz6Y8mo}
  }
  

  Copy to Clipboard

• Reducing 2-qubit gate count for ZX-calculus based quantum circuit optimization
  Korbinian Staudacher, Tobias Guggemos and Sophia Grundner-Culemann
  Show abstract ⇲ Show bibdata ⇲

  Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June -- 1 July 2022
  Keywords: Optimisation, ZX-calculus, Optimisation, PyZX, Applied, Local Complementation.

  In the near term, programming quantum computers will remain severely limited by low quantum volumes. Therefore, it is desirable to implement quantum circuits with the fewest resources possible. For the common Clifford+T circuits, most research is focused on reducing the number of T gates, since they are an order of magnitude more expensive than Clifford gates in quantum error corrected encoding schemes. However, this optimization sometimes leads to more 2-qubit gates, which, even though they are less expensive in terms of fault-tolerance, contribute significantly to the overall circuit cost. Approaches based on the ZX-calculus have recently gained some popularity in the field, but reduction of 2-qubit gates is not their focus. In this work, we present an alternative for improving 2-qubit gate count of a quantum circuit with the ZX-calculus by using heuristics in ZX-diagram simplification. Our approach maintains the good reduction of the T gate count provided by other strategies based on ZX-calculus, thus serving as an extension for other optimization algorithms. Our results show that combining the available ZX-calculus-based optimizations with our algorithms can reduce the number of 2-qubit gates by as much as 40\% compared to current approaches using ZXcalculus. Additionally, we improve the results of the best currently available optimization technique of Nam et. al [22] for some circuits by up to 15\%.

  @inproceedings{Staudacher2022reducing,
      author = {Staudacher, Korbinian and Guggemos, Tobias and Grundner-Culemann, Sophia},
      title = {{Reducing 2-qubit gate count for ZX-calculus based quantum circuit optimization}},
      year = {2022},
      booktitle = {Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June -- 1 July 2022},
      editor = {Gogioso, Stefano and Hoban, Matty},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {394},
      pages = {29--45},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.394.3},
      urldate = {2022-06-20},
      link = {https://www.qplconference.org/proceedings2022/QPL_2022_paper_10.pdf},
      keywords = {Optimisation, ZX-calculus, Optimisation, PyZX, Applied, Local Complementation},
      abstract = {In the near term, programming quantum computers will remain severely limited by low quantum volumes. Therefore, it is desirable to implement quantum circuits with the fewest resources possible. For the common Clifford+T circuits, most research is focused on reducing the number of T gates, since they are an order of magnitude more expensive than Clifford gates in quantum error corrected encoding schemes. However, this optimization sometimes leads to more 2-qubit gates, which, even though they are less expensive in terms of fault-tolerance, contribute significantly to the overall circuit cost. Approaches based on the ZX-calculus have recently gained some popularity in the field, but reduction of 2-qubit gates is not their focus. In this work, we present an alternative for improving 2-qubit gate count of a quantum circuit with the ZX-calculus by using heuristics in ZX-diagram simplification. Our approach maintains the good reduction of the T gate count provided by other strategies based on ZX-calculus, thus serving as an extension for other optimization algorithms. Our results show that combining the available ZX-calculus-based optimizations with our algorithms can reduce the number of 2-qubit gates by as much as 40\% compared to current approaches using ZXcalculus. Additionally, we improve the results of the best currently available optimization technique of Nam et. al [22] for some circuits by up to 15\%.}
  }
  

  Copy to Clipboard

• VyZX : A Vision for Verifying the ZX Calculus
  Adrian Lehmann, Ben Caldwell and Robert Rand
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2205.05781
  Keywords: ZX-calculus, Automation, Applied, Verification.

  Optimizing quantum circuits is a key challenge for quantum computing. The PyZX compiler broke new ground by optimizing circuits via the ZX calculus, a powerful graphical alternative to the quantum circuit model. Still, it carries no guarantee of its correctness. To address this, we developed VyZX, a verified ZX-calculus in the Coq proof assistant. VyZX provides two distinct representations of ZX diagrams for ease of programming and proof: A graph-based representation for writing high-level functions on diagrams and a block-based representation for proving ZX diagrams equivalent. Through these two different views, VyZX provides the tools necessary to verify properties and transformations of ZX diagrams. This paper explores the proofs and design choices underlying VyZX and its application and the challenges of verifying a graphical programming language.

  @article{lehmann2022vyzx,
      author = {Lehmann, Adrian and Caldwell, Ben and Rand, Robert},
      title = {{VyZX : A Vision for Verifying the ZX Calculus}},
      year = {2022},
      journal = {arXiv preprint arXiv:2205.05781},
      urldate = {2022-05-11},
      link = {http://arxiv.org/abs/2205.05781},
      keywords = {ZX-calculus, Automation, Applied, Verification},
      abstract = {Optimizing quantum circuits is a key challenge for quantum computing. The PyZX compiler broke new ground by optimizing circuits via the ZX calculus, a powerful graphical alternative to the quantum circuit model. Still, it carries no guarantee of its correctness. To address this, we developed VyZX, a verified ZX-calculus in the Coq proof assistant. VyZX provides two distinct representations of ZX diagrams for ease of programming and proof: A graph-based representation for writing high-level functions on diagrams and a block-based representation for proving ZX diagrams equivalent. Through these two different views, VyZX provides the tools necessary to verify properties and transformations of ZX diagrams. This paper explores the proofs and design choices underlying VyZX and its application and the challenges of verifying a graphical programming language.},
      video = {https://www.youtube.com/watch?v=sPv-ufgLr1E}
  }
  

  Copy to Clipboard

• Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
  Tommy McElvanney and Miriam Backens
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022
  Keywords: ZX-calculus, Clifford Fragment, gflow, Circuit Extraction, Local Complementation.

  In the one-way model of measurement-based quantum computation (MBQC), computation proceeds via measurements on some standard resource state. So-called flow conditions ensure that the overall computation is deterministic in a suitable sense, with Pauli flow being the most general of these. Existing work on rewriting MBQC patterns while preserving the existence of flow has focused on rewrites that reduce the number of qubits. In this work, we show that introducing new \(Z\)-measured qubits, connected to any subset of the existing qubits, preserves the existence of Pauli flow. Furthermore, we give a unique canonical form for stabilizer ZX-diagrams inspired by recent work of Hu & Khesin [arXiv:2109.10210]. We prove that any MBQC-like stabilizer ZX-diagram with Pauli flow can be rewritten into this canonical form using only rules which preserve the existence of Pauli flow and that each of these rules can be reversed while also preserving the existence of Pauli flow. Hence we have complete graphical rewriting for MBQC-like stabilizer ZX-diagrams with Pauli flow.

  @inproceedings{mcelvanney2023complete,
      author = {McElvanney, Tommy and Backens, Miriam},
      title = {Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements},
      year = {2023},
      booktitle = {Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022},
      editor = {Gogioso, Stefano and Hoban, Matty},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {394},
      pages = {66-82},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.394.5},
      urldate = {2022-05-04},
      link = {http://arxiv.org/abs/2205.02009},
      keywords = {ZX-calculus, Clifford Fragment, gflow, Circuit Extraction, Local Complementation},
      abstract = {In the one-way model of measurement-based quantum computation (MBQC), computation proceeds via measurements on some standard resource state. So-called flow conditions ensure that the overall computation is deterministic in a suitable sense, with Pauli flow being the most general of these. Existing work on rewriting MBQC patterns while preserving the existence of flow has focused on rewrites that reduce the number of qubits.   In this work, we show that introducing new $Z$-measured qubits, connected to any subset of the existing qubits, preserves the existence of Pauli flow. Furthermore, we give a unique canonical form for stabilizer ZX-diagrams inspired by recent work of Hu & Khesin [arXiv:2109.10210]. We prove that any MBQC-like stabilizer ZX-diagram with Pauli flow can be rewritten into this canonical form using only rules which preserve the existence of Pauli flow and that each of these rules can be reversed while also preserving the existence of Pauli flow. Hence we have complete graphical rewriting for MBQC-like stabilizer ZX-diagrams with Pauli flow.},
      video = {https://www.youtube.com/watch?v=Hpk3JKdj4vo}
  }
  

  Copy to Clipboard

• Phase-free ZX diagrams are CSS codes (...or how to graphically grok the surface code)
  Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2204.14038
  Keywords: ZX-calculus, Surface Code, Lattice Surgery, Error correcting codes.

  In this paper, we demonstrate a direct correspondence between phase-free ZX diagrams, a graphical notation for representing and manipulating a certain class of linear maps on qubits, and Calderbank-Shor-Steane (CSS) codes, a large family of quantum error correcting codes constructed from classical codes, including for example the Steane code, surface codes, and colour codes. The stabilisers of a CSS code have an especially nice structure arising from a pair of orthogonal \(\mathbb F_2\)-linear subspaces, or in the case of maximal CSS codes, a single subspace and its orthocomplement. On the other hand, phase-free ZX diagrams can always be efficiently reduced to a normal form given by the basis elements of an \(\mathbb F_2\)-linear subspace. Here, we will show that these two ways of describing a quantum state by an \(\mathbb F_2\)-linear subspace \(S\) are in fact the same. Namely, the maximal CSS code generated by \(S\) fixes the quantum state whose ZX normal form is also given by \(S\). This insight gives us an immediate translation from stabilisers of a maximal CSS code into a ZX diagram describing its associated state. We show that we can extend this translation to stabilisers and logical operators of any (possibly non-maximal) CSS code by "bending wires". To demonstrate the utility of this translation, we give a simple picture of the surface code and a fully graphical derivation of the action of physical lattice surgery operations on the space of logical qubits, completing the ZX presentation of lattice surgery initiated by de Beudrap and Horsman.

  @article{kissinger2022phasefree,
      author = {Kissinger, Aleks},
      title = {{Phase-free ZX diagrams are CSS codes (...or how to graphically grok the surface code)}},
      year = {2022},
      journal = {arXiv preprint arXiv:2204.14038},
      urldate = {2022-04-29},
      link = {http://arxiv.org/abs/2204.14038},
      keywords = {ZX-calculus, Surface Code, Lattice Surgery, Error correcting codes},
      abstract = {In this paper, we demonstrate a direct correspondence between phase-free ZX diagrams, a graphical notation for representing and manipulating a certain class of linear maps on qubits, and Calderbank-Shor-Steane (CSS) codes, a large family of quantum error correcting codes constructed from classical codes, including for example the Steane code, surface codes, and colour codes. The stabilisers of a CSS code have an especially nice structure arising from a pair of orthogonal $\mathbb F_2$-linear subspaces, or in the case of maximal CSS codes, a single subspace and its orthocomplement. On the other hand, phase-free ZX diagrams can always be efficiently reduced to a normal form given by the basis elements of an $\mathbb F_2$-linear subspace. Here, we will show that these two ways of describing a quantum state by an $\mathbb F_2$-linear subspace $S$ are in fact the same. Namely, the maximal CSS code generated by $S$ fixes the quantum state whose ZX normal form is also given by $S$.   This insight gives us an immediate translation from stabilisers of a maximal CSS code into a ZX diagram describing its associated state. We show that we can extend this translation to stabilisers and logical operators of any (possibly non-maximal) CSS code by "bending wires". To demonstrate the utility of this translation, we give a simple picture of the surface code and a fully graphical derivation of the action of physical lattice surgery operations on the space of logical qubits, completing the ZX presentation of lattice surgery initiated by de Beudrap and Horsman.},
      video = {https://www.youtube.com/watch?v=VVhBGpCMlwA}
  }
  

  Copy to Clipboard

• The Many-Worlds Calculus: Representing Quantum Control
  Kostia Chardonnet, Marc de Visme, Benoit Valiron and Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  HAL preprint: hal-03654190
  Keywords: ZX-calculus, Category Theory, Completeness.

  We propose a new typed graphical language for quantum computation, based on compact categories with biproducts. Our language generalizes existing approaches such as ZX-calculus and quantum circuits, while offering a natural framework to support quantum control: it natively supports "quantum tests". The language comes equipped with a denotational semantics based on linear applications, and an equational theory. Through the use of normal forms for the diagrams, we prove the language to be universal, and the equational theory to be complete with respect to the semantics.

  @article{Chardonnet2022ManyWorlds,
      author = {Chardonnet, Kostia and de Visme, Marc and Valiron, Benoit and Vilmart, Renaud},
      title = {{The Many-Worlds Calculus: Representing Quantum Control}},
      year = {2022},
      journal = {HAL preprint: hal-03654190},
      urldate = {2022-04-28},
      link = {https://hal.archives-ouvertes.fr/hal-03654190},
      keywords = {ZX-calculus, Category Theory, Completeness},
      abstract = {We propose a new typed graphical language for quantum computation, based on compact categories with biproducts. Our language generalizes existing approaches such as ZX-calculus and quantum circuits, while offering a natural framework to support quantum control: it natively supports "quantum tests". The language comes equipped with a denotational semantics based on linear applications, and an equational theory. Through the use of normal forms for the diagrams, we prove the language to be universal, and the equational theory to be complete with respect to the semantics.}
  }
  

  Copy to Clipboard

• Building Qutrit Diagonal Gates from Phase Gadgets
  John van de Wetering and Lia Yeh
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022
  Keywords: ZX-calculus, Qutrits, Phase Gadgets, Optimisation, Applied.

  Phase gadgets have proved to be an indispensable tool for reasoning about ZX-diagrams, being used in optimisation and simulation of quantum circuits and the theory of measurement-based quantum computation. In this paper we study phase gadgets for qutrits. We present the flexsymmetric variant of the original qutrit ZX-calculus, which allows for rewriting that is closer in spirit to the original (qubit) ZX-calculus. In this calculus phase gadgets look as you would expect, but there are non-trivial differences in their properties. We devise new qutrit-specific tricks to extend the graphical Fourier theory of qubits, resulting in a translation between the 'additive' phase gadgets and a 'multiplicative' counterpart we dub phase multipliers. This enables us to build different types of qutrit multiple-controlled phase gates. As an application of these results we find a construction for emulating arbitrary qubit diagonal unitaries, and specifically find an emulation for the qubit CCZ gate that only requires three single-qutrit non-Clifford gates to implement - provably lower than the four T gates needed using just qubit gates.

  @inproceedings{vandewetering2023phase,
      author = {van de Wetering, John and Yeh, Lia},
      title = {Building Qutrit Diagonal Gates from Phase Gadgets},
      year = {2023},
      booktitle = {Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022},
      editor = {Gogioso, Stefano and Hoban, Matty},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {394},
      pages = {46-65},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.394.4},
      urldate = {2022-04-28},
      link = {http://arxiv.org/abs/2204.13681},
      keywords = {ZX-calculus, Qutrits, Phase Gadgets, Optimisation, Applied},
      abstract = {Phase gadgets have proved to be an indispensable tool for reasoning about ZX-diagrams, being used in optimisation and simulation of quantum circuits and the theory of measurement-based quantum computation. In this paper we study phase gadgets for qutrits. We present the flexsymmetric variant of the original qutrit ZX-calculus, which allows for rewriting that is closer in spirit to the original (qubit) ZX-calculus. In this calculus phase gadgets look as you would expect, but there are non-trivial differences in their properties. We devise new qutrit-specific tricks to extend the graphical Fourier theory of qubits, resulting in a translation between the 'additive' phase gadgets and a 'multiplicative' counterpart we dub phase multipliers. This enables us to build different types of qutrit multiple-controlled phase gates. As an application of these results we find a construction for emulating arbitrary qubit diagonal unitaries, and specifically find an emulation for the qubit CCZ gate that only requires three single-qutrit non-Clifford gates to implement - provably lower than the four T gates needed using just qubit gates.},
      video = {https://youtu.be/v_y8Wu6GLxc?t=2548}
  }
  

  Copy to Clipboard

• Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Clifford Hierarchy
  Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  HAL preprint: hal-03654438
  Keywords: ZH-calculus, Completeness, Sum-Over-Paths.

  The "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification. We give here a new set of rewrite rules for the formalism, and show that it is complete for "Toffoli-Hadamard", the simplest approximately universal fragment of quantum mechanics. We show that the rewriting is terminating, but not confluent (which is expected from the universality of the fragment). We do so using the connection between Sum-over-Paths and graphical language ZH-Calculus, and also show how the axiomatization translates into the latter. Finally, we show how to enrich the rewrite system to reach completeness for the whole Clifford hierarchy.

  @article{Vilmart2022Completeness,
      author = {Vilmart, Renaud},
      title = {{Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Clifford Hierarchy}},
      year = {2022},
      journal = {HAL preprint: hal-03654438},
      urldate = {2022-04-28},
      link = {https://hal.archives-ouvertes.fr/hal-03654438},
      keywords = {ZH-calculus, Completeness, Sum-Over-Paths},
      abstract = {The "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification. We give here a new set of rewrite rules for the formalism, and show that it is complete for "Toffoli-Hadamard", the simplest approximately universal fragment of quantum mechanics. We show that the rewriting is terminating, but not confluent (which is expected from the universality of the fragment). We do so using the connection between Sum-over-Paths and graphical language ZH-Calculus, and also show how the axiomatization translates into the latter. Finally, we show how to enrich the rewrite system to reach completeness for the whole Clifford hierarchy.}
  }
  

  Copy to Clipboard

• Quantum Linear Optics via String Diagrams
  Giovanni de Felice and Bob Coecke
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022
  Keywords: Photons, ZX-calculus, Applied, Pauli Fusion, Completeness.

  We establish a formal bridge between qubit-based and photonic quantum computing. We do this by defining a functor from the ZX calculus to linear optical circuits. In the process we provide a compositional theory of quantum linear optics which allows to reason about events involving multiple photons such as those required to perform linear-optical and fusion-based quantum computing.

  @inproceedings{defelice2022quantum,
      author = {de Felice, Giovanni and Coecke, Bob},
      title = {Quantum Linear Optics via String Diagrams},
      year = {2023},
      booktitle = {Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022},
      editor = {Gogioso, Stefano and Hoban, Matty},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {394},
      pages = {83-100},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.394.6},
      urldate = {2022-04-27},
      link = {http://arxiv.org/abs/2204.12985},
      keywords = {Photons, ZX-calculus, Applied, Pauli Fusion, Completeness},
      abstract = {We establish a formal bridge between qubit-based and photonic quantum computing. We do this by defining a functor from the ZX calculus to linear optical circuits. In the process we provide a compositional theory of quantum linear optics which allows to reason about events involving multiple photons such as those required to perform linear-optical and fusion-based quantum computing.},
      video = {https://www.youtube.com/watch?v=BomcbwrJxvs}
  }
  

  Copy to Clipboard

• Qudit lattice surgery
  Alexander Cowtan
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2204.13228
  Keywords: ZX-calculus, Qudits, Lattice Surgery, Surface Code.

  We observe that lattice surgery, a model of fault-tolerant qubit computation, generalises straightforwardly to arbitrary finite-dimensional qudits. The generalised model is based on the group algebras \(\mathbb{C}\mathbb{Z}_d\) for \(d \geq 2\). It still requires magic state injection for universal quantum computation. We relate the model to the ZX-calculus, a diagrammatic language based on Hopf-Frobenius algebras.

  @article{cowtan2022qudit,
      author = {Cowtan, Alexander},
      title = {{Qudit lattice surgery}},
      year = {2022},
      journal = {arXiv preprint arXiv:2204.13228},
      urldate = {2022-04-27},
      link = {http://arxiv.org/abs/2204.13228},
      keywords = {ZX-calculus, Qudits, Lattice Surgery, Surface Code},
      abstract = {We observe that lattice surgery, a model of fault-tolerant qubit computation, generalises straightforwardly to arbitrary finite-dimensional qudits. The generalised model is based on the group algebras $\mathbb{C}\mathbb{Z}_d$ for $d \geq 2$. It still requires magic state injection for universal quantum computation. We relate the model to the ZX-calculus, a diagrammatic language based on Hopf-Frobenius algebras.},
      video = {https://youtu.be/eNCefHNnw0A?t=3623}
  }
  

  Copy to Clipboard

• Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime Dimensions
  Robert I. Booth and Titouan Carette
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
  Keywords: ZX-calculus, Completeness, Qudits, Clifford Fragment, Local Complementation, Graph States, Mixed States.

  We introduce a family of ZX-calculi which axiomatise the stabiliser fragment of quantum theory in odd prime dimensions. These calculi recover many of the nice features of the qubit ZX-calculus which were lost in previous proposals for higher-dimensional systems. We then prove that these calculi are complete, i.e. provide a set of rewrite rules which can be used to prove any equality of stabiliser quantum operations. Adding a discard construction, we obtain a calculus complete for mixed state stabiliser quantum mechanics in odd prime dimensions, and this furthermore gives a complete axiomatisation for the related diagrammatic language for affine co-isotropic relations.

  @inproceedings{booth2022complete,
      author = {Booth, Robert I. and Carette, Titouan},
      title = {{Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime Dimensions}},
      year = {2022},
      booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
      editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {241},
      pages = {24:1--24:15},
      publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-256-3},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.MFCS.2022.24},
      urldate = {2022-04-26},
      link = {http://arxiv.org/abs/2204.12531},
      url = {https://drops.dagstuhl.de/opus/volltexte/2022/16822},
      keywords = {ZX-calculus, Completeness, Qudits, Clifford Fragment, Local Complementation, Graph States, Mixed States},
      abstract = {We introduce a family of ZX-calculi which axiomatise the stabiliser fragment of quantum theory in odd prime dimensions. These calculi recover many of the nice features of the qubit ZX-calculus which were lost in previous proposals for higher-dimensional systems. We then prove that these calculi are complete, i.e. provide a set of rewrite rules which can be used to prove any equality of stabiliser quantum operations. Adding a discard construction, we obtain a calculus complete for mixed state stabiliser quantum mechanics in odd prime dimensions, and this furthermore gives a complete axiomatisation for the related diagrammatic language for affine co-isotropic relations.},
      urn = {urn:nbn:de:0030-drops-168225},
      video = {https://www.youtube.com/watch?v=v_y8Wu6GLxc}
  }
  

  Copy to Clipboard

• Large-scale quantum diagrammatic reasoning tools, !-boxes vs. scalable notations
  Titouan Carette and Louis Lemonnier
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2204.11702
  Keywords: Scalable ZX, ZH-calculus, !-boxes, Hypergraph, Local Complementation, Graph States.

  The application of diagrammatic reasoning techniques to large-scale quantum processes needs specific tools to describe families of diagrams of arbitrary size. For now, large-scale diagrammatic reasoning tools in ZH-calculus come in two flavours, !-boxes and scalable notations. This paper investigates the interactions between the two approaches by exhibiting correspondences through various examples from the literature, focusing on (hyper)graph states and diagrammatic transforms. In doing so, we set up a path toward a neat and tidy large-scale diagrammatic reasoning toolbox.

  @article{carette2022largescale,
      author = {Carette, Titouan and Lemonnier, Louis},
      title = {{Large-scale quantum diagrammatic reasoning tools, !-boxes vs. scalable notations}},
      year = {2022},
      journal = {arXiv preprint arXiv:2204.11702},
      urldate = {2022-04-25},
      link = {http://arxiv.org/abs/2204.11702},
      keywords = {Scalable ZX, ZH-calculus, !-boxes, Hypergraph, Local Complementation, Graph States},
      abstract = {The application of diagrammatic reasoning techniques to large-scale quantum processes needs specific tools to describe families of diagrams of arbitrary size. For now, large-scale diagrammatic reasoning tools in ZH-calculus come in two flavours, !-boxes and scalable notations. This paper investigates the interactions between the two approaches by exhibiting correspondences through various examples from the literature, focusing on (hyper)graph states and diagrammatic transforms. In doing so, we set up a path toward a neat and tidy large-scale diagrammatic reasoning toolbox.},
      video = {https://www.youtube.com/watch?v=9yXEoyt8YCA}
  }
  

  Copy to Clipboard

• ZX Polynomial Synthesis
  David Winderl
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Preprint
  Keywords: ZX-calculus, Optimisation, Applied, Phase Gadgets.

  The Noisy intermediate state quantum devices era (NISQ era) in quantum computing can be seen as the era of quantum devices with 50-100 qubits, which provide restricted connectivity between qubits and nosy qubits with a limited coherence time. This issue motivates efficient algorithms to reduce the number of gates applied to circuits in an automated way, similar to the simplification process of classical compilers. Various researchers have proposed methods that reduce the number of gates, and the depth of the quantum circuit. Nevertheless, providing a routed circuit, so a circuit that suffices the connectivity graph of the device was always considered a process that is done after optimization. Griend et al. has proposed a recursive algorithm for synthesizing so-called Z polynomials. Moreover, they showed that optimization and routing in combination are pretty effective for Z Polynomials. Hence they proposed the avenue of future work to extend their algorithm to Pauli gadgets. This guided research aims to analyze the problem of general phase gadget synthesis. Herefore we provide two extensions to the algorithm by Griend et al.. One extension focuses on splitting the ZX Polynomial into smaller commuting regions, while the other tries to identify blocking columns and resolve them beforehand. Next, we provide an algorithm based on the A* search heuristic. Finally, we compare our results to the Pauli-Gadet simplification-pass by tket combined with their internal routing strategy and our optimization strategy with pyzx concerning one qubit gates

  @article{Winderl2022ZXPolynomial,
      author = {Winderl, David},
      title = {{ZX Polynomial Synthesis}},
      year = {2022},
      journal = {Preprint},
      urldate = {2022-04-23},
      link = {https://mediatum.ub.tum.de/doc/1658567/0cqw8i7hoo3k7g3wsrbs0k51m.pdf},
      keywords = {ZX-calculus, Optimisation, Applied, Phase Gadgets},
      abstract = {The Noisy intermediate state quantum devices era (NISQ era) in quantum computing can be seen as the era of quantum devices with 50-100 qubits, which provide restricted connectivity between qubits and nosy qubits with a limited coherence time. This issue motivates efficient algorithms to reduce the number of gates applied to circuits in an automated way, similar to the simplification process of classical compilers. Various researchers have proposed methods that reduce the number of gates, and the depth of the quantum circuit. Nevertheless, providing a routed circuit, so a circuit that suffices the connectivity graph of the device was always considered a process that is done after optimization. Griend et al. has proposed a recursive algorithm for synthesizing so-called Z polynomials. Moreover, they showed that optimization and routing in combination are pretty effective for Z Polynomials. Hence they proposed the avenue of future work to extend their algorithm to Pauli gadgets. This guided research aims to analyze the problem of general phase gadget synthesis. Herefore we provide two extensions to the algorithm by Griend et al.. One extension focuses on splitting the ZX Polynomial into smaller commuting regions, while the other tries to identify blocking columns and resolve them beforehand. Next, we provide an algorithm based on the A* search heuristic. Finally, we compare our results to the Pauli-Gadet simplification-pass by tket combined with their internal routing strategy and our optimization strategy with pyzx concerning one qubit gates},
      video = {https://www.youtube.com/watch?v=V8dlZgSQYiU&t=67s}
  }
  

  Copy to Clipboard

• Diagrammatic Analysis for Parameterized Quantum Circuits
  Tobias Stollenwerk and Stuart Hadfield
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022
  Keywords: ZX-calculus, Variational Circuits, Applied.

  Diagrammatic representations of quantum algorithms and circuits offer novel approaches to their design and analysis. In this work, we describe extensions of the ZX-calculus especially suitable for parameterized quantum circuits, in particular for computing observable expectation values as functions of or for fixed parameters, which are important algorithmic quantities in a variety of applications ranging from combinatorial optimization to quantum chemistry. We provide several new ZX-diagram rewrite rules and generalizations for this setting. In particular, we give formal rules for dealing with linear combinations of ZX-diagrams, where the relative complex-valued scale factors of each diagram must be kept track of, in contrast to most previously studied single-diagram realizations where these coefficients can be effectively ignored. This allows us to directly import a number useful relations from the operator analysis to ZX-calculus setting, including causal cone and quantum gate commutation rules. We demonstrate that the diagrammatic approach offers useful insights into algorithm structure and performance by considering several ans\"atze from the literature including realizations of hardware-efficient ans\"atze and QAOA. We find that by employing a diagrammatic representation, calculations across different ans\"atze can become more intuitive and potentially easier approach systematically than by alternative means. Finally, we outline how diagrammatic approaches may aid in the design and study of new and more effective quantum circuit ans\"atze.

  @inproceedings{stollenwerk2023diagrammatic,
      author = {Stollenwerk, Tobias and Hadfield, Stuart},
      title = {Diagrammatic Analysis for Parameterized Quantum Circuits},
      year = {2023},
      booktitle = {Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022},
      editor = {Gogioso, Stefano and Hoban, Matty},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {394},
      pages = {262-301},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.394.15},
      urldate = {2022-04-04},
      link = {http://arxiv.org/abs/2204.01307},
      keywords = {ZX-calculus, Variational Circuits, Applied},
      abstract = {Diagrammatic representations of quantum algorithms and circuits offer novel approaches to their design and analysis. In this work, we describe extensions of the ZX-calculus especially suitable for parameterized quantum circuits, in particular for computing observable expectation values as functions of or for fixed parameters, which are important algorithmic quantities in a variety of applications ranging from combinatorial optimization to quantum chemistry. We provide several new ZX-diagram rewrite rules and generalizations for this setting. In particular, we give formal rules for dealing with linear combinations of ZX-diagrams, where the relative complex-valued scale factors of each diagram must be kept track of, in contrast to most previously studied single-diagram realizations where these coefficients can be effectively ignored. This allows us to directly import a number useful relations from the operator analysis to ZX-calculus setting, including causal cone and quantum gate commutation rules. We demonstrate that the diagrammatic approach offers useful insights into algorithm structure and performance by considering several ans\"atze from the literature including realizations of hardware-efficient ans\"atze and QAOA. We find that by employing a diagrammatic representation, calculations across different ans\"atze can become more intuitive and potentially easier approach systematically than by alternative means. Finally, we outline how diagrammatic approaches may aid in the design and study of new and more effective quantum circuit ans\"atze.},
      video = {https://youtu.be/0YJgSJvBZH0?t=2789}
  }
  

  Copy to Clipboard

• Constructing All Qutrit Controlled Clifford+T gates in Clifford+T
  Lia Yeh and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲

  Reversible Computation
  Keywords: Qutrits, Optimisation, Clifford+T, ZX-Supported.

  For a number of useful quantum circuits, qudit constructions have been found which reduce resource requirements compared to the best known or best possible qubit construction. However, many of the necessary qutrit gates in these constructions have never been explicitly and efficiently constructed in a fault-tolerant manner. We show how to exactly and unitarily construct any qutrit multiple-controlled Clifford+T unitary using just Clifford+T gates and without using ancillae. The T-count to do so is polynomial in the number of controls k, scaling as \(O(k^{3.585})\). With our results we can construct ancilla-free Clifford+T implementations of multiple-controlled T gates as well as all versions of the qutrit multiple-controlled Toffoli, while the analogous results for qubits are impossible. As an application of our results, we provide a procedure to implement any ternary classical reversible function on \(n\) trits as an ancilla-free qutrit unitary using \(O(3^n n^{3.585})\) T gates.

  @inproceedings{Yeh2022Constructing,
      author = {Yeh, Lia and van de Wetering, John},
      title = {{Constructing All Qutrit Controlled Clifford+T gates in Clifford+T}},
      year = {2022},
      booktitle = {Reversible Computation},
      editor = {Mezzina, Claudio Antares and Podlaski, Krzysztof},
      pages = {28--50},
      publisher = {Springer International Publishing},
      address = {Cham},
      isbn = {978-3-031-09005-9},
      doi = {10.1007/978-3-031-09005-9_3},
      urldate = {2022-04-01},
      link = {https://arxiv.org/abs/2204.00552},
      keywords = {Qutrits, Optimisation, Clifford+T, ZX-Supported},
      abstract = {For a number of useful quantum circuits, qudit constructions have been found which reduce resource requirements compared to the best known or best possible qubit construction. However, many of the necessary qutrit gates in these constructions have never been explicitly and efficiently constructed in a fault-tolerant manner. We show how to exactly and unitarily construct any qutrit multiple-controlled Clifford+T unitary using just Clifford+T gates and without using ancillae. The T-count to do so is polynomial in the number of controls k, scaling as $O(k^{3.585})$. With our results we can construct ancilla-free Clifford+T implementations of multiple-controlled T gates as well as all versions of the qutrit multiple-controlled Toffoli, while the analogous results for qubits are impossible. As an application of our results, we provide a procedure to implement any ternary classical reversible function on $n$ trits as an ancilla-free qutrit unitary using $O(3^n n^{3.585})$ T gates.}
  }
  

  Copy to Clipboard

• Addition and Differentiation of ZX-diagrams
  Emmanuel Jeandel, Simon Perdrix and Margarita Veshchezerova
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Logical Methods in Computer Science
  Keywords: ZX-calculus, Applied, Variational Circuits.

  The ZX-calculus is a powerful framework for reasoning in quantum computing. It provides in particular a compact representation of matrices of interests. A peculiar property of the ZX-calculus is the absence of a formal sum allowing the linear combinations of arbitrary ZX-diagrams. The universality of the formalism guarantees however that for any two ZX-diagrams, the sum of their interpretations can be represented by a ZX-diagram. We introduce a general, inductive definition of the addition of ZX-diagrams, relying on the construction of controlled diagrams. Based on this addition technique, we provide an inductive differentiation of ZX-diagrams. Indeed, given a ZX-diagram with variables in the description of its angles, one can differentiate the diagram according to one of these variables. Differentiation is ubiquitous in quantum mechanics and quantum computing (e.g. for solving optimization problems). Technically, differentiation of ZX-diagrams is strongly related to summation as witnessed by the product rules. We also introduce an alternative, non inductive, differentiation technique rather based on the isolation of the variables. Finally, we apply our results to deduce a diagram for an Ising Hamiltonian.

  @article{jeandel2022addition,
      author = {Jeandel, Emmanuel and Perdrix, Simon and Veshchezerova, Margarita},
      title = {{Addition and Differentiation of ZX-diagrams}},
      year = {2024},
      journal = {{Logical Methods in Computer Science}},
      volume = {{Volume 20, Issue 2}},
      month = {5},
      doi = {10.46298/lmcs-20(2:10)2024},
      urldate = {2022-02-23},
      link = {http://arxiv.org/abs/2202.11386},
      keywords = {ZX-calculus, Applied, Variational Circuits},
      abstract = {The ZX-calculus is a powerful framework for reasoning in quantum computing. It provides in particular a compact representation of matrices of interests. A peculiar property of the ZX-calculus is the absence of a formal sum allowing the linear combinations of arbitrary ZX-diagrams. The universality of the formalism guarantees however that for any two ZX-diagrams, the sum of their interpretations can be represented by a ZX-diagram. We introduce a general, inductive definition of the addition of ZX-diagrams, relying on the construction of controlled diagrams. Based on this addition technique, we provide an inductive differentiation of ZX-diagrams.   Indeed, given a ZX-diagram with variables in the description of its angles, one can differentiate the diagram according to one of these variables. Differentiation is ubiquitous in quantum mechanics and quantum computing (e.g. for solving optimization problems). Technically, differentiation of ZX-diagrams is strongly related to summation as witnessed by the product rules.   We also introduce an alternative, non inductive, differentiation technique rather based on the isolation of the variables. Finally, we apply our results to deduce a diagram for an Ising Hamiltonian.},
      video = {https://www.youtube.com/watch?v=_s2pOcrdmig}
  }
  

  Copy to Clipboard

• Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions
  Aleks Kissinger, John van de Wetering and Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)
  Keywords: ZX-calculus, Classical Simulation, Applied, PyZX, Automation.

  Recent developments in classical simulation of quantum circuits make use of clever decompositions of chunks of magic states into sums of efficiently simulable stabiliser states. We show here how, by considering certain non-stabiliser entangled states which have more favourable decompositions, we can speed up these simulations. This is made possible by using the ZX-calculus, which allows us to easily find instances of these entangled states in the simplified diagram representing the quantum circuit to be simulated. We additionally find a new technique of partial stabiliser decompositions that allow us to trade magic states for stabiliser terms. With this technique we require only \(2^{\alpha t}\) stabiliser terms, where \(\alpha\approx 0.396\), to simulate a circuit with T-count \(t\). This matches the \(\alpha\) found by Qassim et al., but whereas they only get this scaling in the asymptotic limit, ours applies for a circuit of any size. Our method builds upon a recently proposed scheme for simulation combining stabiliser decompositions and optimisation strategies implemented in the software QuiZX. With our techniques we manage to reliably simulate 50-qubit 1400 T-count hidden shift circuits in a couple of minutes on a consumer laptop.

  @inproceedings{kissinger2022classical,
      author = {Kissinger, Aleks and van de Wetering, John and Vilmart, Renaud},
      title = {{Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions}},
      year = {2022},
      booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
      editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {232},
      pages = {5:1--5:13},
      publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-237-2},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.TQC.2022.5},
      urldate = {2022-02-18},
      link = {http://arxiv.org/abs/2202.09202},
      keywords = {ZX-calculus, Classical Simulation, Applied, PyZX, Automation},
      abstract = {Recent developments in classical simulation of quantum circuits make use of clever decompositions of chunks of magic states into sums of efficiently simulable stabiliser states. We show here how, by considering certain non-stabiliser entangled states which have more favourable decompositions, we can speed up these simulations. This is made possible by using the ZX-calculus, which allows us to easily find instances of these entangled states in the simplified diagram representing the quantum circuit to be simulated. We additionally find a new technique of partial stabiliser decompositions that allow us to trade magic states for stabiliser terms. With this technique we require only $2^{\alpha t}$ stabiliser terms, where $\alpha\approx 0.396$, to simulate a circuit with T-count $t$. This matches the $\alpha$ found by Qassim et al., but whereas they only get this scaling in the asymptotic limit, ours applies for a circuit of any size. Our method builds upon a recently proposed scheme for simulation combining stabiliser decompositions and optimisation strategies implemented in the software QuiZX. With our techniques we manage to reliably simulate 50-qubit 1400 T-count hidden shift circuits in a couple of minutes on a consumer laptop.},
      video = {https://youtu.be/y3LIDcgrc1k?t=1394}
  }
  

  Copy to Clipboard

• Circuit Extraction for ZX-Diagrams Can Be #P-Hard
  Niel de Beaudrap, Aleks Kissinger and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
  Keywords: ZX-calculus, Circuit Extraction.

  The ZX-calculus is a graphical language for reasoning about quantum computation using ZX-diagrams, a certain flexible generalisation of quantum circuits that can be used to represent linear maps from \(m\) to \(n\) qubits for any \(m,n \geq 0\). Some applications for the ZX-calculus, such as quantum circuit optimisation and synthesis, rely on being able to efficiently translate a ZX-diagram back into a quantum circuit of comparable size. While several sufficient conditions are known for describing families of ZX-diagrams that can be efficiently transformed back into circuits, it has previously been conjectured that the general problem of circuit extraction is hard. That is, that it should not be possible to efficiently convert an arbitrary ZX-diagram describing a unitary linear map into an equivalent quantum circuit. In this paper we prove this conjecture by showing that the circuit extraction problem is #P-hard, and so is itself at least as hard as strong simulation of quantum circuits. In addition to our main hardness result, which relies specifically on the circuit representation, we give a representation-agnostic hardness result. Namely, we show that any oracle that takes as input a ZX-diagram description of a unitary and produces samples of the output of the associated quantum computation enables efficient probabilistic solutions to NP-complete problems.

  @inproceedings{debeaudrap2022circuit,
      author = {de Beaudrap, Niel and Kissinger, Aleks and van de Wetering, John},
      title = {{Circuit Extraction for ZX-Diagrams Can Be #P-Hard}},
      year = {2022},
      booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)},
      editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {229},
      pages = {119:1--119:19},
      publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-235-8},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.ICALP.2022.119},
      urldate = {2022-02-18},
      link = {http://arxiv.org/abs/2202.09194},
      keywords = {ZX-calculus, Circuit Extraction},
      abstract = {The ZX-calculus is a graphical language for reasoning about quantum computation using ZX-diagrams, a certain flexible generalisation of quantum circuits that can be used to represent linear maps from $m$ to $n$ qubits for any $m,n \geq 0$. Some applications for the ZX-calculus, such as quantum circuit optimisation and synthesis, rely on being able to efficiently translate a ZX-diagram back into a quantum circuit of comparable size. While several sufficient conditions are known for describing families of ZX-diagrams that can be efficiently transformed back into circuits, it has previously been conjectured that the general problem of circuit extraction is hard. That is, that it should not be possible to efficiently convert an arbitrary ZX-diagram describing a unitary linear map into an equivalent quantum circuit. In this paper we prove this conjecture by showing that the circuit extraction problem is #P-hard, and so is itself at least as hard as strong simulation of quantum circuits. In addition to our main hardness result, which relies specifically on the circuit representation, we give a representation-agnostic hardness result. Namely, we show that any oracle that takes as input a ZX-diagram description of a unitary and produces samples of the output of the associated quantum computation enables efficient probabilistic solutions to NP-complete problems.},
      video = {https://www.youtube.com/watch?v=d-2HSa9MHKY}
  }
  

  Copy to Clipboard

• Qutrit Metaplectic Gates Are a Subset of Clifford+T
  Andrew N. Glaudell, Neil J. Ross, John van de Wetering and Lia Yeh
  Show abstract ⇲ Show bibdata ⇲

  17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)
  Keywords: Qutrits, Optimisation, Clifford+T, ZX-Supported.

  A popular universal gate set for quantum computing with qubits is Clifford+T, as this can be readily implemented on many fault-tolerant architectures. For qutrits, there is an equivalent T gate, that, like its qubit analogue, makes Clifford+T approximately universal, is injectable by a magic state, and supports magic state distillation. However, it was claimed that a better gate set for qutrits might be Clifford+R, where R=diag(1,1,-1) is the metaplectic gate, as certain protocols and gates could more easily be implemented using the R gate than the T gate. In this paper we show that when we have at least two qutrits, the qutrit Clifford+R unitaries form a strict subset of the Clifford+T unitaries, by finding a direct decomposition of \(R\otimes I\) as a Clifford+T circuit and proving that the T gate cannot be exactly synthesized in Clifford+R. This shows that in fact the T gate is at least as powerful as the R gate, up to a constant factor. Moreover, we additionally show that it is impossible to find a single-qutrit Clifford+T decomposition of the R gate, making our result tight.

  @inproceedings{glaudell2022Qutrit,
      author = {Glaudell, Andrew N. and Ross, Neil J. and van de Wetering, John and Yeh, Lia},
      title = {{Qutrit Metaplectic Gates Are a Subset of Clifford+T}},
      year = {2022},
      booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)},
      editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {232},
      pages = {12:1--12:15},
      publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-237-2},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.TQC.2022.12},
      urldate = {2022-02-18},
      link = {https://arxiv.org/abs/2202.09235},
      keywords = {Qutrits, Optimisation, Clifford+T, ZX-Supported},
      abstract = {A popular universal gate set for quantum computing with qubits is Clifford+T, as this can be readily implemented on many fault-tolerant architectures. For qutrits, there is an equivalent T gate, that, like its qubit analogue, makes Clifford+T approximately universal, is injectable by a magic state, and supports magic state distillation. However, it was claimed that a better gate set for qutrits might be Clifford+R, where R=diag(1,1,-1) is the metaplectic gate, as certain protocols and gates could more easily be implemented using the R gate than the T gate. In this paper we show that when we have at least two qutrits, the qutrit Clifford+R unitaries form a strict subset of the Clifford+T unitaries, by finding a direct decomposition of $R\otimes I$ as a Clifford+T circuit and proving that the T gate cannot be exactly synthesized in Clifford+R. This shows that in fact the T gate is at least as powerful as the R gate, up to a constant factor. Moreover, we additionally show that it is impossible to find a single-qutrit Clifford+T decomposition of the R gate, making our result tight.}
  }
  

  Copy to Clipboard

• Equivalence Checking of Quantum Circuits with the ZX-Calculus
  Tom Peham
  Show abstract ⇲ Show bibdata ⇲

  Johannes Kepler Universität Linz Masters Thesis
  Keywords: ZX-Calculus, Verification, Automation, Master Thesis.

  As state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for automated methods to design and test potential applications rises. Equivalence checking of quantum circuits is an important, yet hardly automated, task in the development of the quantum software stack. Recently, new methods have been proposed that tackle this problem from widely different perspectives. One of them is based on the ZX-calculus, a graphical rewriting system for quantum computing. However, the power and capability of this equivalence checking method has barely been explored. The aim of this work is to evaluate the ZX-calculus as a tool for equivalence checking of quantum circuits. To this end, it is demonstrated how the ZX-calculus-based approach to equivalence checking can be expanded in order to verify the results of compilation flows and optimizations on quantum circuits. It is also shown that the ZX-calculus based method is not complete — especially for quantum circuits with ancillary qubits. In order to properly evaluate the proposed method we conduct a detailed case study by comparing it to a prominent method in equivalence checking based on decision diagrams.

  @mastersthesis{Peham2022masters,
      author = {Peham, Tom},
      title = {{Equivalence Checking of Quantum Circuits with the ZX-Calculus}},
      year = {2022},
      school = {Johannes Kepler Universit\"at Linz},
      urldate = {2022-02-01},
      link = {https://epub.jku.at/obvulihs/content/titleinfo/7683969},
      keywords = {ZX-Calculus, Verification, Automation, Master Thesis},
      abstract = {As state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for automated methods to design and test potential applications rises. Equivalence checking of quantum circuits is an important, yet hardly automated, task in the development of the quantum software stack. Recently, new methods have been proposed that tackle this problem from widely different perspectives. One of them is based on the ZX-calculus, a graphical rewriting system for quantum computing. However, the power and capability of this equivalence checking method has barely been explored. The aim of this work is to evaluate the ZX-calculus as a tool for equivalence checking of quantum circuits. To this end, it is demonstrated how the ZX-calculus-based approach to equivalence checking can be expanded in order to verify the results of compilation flows and optimizations on quantum circuits. It is also shown that the ZX-calculus based method is not complete — especially for quantum circuits with ancillary qubits. In order to properly evaluate the proposed method we conduct a detailed case study by comparing it to a prominent method in equivalence checking based on decision diagrams.}
  }
  

  Copy to Clipboard

• Differentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning
  Quanlong Wang, Richie Yeung and Mark Koch
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Quantum
  Keywords: Variational Circuits, Applied, ZX-calculus.

  ZX-calculus has proved to be a useful tool for quantum technology with a wide range of successful applications. Most of these applications are of an algebraic nature. However, other tasks that involve differentiation and integration remain unreachable with current ZX techniques. Here we elevate ZX to an analytical perspective by realising differentiation and integration entirely within the framework of ZX-calculus. We explicitly illustrate the new analytic framework of ZX-calculus by applying it in context of quantum machine learning for the analysis of barren plateaus.

  @article{wang2022differentiating,
      author = {Wang, Quanlong and Yeung, Richie and Koch, Mark},
      title = {{Differentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning}},
      year = {2024},
      journal = {{Quantum}},
      volume = {8},
      month = {10},
      pages = {1491},
      publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
      issn = {2521-327X},
      doi = {10.22331/q-2024-10-04-1491},
      urldate = {2022-01-31},
      link = {http://arxiv.org/abs/2201.13250},
      keywords = {Variational Circuits, Applied, ZX-calculus},
      abstract = {ZX-calculus has proved to be a useful tool for quantum technology with a wide range of successful applications. Most of these applications are of an algebraic nature. However, other tasks that involve differentiation and integration remain unreachable with current ZX techniques. Here we elevate ZX to an analytical perspective by realising differentiation and integration entirely within the framework of ZX-calculus. We explicitly illustrate the new analytic framework of ZX-calculus by applying it in context of quantum machine learning for the analysis of barren plateaus.},
      video = {https://youtu.be/_s2pOcrdmig?t=2514}
  }
  

  Copy to Clipboard

2021

• Optimized Compiler for Distributed Quantum Computing
  Daniele Cuomo, Marcello Caleffi, Kevin Krsulich, Filippo Tramonto, Gabriele Agliardi, Enrico Prati and Angela Sara Cacciapuoti
  Show abstract ⇲ Show bibdata ⇲

  ACM Transactions on Quantum Computing
  Keywords: ZX-Supported, Applied, PyZX, Clifford Fragment.

  Practical distributed quantum computing requires the development of efficient compilers, able to make quantum circuits compatible with some given hardware constraints. This problem is known to be tough, even for local computing. Here, we address it on distributed architectures. As generally assumed in this scenario, telegates represent the fundamental remote (inter-processor) operations. Each telegate consists of several tasks: i) entanglement generation and distribution, ii) local operations, and iii) classical communications. Entanglement generations and distribution is an expensive resource, as it is time-consuming. To mitigate its impact, we model an optimization problem that combines running-time minimization with the usage of distributed entangled states. Specifically, we formulated the distributed compilation problem as a dynamic network flow. To enhance the solution space, we extend the formulation, by introducing a predicate that manipulates the circuit given in input and parallelizes telegate tasks. To evaluate our framework, we split the problem into three sub-problems, and solve it by means of an approximation routine. Experiments demonstrate that the run-time is resistant to the problem size scaling. Moreover, we apply the proposed algorithm to compile circuits under different topologies, showing that topologies with a higher ratio between edges and nodes give rise to shallower circuits

  @article{10.1145/3579367,
      author = {Cuomo, Daniele and Caleffi, Marcello and Krsulich, Kevin and Tramonto, Filippo and Agliardi, Gabriele and Prati, Enrico and Cacciapuoti, Angela Sara},
      title = {Optimized Compiler for Distributed Quantum Computing},
      year = {2023},
      journal = {ACM Transactions on Quantum Computing},
      publisher = {Association for Computing Machinery},
      address = {New York, NY, USA},
      issn = {2643-6809},
      doi = {10.1145/3579367},
      urldate = {2021-12-28},
      link = {https://arxiv.org/abs/2112.14139},
      keywords = {ZX-Supported, Applied, PyZX, Clifford Fragment},
      abstract = {Practical distributed quantum computing requires the development of efficient compilers, able to make quantum circuits compatible with some given hardware constraints. This problem is known to be tough, even for local computing. Here, we address it on distributed architectures. As generally assumed in this scenario, telegates represent the fundamental remote (inter-processor) operations. Each telegate consists of several tasks: i) entanglement generation and distribution, ii) local operations, and iii) classical communications. Entanglement generations and distribution is an expensive resource, as it is time-consuming. To mitigate its impact, we model an optimization problem that combines running-time minimization with the usage of distributed entangled states. Specifically, we formulated the distributed compilation problem as a dynamic network flow. To enhance the solution space, we extend the formulation, by introducing a predicate that manipulates the circuit given in input and parallelizes telegate tasks. To evaluate our framework, we split the problem into three sub-problems, and solve it by means of an approximation routine. Experiments demonstrate that the run-time is resistant to the problem size scaling. Moreover, we apply the proposed algorithm to compile circuits under different topologies, showing that topologies with a higher ratio between edges and nodes give rise to shallower circuits}
  }
  

  Copy to Clipboard

• Wielding the ZX-calculus, Flexsymmetry, Mixed States, and Scalable Notations
  Titouan Carette
  Show abstract ⇲ Show bibdata ⇲

  Loria, Université de Lorraine PhD Thesis
  Keywords: ZX-calculus, Category Theory, Scalable ZX, Mixed States, ZH-calculus, ZW-calculus, Protocols, PhD Thesis.

  My first contribution is to propose a formalisation of this property through the notion of flexsymmetry in Chapter 5, it relies on the notion of paradigm introduced in Chapter 4. This equation called the bialgebra rule and making two spiders interact is the key ingredient in the definition of Z*-algebras in Chapter 6 where it is shown that the red and green spiders are not the only ones following this pattern. The introduction of Z*-algebras and the classification of all their models in qubits is the second contribution of this thesis. There are essentially three such structures for qubits, corresponding to the ZX-calculus, ZH-calculus, and ZW-calculus. Similar behaviour can also appear in other settings, as in the graphical linear algebra introduced in Chapter 7. All those calculi can then be used to represent quantum algorithms. But there are two obstacles. First, those algorithms can involve interactions with the non-quantum world that require a broader model of computation allowing classical behaviours alongside quantum ones. This is called mixed state quantum mechanics and a way to extend quantum graphical languages to this setting is presented in Chapter 8. The extension of ZX-calculus to mixed-state quantum mechanics is the third contribution presented in this thesis. A second obstacle is the fact that a quantum algorithm is defined by a uniform family of circuits, one for each possible size of the input. The scalable notations presented in Chapter 9 allow to handle such families, completing the toolbox necessary to calmly approach quantum algorithm graphically. The scalable notations are the fourth and last theoretical contribution of this thesis. All those methods can be used to graphically prove the correction of quantum algorithms. Examples are provided in Chapter 10, which concludes the thesis.

  @phdthesis{carette2021thesis,
      author = {Carette, Titouan},
      title = {{Wielding the ZX-calculus, Flexsymmetry, Mixed States, and Scalable Notations}},
      year = {2021},
      school = {Loria, Universit\'e de Lorraine},
      urldate = {2021-12-06},
      link = {https://hal.archives-ouvertes.fr/tel-03468027/document},
      keywords = {ZX-calculus, Category Theory, Scalable ZX, Mixed States, ZH-calculus, ZW-calculus, Protocols, PhD Thesis},
      abstract = {My first contribution is to propose a formalisation of this property through the notion of flexsymmetry in Chapter 5, it relies on the notion of paradigm introduced in Chapter 4. This equation called the bialgebra rule and making two spiders interact is the key ingredient in the definition of Z*-algebras in Chapter 6 where it is shown that the red and green spiders are not the only ones following this pattern. The introduction of Z*-algebras and the classification of all their models in qubits is the second contribution of this thesis. There are essentially three such structures for qubits, corresponding to the ZX-calculus, ZH-calculus, and ZW-calculus. Similar behaviour can also appear in other settings, as in the graphical linear algebra introduced in Chapter 7. All those calculi can then be used to represent quantum algorithms. But there are two obstacles. First, those algorithms can involve interactions with the non-quantum world that require a broader model of computation allowing classical behaviours alongside quantum ones.
  This is called mixed state quantum mechanics and a way to extend quantum graphical languages to this setting is presented in Chapter 8. The extension of ZX-calculus to mixed-state quantum mechanics is the third contribution presented in this thesis. A second obstacle is the fact that a quantum algorithm is defined by a uniform family of circuits, one for each possible size of the input. The scalable notations presented in Chapter 9 allow to handle such families, completing the toolbox necessary to calmly approach quantum algorithm graphically. The scalable notations are the fourth and last theoretical contribution of this thesis.
  All those methods can be used to graphically prove the correction of quantum algorithms. Examples are provided in Chapter 10, which concludes the thesis.}
  }
  

  Copy to Clipboard

• Spin-networks in the ZX-calculus
  Richard D. P. East, Pierre Martin-Dussaud and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2111.03114
  Keywords: ZH-calculus, Tensor Networks, Applied, PyZX.

  The ZX-calculus, and the variant we consider in this paper (ZXH-calculus), are formal diagrammatic languages for qubit quantum computing. We show that it can also be used to describe SU(2) representation theory. To achieve this, we first recall the definition of Yutsis diagrams, a standard graphical calculus used in quantum chemistry and quantum gravity, which captures the main features of SU(2) representation theory. Second, we show precisely how it embed within Penrose's binor calculus. Third, we subsume both calculus into ZXH-diagrams. In the process we show how the SU(2) invariance of Wigner symbols is trivially provable in the ZXH-calculus. Additionally, we show how we can explicitly diagrammatically calculate 3jm, 4jm and 6j symbols. It has long been thought that quantum gravity should be closely aligned to quantum information theory. In this paper, we present a way in which this connection can be made exact, by writing the spin-networks of loop quantum gravity (LQG) in the ZX-diagrammatic language of quantum computation.

  @article{d.p.east2021spinnetworks,
      author = {East, Richard D. P. and Martin-Dussaud, Pierre and van de Wetering, John},
      title = {{Spin-networks in the ZX-calculus}},
      year = {2021},
      journal = {arXiv preprint arXiv:2111.03114},
      urldate = {2021-11-04},
      link = {http://arxiv.org/abs/2111.03114},
      keywords = {ZH-calculus, Tensor Networks, Applied, PyZX},
      abstract = {The ZX-calculus, and the variant we consider in this paper (ZXH-calculus), are formal diagrammatic languages for qubit quantum computing. We show that it can also be used to describe SU(2) representation theory. To achieve this, we first recall the definition of Yutsis diagrams, a standard graphical calculus used in quantum chemistry and quantum gravity, which captures the main features of SU(2) representation theory. Second, we show precisely how it embed within Penrose's binor calculus. Third, we subsume both calculus into ZXH-diagrams. In the process we show how the SU(2) invariance of Wigner symbols is trivially provable in the ZXH-calculus. Additionally, we show how we can explicitly diagrammatically calculate 3jm, 4jm and 6j symbols. It has long been thought that quantum gravity should be closely aligned to quantum information theory. In this paper, we present a way in which this connection can be made exact, by writing the spin-networks of loop quantum gravity (LQG) in the ZX-diagrammatic language of quantum computation.},
      video = {https://www.youtube.com/watch?v=QLnW4h_UpT4}
  }
  

  Copy to Clipboard

• On the Verge to Improve Technique of T-count Reduction via Spider Nest Identities
  Witalis Domitrz
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford Masters Thesis
  Keywords: ZX-Calculus, Optimisation, T-count, Clifford+T, Phase Gadgets, Applied, Master Thesis.

  Approximate, universal quantum computation is most commonly described by circuits consisting of Clifford+T gates. The T gate, except being crucial for the universality, is the one which is, in real-world implementations, the most resource-intensive, and the least fault-tolerant of all operations. Because of that, a natural question emerges – how to reduce the number of T gates (or T-count) in a given circuit. The known methods used to reduce the T-count to an optimal value have an exponential running time [24, 2], which motivates the search for an efficient heuristic algorithm. The importance of this problem, along with proposed solutions were discussed in multiple publications including [6, 18, 16, 15, 7, 23]. Spider nest identities, introduced in [16], together with the decomposition of the circuit inspired by [18], were combined in [15] to provide an effective algorithm for T-count reduction. This approach was tested and compared with previous results, and, in some cases, it resulted in a significant improvement of the state of the art. Another advantage of this algorithm was, in contrast to the other results, a significant improvement of the execution time. In this dissertation, we discuss several modifications of the algorithm in order to gain partial outperformance without a significant increase of the running time, which include analysis of the influence of the order of applying the identities, efficient usage of identities generated from small and big spider nests, combining the results obtained in [25] with spider nest identities, and others. Some of these modifications improve or achieve the current state of the art for various circuits. We also provide a quantitative comparison of results, verified using [3] – a tool created alongside [4], on numerous benchmark circuits obtained from [9, 26, 3]. Moreover, we present abstract formulations of considered problem, pose a question of completeness of spider nest identities with respect to T-count reduction, and present different, possibly more elegant, way of phrasing the spider nest identities, as dense spider nest identities.

  @mastersthesis{Domitrz2022Masters,
      author = {Domitrz, Witalis},
      title = {{On the Verge to Improve Technique of T-count Reduction via Spider Nest Identities}},
      year = {2021},
      school = {University of Oxford},
      urldate = {2021-10-22},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/domitrz-thesis.pdf},
      keywords = {ZX-Calculus, Optimisation, T-count, Clifford+T, Phase Gadgets, Applied, Master Thesis},
      abstract = {Approximate, universal quantum computation is most commonly described by circuits consisting of Clifford+T gates. The T gate, except being crucial for the universality, is the one which is, in real-world implementations, the most resource-intensive, and the least fault-tolerant of all operations. Because of that, a natural question emerges – how to reduce the number of T gates (or T-count) in a given circuit. The known methods used to reduce the T-count to an optimal value have an exponential running time [24, 2], which motivates the search for an efficient heuristic algorithm. The importance of this problem, along with proposed solutions were discussed in multiple publications including [6, 18, 16, 15, 7, 23]. Spider nest identities, introduced in [16], together with the decomposition of the circuit inspired by [18], were combined in [15] to provide an effective algorithm for T-count reduction. This approach was tested and compared with previous results, and, in some cases, it resulted in a significant improvement of the state of the art. Another advantage of this algorithm was, in contrast to the other results, a significant improvement of the execution time. In this dissertation, we discuss several modifications of the algorithm in order to gain partial outperformance without a significant increase of the running time, which include analysis of the influence of the order of applying the identities, efficient usage of identities generated from small and big spider nests, combining the results obtained in [25] with spider nest identities, and others. Some of these modifications improve or achieve the current state of the art for various circuits. We also provide a quantitative comparison of results, verified using [3] – a tool created alongside [4], on numerous benchmark circuits obtained from [9, 26, 3]. Moreover, we present abstract formulations of considered problem, pose a question of completeness of spider nest identities with respect to T-count reduction, and present different, possibly more elegant, way of phrasing the spider nest identities, as dense spider nest identities.}
  }
  

  Copy to Clipboard

• Representing Matrices Using Algebraic ZX-calculus
  Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2110.06898
  Keywords: Algebraic ZX, Normal-Form.

  Elementary matrices play an important role in linear algebra applications. In this paper, we represent all the elementary matrices of size 2^m\times 2^m using algebraic ZX-calculus. Then we show their properties on inverses and transpose using rewriting rules of ZX-calculus. As a consequence, we are able to depict any matrices of size 2^m\times 2^n by string diagrams without resort to a diagrammatic normal form for matrices as shown in [Wang 2020]. By doing so we pave the way towards visualising by string diagrams important matrix technologies deployed in AI especially machine learning.

  @article{wang2021representing,
      author = {Wang, Quanlong},
      title = {{Representing Matrices Using Algebraic ZX-calculus}},
      year = {2021},
      journal = {arXiv preprint arXiv:2110.06898},
      urldate = {2021-10-13},
      link = {http://arxiv.org/abs/2110.06898},
      keywords = {Algebraic ZX, Normal-Form},
      abstract = {Elementary matrices play an important role in linear algebra applications. In this paper, we represent all the elementary matrices of size 2^m\times 2^m using algebraic ZX-calculus. Then we show their properties on inverses and transpose using rewriting rules of ZX-calculus. As a consequence, we are able to depict any matrices of size 2^m\times 2^n by string diagrams without resort to a diagrammatic normal form for matrices as shown in [Wang 2020]. By doing so we pave the way towards visualising by string diagrams important matrix technologies deployed in AI especially machine learning.},
      video = {https://www.youtube.com/watch?v=E9BJZ2uAVOM}
  }
  

  Copy to Clipboard

• Optimization Approaches for Quantum Circuits using ZX-calculus
  Korbinian Staudacher
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Ludwig-Maximilians-Universität München Masters Thesis
  Keywords: ZX-Calculus, Optimisation, Automation, PyZX, Circuit Extraction, Master Thesis.

  This work focuses on quantum circuit optimization using the ZX-calculus, a recently developed graphical language designed to simplify reasoning about quantum systems. Quantum circuits can be optimized in an intuitive and efficient way by transforming them to equivalent ZX-diagrams and using rules of the ZX-calculus for diagram simplification. However, some rules can modify ZX-diagrams in such a way that the re-extraction of a quantum circuit is no longer possible. Moreover, rules that simplify ZX-diagrams can still increase the size of the underlying circuits. Due to these problems, most of the existing ZXcalculus based optimization approaches become inefficient with increasing quantum circuit complexity. In our work we develop different strategies to improve those approaches. In particular, we introduce heuristics to estimate the optimization benefit gained by certain ZX-rules. This allows treating ZX-diagram simplification as a classical search problem where heuristics can be applied to guide the sequence of rule applications towards minimal circuits. We implement different heuristic-based algorithms like greedy search, random search and simulated annealing in the open-source library PyZX where we test them against existing strategies on circuits of variant size. The results show that using heuristics in diagram simplification often leads to better overall optimization results, especially when optimizing large and complex quantum circuits. Our algorithms can be further improved in several aspects like runtime or consideration of hardware topology.

  @mastersthesis{staudacher2021masters,
      author = {Staudacher, Korbinian},
      title = {{Optimization Approaches for Quantum Circuits using ZX-calculus}},
      year = {2021},
      school = {Ludwig-Maximilians-Universit\"at M\"unchen},
      urldate = {2021-09-30},
      link = {https://www.mnm-team.org/pub/Diplomarbeiten/stau21/PDF-Version/stau21.pdf},
      keywords = {ZX-Calculus, Optimisation, Automation, PyZX, Circuit Extraction, Master Thesis},
      abstract = {This work focuses on quantum circuit optimization using the ZX-calculus, a recently developed graphical language designed to simplify reasoning about quantum systems. Quantum circuits can be optimized in an intuitive and efficient way by transforming them to equivalent ZX-diagrams and using rules of the ZX-calculus for diagram simplification. However, some rules can modify ZX-diagrams in such a way that the re-extraction of a quantum circuit is no longer possible. Moreover, rules that simplify ZX-diagrams can still increase the size of the underlying circuits. Due to these problems, most of the existing ZXcalculus based optimization approaches become inefficient with increasing quantum circuit complexity. In our work we develop different strategies to improve those approaches. In particular, we introduce heuristics to estimate the optimization benefit gained by certain ZX-rules. This allows treating ZX-diagram simplification as a classical search problem where heuristics can be applied to guide the sequence of rule applications towards minimal circuits. We implement different heuristic-based algorithms like greedy search, random search and simulated annealing in the open-source library PyZX where we test them against existing strategies on circuits of variant size. The results show that using heuristics in diagram simplification often leads to better overall optimization results, especially when optimizing large and complex quantum circuits. Our algorithms can be further improved in several aspects like runtime or consideration of hardware topology.
  },
      video = {https://youtu.be/WZgDVPXo7WQ?t=3805}
  }
  

  Copy to Clipboard

• A non-anyonic qudit ZW-calculus
  Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2109.11285
  Keywords: ZW-calculus, Qudits, Algebraic ZX.

  ZW-calculus is a useful graphical language for pure qubit quantum computing. It is via the translation of the completeness of ZW-calculus that the first proof of completeness of ZX-calculus was obtained. A d-level generalisation of qubit ZW-calculus (anyonic qudit ZW-calculus) has been given in \cite{amar} which is universal for pure qudit quantum computing. However, the interpretation of the W spider in this type of ZW-calculus has so-called q-binomial coefficients involved, thus makes computation quite complicated. In this paper, we give a new type of qudit ZW-calculus which has generators and rewriting rules similar to that of the qubit ZW-calculus. Especially, the Z spider is exactly the same as that of the qudit ZX-calculus as given in \cite{wangqufinite}, and the new W spider has much simpler interpretation as a linear map. Furthermore, we establish a translation between this qudit ZW-calculus and the qudit ZX-calculus which is universal as shown in \cite{wangqufinite}, therefore this qudit ZW-calculus is also universal for pure qudit quantum computing.

  @article{wang2021nonanyonic,
      author = {Wang, Quanlong},
      title = {{A non-anyonic qudit ZW-calculus}},
      year = {2021},
      journal = {arXiv preprint arXiv:2109.11285},
      urldate = {2021-09-23},
      link = {http://arxiv.org/abs/2109.11285},
      keywords = {ZW-calculus, Qudits, Algebraic ZX},
      abstract = {ZW-calculus is a useful graphical language for pure qubit quantum computing. It is via the translation of the completeness of ZW-calculus that the first proof of completeness of ZX-calculus was obtained. A d-level generalisation of qubit ZW-calculus (anyonic qudit ZW-calculus) has been given in \cite{amar} which is universal for pure qudit quantum computing. However, the interpretation of the W spider in this type of ZW-calculus has so-called q-binomial coefficients involved, thus makes computation quite complicated. In this paper, we give a new type of qudit ZW-calculus which has generators and rewriting rules similar to that of the qubit ZW-calculus. Especially, the Z spider is exactly the same as that of the qudit ZX-calculus as given in \cite{wangqufinite}, and the new W spider has much simpler interpretation as a linear map. Furthermore, we establish a translation between this qudit ZW-calculus and the qudit ZX-calculus which is universal as shown in \cite{wangqufinite}, therefore this qudit ZW-calculus is also universal for pure qudit quantum computing.},
      video = {https://www.youtube.com/watch?v=DjUn5llp0OE}
  }
  

  Copy to Clipboard

• Relating Measurement Patterns to Circuits via Pauli Flow
  Will Simmons
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 18th International Conference on Quantum Physics and Logic, Gdansk, Poland, and online, 7-11 June 2021
  Keywords: ZX-calculus, MBQC, gflow, Circuit Extraction, Phase Gadgets.

  The one-way model of Measurement-Based Quantum Computing and the gate-based circuit model give two different presentations of how quantum computation can be performed. There are known methods for converting any gate-based quantum circuit into a one-way computation, whereas the reverse is only efficient given some constraints on the structure of the measurement pattern. Causal flow and generalised flow have already been shown as sufficient, with efficient algorithms for identifying these properties and performing the circuit extraction. Pauli flow is a weaker set of conditions that extends generalised flow to use the knowledge that some vertices are measured in a Pauli basis. In this paper, we show that Pauli flow can similarly be identified efficiently and that any measurement pattern whose underlying graph admits a Pauli flow can be efficiently transformed into a gate-based circuit without using ancilla qubits. We then use this relationship to derive simulation results for the effects of graph-theoretic rewrites in the ZX-calculus using a more circuit-like data structure we call the Pauli Dependency DAG.

  @inproceedings{Simmons2021Measurement,
      author = {Simmons, Will},
      title = {{Relating Measurement Patterns to Circuits via Pauli Flow}},
      year = {2021},
      booktitle = {Proceedings 18th International Conference on Quantum Physics and Logic, Gdansk, Poland, and online, 7-11 June 2021},
      editor = {Heunen, Chris and Backens, Miriam},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {343},
      pages = {50-101},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.343.4},
      urldate = {2021-09-13},
      link = {https://arxiv.org/abs/2109.05654},
      keywords = {ZX-calculus, MBQC, gflow, Circuit Extraction, Phase Gadgets},
      abstract = {The one-way model of Measurement-Based Quantum Computing and the gate-based circuit model give two different presentations of how quantum computation can be performed. There are known methods for converting any gate-based quantum circuit into a one-way computation, whereas the reverse is only efficient given some constraints on the structure of the measurement pattern. Causal flow and generalised flow have already been shown as sufficient, with efficient algorithms for identifying these properties and performing the circuit extraction. Pauli flow is a weaker set of conditions that extends generalised flow to use the knowledge that some vertices are measured in a Pauli basis. In this paper, we show that Pauli flow can similarly be identified efficiently and that any measurement pattern whose underlying graph admits a Pauli flow can be efficiently transformed into a gate-based circuit without using ancilla qubits. We then use this relationship to derive simulation results for the effects of graph-theoretic rewrites in the ZX-calculus using a more circuit-like data structure we call the Pauli Dependency DAG.},
      video = {https://www.youtube.com/watch?v=XcrD_Hc4zUY}
  }
  

  Copy to Clipboard

• Hybrid quantum-classical circuit simplification with the ZX-calculus
  Agustín Borgna, Simon Perdrix and Benoît Valiron
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Programming Languages and Systems
  Keywords: ZX-calculus, Mixed States, Optimisation, Automation, PyZX, Applied.

  We present a complete optimization procedure for hybrid quantum-classical circuits with classical parity logic. While common optimization techniques for quantum algorithms focus on rewriting solely the pure quantum segments, there is interest in applying a global optimization process for applications such as quantum error correction and quantum assertions. This work, based on the pure-quantum circuit optimization procedure by Duncan et al., uses an extension of the formal graphical ZX-calculus called ZX-ground as an intermediary representation of the hybrid circuits to allow for granular optimizations below the quantum-gate level. We define a translation from hybrid circuits into diagrams that admit the graph-theoretical focused-gFlow property, needed for the final extraction back into a circuit. We then derive a number of gFlow-preserving optimization rules for ZX-ground diagrams that reduce the size of the graph, and devise an strategy to find optimization opportunities by rewriting the diagram guided by a Gauss elimination process. Then, after extracting the circuit, we present a general procedure for detecting segments of circuit-like ZX-ground diagrams which can be implemented with classical gates in the extracted circuit. We have implemented our optimization procedure as an extension to the open-source python library PyZX.

  @inproceedings{borgna2021hybrid,
      author = {Borgna, Agust{\'i}n and Perdrix, Simon and Valiron, Beno{\^i}t},
      title = {{Hybrid quantum-classical circuit simplification with the ZX-calculus}},
      year = {2021},
      booktitle = {Programming Languages and Systems},
      editor = {Oh, Hakjoo},
      pages = {121--139},
      publisher = {Springer International Publishing},
      address = {Cham},
      doi = {10.1007/978-3-030-89051-3_8},
      urldate = {2021-09-13},
      link = {http://arxiv.org/abs/2109.06071},
      keywords = {ZX-calculus, Mixed States, Optimisation, Automation, PyZX, Applied},
      abstract = {We present a complete optimization procedure for hybrid quantum-classical circuits with classical parity logic. While common optimization techniques for quantum algorithms focus on rewriting solely the pure quantum segments, there is interest in applying a global optimization process for applications such as quantum error correction and quantum assertions.   This work, based on the pure-quantum circuit optimization procedure by Duncan et al., uses an extension of the formal graphical ZX-calculus called ZX-ground as an intermediary representation of the hybrid circuits to allow for granular optimizations below the quantum-gate level. We define a translation from hybrid circuits into diagrams that admit the graph-theoretical focused-gFlow property, needed for the final extraction back into a circuit. We then derive a number of gFlow-preserving optimization rules for ZX-ground diagrams that reduce the size of the graph, and devise an strategy to find optimization opportunities by rewriting the diagram guided by a Gauss elimination process. Then, after extracting the circuit, we present a general procedure for detecting segments of circuit-like ZX-ground diagrams which can be implemented with classical gates in the extracted circuit. We have implemented our optimization procedure as an extension to the open-source python library PyZX.},
      video = {https://www.youtube.com/watch?v=-Frd8w-hTD0}
  }
  

  Copy to Clipboard

• Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
  Aleks Kissinger and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Quantum Science and Technology
  Keywords: ZX-calculus, Classical Simulation, Applied, PyZX, Automation.

  We introduce an enhanced technique for strong classical simulation of quantum circuits which combines the `sum-of-stabilisers' method with an automated simplification strategy based on the ZX-calculus. Recently it was shown that quantum circuits can be classically simulated by expressing the non-stabiliser gates in a circuit as magic state injections and decomposing them in chunks of 2-6 states at a time, obtaining sums of (efficiently-simulable) stabiliser states with many fewer terms than the naive approach. We adapt these techniques from the original setting of Clifford circuits with magic state injection to generic ZX-diagrams and show that, by interleaving this "chunked" decomposition with a ZX-calculus-based simplification strategy, we can obtain stabiliser decompositions that are many orders of magnitude smaller than existing approaches. We illustrate this technique to perform exact norm calculations (and hence strong simulation) on the outputs of random 50- and 100-qubit Clifford+T circuits with up to 70 T-gates as well as a family of hidden shift circuits previously considered by Bravyi and Gosset with over 1000 T-gates.

  @article{kissinger2021simulating,
      author = {Kissinger, Aleks and van de Wetering, John},
      title = {{Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions}},
      year = {2022},
      journal = {Quantum Science and Technology},
      volume = {7},
      number = {4},
      pages = {044001},
      publisher = {IOP Publishing},
      doi = {10.1088/2058-9565/ac5d20},
      urldate = {2021-09-02},
      link = {http://arxiv.org/abs/2109.01076},
      keywords = {ZX-calculus, Classical Simulation, Applied, PyZX, Automation},
      abstract = {We introduce an enhanced technique for strong classical simulation of quantum circuits which combines the `sum-of-stabilisers' method with an automated simplification strategy based on the ZX-calculus. Recently it was shown that quantum circuits can be classically simulated by expressing the non-stabiliser gates in a circuit as magic state injections and decomposing them in chunks of 2-6 states at a time, obtaining sums of (efficiently-simulable) stabiliser states with many fewer terms than the naive approach. We adapt these techniques from the original setting of Clifford circuits with magic state injection to generic ZX-diagrams and show that, by interleaving this "chunked" decomposition with a ZX-calculus-based simplification strategy, we can obtain stabiliser decompositions that are many orders of magnitude smaller than existing approaches. We illustrate this technique to perform exact norm calculations (and hence strong simulation) on the outputs of random 50- and 100-qubit Clifford+T circuits with up to 70 T-gates as well as a family of hidden shift circuits previously considered by Bravyi and Gosset with over 1000 T-gates.},
      video = {https://www.youtube.com/watch?v=0C9i0sUkQgk}
  }
  

  Copy to Clipboard

• Quantum Multiple-Valued Decision Diagrams in Graphical Calculi
  Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
  Keywords: ZH-calculus, Classical Simulation, Verification.

  Graphical calculi such as the ZH-calculus are powerful tools in the study and analysis of quantum processes, with links to other models of quantum computation such as quantum circuits, measurement-based computing, etc. A somewhat compact but systematic way to describe a quantum process is through the use of quantum multiple-valued decision diagrams (QMDDs), which have already been used for the synthesis of quantum circuits as well as for verification. We show in this paper how to turn a QMDD into an equivalent ZH-diagram, and vice-versa, and show how reducing a QMDD translates in the ZH-Calculus, hence allowing tools from one formalism to be used into the other.

  @inproceedings{vilmart2021quantum,
      author = {Vilmart, Renaud},
      title = {{Quantum Multiple-Valued Decision Diagrams in Graphical Calculi}},
      year = {2021},
      booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
      editor = {Bonchi, Filippo and Puglisi, Simon J.},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {202},
      pages = {89:1--89:15},
      publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-201-3},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.MFCS.2021.89},
      urldate = {2021-07-02},
      link = {http://arxiv.org/abs/2107.01186},
      keywords = {ZH-calculus, Classical Simulation, Verification},
      abstract = {Graphical calculi such as the ZH-calculus are powerful tools in the study and analysis of quantum processes, with links to other models of quantum computation such as quantum circuits, measurement-based computing, etc.   A somewhat compact but systematic way to describe a quantum process is through the use of quantum multiple-valued decision diagrams (QMDDs), which have already been used for the synthesis of quantum circuits as well as for verification.   We show in this paper how to turn a QMDD into an equivalent ZH-diagram, and vice-versa, and show how reducing a QMDD translates in the ZH-Calculus, hence allowing tools from one formalism to be used into the other.},
      urn = {urn:nbn:de:0030-drops-145295},
      video = {https://www.youtube.com/watch?v=HTPU-XqW2gM}
  }
  

  Copy to Clipboard

• Quantum double aspects of surface code models
  Alexander Cowtan and Shahn Majid
  Show abstract ⇲ Show bibdata ⇲

  Journal of Mathematical Physics
  Keywords: Braids, Surface Code.

  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double \(D(G)\) symmetry, where \(G\) is a finite group. We provide projection operators for its quasiparticles content as irreducible representations of \(D(G)\) and combine this with \(D(G)\)-bimodule properties of open ribbon excitation spaces \(L(s_0,s_1)\) to show how open ribbons can be used to teleport information between their endpoints \(s_0,s_1\). We give a self-contained account that builds on earlier work but emphasises applications to quantum computing as surface code theory, including gates on \(D(S_3)\). We show how the theory reduces to a simpler theory for toric codes in the case of \(D( \Bbb Z_n)\cong \Bbb C\Bbb Z_n^2\), including toric ribbon operators and their braiding. In the other direction, we show how our constructions generalise to \(D(H)\) models based on a finite-dimensional Hopf algebra \(H\), including site actions of \(D(H)\) and partial results on ribbon equivariance even when the Hopf algebra is not semisimple.

  @article{cowtan2021quantum,
      author = {Cowtan, Alexander and Majid, Shahn},
      title = {{Quantum double aspects of surface code models}},
      year = {2022},
      journal = {Journal of Mathematical Physics},
      volume = {63},
      doi = {10.1063/5.0063768},
      urldate = {2021-06-25},
      link = {http://arxiv.org/abs/2107.04411},
      keywords = {Braids, Surface Code},
      abstract = {We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry, where $G$ is a finite group. We provide projection operators for its quasiparticles content as irreducible representations of $D(G)$ and combine this with $D(G)$-bimodule properties of open ribbon excitation spaces $L(s_0,s_1)$ to show how open ribbons can be used to teleport information between their endpoints $s_0,s_1$. We give a self-contained account that builds on earlier work but emphasises applications to quantum computing as surface code theory, including gates on $D(S_3)$. We show how the theory reduces to a simpler theory for toric codes in the case of $D( \Bbb Z_n)\cong \Bbb C\Bbb Z_n^2$, including toric ribbon operators and their braiding. In the other direction, we show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$, including site actions of $D(H)$ and partial results on ribbon equivariance even when the Hopf algebra is not semisimple.}
  }
  

  Copy to Clipboard

• The role of compositionality in constructing complementary classical structures within qubit systems
  Siti Aqilah Binti Muhamad Rasat
  Show abstract ⇲ Show bibdata ⇲

  Universiti Putra Malaysia Masters Thesis
  Keywords: ZX-Calculus, Strong Complementarity, Master Thesis.

  Observables in a quantum system, represented by a Hilbert space, are given by the orthogonal bases of the aforementioned Hilbert space. Categorical Quantum Mechanics provides further abstraction of such observables, allowing for a diagrammatic representation of measurements that extends to quantum processes. Our research studies this abstraction of observables, which has been dubbed as classical structures, in a subtheory of quantum mechanics which focuses on qubit systems (or 2-dimensional quantum system and its composites). We have constructed a procedure that takes the complementary classical structures of a single qubit system and compose them separably via the Kronecker product or 'entangle' them via Bell states to obtain complementary classical structures in n-qubit systems. In this present work, we apply our procedure to two qubit and three qubit systems as examples. Then, using rewriting rules of ZX-calculus and tools in graph theory, we searched for maximal complete sets of mutually complementary classical structures (the categorical counterpart of mutually unbiased bases) among our constructed composite classical structures. For two qubits, we found 13 maximal complete sets of mutually complementary classical structures, and for three qubits, we found 32,448 maximal complete sets of mutually complementary classical structures.

  @mastersthesis{rasat2021masters,
      author = {Rasat, Siti Aqilah Binti Muhamad},
      title = {{The role of compositionality in constructing complementary classical structures within qubit systems}},
      year = {2021},
      school = {Universiti Putra Malaysia},
      urldate = {2021-05-24},
      link = {https://arxiv.org/abs/2105.11966},
      keywords = {ZX-Calculus, Strong Complementarity, Master Thesis},
      abstract = {Observables in a quantum system, represented by a Hilbert space, are given by the orthogonal bases of the aforementioned Hilbert space. Categorical Quantum Mechanics provides further abstraction of such observables, allowing for a diagrammatic representation of measurements that extends to quantum processes. Our research studies this abstraction of observables, which has been dubbed as classical structures, in a subtheory of quantum mechanics which focuses on qubit systems (or 2-dimensional quantum system and its composites). We have constructed a procedure that takes the complementary classical structures of a single qubit system and compose them separably via the Kronecker product or 'entangle' them via Bell states to obtain complementary classical structures in n-qubit systems. In this present work, we apply our procedure to two qubit and three qubit systems as examples. Then, using rewriting rules of ZX-calculus and tools in graph theory, we searched for maximal complete sets of mutually complementary classical structures (the categorical counterpart of mutually unbiased bases) among our constructed composite classical structures. For two qubits, we found 13 maximal complete sets of mutually complementary classical structures, and for three qubits, we found 32,448 maximal complete sets of mutually complementary classical structures.}
  }
  

  Copy to Clipboard

• A Graphical Calculus for Lagrangian Relations
  Cole Comfort and Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings of the Fourth International Conference on Applied Category Theory, Cambridge, United Kingdom, 12-16th July 2021
  Keywords: Clifford fragment, Qudits, Spekkens Toy Model, Category Theory.

  Symplectic vector spaces are the phase space of linear mechanical systems. The symplectic form describes, for example, the relation between position and momentum as well as current and voltage. The category of linear Lagrangian relations between symplectic vector spaces is a symmetric monoidal subcategory of relations which gives a semantics for the evolution -- and more generally linear constraints on the evolution -- of various physical systems. We give a new presentation of the category of Lagrangian relations over an arbitrary field as a `doubled' category of linear relations. More precisely, we show that it arises as a variation of Selinger's CPM construction applied to linear relations, where the covariant orthogonal complement functor plays of the role of conjugation. Furthermore, for linear relations over prime fields, this corresponds exactly to the CPM construction for a suitable choice of dagger. We can furthermore extend this construction by a single affine shift operator to obtain a category of affine Lagrangian relations. Using this new presentation, we prove the equivalence of the prop of affine Lagrangian relations with the prop of qudit stabilizer theory in odd prime dimensions. We hence obtain a unified graphical language for several disparate process theories, including electrical circuits, Spekkens' toy theory, and odd-prime-dimensional stabilizer quantum circuits.

  @inproceedings{comfort2021graphical,
      author = {Comfort, Cole and Kissinger, Aleks},
      title = {{A Graphical Calculus for Lagrangian Relations}},
      year = {2022},
      booktitle = {Proceedings of the Fourth International Conference on Applied Category Theory, Cambridge, United Kingdom, 12-16th July 2021},
      editor = {Kishida, Kohei},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {372},
      pages = {338-351},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.372.24},
      urldate = {2021-05-13},
      link = {http://arxiv.org/abs/2105.06244},
      keywords = {Clifford fragment, Qudits, Spekkens Toy Model, Category Theory},
      abstract = {Symplectic vector spaces are the phase space of linear mechanical systems. The symplectic form describes, for example, the relation between position and momentum as well as current and voltage. The category of linear Lagrangian relations between symplectic vector spaces is a symmetric monoidal subcategory of relations which gives a semantics for the evolution -- and more generally linear constraints on the evolution -- of various physical systems.   We give a new presentation of the category of Lagrangian relations over an arbitrary field as a `doubled' category of linear relations. More precisely, we show that it arises as a variation of Selinger's CPM construction applied to linear relations, where the covariant orthogonal complement functor plays of the role of conjugation. Furthermore, for linear relations over prime fields, this corresponds exactly to the CPM construction for a suitable choice of dagger. We can furthermore extend this construction by a single affine shift operator to obtain a category of affine Lagrangian relations. Using this new presentation, we prove the equivalence of the prop of affine Lagrangian relations with the prop of qudit stabilizer theory in odd prime dimensions. We hence obtain a unified graphical language for several disparate process theories, including electrical circuits, Spekkens' toy theory, and odd-prime-dimensional stabilizer quantum circuits.},
      video = {https://www.youtube.com/watch?v=Xbxv3FiCIAA}
  }
  

  Copy to Clipboard

• Vanishing 2-Qubit Gates with Non-Simplification ZX-Rules
  Ryan Krueger
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  University of Oxford Masters Thesis
  Keywords: ZX-calculus, Optimisation, PyZX, Automation, Applied, Local Complementation.

  Traditional quantum circuit optimization is performed directly at the circuit level. Alternatively, a quantum circuit can be translated to a ZX-diagram which can be simplified using the rules of the ZX-calculus, after which a simplified circuit can be extracted. However, the best-known extraction procedures can drastically increase the number of 2-qubit gates. In this work, we take advantage of the fact that local changes in a ZX-diagram can drastically affect the complexity of the extracted circuit. We use a pair of congruences (i.e., non-simplification rewrite rules) based on the graph-theoretic notions of local complementation and pivoting to generate local variants of a simplified ZX-diagram. We explore the space of equivalent ZX-diagrams generated by these congruences using simulated annealing and genetic algorithms to obtain a simplified circuit with fewer 2-qubit gates. On randomly generated circuits, our method can outperform state-of-the-art optimization techniques for low-qubit (<10) circuits. On a set of previously reported benchmark circuits with <=14 qubits, our method outperforms off-the-shelf methods in 87% of cases, consistently reducing overall circuit complexity by an additional ~15-30% and eliminating up to 46% of 2-qubit gates. These preliminary results serve as a proof-of-concept for a new circuit optimization strategy in the ZX-calculus.

  @mastersthesis{krueger2021Masters,
      author = {Krueger, Ryan},
      title = {{Vanishing 2-Qubit Gates with Non-Simplification ZX-Rules}},
      year = {2021},
      school = {University of Oxford},
      urldate = {2021-04-23},
      link = {http://arxiv.org/abs/2209.06874},
      keywords = {ZX-calculus, Optimisation, PyZX, Automation, Applied, Local Complementation},
      abstract = {Traditional quantum circuit optimization is performed directly at the circuit level. Alternatively, a quantum circuit can be translated to a ZX-diagram which can be simplified using the rules of the ZX-calculus, after which a simplified circuit can be extracted. However, the best-known extraction procedures can drastically increase the number of 2-qubit gates. In this work, we take advantage of the fact that local changes in a ZX-diagram can drastically affect the complexity of the extracted circuit. We use a pair of congruences (i.e., non-simplification rewrite rules) based on the graph-theoretic notions of local complementation and pivoting to generate local variants of a simplified ZX-diagram. We explore the space of equivalent ZX-diagrams generated by these congruences using simulated annealing and genetic algorithms to obtain a simplified circuit with fewer 2-qubit gates. On randomly generated circuits, our method can outperform state-of-the-art optimization techniques for low-qubit (<10) circuits. On a set of previously reported benchmark circuits with <=14 qubits, our method outperforms off-the-shelf methods in 87% of cases, consistently reducing overall circuit complexity by an additional ~15-30% and eliminating up to 46% of 2-qubit gates. These preliminary results serve as a proof-of-concept for a new circuit optimization strategy in the ZX-calculus.},
      video = {https://www.youtube.com/watch?v=tUIcqXKEFhk}
  }
  

  Copy to Clipboard

• Qufinite ZX-calculus: a unified framework of qudit ZX-calculi
  Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2104.06429
  Keywords: Algebraic ZX, Completeness, Triangle, Qudits.

  ZX-calculus is graphical language for quantum computing which usually focuses on qubits. In this paper, we generalise qubit ZX-calculus to qudit ZX-calculus in any finite dimension by introducing suitable generators, especially a carefully chosen triangle node. As a consequence we obtain a set of rewriting rules which can be seen as a direct generalisation of qubit rules, and a normal form for any qudit vectors. Based on the qudit ZX-calculi, we propose a graphical formalism called qufinite ZX-calculus as a unified framework for all qudit ZX-calculi, which is universal for finite quantum theory due to a normal form for matrix of any finite size. We would expect a reconstruction of finite quantum theory within the framework of qufinite ZX-calculus which focuses on compositionality without resorting to any probability theory or sum structures.

  @article{wang2021qufinite,
      author = {Wang, Quanlong},
      title = {{Qufinite ZX-calculus: a unified framework of qudit ZX-calculi}},
      year = {2021},
      journal = {arXiv preprint arXiv:2104.06429},
      urldate = {2021-04-13},
      link = {http://arxiv.org/abs/2104.06429},
      keywords = {Algebraic ZX, Completeness, Triangle, Qudits},
      abstract = {ZX-calculus is graphical language for quantum computing which usually focuses on qubits. In this paper, we generalise qubit ZX-calculus to qudit ZX-calculus in any finite dimension by introducing suitable generators, especially a carefully chosen triangle node. As a consequence we obtain a set of rewriting rules which can be seen as a direct generalisation of qubit rules, and a normal form for any qudit vectors. Based on the qudit ZX-calculi, we propose a graphical formalism called qufinite ZX-calculus as a unified framework for all qudit ZX-calculi, which is universal for finite quantum theory due to a normal form for matrix of any finite size. We would expect a reconstruction of finite quantum theory within the framework of qufinite ZX-calculus which focuses on compositionality without resorting to any probability theory or sum structures.},
      video = {https://www.youtube.com/watch?v=5DmlLbxGNlU}
  }
  

  Copy to Clipboard

• Quantum Algorithms and Oracles with the Scalable ZX-calculus
  Titouan Carette, Yohann D'Anello and Simon Perdrix
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 18th International Conference on Quantum Physics and Logic, Gdansk, Poland, and online, 7-11 June 2021
  Keywords: ZX-calculus, Scalable ZX, Tempered, Protocols.

  The ZX-calculus was introduced as a graphical language able to represent specific quantum primitives in an intuitive way. The recent completeness results have shown the theoretical possibility of a purely graphical description of quantum processes. However, in practice, such approaches are limited by the intrinsic low level nature of ZX calculus. The scalable notations have been proposed as an attempt to recover an higher level point of view while maintaining the topological rewriting rules of a graphical language. We demonstrate that the scalable ZX-calculus provides a formal, intuitive, and compact framework to describe and prove quantum algorithms. As a proof of concept, we consider the standard oracle-based quantum algorithms: Deutsch-Jozsa, Bernstein-Vazirani, Simon, and Grover algorithms, and we show they can be described and proved graphically.

  @inproceedings{Carette2021quantum,
      author = {Carette, Titouan and D'Anello, Yohann and Perdrix, Simon},
      title = {{Quantum Algorithms and Oracles with the Scalable ZX-calculus}},
      year = {2021},
      booktitle = {Proceedings 18th International Conference on Quantum Physics and Logic, Gdansk, Poland, and online, 7-11 June 2021},
      editor = {Heunen, Chris and Backens, Miriam},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {343},
      pages = {193-209},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.343.10},
      urldate = {2021-04-02},
      link = {http://arxiv.org/abs/2104.01043},
      keywords = {ZX-calculus, Scalable ZX, Tempered, Protocols},
      abstract = {The ZX-calculus was introduced as a graphical language able to represent specific quantum primitives in an intuitive way. The recent completeness results have shown the theoretical possibility of a purely graphical description of quantum processes. However, in practice, such approaches are limited by the intrinsic low level nature of ZX calculus. The scalable notations have been proposed as an attempt to recover an higher level point of view while maintaining the topological rewriting rules of a graphical language. We demonstrate that the scalable ZX-calculus provides a formal, intuitive, and compact framework to describe and prove quantum algorithms. As a proof of concept, we consider the standard oracle-based quantum algorithms: Deutsch-Jozsa, Bernstein-Vazirani, Simon, and Grover algorithms, and we show they can be described and proved graphically.},
      video = {https://www.youtube.com/watch?v=8J0Ll8RXyz0}
  }
  

  Copy to Clipboard

• ZX-Calculus and Extended Wolfram Model Systems II: Fast Diagrammatic Reasoning with an Application to Quantum Circuit Simplification
  Jonathan Gorard, Manojna Namuduri and Xerxes D. Arsiwalla
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2103.15820
  Keywords: ZX-calculus, Category Theory, Optimisation, Applied.

  This article presents a novel algorithmic methodology for performing automated diagrammatic deductions over combinatorial structures, using a combination of modified equational theorem-proving techniques and the extended Wolfram model hypergraph rewriting formalism developed by the authors in previous work. We focus especially upon the application of this new algorithm to the problem of automated circuit simplification in quantum information theory, using Wolfram model multiway operator systems combined with the ZX-calculus formalism for enacting fast diagrammatic reasoning over linear transformations between qubits. We show how to construct a generalization of the deductive inference rules for Knuth-Bendix completion in which equation matches are selected on the basis of causal edge density in the associated multiway system, before proceeding to demonstrate how to embed the higher-order logic of the ZX-calculus rules within this first-order equational framework. After showing explicitly how the (hyper)graph rewritings of both Wolfram model systems and the ZX-calculus can be effectively realized within this formalism, we proceed to exhibit comparisons of time complexity vs. proof complexity for this new algorithmic approach when simplifying randomly-generated Clifford circuits down to pseudo-normal form, as well as when reducing the number of T-gates in randomly-generated non-Clifford circuits, with circuit sizes ranging up to 3000 gates, illustrating that the method performs favorably in comparison with existing circuit simplification frameworks, and also exhibiting the approximately quadratic speedup obtained by employing the causal edge density optimization. Finally, we present a worked example of an automated proof of correctness for a simple quantum teleportation protocol, in order to demonstrate more clearly the internal operations of the theorem-proving procedure.

  @article{gorard2021zxcalculus,
      author = {Gorard, Jonathan and Namuduri, Manojna and Arsiwalla, Xerxes D.},
      title = {{ZX-Calculus and Extended Wolfram Model Systems II: Fast Diagrammatic Reasoning with an Application to Quantum Circuit Simplification}},
      year = {2021},
      journal = {arXiv preprint arXiv:2103.15820},
      urldate = {2021-03-29},
      link = {http://arxiv.org/abs/2103.15820},
      keywords = {ZX-calculus, Category Theory, Optimisation, Applied},
      abstract = {This article presents a novel algorithmic methodology for performing automated diagrammatic deductions over combinatorial structures, using a combination of modified equational theorem-proving techniques and the extended Wolfram model hypergraph rewriting formalism developed by the authors in previous work. We focus especially upon the application of this new algorithm to the problem of automated circuit simplification in quantum information theory, using Wolfram model multiway operator systems combined with the ZX-calculus formalism for enacting fast diagrammatic reasoning over linear transformations between qubits. We show how to construct a generalization of the deductive inference rules for Knuth-Bendix completion in which equation matches are selected on the basis of causal edge density in the associated multiway system, before proceeding to demonstrate how to embed the higher-order logic of the ZX-calculus rules within this first-order equational framework. After showing explicitly how the (hyper)graph rewritings of both Wolfram model systems and the ZX-calculus can be effectively realized within this formalism, we proceed to exhibit comparisons of time complexity vs. proof complexity for this new algorithmic approach when simplifying randomly-generated Clifford circuits down to pseudo-normal form, as well as when reducing the number of T-gates in randomly-generated non-Clifford circuits, with circuit sizes ranging up to 3000 gates, illustrating that the method performs favorably in comparison with existing circuit simplification frameworks, and also exhibiting the approximately quadratic speedup obtained by employing the causal edge density optimization. Finally, we present a worked example of an automated proof of correctness for a simple quantum teleportation protocol, in order to demonstrate more clearly the internal operations of the theorem-proving procedure.}
  }
  

  Copy to Clipboard

• Diagrammatic Differentiation for Quantum Machine Learning
  Alexis Toumi, Richie Yeung and Giovanni de Felice
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 18th International Conference on Quantum Physics and Logic, Gdansk, Poland, and online, 7-11 June 2021
  Keywords: ZX-calculus, Applied, PyZX, NLP.

  We introduce diagrammatic differentiation for tensor calculus by generalising the dual number construction from rigs to monoidal categories. Applying this to ZX diagrams, we show how to calculate diagrammatically the gradient of a linear map with respect to a phase parameter. For diagrams of parametrised quantum circuits, we get the well-known parameter-shift rule at the basis of many variational quantum algorithms. We then extend our method to the automatic differentation of hybrid classical-quantum circuits, using diagrams with bubbles to encode arbitrary non-linear operators. Moreover, diagrammatic differentiation comes with an open-source implementation in DisCoPy, the Python library for monoidal categories. Diagrammatic gradients of classical-quantum circuits can then be simplified using the PyZX library and executed on quantum hardware via the tket compiler. This opens the door to many practical applications harnessing both the structure of string diagrams and the computational power of quantum machine learning.

  @inproceedings{toumi2021diagrammatic,
      author = {Toumi, Alexis and Yeung, Richie and de Felice, Giovanni},
      title = {{Diagrammatic Differentiation for Quantum Machine Learning}},
      year = {2021},
      booktitle = {Proceedings 18th International Conference on Quantum Physics and Logic, Gdansk, Poland, and online, 7-11 June 2021},
      editor = {Heunen, Chris and Backens, Miriam},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {343},
      pages = {132-144},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.343.7},
      urldate = {2021-03-14},
      link = {http://arxiv.org/abs/2103.07960},
      keywords = {ZX-calculus, Applied, PyZX, NLP},
      abstract = {We introduce diagrammatic differentiation for tensor calculus by generalising the dual number construction from rigs to monoidal categories. Applying this to ZX diagrams, we show how to calculate diagrammatically the gradient of a linear map with respect to a phase parameter. For diagrams of parametrised quantum circuits, we get the well-known parameter-shift rule at the basis of many variational quantum algorithms. We then extend our method to the automatic differentation of hybrid classical-quantum circuits, using diagrams with bubbles to encode arbitrary non-linear operators. Moreover, diagrammatic differentiation comes with an open-source implementation in DisCoPy, the Python library for monoidal categories. Diagrammatic gradients of classical-quantum circuits can then be simplified using the PyZX library and executed on quantum hardware via the tket compiler. This opens the door to many practical applications harnessing both the structure of string diagrams and the computational power of quantum machine learning.},
      video = {https://www.youtube.com/watch?v=HOB3r44-pGw}
  }
  

  Copy to Clipboard

• Completeness of the ZH-calculus
  Miriam Backens, Aleks Kissinger, Hector Miller-Bakewell, John van de Wetering and Sal Wolffs
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Compositionality
  Keywords: ZH-calculus, Completeness.

  There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this gate set can be elegantly described by the ZX-calculus, a graphical language for a class of string diagrams describing linear maps between qubits. The ZX-calculus has proven useful in a variety of areas of quantum information, but is less suitable for reasoning about operations outside its natural gate set such as multi-linear Boolean operations like the Toffoli gate. In this paper we study the ZH-calculus, an alternative graphical language of string diagrams that does allow straightforward encoding of Toffoli gates and other more complicated Boolean logic circuits. We find a set of simple rewrite rules for this calculus and show it is complete with respect to matrices over \(\mathbb{Z}[\frac12]\), which correspond to the approximately universal Toffoli+Hadamard gateset. Furthermore, we construct an extended version of the ZH-calculus that is complete with respect to matrices over any ring \(R\) where \(1+1\) is not a zero-divisor.

  @article{backens2021completenessZH,
      author = {Backens, Miriam and Kissinger, Aleks and Miller-Bakewell, Hector and van de Wetering, John and Wolffs, Sal},
      title = {{Completeness of the ZH-calculus}},
      year = {2023},
      journal = {{Compositionality}},
      volume = {5},
      issue = {5},
      month = {7},
      publisher = {{Compositionality}},
      issn = {2631-4444},
      doi = {10.32408/compositionality-5-5},
      urldate = {2021-03-11},
      link = {https://arxiv.org/abs/2103.06610},
      keywords = {ZH-calculus, Completeness},
      abstract = {There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this gate set can be elegantly described by the ZX-calculus, a graphical language for a class of string diagrams describing linear maps between qubits. The ZX-calculus has proven useful in a variety of areas of quantum information, but is less suitable for reasoning about operations outside its natural gate set such as multi-linear Boolean operations like the Toffoli gate. In this paper we study the ZH-calculus, an alternative graphical language of string diagrams that does allow straightforward encoding of Toffoli gates and other more complicated Boolean logic circuits. We find a set of simple rewrite rules for this calculus and show it is complete with respect to matrices over $\mathbb{Z}[\frac12]$, which correspond to the approximately universal Toffoli+Hadamard gateset. Furthermore, we construct an extended version of the ZH-calculus that is complete with respect to matrices over any ring $R$ where $1+1$ is not a zero-divisor.},
      video = {https://www.youtube.com/watch?v=Shu-EWNl-mE}
  }
  

  Copy to Clipboard

• Simplification Strategies for the Qutrit ZX-Calculus
  Alex Townsend-Teague and Konstantinos Meichanetzidis
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2103.06914
  Keywords: ZX-calculus, Tensor networks, Applied.

  The ZX-calculus is a graphical language for suitably represented tensor networks, called ZX-diagrams. Calculations are performed by transforming ZX-diagrams with rewrite rules. The ZX-calculus has found applications in reasoning about quantum circuits, condensed matter systems, quantum algorithms, quantum error correcting codes, and counting problems. A key notion is the stabiliser fragment of the ZX-calculus, a subfamily of ZX-diagrams for which rewriting can be done efficiently in terms of derived simplifying rewrites. Recently, higher dimensional qudits - in particular, qutrits - have gained prominence within quantum computing research. The main contribution of this work is the derivation of efficient rewrite strategies for the stabiliser fragment of the qutrit ZX-calculus. Notably, this constitutes a first non-trivial step towards the simplification of qutrit quantum circuits. We then give further unexpected areas in which these rewrite strategies provide complexity-theoretic insight; namely, we reinterpret known results about evaluating the Jones polynomial, an important link invariant in knot theory, and counting graph colourings.

  @article{townsend-teague2021classifying,
      author = {Townsend-Teague, Alex and Meichanetzidis, Konstantinos},
      title = {{Simplification Strategies for the Qutrit ZX-Calculus}},
      year = {2021},
      journal = {arXiv preprint arXiv:2103.06914},
      urldate = {2021-03-11},
      link = {http://arxiv.org/abs/2103.06914},
      keywords = {ZX-calculus, Tensor networks, Applied},
      abstract = {The ZX-calculus is a graphical language for suitably represented tensor networks, called ZX-diagrams. Calculations are performed by transforming ZX-diagrams with rewrite rules. The ZX-calculus has found applications in reasoning about quantum circuits, condensed matter systems, quantum algorithms, quantum error correcting codes, and counting problems. A key notion is the stabiliser fragment of the ZX-calculus, a subfamily of ZX-diagrams for which rewriting can be done efficiently in terms of derived simplifying rewrites. Recently, higher dimensional qudits - in particular, qutrits - have gained prominence within quantum computing research. The main contribution of this work is the derivation of efficient rewrite strategies for the stabiliser fragment of the qutrit ZX-calculus. Notably, this constitutes a first non-trivial step towards the simplification of qutrit quantum circuits. We then give further unexpected areas in which these rewrite strategies provide complexity-theoretic insight; namely, we reinterpret known results about evaluating the Jones polynomial, an important link invariant in knot theory, and counting graph colourings.},
      video = {https://youtu.be/v_y8Wu6GLxc?t=1558}
  }
  

  Copy to Clipboard

• Quantum and braided ZX calculus
  Shahn Majid
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Journal of Physics A: Mathematical and Theoretical
  Keywords: Braids, Frobenius algebras.

  We revisit the notion of interacting Frobenius Hopf algebras for ZX-calculus in quantum computing, with focus on allowing the algebras to be noncommutative and coalgebras to be noncocommutative. We introduce the notion of *-structures in ZX-calculus at this algebraic level and construct examples based on the quantum group \(u_q(sl_2)\) at a root of unity. We provide an abstract formulation of the Hadamard gate at this level and clarify its relationship to Hopf algebra self-duality. We then solve the problem of extending the notion of interacting Hopf algebras and ZX-calculus to take place in a braided tensor category. In the ribbon case, the Hadamard gate coming from braided self-duality obeys a modular identity. We give the example of \(b_q(sl_2)\), the self-dual braided version of \(u_q(sl_2)\).

  @article{majid2021quantum,
      author = {Majid, Shahn},
      title = {{Quantum and braided ZX calculus}},
      year = {2022},
      journal = {Journal of Physics A: Mathematical and Theoretical},
      doi = {10.1088/1751-8121/ac631f},
      urldate = {2021-03-11},
      link = {http://arxiv.org/abs/2103.07264},
      keywords = {Braids, Frobenius algebras},
      abstract = {We revisit the notion of interacting Frobenius Hopf algebras for ZX-calculus in quantum computing, with focus on allowing the algebras to be noncommutative and coalgebras to be noncocommutative. We introduce the notion of *-structures in ZX-calculus at this algebraic level and construct examples based on the quantum group $u_q(sl_2)$ at a root of unity. We provide an abstract formulation of the Hadamard gate at this level and clarify its relationship to Hopf algebra self-duality. We then solve the problem of extending the notion of interacting Hopf algebras and ZX-calculus to take place in a braided tensor category. In the ribbon case, the Hadamard gate coming from braided self-duality obeys a modular identity. We give the example of $b_q(sl_2)$, the self-dual braided version of $u_q(sl_2)$.},
      video = {https://www.youtube.com/watch?v=sXpT8Xhpwuw}
  }
  

  Copy to Clipboard

• [Video] String Diagrams for the Surface Code 🎥
  Alex Cowtan
  Show abstract ⇲ Show bibdata ⇲

  ZX seminar
  Keywords: ZX-calculus, Surface Code, Braids, Applied.

  We briefly review modular tensor categories, a formalism for modelling anyonic theories. By considering the modular tensor category for the toric code and a functor to FdHilb, we give the semantics of surface code string diagrams in terms of circuits and the ZX-calculus. We use these tools to compile circuits to the surface code.

  @misc{Cowtan2021Video,
      author = {Cowtan, Alex},
      title = {{String Diagrams for the Surface Code}},
      year = {2021},
      howpublished = {ZX seminar},
      urldate = {2021-03-01},
      url = {https://www.youtube.com/watch?v=OYDpEo8yP40},
      keywords = {ZX-calculus, Surface Code, Braids, Applied},
      abstract = {We briefly review modular tensor categories, a formalism for modelling anyonic theories. By considering the modular tensor category for the toric code and a functor to FdHilb, we give the semantics of surface code string diagrams in terms of circuits and the ZX-calculus. We use these tools to compile circuits to the surface code.}
  }
  

  Copy to Clipboard

• Geometry of Interaction for ZX-Diagrams
  Kostia Chardonnet, Benoît Valiron and Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
  Keywords: ZX-calculus, Verification.

  ZX-Calculus is a versatile graphical language for quantum computation equipped with an equational theory. Getting inspiration from Geometry of Interaction, in this paper we propose a token-machine based asynchronous model of both pure ZX-Calculus and its extension to mixed processes. We also show how to connect this new semantics to the usual standard interpretation of ZX-diagrams. This model allows us to have a new look at what ZX-diagrams compute, and give a more local, operational view of the semantics of ZX-diagrams.

  @inproceedings{kostia2021geometry,
      author = {Chardonnet, Kostia and Valiron, Beno\^{i}t and Vilmart, Renaud},
      title = {{Geometry of Interaction for ZX-Diagrams}},
      year = {2021},
      booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
      editor = {Bonchi, Filippo and Puglisi, Simon J.},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {202},
      pages = {30:1--30:16},
      publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-201-3},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.MFCS.2021.30},
      urldate = {2021-03-01},
      link = {https://hal.archives-ouvertes.fr/hal-03154573/},
      keywords = {ZX-calculus, Verification},
      abstract = {ZX-Calculus is a versatile graphical language for quantum computation equipped with an equational theory. Getting inspiration from Geometry of Interaction, in this paper we propose a token-machine based asynchronous model of both pure ZX-Calculus and its extension to mixed processes. We also show how to connect this new semantics to the usual standard interpretation of ZX-diagrams. This model allows us to have a new look at what ZX-diagrams compute, and give a more local, operational view of the semantics of ZX-diagrams.},
      urn = {urn:nbn:de:0030-drops-144701},
      video = {https://www.youtube.com/watch?v=C_to8pIfpmc}
  }
  

  Copy to Clipboard

• Kindergarden quantum mechanics graduates (...or how I learned to stop gluing LEGO together and love the ZX-calculus)
  Bob Coecke, Dominic Horsman, Aleks Kissinger and Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲

  Theoretical Computer Science
  Keywords: ZX-calculus, NLP, MBQC.

  This paper is a `spiritual child' of the 2005 lecture notes Kindergarten Quantum Mechanics, which showed how a simple, pictorial extension of Dirac notation allowed several quantum features to be easily expressed and derived, using language even a kindergartner can understand. Central to that approach was the use of pictures and pictorial transformation rules to understand and derive features of quantum theory and computation. However, this approach left many wondering `where's the beef?' In other words, was this new approach capable of producing new results, or was it simply an aesthetically pleasing way to restate stuff we already know? The aim of this sequel paper is to say `here's the beef!', and highlight some of the major results of the approach advocated in Kindergarten Quantum Mechanics, and how they are being applied to tackle practical problems on real quantum computers. We will focus mainly on what has become the Swiss army knife of the pictorial formalism: the ZX-calculus. First we look at some of the ideas behind the ZX-calculus, comparing and contrasting it with the usual quantum circuit formalism. We then survey results from the past 2 years falling into three categories: (1) completeness of the rules of the ZX-calculus, (2) state-of-the-art quantum circuit optimisation results in commercial and open-source quantum compilers relying on ZX, and (3) the use of ZX in translating real-world stuff like natural language into quantum circuits that can be run on today's (very limited) quantum hardware. We also take the title literally, and outline an ongoing experiment aiming to show that ZX-calculus enables children to do cutting-edge quantum computing stuff. If anything, this would truly confirm that `kindergarten quantum mechanics' wasn't just a joke.

  @article{coecke2021kindergarden,
      author = {Coecke, Bob and Horsman, Dominic and Kissinger, Aleks and Wang, Quanlong},
      title = {{Kindergarden quantum mechanics graduates (...or how I learned to stop gluing LEGO together and love the ZX-calculus)}},
      year = {2022},
      journal = {Theoretical Computer Science},
      volume = {897},
      month = {1},
      pages = {1--22},
      doi = {10.1016/j.tcs.2021.07.024},
      urldate = {2021-02-22},
      link = {http://arxiv.org/abs/2102.10984},
      keywords = {ZX-calculus, NLP, MBQC},
      abstract = {This paper is a `spiritual child' of the 2005 lecture notes Kindergarten Quantum Mechanics, which showed how a simple, pictorial extension of Dirac notation allowed several quantum features to be easily expressed and derived, using language even a kindergartner can understand. Central to that approach was the use of pictures and pictorial transformation rules to understand and derive features of quantum theory and computation. However, this approach left many wondering `where's the beef?' In other words, was this new approach capable of producing new results, or was it simply an aesthetically pleasing way to restate stuff we already know?   The aim of this sequel paper is to say `here's the beef!', and highlight some of the major results of the approach advocated in Kindergarten Quantum Mechanics, and how they are being applied to tackle practical problems on real quantum computers. We will focus mainly on what has become the Swiss army knife of the pictorial formalism: the ZX-calculus. First we look at some of the ideas behind the ZX-calculus, comparing and contrasting it with the usual quantum circuit formalism. We then survey results from the past 2 years falling into three categories: (1) completeness of the rules of the ZX-calculus, (2) state-of-the-art quantum circuit optimisation results in commercial and open-source quantum compilers relying on ZX, and (3) the use of ZX in translating real-world stuff like natural language into quantum circuits that can be run on today's (very limited) quantum hardware.   We also take the title literally, and outline an ongoing experiment aiming to show that ZX-calculus enables children to do cutting-edge quantum computing stuff. If anything, this would truly confirm that `kindergarten quantum mechanics' wasn't just a joke.}
  }
  

  Copy to Clipboard

• Distributive Laws, Spans and the ZX-Calculus
  Cole Comfort
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2102.04386
  Keywords: ZX-calculus, Category Theory, Completeness.

  We modularly build increasingly larger fragments of the ZX-calculus by modularly adding new generators and relations, at each point, giving some concrete semantics in terms of some category of spans. This is performed using Lack's technique of composing props via distributive laws, as well as the technique of pushout cubes of Zanasi. We do this for the fragment of the ZX-calculus with only the black \(\pi\)-phase (and no Hadamard gate) as well as well as the fragment which additionally has the and gate as a generator (which is equivalent to the natural number H-box fragment of the ZH calculus). In the former case, we show that this is equivalent to the full subcategory of spans of (possibly empty) free, finite dimensional affine \(\mathbb F_2\)-vector spaces, where the objects are the non-empty affine vector spaces. In the latter case, we show that this is equivalent to the full subcategory of spans of finite sets where the objects are powers of the two element set. Because these fragments of the ZX-calculus have semantics in terms of full subcategories of categories of spans, they can not be presented by distributive laws over groupoids. Instead, we first construct their subcategories of partial isomorphisms via distributive laws over all isomorphims with subobjects adoined. After which, the full subcategory of spans are obtained by freely adjoining units and counits the the semi-Frobenius structures given by the diagonal and codiagonal maps.

  @article{comfort2021distributive,
      author = {Comfort, Cole},
      title = {{Distributive Laws, Spans and the ZX-Calculus}},
      year = {2021},
      journal = {arXiv preprint arXiv:2102.04386},
      urldate = {2021-02-08},
      link = {http://arxiv.org/abs/2102.04386},
      keywords = {ZX-calculus, Category Theory, Completeness},
      abstract = {We modularly build increasingly larger fragments of the ZX-calculus by modularly adding new generators and relations, at each point, giving some concrete semantics in terms of some category of spans. This is performed using Lack's technique of composing props via distributive laws, as well as the technique of pushout cubes of Zanasi. We do this for the fragment of the ZX-calculus with only the black $\pi$-phase (and no Hadamard gate) as well as well as the fragment which additionally has the and gate as a generator (which is equivalent to the natural number H-box fragment of the ZH calculus). In the former case, we show that this is equivalent to the full subcategory of spans of (possibly empty) free, finite dimensional affine $\mathbb F_2$-vector spaces, where the objects are the non-empty affine vector spaces. In the latter case, we show that this is equivalent to the full subcategory of spans of finite sets where the objects are powers of the two element set. Because these fragments of the ZX-calculus have semantics in terms of full subcategories of categories of spans, they can not be presented by distributive laws over groupoids. Instead, we first construct their subcategories of partial isomorphisms via distributive laws over all isomorphims with subobjects adoined. After which, the full subcategory of spans are obtained by freely adjoining units and counits the the semi-Frobenius structures given by the diagonal and codiagonal maps.},
      video = {https://www.youtube.com/watch?v=PF2uwuoZrbs}
  }
  

  Copy to Clipboard

• Construction of classical structures on N qubits by composing diagrammatic eigenbases of Pauli operators
  Aqilah Rasat
  Show abstract ⇲ Show bibdata ⇲

  AIP Conference Proceedings
  Keywords: ZX-calculus, Strong Complementarity.

  Within the framework of Categorical Quantum Mechanics, it was found that orthogonal bases are subsumed by the so called classical structures. So, there must be classical structures which have the eigenbases of the Pauli X,Y and Z operators as their underlying bases. In this article, we propose a procedure for composing these classical structures on a single qubit which produces classical structures on multiple qubits. As a result, we can present orthogonal bases within a multiple qubit system as diagrams which makes explicit the entanglement structure of those bases.

  @inproceedings{rasat2021construction,
      author = {Rasat, Aqilah},
      title = {Construction of classical structures on N qubits by composing diagrammatic eigenbases of Pauli operators},
      year = {2021},
      booktitle = {AIP Conference Proceedings},
      volume = {2319},
      number = {1},
      pages = {120001},
      organization = {AIP Publishing LLC},
      doi = {10.1063/5.0036992},
      urldate = {2021-02-05},
      link = {https://doi.org/10.1063/5.0036992},
      keywords = {ZX-calculus, Strong Complementarity},
      abstract = {Within the framework of Categorical Quantum Mechanics, it was found that orthogonal bases are subsumed by the so called classical structures. So, there must be classical structures which have the eigenbases of the Pauli X,Y and Z operators as their underlying bases. In this article, we propose a procedure for composing these classical structures on a single qubit which produces classical structures on multiple qubits. As a result, we can present orthogonal bases within a multiple qubit system as diagrams which makes explicit the entanglement structure of those bases.}
  }
  

  Copy to Clipboard

• Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory
  Titouan Carette, Marc de Visme and Simon Perdrix
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  Keywords: Completeness, Category Theory, Mixed States.

  Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite number of qubits. Meanwhile, delayed traces have been used as a graphical way to represent finite-memory computations on streams, in a classical setting (cartesian data types). We merge those two approaches and describe a general construction that extends any graphical language, equipped with a notion of discarding, to a graphical language of finite memory computations. In order to handle cases like the ZX-calculus, which is complete for post-selected quantum mechanics, we extend the delayed trace formalism beyond the causal case, refining the notion of causality for stream transformers. We design a stream semantics based on stateful morphism sequences and, under some assumptions, show universality and completeness results. Finally, we investigate the links of our framework with previous works on cartesian data types, signal flow graphs, and quantum channels with memories.

  @inproceedings{carette2021graphical,
      author = {Carette, Titouan and de Visme, Marc and Perdrix, Simon},
      title = {{Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory}},
      year = {2021},
      booktitle = {2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
      volume = {},
      number = {},
      pages = {1--13},
      doi = {10.1109/LICS52264.2021.9470553},
      urldate = {2021-02-05},
      link = {http://arxiv.org/abs/2102.03133},
      keywords = {Completeness, Category Theory, Mixed States},
      abstract = {Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite number of qubits. Meanwhile, delayed traces have been used as a graphical way to represent finite-memory computations on streams, in a classical setting (cartesian data types). We merge those two approaches and describe a general construction that extends any graphical language, equipped with a notion of discarding, to a graphical language of finite memory computations. In order to handle cases like the ZX-calculus, which is complete for post-selected quantum mechanics, we extend the delayed trace formalism beyond the causal case, refining the notion of causality for stream transformers. We design a stream semantics based on stateful morphism sequences and, under some assumptions, show universality and completeness results. Finally, we investigate the links of our framework with previous works on cartesian data types, signal flow graphs, and quantum channels with memories.},
      video = {https://www.youtube.com/watch?v=zdPeKaDZCJs}
  }
  

  Copy to Clipboard

• When Only Topology Matters
  Titouan Carette
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2102.03178
  Keywords: Category Theory.

  Graphical languages are symmetric monoidal categories presented by generators and equations. The string diagrams notation allows to transform numerous axioms into low dimension topological rules we are comfortable with as three dimensional space citizens. This aspect is often referred to by the Only Topology Matters paradigm (OTM). However OTM remains quite informal and its exact meaning in terms of rewriting rules is ambiguous. In this paper we define three precise aspects of the OTM paradigm, namely flexsymmetry, flexcyclicity and flexibility of Frobenius algebras. We investigate how this new framework can simplify the presentation of known graphical languages based on Frobenius algebras.

  @article{carette2021when,
      author = {Carette, Titouan},
      title = {{When Only Topology Matters}},
      year = {2021},
      journal = {arXiv preprint arXiv:2102.03178},
      urldate = {2021-02-04},
      link = {http://arxiv.org/abs/2102.03178},
      keywords = {Category Theory},
      abstract = {Graphical languages are symmetric monoidal categories presented by generators and equations. The string diagrams notation allows to transform numerous axioms into low dimension topological rules we are comfortable with as three dimensional space citizens. This aspect is often referred to by the Only Topology Matters paradigm (OTM). However OTM remains quite informal and its exact meaning in terms of rewriting rules is ambiguous. In this paper we define three precise aspects of the OTM paradigm, namely flexsymmetry, flexcyclicity and flexibility of Frobenius algebras. We investigate how this new framework can simplify the presentation of known graphical languages based on Frobenius algebras.},
      video = {https://www.youtube.com/watch?v=oZv_SLClh0M}
  }
  

  Copy to Clipboard

• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
  Chen Zhao and Xiao-Shan Gao
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Quantum
  Keywords: Variational Circuits, ZX-calculus, Applied.

  In this paper, we propose a general scheme to analyze the barren plateau phenomenon in training quantum neural networks with the ZX-calculus. More precisely, we extend the barren plateaus theorem from unitary 2-design circuits to any parameterized quantum circuits under certain reasonable assumptions. The main technical contribution of this paper is representing certain integrations as ZX-diagrams and computing them with the ZX-calculus. The method is used to analyze four concrete quantum neural networks with different structures. It is shown that, for the hardware efficient ansatz and the MPS-inspired ansatz, there exist barren plateaus, while for the QCNN and the tree tensor network ansatz, there exists no barren plateau.

  @article{Zhao2021analyzingbarren,
      author = {Zhao, Chen and Gao, Xiao-Shan},
      title = {Analyzing the barren plateau phenomenon in training quantum neural networks with the {ZX}-calculus},
      year = {2021},
      journal = {{Quantum}},
      volume = {5},
      month = {6},
      pages = {466},
      publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
      issn = {2521-327X},
      doi = {10.22331/q-2021-06-04-466},
      urldate = {2021-02-03},
      link = {http://arxiv.org/abs/2102.01828},
      keywords = {Variational Circuits, ZX-calculus, Applied},
      abstract = {In this paper, we propose a general scheme to analyze the barren plateau phenomenon in training quantum neural networks with the ZX-calculus. More precisely, we extend the barren plateaus theorem from unitary 2-design circuits to any parameterized quantum circuits under certain reasonable assumptions. The main technical contribution of this paper is representing certain integrations as ZX-diagrams and computing them with the ZX-calculus. The method is used to analyze four concrete quantum neural networks with different structures. It is shown that, for the hardware efficient ansatz and the MPS-inspired ansatz, there exist barren plateaus, while for the QCNN and the tree tensor network ansatz, there exists no barren plateau.},
      video = {https://www.youtube.com/watch?v=dFryJQIV0-k}
  }
  

  Copy to Clipboard

• Parametrized Quantum Circuits of Synonymous Sentences in Quantum Natural Language Processing
  Mina Abbaszadeh, S. Shahin Mousavi and Vahid Salari
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2102.02204
  Keywords: NLP, ZX-calculus, Applied.

  In this paper, we develop a compositional vector-based semantics of positive transitive sentences in quantum natural language processing for a non-English language, i.e. Persian, to compare the parametrized quantum circuits of two synonymous sentences in two languages, English and Persian. By considering grammar+meaning of a transitive sentence, we translate DisCoCat diagram via ZX-calculus into quantum circuit form. Also, we use a bigraph method to rewrite DisCoCat diagram and turn into quantum circuit in the semantic side.

  @article{abbaszadeh2021parametrized,
      author = {Abbaszadeh, Mina and Shahin Mousavi, S. and Salari, Vahid},
      title = {{Parametrized Quantum Circuits of Synonymous Sentences in Quantum Natural Language Processing}},
      year = {2021},
      journal = {arXiv preprint arXiv:2102.02204},
      urldate = {2021-02-02},
      link = {http://arxiv.org/abs/2102.02204},
      keywords = {NLP, ZX-calculus, Applied},
      abstract = {In this paper, we develop a compositional vector-based semantics of positive transitive sentences in quantum natural language processing for a non-English language, i.e. Persian, to compare the parametrized quantum circuits of two synonymous sentences in two languages, English and Persian. By considering grammar+meaning of a transitive sentence, we translate DisCoCat diagram via ZX-calculus into quantum circuit form. Also, we use a bigraph method to rewrite DisCoCat diagram and turn into quantum circuit in the semantic side.}
  }
  

  Copy to Clipboard

• Quantum Theory from Principles, Quantum Software from Diagrams
  John van de Wetering
  Show abstract ⇲ Show bibdata ⇲

  Radboud University Nijmegen PhD Thesis
  Keywords: ZX-calculus, Optimisation, MBQC, Phase Gadgets, Local Complementation.

  This thesis consists of two parts. The first part is about how quantum theory can be recovered from first principles, while the second part is about the application of diagrammatic reasoning, specifically the ZX-calculus, to practical problems in quantum computing. The main results of the first part include a reconstruction of quantum theory from principles related to properties of sequential measurement and a reconstruction based on properties of pure maps and the mathematics of effectus theory. It also includes a detailed study of JBW-algebras, a type of infinite-dimensional Jordan algebra motivated by von Neumann algebras. In the second part we find a new model for measurement-based quantum computing, study how measurement patterns in the one-way model can be simplified and find a new algorithm for extracting a unitary circuit from such patterns. We use these results to develop a circuit optimisation strategy that leads to a new normal form for Clifford circuits and reductions in the T-count of Clifford+T circuits.

  @phdthesis{wetering2021thesis,
      author = {van de Wetering, John},
      title = {{Quantum Theory from Principles, Quantum Software from Diagrams}},
      year = {2021},
      school = {Radboud University Nijmegen},
      urldate = {2021-01-10},
      link = {https://arxiv.org/abs/2101.03608},
      keywords = {ZX-calculus, Optimisation, MBQC, Phase Gadgets, Local Complementation},
      abstract = {This thesis consists of two parts. The first part is about how quantum theory can be recovered from first principles, while the second part is about the application of diagrammatic reasoning, specifically the ZX-calculus, to practical problems in quantum computing. The main results of the first part include a reconstruction of quantum theory from principles related to properties of sequential measurement and a reconstruction based on properties of pure maps and the mathematics of effectus theory. It also includes a detailed study of JBW-algebras, a type of infinite-dimensional Jordan algebra motivated by von Neumann algebras. In the second part we find a new model for measurement-based quantum computing, study how measurement patterns in the one-way model can be simplified and find a new algorithm for extracting a unitary circuit from such patterns. We use these results to develop a circuit optimisation strategy that leads to a new normal form for Clifford circuits and reductions in the T-count of Clifford+T circuits.}
  }
  

  Copy to Clipboard

2020

• ZX-calculus for the working quantum computer scientist
  John van de Wetering
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2012.13966
  Keywords: ZX-calculus, ZH-calculus, ZW-calculus, MBQC, Completeness, Applied, Category Theory, Mixed States, Clifford Fragment.

  The ZX-calculus is a graphical language for reasoning about quantum computation that has recently seen an increased usage in a variety of areas such as quantum circuit optimisation, surface codes and lattice surgery, measurement-based quantum computation, and quantum foundations. The first half of this review gives a gentle introduction to the ZX-calculus suitable for those familiar with the basics of quantum computing. The aim here is to make the reader comfortable enough with the ZX-calculus that they could use it in their daily work for small computations on quantum circuits and states. The latter sections give a condensed overview of the literature on the ZX-calculus. We discuss Clifford computation and graphically prove the Gottesman-Knill theorem, we discuss a recently introduced extension of the ZX-calculus that allows for convenient reasoning about Toffoli gates, and we discuss the recent completeness theorems for the ZX-calculus that show that, in principle, all reasoning about quantum computation can be done using ZX-diagrams. Additionally, we discuss the categorical and algebraic origins of the ZX-calculus and we discuss several extensions of the language which can represent mixed states, measurement, classical control and higher-dimensional qudits.

  @article{vandewetering2020zxcalculus,
      author = {van de Wetering, John},
      title = {{ZX-calculus for the working quantum computer scientist}},
      year = {2020},
      journal = {arXiv preprint arXiv:2012.13966},
      urldate = {2020-12-27},
      link = {http://arxiv.org/abs/2012.13966},
      keywords = {ZX-calculus, ZH-calculus, ZW-calculus, MBQC, Completeness, Applied, Category Theory, Mixed States, Clifford Fragment},
      abstract = {The ZX-calculus is a graphical language for reasoning about quantum computation that has recently seen an increased usage in a variety of areas such as quantum circuit optimisation, surface codes and lattice surgery, measurement-based quantum computation, and quantum foundations. The first half of this review gives a gentle introduction to the ZX-calculus suitable for those familiar with the basics of quantum computing. The aim here is to make the reader comfortable enough with the ZX-calculus that they could use it in their daily work for small computations on quantum circuits and states. The latter sections give a condensed overview of the literature on the ZX-calculus. We discuss Clifford computation and graphically prove the Gottesman-Knill theorem, we discuss a recently introduced extension of the ZX-calculus that allows for convenient reasoning about Toffoli gates, and we discuss the recent completeness theorems for the ZX-calculus that show that, in principle, all reasoning about quantum computation can be done using ZX-diagrams. Additionally, we discuss the categorical and algebraic origins of the ZX-calculus and we discuss several extensions of the language which can represent mixed states, measurement, classical control and higher-dimensional qudits.}
  }
  

  Copy to Clipboard

• A note on diagonal gates in SZX-calculus
  Titouan Carette
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2012.09540
  Keywords: Scalable ZX, Phase Gadgets, Fourier, ZH-calculus, Hypergraph, Tempered, Graph States.

  This note describes how the scalable ZXH calculus can be used to represent in a compact way the quantum gates that are diagonal in the computational basis. This includes controlled and multi-controlled Z gates, their generalizations, respectively graph and hypergraph operators, and also phase gadgets.

  @article{carette2020note,
      author = {Carette, Titouan},
      title = {{A note on diagonal gates in SZX-calculus}},
      year = {2020},
      journal = {arXiv preprint arXiv:2012.09540},
      urldate = {2020-12-17},
      link = {http://arxiv.org/abs/2012.09540},
      keywords = {Scalable ZX, Phase Gadgets, Fourier, ZH-calculus, Hypergraph, Tempered, Graph States},
      abstract = {This note describes how the scalable ZXH calculus can be used to represent in a compact way the quantum gates that are diagonal in the computational basis. This includes controlled and multi-controlled Z gates, their generalizations, respectively graph and hypergraph operators, and also phase gadgets.}
  }
  

  Copy to Clipboard

• Constructing quantum circuits with global gates
  John van de Wetering
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  New Journal of Physics
  Keywords: Optimisation, Phase Gadgets, ZX-supported, Applied.

  There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however not always the natural multi-qubit interaction that can be implemented on a given physical quantum computer, necessitating a compilation step that transforms these CNOT gates to the native gate set. A particularly interesting case where compilation is necessary is for ion trap quantum computers, where the natural entangling operation can act on more than 2 qubits and can even act globally on all qubits at once. This calls for an entirely different approach to constructing efficient circuits. In this paper we study the problem of converting a given circuit that uses 2-qubit gates to one that uses global gates. Our three main contributions are as follows. First, we find an efficient algorithm for transforming an arbitrary circuit consisting of Clifford gates and arbitrary phase gates into a circuit consisting of single-qubit gates and a number of global interactions proportional to the number of non-Clifford phases present in the original circuit. Second, we find a general strategy to transform a global gate that targets all qubits into one that targets only a subset of the qubits. This approach scales linearly with the number of qubits that are not targeted, in contrast to the exponential scaling reported in (Maslov & Nam, N. J. Phys. 2018). Third, we improve on the number of global gates required to synthesise an arbitrary n-qubit Clifford circuit from the 12n-18 reported in (Maslov & Nam, N. J. Phys. 2018) to 6n-8.

  @article{vandewetering2020constructing,
      author = {van de Wetering, John},
      title = {{Constructing quantum circuits with global gates}},
      year = {2021},
      journal = {New Journal of Physics},
      volume = {23},
      number = {4},
      month = {4},
      pages = {043015},
      publisher = {{IOP Publishing}},
      doi = {10.1088/1367-2630/abf1b3},
      urldate = {2020-12-16},
      link = {http://arxiv.org/abs/2012.09061},
      keywords = {Optimisation, Phase Gadgets, ZX-supported, Applied},
      abstract = {There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however not always the natural multi-qubit interaction that can be implemented on a given physical quantum computer, necessitating a compilation step that transforms these CNOT gates to the native gate set. A particularly interesting case where compilation is necessary is for ion trap quantum computers, where the natural entangling operation can act on more than 2 qubits and can even act globally on all qubits at once. This calls for an entirely different approach to constructing efficient circuits. In this paper we study the problem of converting a given circuit that uses 2-qubit gates to one that uses global gates. Our three main contributions are as follows. First, we find an efficient algorithm for transforming an arbitrary circuit consisting of Clifford gates and arbitrary phase gates into a circuit consisting of single-qubit gates and a number of global interactions proportional to the number of non-Clifford phases present in the original circuit. Second, we find a general strategy to transform a global gate that targets all qubits into one that targets only a subset of the qubits. This approach scales linearly with the number of qubits that are not targeted, in contrast to the exponential scaling reported in (Maslov & Nam, N. J. Phys. 2018). Third, we improve on the number of global gates required to synthesise an arbitrary n-qubit Clifford circuit from the 12n-18 reported in (Maslov & Nam, N. J. Phys. 2018) to 6n-8.},
      video = {https://www.youtube.com/watch?v=M2RI1dYC214}
  }
  

  Copy to Clipboard

• [Video] Quantum Natural Language Processing 🎥
  Bob Coecke
  Show abstract ⇲ Show bibdata ⇲

  Q2B 2020
  Keywords: ZX-calculus, NLP, Applied, Automation.

  Bob Coecke, Professor at the University of Oxford and Senior Scientific Advisor at Cambridge Quantum Computing, presents to attendees on December 10, 2020 at Q2B20 - Practical Quantum Computing, an annual conference hosted by QC Ware.

  @misc{Coecke2020Video,
      author = {Coecke, Bob},
      title = {{Quantum Natural Language Processing}},
      year = {2020},
      howpublished = {Q2B 2020},
      urldate = {2020-12-10},
      url = {https://www.youtube.com/watch?v=wqDzn_kzQTc},
      keywords = {ZX-calculus, NLP, Applied, Automation},
      abstract = {Bob Coecke, Professor at the University of Oxford and Senior Scientific Advisor at Cambridge Quantum Computing, presents to attendees on December 10, 2020 at Q2B20 - Practical Quantum Computing, an annual conference hosted by QC Ware.}
  }
  

  Copy to Clipboard

• [Video] Algorithm Development on Honeywell’s Quantum Computer 🎥
  Ross Duncan
  Show abstract ⇲ Show bibdata ⇲

  Q2B 2020
  Keywords: ZX-calculus, MBQC, Applied, Optimisation, Automation.

  Ross Duncan, Head of Quantum Software of Cambridge Quantum Computing, presents to attendees on December 8, 2020 at Q2B20 - Practical Quantum Computing, an annual conference hosted by QC Ware.

  @misc{Duncan2020Video,
      author = {Duncan, Ross},
      title = {{Algorithm Development on Honeywell’s Quantum Computer}},
      year = {2020},
      howpublished = {Q2B 2020},
      urldate = {2020-12-08},
      url = {https://www.youtube.com/watch?v=chZ8QhTNJXo},
      keywords = {ZX-calculus, MBQC, Applied, Optimisation, Automation},
      abstract = {Ross Duncan, Head of Quantum Software of Cambridge Quantum Computing, presents to attendees on December 8, 2020 at Q2B20 - Practical Quantum Computing, an annual conference hosted by QC Ware.}
  }
  

  Copy to Clipboard

• Foundations for Near-Term Quantum Natural Language Processing
  Bob Coecke, Giovanni de Felice, Konstantinos Meichanetzidis and Alexis Toumi
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2012.03755
  Keywords: NLP, ZX-calculus, Applied.

  We provide conceptual and mathematical foundations for near-term quantum natural language processing (QNLP), and do so in quantum computer scientist friendly terms. We opted for an expository presentation style, and provide references for supporting empirical evidence and formal statements concerning mathematical generality. We recall how the quantum model for natural language that we employ canonically combines linguistic meanings with rich linguistic structure, most notably grammar. In particular, the fact that it takes a quantum-like model to combine meaning and structure, establishes QNLP as quantum-native, on par with simulation of quantum systems. Moreover, the now leading Noisy Intermediate-Scale Quantum (NISQ) paradigm for encoding classical data on quantum hardware, variational quantum circuits, makes NISQ exceptionally QNLP-friendly: linguistic structure can be encoded as a free lunch, in contrast to the apparently exponentially expensive classical encoding of grammar. Quantum speed-up for QNLP tasks has already been established in previous work with Will Zeng. Here we provide a broader range of tasks which all enjoy the same advantage. Diagrammatic reasoning is at the heart of QNLP. Firstly, the quantum model interprets language as quantum processes via the diagrammatic formalism of categorical quantum mechanics. Secondly, these diagrams are via ZX-calculus translated into quantum circuits. Parameterisations of meanings then become the circuit variables to be learned. Our encoding of linguistic structure within quantum circuits also embodies a novel approach for establishing word-meanings that goes beyond the current standards in mainstream AI, by placing linguistic structure at the heart of Wittgenstein's meaning-is-context.

  @article{coecke2020foundations,
      author = {Coecke, Bob and de Felice, Giovanni and Meichanetzidis, Konstantinos and Toumi, Alexis},
      title = {{Foundations for Near-Term Quantum Natural Language Processing}},
      year = {2020},
      journal = {arXiv preprint arXiv:2012.03755},
      urldate = {2020-12-07},
      link = {http://arxiv.org/abs/2012.03755},
      keywords = {NLP, ZX-calculus, Applied},
      abstract = {We provide conceptual and mathematical foundations for near-term quantum natural language processing (QNLP), and do so in quantum computer scientist friendly terms. We opted for an expository presentation style, and provide references for supporting empirical evidence and formal statements concerning mathematical generality.   We recall how the quantum model for natural language that we employ canonically combines linguistic meanings with rich linguistic structure, most notably grammar. In particular, the fact that it takes a quantum-like model to combine meaning and structure, establishes QNLP as quantum-native, on par with simulation of quantum systems. Moreover, the now leading Noisy Intermediate-Scale Quantum (NISQ) paradigm for encoding classical data on quantum hardware, variational quantum circuits, makes NISQ exceptionally QNLP-friendly: linguistic structure can be encoded as a free lunch, in contrast to the apparently exponentially expensive classical encoding of grammar.   Quantum speed-up for QNLP tasks has already been established in previous work with Will Zeng. Here we provide a broader range of tasks which all enjoy the same advantage.   Diagrammatic reasoning is at the heart of QNLP. Firstly, the quantum model interprets language as quantum processes via the diagrammatic formalism of categorical quantum mechanics. Secondly, these diagrams are via ZX-calculus translated into quantum circuits. Parameterisations of meanings then become the circuit variables to be learned.   Our encoding of linguistic structure within quantum circuits also embodies a novel approach for establishing word-meanings that goes beyond the current standards in mainstream AI, by placing linguistic structure at the heart of Wittgenstein's meaning-is-context.},
      video = {https://www.youtube.com/watch?v=dXGnsCKLXrE}
  }
  

  Copy to Clipboard

• AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
  Richard D. P. East, John van de Wetering, Nicholas Chancellor and Adolfo G. Grushin
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  PRX Quantum
  Keywords: Condensed Matter, ZH-calculus, PyZX, Tensor Networks, Applied.

  From Feynman diagrams to tensor networks, diagrammatic representations of computations in quantum mechanics have catalysed progress in physics. These diagrams represent the underlying mathematical operations and aid physical interpretation, but cannot generally be computed with directly. In this paper we introduce the ZXH-calculus, a graphical language based on the ZX-calculus, that we use to represent and reason about many-body states entirely graphically. As a demonstration, we express the 1D AKLT state, a symmetry protected topological state, in the ZXH-calculus by developing a representation of spins higher than 1/2 within the calculus. By exploiting the simplifying power of the ZXH-calculus rules we show how this representation straightforwardly recovers two important properties, the existence of topologically protected edge states, and the non-vanishing of a string order parameter. We furthermore show how the AKLT matrix-product state representation can be recovered from our diagrams. In addition, we provide an alternative proof that the 2D AKLT state on a hexagonal lattice can be reduced to a graph state, demonstrating that it is a universal quantum computing resource. Our results show that the ZXH-calculus is a powerful language for representing and computing with physical states entirely graphically, paving the way to develop more efficient many-body algorithms.

  @article{east2020akltstates,
      author = {East, Richard D. P. and van de Wetering, John and Chancellor, Nicholas and Grushin, Adolfo G.},
      title = {{AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states}},
      year = {2022},
      journal = {PRX Quantum},
      volume = {3},
      issue = {1},
      month = {Jan},
      pages = {010302},
      numpages = {31},
      publisher = {American Physical Society},
      doi = {10.1103/PRXQuantum.3.010302},
      urldate = {2020-12-02},
      link = {http://arxiv.org/abs/2012.01219},
      keywords = {Condensed Matter, ZH-calculus, PyZX, Tensor Networks, Applied},
      abstract = {From Feynman diagrams to tensor networks, diagrammatic representations of computations in quantum mechanics have catalysed progress in physics. These diagrams represent the underlying mathematical operations and aid physical interpretation, but cannot generally be computed with directly. In this paper we introduce the ZXH-calculus, a graphical language based on the ZX-calculus, that we use to represent and reason about many-body states entirely graphically. As a demonstration, we express the 1D AKLT state, a symmetry protected topological state, in the ZXH-calculus by developing a representation of spins higher than 1/2 within the calculus. By exploiting the simplifying power of the ZXH-calculus rules we show how this representation straightforwardly recovers two important properties, the existence of topologically protected edge states, and the non-vanishing of a string order parameter. We furthermore show how the AKLT matrix-product state representation can be recovered from our diagrams. In addition, we provide an alternative proof that the 2D AKLT state on a hexagonal lattice can be reduced to a graph state, demonstrating that it is a universal quantum computing resource. Our results show that the ZXH-calculus is a powerful language for representing and computing with physical states entirely graphically, paving the way to develop more efficient many-body algorithms.},
      video = {https://www.youtube.com/watch?v=vi-ndkgKgQY}
  }
  

  Copy to Clipboard

• Diagrammatic Design and Study of Ansätze for Quantum Machine Learning
  Richie Yeung
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford Masters Thesis
  Keywords: ZX-calculus, Applied, Variational Circuits, Chemistry, Master Thesis.

  Given the rising popularity of quantum machine learning (QML), it is important to develop techniques that effectively simplify commonly adopted families of parameterised quantum circuits (commonly known as ans\"{a}tze). This thesis pioneers the use of diagrammatic techniques to reason with QML ans\"{a}tze. We take commonly used QML ans\"{a}tze and convert them to diagrammatic form and give a full description of how these gates commute, making the circuits much easier to analyse and simplify. Furthermore, we leverage a combinatorial description of the interaction between CNOTs and phase gadgets to analyse a periodicity phenomenon in layered ans\"{a}tze and also to simplify a class of circuits commonly used in QML.

  @mastersthesis{yeung2020diagrammatic,
      author = {Yeung, Richie},
      title = {{Diagrammatic Design and Study of Ans\"{a}tze for Quantum Machine Learning}},
      year = {2020},
      school = {University of Oxford},
      urldate = {2020-11-22},
      link = {http://arxiv.org/abs/2011.11073},
      keywords = {ZX-calculus, Applied, Variational Circuits, Chemistry, Master Thesis},
      abstract = {Given the rising popularity of quantum machine learning (QML), it is important to develop techniques that effectively simplify commonly adopted families of parameterised quantum circuits (commonly known as ans\"{a}tze). This thesis pioneers the use of diagrammatic techniques to reason with QML ans\"{a}tze. We take commonly used QML ans\"{a}tze and convert them to diagrammatic form and give a full description of how these gates commute, making the circuits much easier to analyse and simplify. Furthermore, we leverage a combinatorial description of the interaction between CNOTs and phase gadgets to analyse a periodicity phenomenon in layered ans\"{a}tze and also to simplify a class of circuits commonly used in QML.}
  }
  

  Copy to Clipboard

• Graphical calculi and their conjecture synthesis
  Hector Miller-Bakewell
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford PhD Thesis
  Keywords: ZX-calculus, ZQ-calculus, Automation, Quantomatic, PhD Thesis.

  Categorical Quantum Mechanics, and graphical calculi in particular, has proven to be an intuitive and powerful way to reason about quantum computing. This work continues the exploration of graphical calculi, inside and outside of the quantum computing setting, by investigating the algebraic structures with which we label diagrams. The initial aim for this was Conjecture Synthesis; the algorithmic process of creating theorems. To this process we introduce a generalisation step, which itself requires the ability to infer and then verify parameterised families of theorems. 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. These frameworks inspired further research into the design of graphical calculi, and we introduce two important new calculi here. First is the calculus RING, which 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. It is expected that these results will be of use to those creating optimisation schemes and intermediate representations for quantum computing, to those creating new graphical calculi, and for those performing conjecture synthesis.

  @phdthesis{millerbakewell2020thesis,
      author = {Miller-Bakewell, Hector},
      title = {{Graphical calculi and their conjecture synthesis}},
      year = {2020},
      school = {University of Oxford},
      urldate = {2020-10-08},
      link = {https://arxiv.org/abs/2010.03914},
      keywords = {ZX-calculus, ZQ-calculus, Automation, Quantomatic, PhD Thesis},
      abstract = {Categorical Quantum Mechanics, and graphical calculi in particular, has proven to be an intuitive and powerful way to reason about quantum computing. This work continues the exploration of graphical calculi, inside and outside of the quantum computing setting, by investigating the algebraic structures with which we label diagrams. The initial aim for this was Conjecture Synthesis; the algorithmic process of creating theorems. To this process we introduce a generalisation step, which itself requires the ability to infer and then verify parameterised families of theorems. 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. These frameworks inspired further research into the design of graphical calculi, and we introduce two important new calculi here. First is the calculus RING, which 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. It is expected that these results will be of use to those creating optimisation schemes and intermediate representations for quantum computing, to those creating new graphical calculi, and for those performing conjecture synthesis.}
  }
  

  Copy to Clipboard

• ZX-Calculus and Extended Hypergraph Rewriting Systems I: A Multiway Approach to Categorical Quantum Information Theory
  Jonathan Gorard, Manojna Namuduri and Xerxes D. Arsiwalla
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2010.02752
  Keywords: ZX-calculus, Category Theory.

  Categorical quantum mechanics and the Wolfram model offer distinct but complementary approaches to studying the relationship between diagrammatic rewriting systems over combinatorial structures and the foundations of physics; the objective of the present article is to begin elucidating the formal correspondence between the two methodologies in the context of the ZX-calculus formalism of Coecke and Duncan for reasoning diagrammatically about linear maps between qubits. After briefly summarizing the relevant formalisms, and presenting a categorical formulation of the Wolfram model in terms of adhesive categories and double-pushout rewriting systems, we illustrate how the diagrammatic rewritings of the ZX-calculus can be embedded and realized within the broader context of Wolfram model multiway systems, and illustrate some of the capabilities of the software framework (ZXMultiwaySystem) that we have developed specifically for this purpose. Finally, we present a proof (along with an explicitly computed example) based on the methods of Dixon and Kissinger that the multiway evolution graphs and branchial graphs of the Wolfram model are naturally endowed with a monoidal structure based on rulial composition that is, furthermore, compatible with the monoidal product of ZX-diagrams.

  @article{gorard2020zxcalculus,
      author = {Gorard, Jonathan and Namuduri, Manojna and D. Arsiwalla, Xerxes},
      title = {{ZX-Calculus and Extended Hypergraph Rewriting Systems I: A Multiway Approach to Categorical Quantum Information Theory}},
      year = {2020},
      journal = {arXiv preprint arXiv:2010.02752},
      urldate = {2020-10-05},
      link = {http://arxiv.org/abs/2010.02752},
      keywords = {ZX-calculus, Category Theory},
      abstract = {Categorical quantum mechanics and the Wolfram model offer distinct but complementary approaches to studying the relationship between diagrammatic rewriting systems over combinatorial structures and the foundations of physics; the objective of the present article is to begin elucidating the formal correspondence between the two methodologies in the context of the ZX-calculus formalism of Coecke and Duncan for reasoning diagrammatically about linear maps between qubits. After briefly summarizing the relevant formalisms, and presenting a categorical formulation of the Wolfram model in terms of adhesive categories and double-pushout rewriting systems, we illustrate how the diagrammatic rewritings of the ZX-calculus can be embedded and realized within the broader context of Wolfram model multiway systems, and illustrate some of the capabilities of the software framework (ZXMultiwaySystem) that we have developed specifically for this purpose. Finally, we present a proof (along with an explicitly computed example) based on the methods of Dixon and Kissinger that the multiway evolution graphs and branchial graphs of the Wolfram model are naturally endowed with a monoidal structure based on rulial composition that is, furthermore, compatible with the monoidal product of ZX-diagrams.}
  }
  

  Copy to Clipboard

• [Video] Sparsifying ZX-diagrams for CNOT count 🎥
  Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲

  ZX seminar
  Keywords: ZX-calculus, PyZX, Optimisation, Applied.

  Reducing ZX-diagrams using the technique from "Graph-theoretic simplification" (arXiv:1902.03178) does not result in unique normal forms, but rather one of many equivalent diagrams modulo local complementation and pivoting. The particular choice of normal form can then have a big effect on the CNOT count of the resulting diagram. In this talk, I will show some preliminary efforts to explore this space and use simulated annealing to get the CNOT count down.

  @misc{Kissinger2020Video,
      author = {Kissinger, Aleks},
      title = {{Sparsifying ZX-diagrams for CNOT count}},
      year = {2020},
      howpublished = {ZX seminar},
      urldate = {2020-10-05},
      url = {https://www.youtube.com/watch?v=twtCQ-XF9f8},
      keywords = {ZX-calculus, PyZX, Optimisation, Applied},
      abstract = {Reducing ZX-diagrams using the technique from "Graph-theoretic simplification" (arXiv:1902.03178) does not result in unique normal forms, but rather one of many equivalent diagrams modulo local complementation and pivoting. The particular choice of normal form can then have a big effect on the CNOT count of the resulting diagram. In this talk, I will show some preliminary efforts to explore this space and use simulated annealing to get the CNOT count down.}
  }
  

  Copy to Clipboard

• [Video] ZXCalculus.jl - A Julia package for ZX Calculus for Yao.jl 🎥
  Zhao Chen
  Show abstract ⇲ Show bibdata ⇲

  ZX seminar
  Keywords: ZX-calculus, Automation, Optimisation, Applied.

  ZXCalculus.jl is a Google Summer of Code (GSoC) 2020 project developed this summer to enable Yao's newly developed compiler to be able to simplify quantum circuits using ZX calculus. It is highly inspired by the python project pyzx, and with some custom tweaks. In this talk, we will briefly introduce the Yao's ecosystem in the Julia programming language and give people a tutorial on how to use this ZXCalculus package.

  @misc{Chen2020Video,
      author = {Chen, Zhao},
      title = {{ZXCalculus.jl - A Julia package for ZX Calculus for Yao.jl}},
      year = {2020},
      howpublished = {ZX seminar},
      urldate = {2020-09-21},
      url = {https://www.youtube.com/watch?v=LnzEf0pWQcs},
      keywords = {ZX-calculus, Automation, Optimisation, Applied},
      abstract = {ZXCalculus.jl is a Google Summer of Code (GSoC) 2020 project developed this summer to enable Yao's newly developed compiler to be able to simplify quantum circuits using ZX calculus. It is highly inspired by the python project pyzx, and with some custom tweaks. In this talk, we will briefly introduce the Yao's ecosystem in the Julia programming language and give people a tutorial on how to use this ZXCalculus package.}
  }
  

  Copy to Clipboard

• A Recipe for Quantum Graphical Languages
  Titouan Carette and Emmanuel Jeandel
  Show abstract ⇲ Show bibdata ⇲

  47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
  Keywords: ZX-calculus, ZW-calculus, ZH-calculus, Foundations.

  Different graphical calculi have been proposed to represent quantum computation. First the ZX- calculus [4], followed by the ZW-calculus [12] and then the ZH-calculus [1]. We can wonder if new Z*-calculi will continue to be proposed forever. This article answers negatively. All those language share a common core structure we call Z*-algebras. We classify Z*-algebras up to isomorphism in two dimensional Hilbert spaces and show that they are all variations of the aforementioned calculi. We do the same for linear relations and show that the calculus of [2] is essentially the unique one.

  @inproceedings{carette2020recipe,
      author = {Carette, Titouan and Jeandel, Emmanuel},
      title = {{A Recipe for Quantum Graphical Languages}},
      year = {2020},
      booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
      editor = {Artur Czumaj and Anuj Dawar and Emanuela Merelli},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {168},
      pages = {118:1--118:17},
      publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-138-2},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.ICALP.2020.118},
      urldate = {2020-08-10},
      link = {http://arxiv.org/abs/2008.04193},
      url = {https://drops.dagstuhl.de/opus/volltexte/2020/12525},
      keywords = {ZX-calculus, ZW-calculus, ZH-calculus, Foundations},
      abstract = {Different graphical calculi have been proposed to represent quantum computation. First the ZX- calculus [4], followed by the ZW-calculus [12] and then the ZH-calculus [1]. We can wonder if new Z*-calculi will continue to be proposed forever. This article answers negatively. All those language share a common core structure we call Z*-algebras. We classify Z*-algebras up to isomorphism in two dimensional Hilbert spaces and show that they are all variations of the aforementioned calculi. We do the same for linear relations and show that the calculus of [2] is essentially the unique one.}
  }
  

  Copy to Clipboard

• [Video] A Rosetta Stone for the ZX Calculus and the Surface Code 🎥
  Craig Gidney
  Show abstract ⇲ Show bibdata ⇲

  ZX seminar
  Keywords: ZX-calculus, Lattice Surgery, Surface Code, Applied.

  This is a talk I gave to a ZX calculus reading group, about thinking tools for translating surface code constructions into ZX graphs.

  @misc{Gidney2020Video,
      author = {Gidney, Craig},
      title = {{A Rosetta Stone for the ZX Calculus and the Surface Code}},
      year = {2020},
      howpublished = {ZX seminar},
      urldate = {2020-08-03},
      url = {https://www.youtube.com/watch?v=1ojXEEm_JiI},
      keywords = {ZX-calculus, Lattice Surgery, Surface Code, Applied},
      abstract = {This is a talk I gave to a ZX calculus reading group, about thinking tools for translating surface code constructions into ZX graphs.}
  }
  

  Copy to Clipboard

• A Compositional Model of Consciousness based on Consciousness-Only
  Camilo Miguel Signorelli, Quanlong Wang and Ilyas Khan
  Show abstract ⇲ Show bibdata ⇲

  Entropy
  Keywords: Qudits, Algebraic ZX, Foundations.

  Scientific studies of consciousness rely on objects whose existence is assumed to be independent of any consciousness. On the contrary, we assume consciousness to be fundamental, and that one of the main features of consciousness is characterized as being other-dependent. We set up a framework which naturally subsumes this feature by defining a compact closed category where morphisms represent conscious processes. These morphisms are a composition of a set of generators, each being specified by their relations with other generators, and therefore co-dependent. The framework is general enough and fits well into a compositional model of consciousness. Interestingly, we also show how our proposal may become a step towards avoiding the hard problem of consciousness, and thereby address the combination problem of conscious experiences.

  @article{miguelsignorelli2020compositional,
      author = {Miguel Signorelli, Camilo and Wang, Quanlong and Khan, Ilyas},
      title = {{A Compositional Model of Consciousness based on Consciousness-Only}},
      year = {2020},
      journal = {Entropy},
      volume = {23},
      number = {3},
      article-number = {308},
      issn = {1099-4300},
      doi = {10.3390/e23030308},
      urldate = {2020-07-31},
      link = {http://arxiv.org/abs/2007.16138},
      url = {https://www.mdpi.com/1099-4300/23/3/308},
      keywords = {Qudits, Algebraic ZX, Foundations},
      abstract = {Scientific studies of consciousness rely on objects whose existence is assumed to be independent of any consciousness. On the contrary, we assume consciousness to be fundamental, and that one of the main features of consciousness is characterized as being other-dependent. We set up a framework which naturally subsumes this feature by defining a compact closed category where morphisms represent conscious processes. These morphisms are a composition of a set of generators, each being specified by their relations with other generators, and therefore co-dependent. The framework is general enough and fits well into a compositional model of consciousness. Interestingly, we also show how our proposal may become a step towards avoiding the hard problem of consciousness, and thereby address the combination problem of conscious experiences.}
  }
  

  Copy to Clipboard

• Algebraic complete axiomatisation of ZX-calculus with a normal form via elementary matrix operations
  Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  arXiv:2007.13739
  Keywords: ZX-calculus, Completeness, Algebraic ZX.

  In this paper we give a complete axiomatisation of qubit ZX-calculus via elementary transformations which are basic operations in linear algebra. This formalism has two main advantages. First, all the operations of the phases are algebraic ones without trigonometry functions involved, thus paved the way for generalising complete axiomatisation of qubit ZX-calculus to qudit ZX-calculus and ZX-calculus over commutative semirings. Second, we characterise elementary transformations in terms of ZX diagrams, so a lot of linear algebra stuff can be done purely diagrammatically.

  @article{wang2020algebraic,
      author = {Wang, Quanlong},
      title = {{Algebraic complete axiomatisation of ZX-calculus with a normal form via elementary matrix operations}},
      year = {2020},
      journal = {arXiv preprint arXiv:2007.13739},
      urldate = {2020-07-26},
      link = {http://arxiv.org/abs/2007.13739},
      keywords = {ZX-calculus, Completeness, Algebraic ZX},
      abstract = {In this paper we give a complete axiomatisation of qubit ZX-calculus via elementary transformations which are basic operations in linear algebra. This formalism has two main advantages. First, all the operations of the phases are algebraic ones without trigonometry functions involved, thus paved the way for generalising complete axiomatisation of qubit ZX-calculus to qudit ZX-calculus and ZX-calculus over commutative semirings. Second, we characterise elementary transformations in terms of ZX diagrams, so a lot of linear algebra stuff can be done purely diagrammatically.},
      video = {https://www.youtube.com/watch?v=9V6up7hpqZw}
  }
  

  Copy to Clipboard

• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
  Alexander Cowtan, Will Simmons and Ross Duncan
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2007.10515
  Keywords: Optimisation, Phase gadgets, Chemistry, Applied, ZX-supported.

  We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms which use the Unitary Coupled Cluster (UCC) ansatz, designed to reduce circuit depth and gate count. This is achieved by partitioning Pauli exponential terms into mutually commuting sets. These sets are then diagonalised using Clifford circuits and synthesised using the phase polynomial formalism. This strategy reduces cx depth by 75.4\% on average, and by up to 89.9\%, compared to naive synthesis for a variety of molecules, qubit encodings and basis sets.

  @article{cowtan2020generic,
      author = {Cowtan, Alexander and Simmons, Will and Duncan, Ross},
      title = {{A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz}},
      year = {2020},
      journal = {arXiv preprint arXiv:2007.10515},
      urldate = {2020-07-20},
      link = {http://arxiv.org/abs/2007.10515},
      keywords = {Optimisation, Phase gadgets, Chemistry, Applied, ZX-supported},
      abstract = {We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms which use the Unitary Coupled Cluster (UCC) ansatz, designed to reduce circuit depth and gate count. This is achieved by partitioning Pauli exponential terms into mutually commuting sets. These sets are then diagonalised using Clifford circuits and synthesised using the phase polynomial formalism. This strategy reduces cx depth by 75.4\% on average, and by up to 89.9\%, compared to naive synthesis for a variety of molecules, qubit encodings and basis sets.}
  }
  

  Copy to Clipboard

• Parts of Speech Tagging in NLP: Runtime Optimization with Quantum Formulation and ZX Calculus
  Arit Kumar Bishwas, Ashish Mani and Vasile Palade
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2007.10328
  Keywords: Optimisation, NLP, Applied, ZX-Supported.

  This paper proposes an optimized formulation of the parts of speech tagging in Natural Language Processing with a quantum computing approach and further demonstrates the quantum gate-level runnable optimization with ZX-calculus, keeping the implementation target in the context of Noisy Intermediate Scale Quantum Systems (NISQ). Our quantum formulation exhibits quadratic speed up over the classical counterpart and further demonstrates the implementable optimization with the help of ZX calculus postulates.

  @article{kumarbishwas2020parts,
      author = {Kumar Bishwas, Arit and Mani, Ashish and Palade, Vasile},
      title = {{Parts of Speech Tagging in NLP: Runtime Optimization with Quantum Formulation and ZX Calculus}},
      year = {2020},
      journal = {arXiv preprint arXiv:2007.10328},
      urldate = {2020-07-19},
      link = {http://arxiv.org/abs/2007.10328},
      keywords = {Optimisation, NLP, Applied, ZX-Supported},
      abstract = {This paper proposes an optimized formulation of the parts of speech tagging in Natural Language Processing with a quantum computing approach and further demonstrates the quantum gate-level runnable optimization with ZX-calculus, keeping the implementation target in the context of Noisy Intermediate Scale Quantum Systems (NISQ). Our quantum formulation exhibits quadratic speed up over the classical counterpart and further demonstrates the implementable optimization with the help of ZX calculus postulates.}
  }
  

  Copy to Clipboard

• Colored props for large scale graphical reasoning
  Titouan Carette and Simon Perdrix
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2007.03564
  Keywords: Completeness, Scalable ZX, Category Theory.

  The prop formalism allows representation of processes withstring diagrams and has been successfully applied in various areas such as quantum computing, electric circuits and control flow graphs. However, these graphical approaches suffer from scalability problems when it comes to writing large diagrams. A proposal to tackle this issue has been investigated for ZX-calculus using colored props. This paper extends the approach to any prop, making it a general tool for graphical languages manipulation.

  @article{carette2020colored,
      author = {Carette, Titouan and Perdrix, Simon},
      title = {{Colored props for large scale graphical reasoning}},
      year = {2020},
      journal = {arXiv preprint arXiv:2007.03564},
      urldate = {2020-07-07},
      link = {http://arxiv.org/abs/2007.03564},
      keywords = {Completeness, Scalable ZX, Category Theory},
      abstract = {The prop formalism allows representation of processes withstring diagrams and has been successfully applied in various areas such as quantum computing, electric circuits and control flow graphs. However, these graphical approaches suffer from scalability problems when it comes to writing large diagrams. A proposal to tackle this issue has been investigated for ZX-calculus using colored props. This paper extends the approach to any prop, making it a general tool for graphical languages manipulation.}
  }
  

  Copy to Clipboard

• [Video] Measurement-based quantum computing (MBQC) in the ZX-calculus 🎥
  Miriam Backens
  Show abstract ⇲ Show bibdata ⇲

  ZX seminar
  Keywords: ZX-calculus, MBQC, Applied.

  @misc{Backens2020Video,
      author = {Backens, Miriam},
      title = {{Measurement-based quantum computing (MBQC) in the ZX-calculus}},
      year = {2020},
      howpublished = {ZX seminar},
      urldate = {2020-06-29},
      url = {https://www.youtube.com/watch?v=0KYkTWdvNmo},
      keywords = {ZX-calculus, MBQC, Applied},
      abstract = {}
  }
  

  Copy to Clipboard

• [Video] Enter a visual era: process theory embodied in ZX-calculus 🎥
  Quanglong Wang
  Show abstract ⇲ Show bibdata ⇲

  QPL 2020
  Keywords: ZX-calculus, Triangle, Algebraic ZX, Completeness.

  @misc{Wang2020Video,
      author = {Wang, Quanglong},
      title = {{Enter a visual era: process theory embodied in ZX-calculus}},
      year = {2020},
      howpublished = {QPL 2020},
      urldate = {2020-06-06},
      url = {https://www.youtube.com/watch?v=cZ4CSkTJ8vA},
      keywords = {ZX-calculus, Triangle, Algebraic ZX, Completeness},
      abstract = {}
  }
  

  Copy to Clipboard

• Well-tempered ZX and ZH Calculi
  Niel de Beaudrap
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020
  Keywords: ZX-calculus, ZH-Calculus, Tempered, Scalars.

  The ZX calculus is a mathematical tool to represent and analyse quantum operations by manipulating diagrams which in effect represent tensor networks. Two families of nodes of these networks are ones which commute with either Z rotations or X rotations, usually called "green nodes" and "red nodes" respectively. The original formulation of the ZX calculus was motivated in part by properties of the algebras formed by the green and red nodes: notably, that they form a bialgebra -- but only up to scalar factors. As a consequence, the diagram transformations and notation for certain unitary operations involve "scalar gadgets" which denote contributions to a normalising factor. We present renormalised generators for the ZX calculus, which form a bialgebra precisely. As a result, no scalar gadgets are required to represent the most common unitary transformations, and the corresponding diagram transformations are generally simpler. We also present a similar renormalised version of the ZH calculus. We obtain these results by an analysis of conditions under which various "idealised" rewrites are sound, leveraging the existing presentations of the ZX and ZH calculi.

  @inproceedings{debeaudrap2020welltempered,
      author = {de Beaudrap, Niel},
      title = {{Well-tempered ZX and ZH Calculi}},
      year = {2021},
      booktitle = {Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020},
      editor = {Valiron, Beno\^it and Mansfield, Shane and Arrighi, Pablo and Panangaden, Prakash},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {340},
      pages = {13-45},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.340.2},
      urldate = {2020-06-03},
      link = {http://arxiv.org/abs/2006.02557},
      keywords = {ZX-calculus,ZH-Calculus,Tempered, Scalars},
      abstract = {The ZX calculus is a mathematical tool to represent and analyse quantum operations by manipulating diagrams which in effect represent tensor networks. Two families of nodes of these networks are ones which commute with either Z rotations or X rotations, usually called "green nodes" and "red nodes" respectively. The original formulation of the ZX calculus was motivated in part by properties of the algebras formed by the green and red nodes: notably, that they form a bialgebra -- but only up to scalar factors. As a consequence, the diagram transformations and notation for certain unitary operations involve "scalar gadgets" which denote contributions to a normalising factor. We present renormalised generators for the ZX calculus, which form a bialgebra precisely. As a result, no scalar gadgets are required to represent the most common unitary transformations, and the corresponding diagram transformations are generally simpler. We also present a similar renormalised version of the ZH calculus. We obtain these results by an analysis of conditions under which various "idealised" rewrites are sound, leveraging the existing presentations of the ZX and ZH calculi.},
      video = {https://www.youtube.com/watch?v=3qivz98DhA8}
  }
  

  Copy to Clipboard

• Quantum Natural Language Processing on Near-Term Quantum Computers
  Konstantinos Meichanetzidis, Stefano Gogioso, Giovanni de Felice, Nicolò Chiappori, Alexis Toumi and Bob Coecke
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020
  Keywords: ZX-calculus, NLP, Applied.

  In this work, we describe a full-stack pipeline for natural language processing on near-term quantum computers, aka QNLP. The language modelling framework we employ is that of compositional distributional semantics (DisCoCat), which extends and complements the compositional structure of pregroup grammars. Within this model, the grammatical reduction of a sentence is interpreted as a diagram, encoding a specific interaction of words according to the grammar. It is this interaction which, together with a specific choice of word embedding, realises the meaning (or "semantics") of a sentence. Building on the formal quantum-like nature of such interactions, we present a method for mapping DisCoCat diagrams to quantum circuits. Our methodology is compatible both with NISQ devices and with established Quantum Machine Learning techniques, paving the way to near-term applications of quantum technology to natural language processing.

  @inproceedings{meichanetzidis2020quantum,
      author = {Meichanetzidis, Konstantinos and Gogioso, Stefano and de Felice, Giovanni and Chiappori, Nicol\`o and Toumi, Alexis and Coecke, Bob},
      title = {{Quantum Natural Language Processing on Near-Term Quantum Computers}},
      year = {2021},
      booktitle = {Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020},
      editor = {Valiron, Beno\^it and Mansfield, Shane and Arrighi, Pablo and Panangaden, Prakash},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {340},
      pages = {213-229},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.340.11},
      urldate = {2020-05-08},
      link = {http://arxiv.org/abs/2005.04147},
      keywords = {ZX-calculus, NLP, Applied},
      abstract = {In this work, we describe a full-stack pipeline for natural language processing on near-term quantum computers, aka QNLP. The language modelling framework we employ is that of compositional distributional semantics (DisCoCat), which extends and complements the compositional structure of pregroup grammars. Within this model, the grammatical reduction of a sentence is interpreted as a diagram, encoding a specific interaction of words according to the grammar. It is this interaction which, together with a specific choice of word embedding, realises the meaning (or "semantics") of a sentence. Building on the formal quantum-like nature of such interactions, we present a method for mapping DisCoCat diagrams to quantum circuits. Our methodology is compatible both with NISQ devices and with established Quantum Machine Learning techniques, paving the way to near-term applications of quantum technology to natural language processing.},
      video = {https://www.youtube.com/watch?v=4Tw7BO7PyV4}
  }
  

  Copy to Clipboard

• Benchmarking ZX-Calculus Circuit Optimization Against Qiskit Transpilation
  Lia Yeh, Emma Dasgupta and Erick Winston
  Show abstract ⇲ Show bibdata ⇲

  ACM SRC Grand Finals Candidates
  Keywords: ZX-calculus, PyZX, Optimisation, Applied.

  Quantum hardware and algorithms researchers alike have expressed the critical need for and shortage of expertise in quantum programming languages, compilation, and computer architecture. We design, implement, and benchmark quantum compilation and visualization in PyZX, a Python tool for the ZX-calculus, applied to Qiskit, the most widely-used quantum programming language. We demonstrate correct circuit optimization by our Qiskit transpiler pass on 1000 two qubit Randomized Benchmarking circuits, reducing gate count of 29% of the circuits further than Qiskit’s default transpiler.

  @article{yeh2021benchmarking,
      author = {Yeh, Lia and Dasgupta, Emma and Winston, Erick},
      title = {{Benchmarking ZX-Calculus Circuit Optimization Against Qiskit Transpilation}},
      year = {2020},
      journal = {ACM SRC Grand Finals Candidates},
      urldate = {2020-05-01},
      link = {https://src.acm.org/binaries/content/assets/src/2020/lia-yeh.pdf},
      keywords = {ZX-calculus, PyZX, Optimisation, Applied},
      abstract = {Quantum hardware and algorithms researchers alike have expressed the critical need for and shortage of expertise in quantum programming languages, compilation, and computer architecture. We design, implement, and benchmark quantum compilation and visualization in PyZX, a Python tool for the ZX-calculus, applied to Qiskit, the most widely-used quantum programming language. We demonstrate correct circuit optimization by our Qiskit transpiler pass on 1000 two qubit Randomized Benchmarking circuits, reducing gate count of 29% of the circuits further than Qiskit’s default transpiler.}
  }
  

  Copy to Clipboard

• The ZX&-calculus: A complete graphical calculus for classical circuits using spiders
  Cole Comfort
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020
  Keywords: ZX&, AND gates, Classical circuits, Completeness.

  We give a complete presentation for the fragment, ZX\&, of the ZX-calculus generated by the Z and X spiders (corresponding to copying and addition) along with the not gate and the and gate. To prove completeness, we freely add units and counits to the category TOF generated by the Toffoli gate and ancillary bits, showing that this yields the strictification of spans of powers of the two element set; and then perform a two way translation between this category and ZX\&. A translation to some extension of TOF, as opposed to some fragment of the ZX-calculus, is a natural choice because of the multiplicative nature of the Toffoli gate. To this end, we show that freely adding counits to the semi-Frobenius algebra of a discrete inverse category is the same as computing the "environment structure" of the classical structures of the base discrete inverse category. We show that in this setting, the classical channels and the discrete Cartesian completion are the same constructions. Therefore, in the case of TOF, freely adding a counit, constructing the category of quantum channels, and computing the discrete Cartesian completion are all equivalent to partial functions between powers of the two element set. By glueing together the free counit completion and the free unit completion, this yields the strictification of spans between powers of the two element set.

  @inproceedings{Cole2020ZXand,
      author = {Comfort, Cole},
      title = {{The ZX\&-calculus: A complete graphical calculus for classical circuits using spiders}},
      year = {2021},
      booktitle = {Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020},
      editor = {Valiron, Beno\^it and Mansfield, Shane and Arrighi, Pablo and Panangaden, Prakash},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {340},
      pages = {60-90},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.340.4},
      urldate = {2020-04-29},
      link = {https://arxiv.org/abs/2004.05287},
      keywords = { ZX\&, AND gates, Classical circuits, Completeness},
      abstract = {We give a complete presentation for the fragment, ZX\&, of the ZX-calculus generated by the Z and X spiders (corresponding to copying and addition) along with the not gate and the and gate. To prove completeness, we freely add units and counits to the category TOF generated by the Toffoli gate and ancillary bits, showing that this yields the strictification of spans of powers of the two element set; and then perform a two way translation between this category and ZX\&. A translation to some extension of TOF, as opposed to some fragment of the ZX-calculus, is a natural choice because of the multiplicative nature of the Toffoli gate. To this end, we show that freely adding counits to the semi-Frobenius algebra of a discrete inverse category is the same as computing the "environment structure" of the classical structures of the base discrete inverse category. We show that in this setting, the classical channels and the discrete Cartesian completion are the same constructions. Therefore, in the case of TOF, freely adding a counit, constructing the category of quantum channels, and computing the discrete Cartesian completion are all equivalent to partial functions between powers of the two element set. By glueing together the free counit completion and the free unit completion, this yields the strictification of spans between powers of the two element set. },
      video = {https://www.youtube.com/watch?v=UwAd-3louBU}
  }
  

  Copy to Clipboard

• Tensor Network Rewriting Strategies for Satisfiability and Counting
  Niel de Beaudrap, Aleks Kissinger and Konstantinos Meichanetzidis
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020
  Keywords: ZH-calculus, Tensor networks, SAT, Applied.

  We provide a graphical treatment of SAT and \#SAT on equal footing. Instances of \#SAT can be represented as tensor networks in a standard way. These tensor networks are interpreted by diagrams of the ZH-calculus: a system to reason about tensors over \(\mathbb{C}\) in terms of diagrams built from simple generators, in which computation may be carried out by \emph{transformations of diagrams alone}. In general, nodes of ZH diagrams take parameters over \(\mathbb{C}\) which determine the tensor coefficients; for the standard representation of \#SAT instances, the coefficients take the value \(0\) or \(1\). Then, by choosing the coefficients of a diagram to range over \(\mathbb B\), we represent the corresponding instance of SAT. Thus, by interpreting a diagram either over the boolean semiring or the complex numbers, we instantiate either the \emph{decision} or \emph{counting} version of the problem. We find that for classes known to be in P, such as \(2\)SAT and \#XORSAT, the existence of appropriate rewrite rules allows for efficient simplification of the diagram, producing the solution in polynomial time. In contrast, for classes known to be NP-complete, such as \(3\)SAT, or \#P-complete, such as \#\(2\)SAT, the corresponding rewrite rules introduce hyperedges to the diagrams, in numbers which are not easily bounded above by a polynomial. This diagrammatic approach unifies the diagnosis of the complexity of CSPs and \#CSPs and shows promise in aiding tensor network contraction-based algorithms.

  @inproceedings{debeaudrap2020tensor,
      author = {de Beaudrap, Niel and Kissinger, Aleks and Meichanetzidis, Konstantinos},
      title = {{Tensor Network Rewriting Strategies for Satisfiability and Counting}},
      year = {2021},
      booktitle = {Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020},
      editor = {Valiron, Beno\^it and Mansfield, Shane and Arrighi, Pablo and Panangaden, Prakash},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {340},
      pages = {46-59},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.340.3},
      urldate = {2020-04-14},
      link = {http://arxiv.org/abs/2004.06455},
      keywords = {ZH-calculus, Tensor networks, SAT, Applied},
      abstract = {We provide a graphical treatment of SAT and \#SAT on equal footing. Instances of \#SAT can be represented as tensor networks in a standard way. These tensor networks are interpreted by diagrams of the ZH-calculus: a system to reason about tensors over $\mathbb{C}$ in terms of diagrams built from simple generators, in which computation may be carried out by \emph{transformations of diagrams alone}. In general, nodes of ZH diagrams take parameters over $\mathbb{C}$ which determine the tensor coefficients; for the standard representation of \#SAT instances, the coefficients take the value $0$ or $1$. Then, by choosing the coefficients of a diagram to range over $\mathbb B$, we represent the corresponding instance of SAT. Thus, by interpreting a diagram either over the boolean semiring or the complex numbers, we instantiate either the \emph{decision} or \emph{counting} version of the problem. We find that for classes known to be in P, such as $2$SAT and \#XORSAT, the existence of appropriate rewrite rules allows for efficient simplification of the diagram, producing the solution in polynomial time. In contrast, for classes known to be NP-complete, such as $3$SAT, or \#P-complete, such as \#$2$SAT, the corresponding rewrite rules introduce hyperedges to the diagrams, in numbers which are not easily bounded above by a polynomial. This diagrammatic approach unifies the diagnosis of the complexity of CSPs and \#CSPs and shows promise in aiding tensor network contraction-based algorithms.},
      video = {https://www.youtube.com/watch?v=JYnkOflmF5M}
  }
  

  Copy to Clipboard

• Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices
  Arianne Meijer-van de Griend and Ross Duncan
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022
  Keywords: Phase gadgets, Optimisation, Applied, ZX-Supported.

  We propose a new algorithm to synthesise quantum circuits for phase polynomials, which takes into account the qubit connectivity of the quantum computer. We focus on the architectures of currently available NISQ devices. Our algorithm generates circuits with a smaller CNOT depth than the algorithms currently used in Staq and t\(|\)ket\(\rangle\), while improving the runtime with respect the former.

  @inproceedings{meijer-vandegriend2023architectureaware,
      author = {Meijer-van de Griend, Arianne and Duncan, Ross},
      title = {Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices},
      year = {2023},
      booktitle = {Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022},
      editor = {Gogioso, Stefano and Hoban, Matty},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {394},
      pages = {116-140},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.394.8},
      urldate = {2020-04-13},
      link = {http://arxiv.org/abs/2004.06052},
      keywords = {Phase gadgets, Optimisation, Applied, ZX-Supported},
      abstract = {We propose a new algorithm to synthesise quantum circuits for phase polynomials, which takes into account the qubit connectivity of the quantum computer. We focus on the architectures of currently available NISQ devices. Our algorithm generates circuits with a smaller CNOT depth than the algorithms currently used in Staq and t$|$ket$\rangle$, while improving the runtime with respect the former.},
      video = {https://www.youtube.com/watch?v=uOAA0nbh9MI}
  }
  

  Copy to Clipboard

• Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities
  Niel de Beaudrap, Xiaoning Bian and Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲

  15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)
  Keywords: T-count, Optimisation, Applied, ZX-Supported.

  In fault-tolerant quantum computing systems, realising (approximately) universal quantum computation is usually described in terms of realising Clifford+T operations, which is to say a circuit of CNOT, Hadamard, and π/2-phase rotations, together with T operations (π/4-phase rotations). For many error correcting codes, fault-tolerant realisations of Clifford operations are significantly less resource-intensive than those of T gates, which motivates finding ways to realise the same transformation involving T-count (the number of T gates involved) which is as low as possible. Investigations into this problem [arXiv:1206.0758, 1303.2042, 1308.4134, 1601.07363, 1606.01904, 1701.00140] has led to observations that this problem is closely related to NP-hard tensor decomposition problems [arXiv:1712.01557] and is tantamount to the difficult problem of decoding exponentially long Reed-Muller codes [arXiv:1601.07363]. This problem then presents itself as one for which must be content in practise with approximate optimisation, in which one develops an array of tactics to be deployed through some pragmatic strategy. In this vein, we describe techniques to reduce the T-count, based on the effective application of "spider nest identities": easily recognised products of parity-phase operations which are equivalent to the identity operation. We demonstrate the effectiveness of such techniques by obtaining improvements in the T-counts of a number of circuits, in run-times which are typically less than the time required to make a fresh cup of coffee.

  @inproceedings{deBeaudrapN2020treducspidernest,
      author = {Niel de Beaudrap and Xiaoning Bian and Quanlong Wang},
      title = {{Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities}},
      year = {2020},
      booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
      editor = {Steven T. Flammia},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {158},
      pages = {11:1--11:23},
      publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-146-7},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.TQC.2020.11},
      urldate = {2020-04-10},
      link = {https://arxiv.org/abs/2004.05164},
      keywords = {T-count, Optimisation, Applied, ZX-Supported},
      abstract = {In fault-tolerant quantum computing systems, realising (approximately) universal quantum computation is usually described in terms of realising Clifford+T operations, which is to say a circuit of CNOT, Hadamard, and π/2-phase rotations, together with T operations (π/4-phase rotations). For many error correcting codes, fault-tolerant realisations of Clifford operations are significantly less resource-intensive than those of T gates, which motivates finding ways to realise the same transformation involving T-count (the number of T gates involved) which is as low as possible. Investigations into this problem [arXiv:1206.0758, 1303.2042, 1308.4134, 1601.07363, 1606.01904, 1701.00140] has led to observations that this problem is closely related to NP-hard tensor decomposition problems [arXiv:1712.01557] and is tantamount to the difficult problem of decoding exponentially long Reed-Muller codes [arXiv:1601.07363]. This problem then presents itself as one for which must be content in practise with approximate optimisation, in which one develops an array of tactics to be deployed through some pragmatic strategy. In this vein, we describe techniques to reduce the T-count, based on the effective application of "spider nest identities": easily recognised products of parity-phase operations which are equivalent to the identity operation. We demonstrate the effectiveness of such techniques by obtaining improvements in the T-counts of a number of circuits, in run-times which are typically less than the time required to make a fresh cup of coffee. },
      urn = {urn:nbn:de:0030-drops-120705}
  }
  

  Copy to Clipboard

• Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus
  Louis Lemonnier, John van de Wetering and Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020
  Keywords: ZH-calculus, Fourier, Sum-Over-Paths, Hypergraph, Local Complementation.

  The ZH-calculus is a complete graphical calculus for linear maps between qubits that admits, for example, a straightforward encoding of hypergraph states and circuits arising from the Toffoli+Hadamard gate set. In this paper, we establish a correspondence between the ZH-calculus and the path-sum formalism, a technique recently introduced by Amy to verify quantum circuits. In particular, we find a bijection between certain canonical forms of ZH-diagrams and path-sum expressions. We then introduce and prove several new simplification rules for the ZH-calculus, which are in direct correspondence to the simplification rules of the path-sum formalism. The relatively opaque path-sum rules are shown to arise naturally as the convergence of two consequences of the ZH-calculus. The first is the extension of the familiar graph-theoretic simplifications based on local complementation and pivoting to their hypergraph-theoretic analogues: hyper-local complementation and hyper-pivoting. The second is the graphical Fourier transform introduced by Kuijpers et al., which enables effective simplification of ZH-diagrams encoding multi-linear phase polynomials with arbitrary real coefficients.

  @inproceedings{Lemonnier2020Hypergraph,
      author = {Lemonnier, Louis and van de Wetering, John and Kissinger, Aleks},
      title = {{Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus}},
      year = {2021},
      booktitle = {Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020},
      editor = {Valiron, Beno\^it and Mansfield, Shane and Arrighi, Pablo and Panangaden, Prakash},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {340},
      pages = {188-212},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.340.10},
      urldate = {2020-03-30},
      link = {https://arxiv.org/abs/2003.13564},
      keywords = {ZH-calculus, Fourier, Sum-Over-Paths, Hypergraph, Local Complementation},
      abstract = {The ZH-calculus is a complete graphical calculus for linear maps between qubits that admits, for example, a straightforward encoding of hypergraph states and circuits arising from the Toffoli+Hadamard gate set. In this paper, we establish a correspondence between the ZH-calculus and the path-sum formalism, a technique recently introduced by Amy to verify quantum circuits. In particular, we find a bijection between certain canonical forms of ZH-diagrams and path-sum expressions. We then introduce and prove several new simplification rules for the ZH-calculus, which are in direct correspondence to the simplification rules of the path-sum formalism. The relatively opaque path-sum rules are shown to arise naturally as the convergence of two consequences of the ZH-calculus. The first is the extension of the familiar graph-theoretic simplifications based on local complementation and pivoting to their hypergraph-theoretic analogues: hyper-local complementation and hyper-pivoting. The second is the graphical Fourier transform introduced by Kuijpers et al., which enables effective simplification of ZH-diagrams encoding multi-linear phase polynomials with arbitrary real coefficients.},
      video = {https://www.youtube.com/watch?v=YVKup5ppqSU}
  }
  

  Copy to Clipboard

• Entanglement and Quaternions: The graphical calculus ZQ
  Hector Miller-Bakewell
  Show abstract ⇲ Show bibdata ⇲

  arXiv:2003.09999
  Keywords: ZQ-Calculus, Quaternions, Completeness.

  Graphical calculi are vital tools for representing and reasoning about quantum circuits and processes. Some are not only graphically intuitive but also logically complete. The best known of these is the ZX-calculus, which is an industry candidate for an Intermediate Representation; a language that sits between the algorithm designer's intent and the quantum hardware's gate instructions. The ZX calculus, built from generalised Z and X rotations, has difficulty reasoning about arbitrary rotations. This contrasts with the cross-hardware compiler TriQ which uses these arbitrary rotations to exploit hardware efficiencies. In this paper we introduce the graphical calculus ZQ, which uses quaternions to represent these arbitrary rotations, similar to TriQ, and the phase-free Z spider to represent entanglement, similar to ZX. 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. This new calculus extends the zoo of qubit graphical calculi, each with different strengths, and we hope it will provide a common language for the optimisation procedures of both ZX and TriQ.

  @article{MillerBakewell2020ZQ,
      author = {Hector Miller-Bakewell},
      title = {{Entanglement and Quaternions: The graphical calculus ZQ}},
      year = {2020},
      journal = {arXiv preprint arXiv:2003.09999},
      urldate = {2020-03-22},
      link = {https://arxiv.org/abs/2003.09999},
      keywords = {ZQ-Calculus,Quaternions, Completeness},
      abstract = {Graphical calculi are vital tools for representing and reasoning about quantum circuits and processes. Some are not only graphically intuitive but also logically complete. The best known of these is the ZX-calculus, which is an industry candidate for an Intermediate Representation; a language that sits between the algorithm designer's intent and the quantum hardware's gate instructions. The ZX calculus, built from generalised Z and X rotations, has difficulty reasoning about arbitrary rotations. This contrasts with the cross-hardware compiler TriQ which uses these arbitrary rotations to exploit hardware efficiencies. In this paper we introduce the graphical calculus ZQ, which uses quaternions to represent these arbitrary rotations, similar to TriQ, and the phase-free Z spider to represent entanglement, similar to ZX. 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. This new calculus extends the zoo of qubit graphical calculi, each with different strengths, and we hope it will provide a common language for the optimisation procedures of both ZX and TriQ.}
  }
  

  Copy to Clipboard

• The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford
  Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  Foundations of Software Science and Computation Structures
  Keywords: ZH-Calculus, Clifford Fragment, Sum-Over-Paths.

  We show that the formalism of "Sum-Over-Path" (SOP), used for symbolically representing linear maps or quantum operators, together with a proper rewrite system, has a structure of dagger-compact PROP. Several consequences arise from this observation: 1) Morphisms of SOP are very close to the diagrams of the graphical calculus called ZH-Calculus, so we give a system of interpretation between the two; 2) A construction, called the discard construction, can be applied to enrich the formalism so that, in particular, it can represent the quantum measurement. We also enrich the rewrite system so as to get the completeness of the Clifford fragments of both the initial formalism and its enriched version.

  @inproceedings{pathsRenaud,
      author = {Renaud Vilmart},
      title = {{The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford}},
      year = {2021},
      booktitle = {Foundations of Software Science and Computation Structures},
      editor = {Kiefer, Stefan and Tasson, Christine},
      pages = {531--550},
      publisher = {Springer International Publishing},
      address = {Cham},
      isbn = {978-3-030-71995-1},
      doi = {10.1007/978-3-030-71995-1_27},
      urldate = {2020-03-12},
      link = {https://arxiv.org/abs/2003.05678},
      keywords = {ZH-Calculus,Clifford Fragment,Sum-Over-Paths },
      abstract = {We show that the formalism of "Sum-Over-Path" (SOP), used for symbolically representing linear maps or quantum operators, together with a proper rewrite system, has a structure of dagger-compact PROP. Several consequences arise from this observation: 1) Morphisms of SOP are very close to the diagrams of the graphical calculus called ZH-Calculus, so we give a system of interpretation between the two; 2) A construction, called the discard construction, can be applied to enrich the formalism so that, in particular, it can represent the quantum measurement. We also enrich the rewrite system so as to get the completeness of the Clifford fragments of both the initial formalism and its enriched version.}
  }
  

  Copy to Clipboard

• There and back again: A circuit extraction tale
  Miriam Backens, Hector Miller-Bakewell, Giovanni de Felice, Leo Lobski and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Quantum
  Keywords: ZX-Calculus, circuit extraction, MBQC, gflow, Optimisation, Graph States, Phase Gadgets, Applied.

  We give the first circuit-extraction algorithm to work for one-way computations containing measurements in all three planes and having gflow. The algorithm is efficient and the resulting circuits do not contain ancillae. One-way computations are represented using the ZX-calculus, hence the algorithm also represents the most general known procedure for extracting circuits from ZX-diagrams. In developing this algorithm, we generalise several concepts and results previously known for computations containing only XY-plane measurements. We bring together several known rewrite rules for measurement patterns and formalise them in a unified notation using the ZX-calculus. These rules are used to simplify measurement patterns by reducing the number of qubits while preserving both the semantics and the existence of gflow. The results can be applied to circuit optimisation by translating circuits to patterns and back again.

  @article{Backens2020extraction,
      author = {Backens, Miriam  and  Miller-Bakewell, Hector and  de Felice, Giovanni and Lobski, Leo and van de Wetering, John},
      title = {{There and back again: A circuit extraction tale}},
      year = {2021},
      journal = {{Quantum}},
      volume = {5},
      month = {3},
      pages = {421},
      publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
      issn = {2521-327X},
      doi = {10.22331/q-2021-03-25-421},
      urldate = {2020-03-03},
      link = {https://arxiv.org/abs/2003.01664},
      keywords = {ZX-Calculus, circuit extraction, MBQC, gflow, Optimisation, Graph States, Phase Gadgets, Applied},
      abstract = {We give the first circuit-extraction algorithm to work for one-way computations containing measurements in all three planes and having gflow. The algorithm is efficient and the resulting circuits do not contain ancillae. One-way computations are represented using the ZX-calculus, hence the algorithm also represents the most general known procedure for extracting circuits from ZX-diagrams. In developing this algorithm, we generalise several concepts and results previously known for computations containing only XY-plane measurements. We bring together several known rewrite rules for measurement patterns and formalise them in a unified notation using the ZX-calculus. These rules are used to simplify measurement patterns by reducing the number of qubits while preserving both the semantics and the existence of gflow. The results can be applied to circuit optimisation by translating circuits to patterns and back again.},
      video = {https://www.youtube.com/watch?v=Orilw6ujWag}
  }
  

  Copy to Clipboard

• Analysis of quantum hypergraph states in the ZH-calculus
  Mateusz Kupper
  Show abstract ⇲ Show bibdata ⇲

  University of Edinburgh Masters Thesis
  Keywords: ZH-Calculus, MBQC, Hypergraph, Graph States, Master Thesis.

  In this dissertation, we prove the known quantum hypergraph state manipulation rules, and introduce metarules for showing the correctness of measurement-based quantum computing (MBQC) resource states and measurement patterns in the ZH-calculus. In particular, we study the action of local Pauli operators on quantum hypergraph states, prove the generalisation of local complementation laws for hypergraph states and derive hypergraph transformation rules for local measurements, which have never been studied in the graphical calculus before. We then apply the derived metarules to study the two hypergraph-based MBQC states: the Union Jack state and the Takeuchi-Morimae-Hayashi state. Our examples show that the use of graphical calculus yields simple and intuitive proofs; in particular the metarules provide a formal and straightforward way of validating MBQC measurement patterns.

  @mastersthesis{KupperThesis,
      author = {Kupper, Mateusz},
      title = {{Analysis of quantum hypergraph states in the ZH-calculus}},
      year = {2019},
      school = {University of Edinburgh},
      urldate = {2020-01-01},
      link = {https://www.researchgate.net/publication/339377025_Analysis_of_quantum_hypergraph_states_in_the_ZH-calculus},
      keywords = {ZH-Calculus, MBQC, Hypergraph, Graph States, Master Thesis},
      abstract = {In this dissertation, we prove the known quantum hypergraph state manipulation rules, and introduce metarules for showing the correctness of measurement-based quantum computing (MBQC) resource states and measurement patterns in the ZH-calculus. In particular, we study the action of local Pauli operators on quantum hypergraph states, prove the generalisation of local complementation laws for hypergraph states and derive hypergraph transformation rules for local measurements, which have never been studied in the graphical calculus before. We then apply the derived metarules to study the two hypergraph-based MBQC states: the Union Jack state and the Takeuchi-Morimae-Hayashi state. Our examples show that the use of graphical calculus yields simple and intuitive proofs; in particular the metarules provide a formal and straightforward way of validating MBQC measurement patterns.}
  }
  

  Copy to Clipboard

2019

• Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
  Michael Hanks, Marta P. Estarellas, William J. Munro and Kae Nemoto
  Show abstract ⇲ Show bibdata ⇲

  Physical Review X
  Keywords: Lattice surgery, Surface Code, Optimisation, Applied.

  Mapping a quantum algorithm to any practical large-scale quantum computer will require a sequence of compilations and optimizations. At the level of fault-tolerant encoding, one likely requirement of this process is the translation into a topological circuit, for which braided circuits represent one candidate model. Given the large overhead associated with encoded circuits, it is paramount to reduce their size in terms of computation time and qubit number through circuit compression. While these optimizations have typically been performed in the language of three-dimensional diagrams, such a representation does not allow an efficient, general, and scalable approach to reduction or verification. We propose the use of the ZX-calculus as an intermediate language for braided circuit compression, demonstrating advantage by comparing results using this approach with those previously obtained for the compression of A- and Y-state distillation circuits. We then provide a benchmark of our method against a small set of Clifford+T circuits, yielding compression percentages of 77%. Our results suggest that the overheads of braided, defect-based circuits are comparable to those of their lattice-surgery counterparts, restoring the potential of this model for surface-code quantum computation.

  @article{hanks2019effective,
      author = {Hanks, Michael and P. Estarellas, Marta and J. Munro, William and Nemoto, Kae},
      title = {{Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus}},
      year = {2020},
      journal = {Physical Review X},
      volume = {10},
      issue = {4},
      pages = {041030},
      doi = {10.1103/PhysRevX.10.041030},
      urldate = {2019-12-24},
      link = {http://arxiv.org/abs/1912.11503},
      keywords = {Lattice surgery, Surface Code, Optimisation, Applied},
      abstract = {Mapping a quantum algorithm to any practical large-scale quantum computer will require a sequence of compilations and optimizations. At the level of fault-tolerant encoding, one likely requirement of this process is the translation into a topological circuit, for which braided circuits represent one candidate model. Given the large overhead associated with encoded circuits, it is paramount to reduce their size in terms of computation time and qubit number through circuit compression. While these optimizations have typically been performed in the language of three-dimensional diagrams, such a representation does not allow an efficient, general, and scalable approach to reduction or verification. We propose the use of the ZX-calculus as an intermediate language for braided circuit compression, demonstrating advantage by comparing results using this approach with those previously obtained for the compression of A- and Y-state distillation circuits. We then provide a benchmark of our method against a small set of Clifford+T circuits, yielding compression percentages of 77%. Our results suggest that the overheads of braided, defect-based circuits are comparable to those of their lattice-surgery counterparts, restoring the potential of this model for surface-code quantum computation.}
  }
  

  Copy to Clipboard

• On completeness of algebraic ZX-calculus over arbitrary commutative rings and semirings
  Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲

  arXiv:1912.01003
  Keywords: ZX-calculus, Completeness, Rings.

  ZX-calculus is a strict mathematical formalism for graphical quantum computing which is based on the field of complex numbers. In this paper, we extend its power by generalising ZX-calculus to such an extent that it both in an arbitrary commutative ring and an arbitrary commutative semiring. We follow the framework of arXiv:2007.13739 to prove that the proposed ZX-calculus over an arbitrary commutative ring is complete for matrices over the same ring, via a normal form inspired from matrix elementary operations such as row addition and row multiplication. This work paves the way for doing elementary number theory in string diagrams. The proof of completeness for ZX-calculus over arbitrary commutative semirings is quite similar, whose details will be provided in a forthcoming version.

  @article{ringZX,
      author = {Wang, Quanlong},
      title = {{On completeness of algebraic ZX-calculus over arbitrary commutative rings and semirings}},
      year = {2019},
      journal = {arXiv preprint arXiv:1912.01003},
      urldate = {2019-12-02},
      link = {https://arxiv.org/abs/1912.01003},
      keywords = {ZX-calculus, Completeness, Rings},
      abstract = {ZX-calculus is a strict mathematical formalism for graphical quantum computing which is based on the field of complex numbers. In this paper, we extend its power by generalising ZX-calculus to such an extent that it both in an arbitrary commutative ring and an arbitrary commutative semiring. We follow the framework of arXiv:2007.13739 to prove that the proposed ZX-calculus over an arbitrary commutative ring is complete for matrices over the same ring, via a normal form inspired from matrix elementary operations such as row addition and row multiplication. This work paves the way for doing elementary number theory in string diagrams. The proof of completeness for ZX-calculus over arbitrary commutative semirings is quite similar, whose details will be provided in a forthcoming version.}
  }
  

  Copy to Clipboard

• ZX-Calculus and Quantum Stabilizer Theory
  Coen Borghans
  Show abstract ⇲ Show bibdata ⇲

  Radboud University Masters Thesis
  Keywords: ZX-Calculus, Clifford Fragment, Master Thesis.

  We will look at how we can convert between ZX-Calculus and stabilizer theory. This means that we develop a procedure to find stabilizers for a given state in the ZX-Calculus as well as a method to create a ZX-state for a given set of stabilizers. These are then presented as algorithms that can be efficiently implemented.

  @mastersthesis{borghans2019masters,
      author = {Borghans, Coen},
      title = {{ZX-Calculus and Quantum Stabilizer Theory}},
      year = {2019},
      school = {Radboud University},
      urldate = {2019-11-20},
      link = {https://www.cs.ox.ac.uk/people/aleks.kissinger/papers/borghans-thesis.pdf},
      keywords = {ZX-Calculus, Clifford Fragment, Master Thesis},
      abstract = {We will look at how we can convert between ZX-Calculus and stabilizer theory. This means that we develop a procedure to find stabilizers for a given state in the ZX-Calculus as well as a method to create a ZX-state for a given set of stabilizers. These are then presented as algorithms that can be efficiently implemented.}
  }
  

  Copy to Clipboard

• Techniques to Reduce $π/4$-Parity-Phase Circuits, Motivated by the ZX Calculus
  Niel de Beaudrap, Xiaoning Bian and Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲

  Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019
  Keywords: Optimisation, T-count, Clifford+T, ZX-calculus, Applied, ZX-Supported.

  To approximate arbitrary unitary transformations on one or more qubits, one must perform transformations which are outside of the Clifford group. The gate most commonly considered for this purpose is the T=diag(1,exp(i\pi/4)) gate. As T gates are computationally expensive to perform fault-tolerantly in the most promising error-correction technologies, minimising the "T-count" (the number of T gates) required to realise a given unitary in a Clifford+T circuit is of great interest. We describe techniques to find circuits with reduced T-count in unitary circuits, which develop on the ideas of Heyfron and Campbell [arXiv:1712.01557] with the help of the ZX calculus. Following [arXiv:1712.01557], we reduce the problem to that of minimising the T count of a CNOT+T circuit. The ZX calculus motivates a further reduction to simplifying a product of commuting "\pi/4-parity-phase" operations: diagonal unitary transformations which induce a relative phase of exp(i\pi/4) depending on the outcome of a parity computation on the standard basis (which motivated Kissinger and van de Wetering [1903.10477] to introduce "phase gadgets"). For a number of standard benchmark circuits, we show that these techniques --- in some cases supplemented by the TODD subroutine of Heyfron and Campbell [arXiv:1712.01557] --- yield T-counts comparable to or better than the best previously known results.

  @inproceedings{deBeaudrap2020Techniques,
      author = {de Beaudrap, Niel and Bian, Xiaoning and Wang, Quanlong},
      title = {{Techniques to Reduce $\pi/4$-Parity-Phase Circuits, Motivated by the ZX Calculus}},
      year = {2020},
      booktitle = {Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019},
      editor = {Coecke, Bob and Leifer, Matthew},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {318},
      pages = {131-149},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.318.9},
      urldate = {2019-11-20},
      link = {https://arxiv.org/abs/1911.09039},
      keywords = {Optimisation, T-count, Clifford+T, ZX-calculus, Applied, ZX-Supported},
      abstract = {To approximate arbitrary unitary transformations on one or more qubits, one must perform transformations which are outside of the Clifford group. The gate most commonly considered for this purpose is the T=diag(1,exp(i\pi/4)) gate. As T gates are computationally expensive to perform fault-tolerantly in the most promising error-correction technologies, minimising the "T-count" (the number of T gates) required to realise a given unitary in a Clifford+T circuit is of great interest. We describe techniques to find circuits with reduced T-count in unitary circuits, which develop on the ideas of Heyfron and Campbell [arXiv:1712.01557] with the help of the ZX calculus. Following [arXiv:1712.01557], we reduce the problem to that of minimising the T count of a CNOT+T circuit. The ZX calculus motivates a further reduction to simplifying a product of commuting "\pi/4-parity-phase" operations: diagonal unitary transformations which induce a relative phase of exp(i\pi/4) depending on the outcome of a parity computation on the standard basis (which motivated Kissinger and van de Wetering [1903.10477] to introduce "phase gadgets"). For a number of standard benchmark circuits, we show that these techniques --- in some cases supplemented by the TODD subroutine of Heyfron and Campbell [arXiv:1712.01557] --- yield T-counts comparable to or better than the best previously known results.}
  }
  

  Copy to Clipboard

• An Algebraic Axiomatisation of ZX-calculus
  Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲

  Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020
  Keywords: ZX-calculus, ZH-calculus, Completeness, Algebraic ZX.

  In this paper we give an algebraic complete axiomatisation of ZX-calculus in the sense that there are only ring operations involved for phases, without any need of trigonometry functions such as sin and cos, in contrast to previous universally complete axiomatisations of ZX-calculus. With this algebraic axiomatisation of ZX-calculus, we are able to establish an invertible translation from ZH-calculus to ZX-calculus and to derive all the ZX-translated rules of ZH-calculus. As a consequence, we have a great benefit that all techniques obtained in ZH-calculus can be transplanted to ZX-calculus.

  @inproceedings{Wang2019Algebraic,
      author = {Wang, Quanlong},
      title = {{An Algebraic Axiomatisation of ZX-calculus}},
      year = {2021},
      booktitle = {Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020},
      editor = {Valiron, Beno\^it and Mansfield, Shane and Arrighi, Pablo and Panangaden, Prakash},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {340},
      pages = {303-332},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.340.16},
      urldate = {2019-11-15},
      link = {https://arxiv.org/abs/1911.06752},
      keywords = {ZX-calculus, ZH-calculus, Completeness, Algebraic ZX},
      abstract = {In this paper we give an algebraic complete axiomatisation of ZX-calculus in the sense that there are only ring operations involved for phases, without any need of trigonometry functions such as sin and cos, in contrast to previous universally complete axiomatisations of ZX-calculus. With this algebraic axiomatisation of ZX-calculus, we are able to establish an invertible translation from ZH-calculus to ZX-calculus and to derive all the ZX-translated rules of ZH-calculus. As a consequence, we have a great benefit that all techniques obtained in ZH-calculus can be transplanted to ZX-calculus. }
  }
  

  Copy to Clipboard

• AND-gates in ZX-calculus: Spider Nest Identities and QBC-completeness
  Anthony Munson, Bob Coecke and Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲

  Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020
  Keywords: Phase Gadgets, Completeness, ZX-calculus, AND gates.

  In this note we exploit the utility of the triangle symbol in ZX-calculus, and its role within the ZX-representation of AND-gates in particular. First, we derive a decomposition theorem for large phase gadgets, something that is of key importance to recent developments in quantum circuit optimisation and T-count reduction in particular. Then, using the same rule set, we prove a completeness theorem for quantum Boolean circuits (QBCs), which adds to the plethora of complete reasoning systems under the umbrella of ZX-calculus.

  @inproceedings{Munson2019ANDgates,
      author = {Munson, Anthony and Coecke, Bob and Wang, Quanlong},
      title = {{AND-gates in ZX-calculus: Spider Nest Identities and QBC-completeness}},
      year = {2021},
      booktitle = {Proceedings 17th International Conference on Quantum Physics and Logic, Paris, France, June 2 - 6, 2020},
      editor = {Valiron, Beno\^it and Mansfield, Shane and Arrighi, Pablo and Panangaden, Prakash},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {340},
      pages = {230-255},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.340.12},
      urldate = {2019-10-15},
      link = {https://arxiv.org/abs/1910.06818},
      keywords = {Phase Gadgets, Completeness, ZX-calculus, AND gates},
      abstract = {In this note we exploit the utility of the triangle symbol in ZX-calculus, and its role within the ZX-representation of AND-gates in particular. First, we derive a decomposition theorem for large phase gadgets, something that is of key importance to recent developments in quantum circuit optimisation and T-count reduction in particular. Then, using the same rule set, we prove a completeness theorem for quantum Boolean circuits (QBCs), which adds to the plethora of complete reasoning systems under the umbrella of ZX-calculus. }
  }
  

  Copy to Clipboard

• ZX-Calculi for Quantum Computing and their Completeness
  Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  Loria, Université de Lorraine PhD Thesis
  Keywords: ZX-calculus, ZW-calculus, Completeness, triangle, PhD Thesis.

  The ZX-Calculus is a powerful and intuitive graphical language, based on category theory, that allows for quantum reasoning and computing. Quantum evolutions are seen in this formalism as open graphs, or diagrams, that can be transformed locally according to a set of axioms that preserve the result of the computation. One of the most important aspects of language is its completeness: Given two diagrams that represent the same quantum evolution, can I transform one into the other using only the graphical rules allowed by the language? If this is the case, it means that the graphical language captures quantum mechanics entirely. The language is known to be complete for a particular subclass (or fragment) of quantum evolutions, called Clifford. Unfortunately, this one is not universal: we cannot represent, or even approach, certain quantum evolutions. In this thesis, we propose to extend the set of axioms to obtain completeness for larger fragments of the language, which in particular are approximately universal, or even universal. To do this, we first use the completeness of another graphical language and transport this result to the ZX-Calculus. In order to simplify this tedious step, we introduce an intermediate language, interesting in itself as it captures a particular but universal fragment of quantum mechanics: Toffoli-Hadamard. We then define the notion of a linear diagram, which provides a uniform proof for some sets of equations. We also define the notion of singular value decomposition of a diagram, which allows us to avoid a large number of calculations. In a second step, we define a normal form that exists for an infinite number of...

  @phdthesis{vilmart2019thesis,
      author = {Vilmart, Renaud},
      title = {{ZX-Calculi for Quantum Computing and their Completeness}},
      year = {2019},
      school = {Loria, Universit\'e de Lorraine},
      urldate = {2019-09-19},
      link = {https://hal.archives-ouvertes.fr/tel-02395443/document},
      keywords = {ZX-calculus, ZW-calculus, Completeness, triangle, PhD Thesis},
      abstract = {The ZX-Calculus is a powerful and intuitive graphical language, based on category theory, that allows for quantum reasoning and computing. Quantum evolutions are seen in this formalism as open graphs, or diagrams, that can be transformed locally according to a set of axioms that preserve the result of the computation. One of the most important aspects of language is its completeness: Given two diagrams that represent the same quantum evolution, can I transform one into the other using only the graphical rules allowed by the language? If this is the case, it means that the graphical language captures quantum mechanics entirely. The language is known to be complete for a particular subclass (or fragment) of quantum evolutions, called Clifford. Unfortunately, this one is not universal: we cannot represent, or even approach, certain quantum evolutions. In this thesis, we propose to extend the set of axioms to obtain completeness for larger fragments of the language, which in particular are approximately universal, or even universal. To do this, we first use the completeness of another graphical language and transport this result to the ZX-Calculus. In order to simplify this tedious step, we introduce an intermediate language, interesting in itself as it captures a particular but universal fragment of quantum mechanics: Toffoli-Hadamard. We then define the notion of a linear diagram, which provides a uniform proof for some sets of equations. We also define the notion of singular value decomposition of a diagram, which allows us to avoid a large number of calculations. In a second step, we define a normal form that exists for an infinite number of...}
  }
  

  Copy to Clipboard

• Classifying reversible logic gates with ancillary bits
  Cole Comfort
  Show abstract ⇲ Show bibdata ⇲

  University of Calgary Masters Thesis
  Keywords: Toffoli, Clifford Fragment, Completeness, Real Fragment, Master Thesis.

  In this thesis, two models of reversible computing are classified, and the relation of reversible computing to quantum computing is explored. First, a finite, complete set of identities is given for the symmetric monoidal category generated by the computational ancillary bits along with the controlled-not gate. In doing so, it is proven that this category is equivalent to the category of partial isomorphisms between non-empty finitely-generated commutative torsors of characteristic 2. Next, a finite, complete set of identities is given for the symmetric monoidal category generated by the computational ancillary bits along with the Toffoli gate. In doing so, it is proven that this category is equivalent to the category of partial isomorphisms between finite powers of the two element set. The relation between reversible and quantum computing is also explored. In particular, the category with the controlled-not gate as a generator is extended to be complete for the real stabilizer fragment of quantum mechanics. This is performed by translating the identities to and from the angle-free fragment of the ZX-calculus, and showing that these translations are inverse to each other.

  @mastersthesis{comfort2019masters,
      author = {Comfort, Cole},
      title = {{Classifying reversible logic gates with ancillary bits}},
      year = {2019},
      school = {University of Calgary},
      urldate = {2019-07-25},
      link = {https://prism.ucalgary.ca/handle/1880/110665},
      keywords = {Toffoli, Clifford Fragment, Completeness, Real Fragment, Master Thesis},
      abstract = {In this thesis, two models of reversible computing are classified, and the relation of reversible computing to quantum computing is explored. First, a finite, complete set of identities is given for the symmetric monoidal category generated by the computational ancillary bits along with the controlled-not gate. In doing so, it is proven that this category is equivalent to the category of partial isomorphisms between non-empty finitely-generated commutative torsors of characteristic 2. Next, a finite, complete set of identities is given for the symmetric monoidal category generated by the computational ancillary bits along with the Toffoli gate. In doing so, it is proven that this category is equivalent to the category of partial isomorphisms between finite powers of the two element set. The relation between reversible and quantum computing is also explored. In particular, the category with the controlled-not gate as a generator is extended to be complete for the real stabilizer fragment of quantum mechanics. This is performed by translating the identities to and from the angle-free fragment of the ZX-calculus, and showing that these translations are inverse to each other.}
  }
  

  Copy to Clipboard

• Phase Gadget Synthesis for Shallow Circuits
  Alexander Cowtan, Silas Dilkes, Ross Duncan, Will Simmons and Seyon Sivarajah
  Show abstract ⇲ Show bibdata ⇲

  Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019
  Keywords: Phase Gadgets, Optimisation, ZX-calculus, Applied, ZX-Supported.

  We give an overview of the circuit optimisation methods used by tket, a compiler system for quantum software developed by Cambridge Quantum Computing Ltd. We focus on a novel technique based around phase gadgets, a family of multi-qubit quantum operations which occur naturally in a wide range of quantum circuits of practical interest. The phase gadgets have a simple presentation in the ZX-calculus, which makes it easy to reason about them. Taking advantage of this, we present an efficient method to translate the phase gadgets back to CNOT gates and single qubit operations suitable for execution on a quantum computer with significant reductions in gate count and circuit depth. We demonstrate the effectiveness of these methods on a quantum chemistry benchmarking set based on variational circuits for ground state estimation of small molecules.

  @inproceedings{Cowtan2020phasegadget,
      author = {Cowtan, Alexander and Dilkes, Silas and Duncan, Ross and Simmons, Will and Sivarajah, Seyon},
      title = {{Phase Gadget Synthesis for Shallow Circuits}},
      year = {2020},
      booktitle = {Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019},
      editor = {Coecke, Bob and Leifer, Matthew},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {318},
      pages = {213-228},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.318.13},
      urldate = {2019-06-04},
      link = {https://arxiv.org/abs/1906.01734},
      keywords = {Phase Gadgets, Optimisation, ZX-calculus, Applied, ZX-Supported},
      abstract = {We give an overview of the circuit optimisation methods used by tket, a compiler system for quantum software developed by Cambridge Quantum Computing Ltd. We focus on a novel technique based around phase gadgets, a family of multi-qubit quantum operations which occur naturally in a wide range of quantum circuits of practical interest. The phase gadgets have a simple presentation in the ZX-calculus, which makes it easy to reason about them. Taking advantage of this, we present an efficient method to translate the phase gadgets back to CNOT gates and single qubit operations suitable for execution on a quantum computer with significant reductions in gate count and circuit depth. We demonstrate the effectiveness of these methods on a quantum chemistry benchmarking set based on variational circuits for ground state estimation of small molecules.}
  }
  

  Copy to Clipboard

• A Diagrammatic Approach to Quantum Dynamics
  Stefano Gogioso
  Show abstract ⇲ Show bibdata ⇲

  8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)
  Keywords: Strong Complementarity, Foundations.

  We present a diagrammatic approach to quantum dynamics based on the categorical algebraic structure of strongly complementary observables. We provide physical semantics to our approach in terms of quantum clocks and quantisation of time. We show that quantum dynamical systems arise naturally as the algebras of a certain dagger Frobenius monad, with the morphisms and tensor product of the category of algebras playing the role, respectively, of equivariant transformations and synchronised parallel composition of dynamical systems. We show that the Weyl Canonical Commutation Relations between time and energy are an incarnation of the bialgebra law and we derive Schr\"{o}dinger's equation from a process-theoretic perspective. Finally, we use diagrammatic symmetry-observable duality to prove Stone's proposition and von Neumann's Mean Ergodic proposition, recasting the results as two faces of the very same coin.

  @inproceedings{gogioso2019diagrammatic,
      author = {Stefano Gogioso},
      title = {{A Diagrammatic Approach to Quantum Dynamics}},
      year = {2019},
      booktitle = {8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019)},
      editor = {Markus Roggenbach and Ana Sokolova},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {139},
      pages = {19:1--19:23},
      publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-120-7},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.CALCO.2019.19},
      urldate = {2019-05-30},
      link = {http://arxiv.org/abs/1905.13111},
      keywords = {Strong Complementarity, Foundations},
      abstract = {We present a diagrammatic approach to quantum dynamics based on the categorical algebraic structure of strongly complementary observables. We provide physical semantics to our approach in terms of quantum clocks and quantisation of time. We show that quantum dynamical systems arise naturally as the algebras of a certain dagger Frobenius monad, with the morphisms and tensor product of the category of algebras playing the role, respectively, of equivariant transformations and synchronised parallel composition of dynamical systems. We show that the Weyl Canonical Commutation Relations between time and energy are an incarnation of the bialgebra law and we derive Schr\"{o}dinger's equation from a process-theoretic perspective. Finally, we use diagrammatic symmetry-observable duality to prove Stone's proposition and von Neumann's Mean Ergodic proposition, recasting the results as two faces of the very same coin.}
  }
  

  Copy to Clipboard

• Flexible layout of surface code computations using AutoCCZ states
  Craig Gidney and Austin G. Fowler
  Show abstract ⇲ Show bibdata ⇲

  arXiv:1905.08916
  Keywords: CCZ, Surface code, ZX-calculus, Toffoli, Lattice Surgery, Applied.

  We construct a self-correcting CCZ state (the "AutoCCZ") with embedded delayed choice CZs for completing gate teleportations. Using the AutoCCZ state we create efficient surface code spacetime layouts for both a depth-limited circuit (a ripply-carry addition) and a Clifford-limited circuit (a QROM read). Our layouts account for distillation and routing, are based on plausible physical assumptions for a large-scale superconducting qubit platform, and suggest that circuit-level Toffoli parallelism (e.g. using a carry-lookahead adder instead of a ripple-carry adder) will not reduce the execution time of computations involving fewer than five million physical qubits. We reduce the spacetime volume of delayed choice CZs by a factor of 4 compared to techniques from previous work (Fowler 2012), and make several improvements to the CCZ magic state factory from (Gidney 2019).

  @article{autoCCZ,
      author = {Gidney, Craig and Fowler, Austin G.},
      title = {{Flexible layout of surface code computations using AutoCCZ states}},
      year = {2019},
      journal = {arXiv preprint arXiv:1905.08916},
      urldate = {2019-05-22},
      link = {https://arxiv.org/abs/1905.08916},
      keywords = {CCZ, Surface code, ZX-calculus, Toffoli, Lattice Surgery, Applied},
      abstract = {We construct a self-correcting CCZ state (the "AutoCCZ") with embedded delayed choice CZs for completing gate teleportations. Using the AutoCCZ state we create efficient surface code spacetime layouts for both a depth-limited circuit (a ripply-carry addition) and a Clifford-limited circuit (a QROM read). Our layouts account for distillation and routing, are based on plausible physical assumptions for a large-scale superconducting qubit platform, and suggest that circuit-level Toffoli parallelism (e.g. using a carry-lookahead adder instead of a ripple-carry adder) will not reduce the execution time of computations involving fewer than five million physical qubits. We reduce the spacetime volume of delayed choice CZs by a factor of 4 compared to techniques from previous work (Fowler 2012), and make several improvements to the CCZ magic state factory from (Gidney 2019).  }
  }
  

  Copy to Clipboard

• Hopf-Frobenius Algebras and a Simpler Drinfeld Double
  Joseph Collins and Ross Duncan
  Show abstract ⇲ Show bibdata ⇲

  Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019
  Keywords: Frobenius algebras, Category Theory.

  The zx-calculus and related theories are based on so-called interacting Frobenius algebras, where a pair of \(\dagger\)-special commutative Frobenius algebras jointly form a pair of Hopf algebras. In this setting we introduce a generalisation of this structure, Hopf-Frobenius algebras, starting from a single Hopf algebra which is not necessarily commutative or cocommutative. We provide the necessary and sufficient condition for a Hopf algebra to be a Hopf-Frobenius algebra, and show that every Hopf algebra in \(\textbf{FVect}_\text{k}\) is a Hopf-Frobenius algebra. Hopf-Frobenius algebras provide a notion of duality, and give us a "dual" Hopf algebra that is isomorphic to the usual dual Hopf algebra in a compact closed category. We use this isomorphism to construct a Hopf algebra isomorphic to the Drinfeld double that is defined on \(H\otimes H\) rather than \(H\otimes H^*\).

  @inproceedings{Collins2020HopfFrobenius,
      author = {Collins, Joseph and Duncan, Ross},
      title = {{Hopf-Frobenius Algebras and a Simpler Drinfeld Double}},
      year = {2020},
      booktitle = {Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019},
      editor = {Coecke, Bob and Leifer, Matthew},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {318},
      pages = {150-180},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.318.10},
      urldate = {2019-05-02},
      link = {https://arxiv.org/abs/1905.00797},
      keywords = {Frobenius algebras, Category Theory},
      abstract = {The zx-calculus and related theories are based on so-called interacting Frobenius algebras, where a pair of $\dagger$-special commutative Frobenius algebras jointly form a pair of Hopf algebras. In this setting we introduce a generalisation of this structure, Hopf-Frobenius algebras, starting from a single Hopf algebra which is not necessarily commutative or cocommutative. We provide the necessary and sufficient condition for a Hopf algebra to be a Hopf-Frobenius algebra, and show that every Hopf algebra in $\textbf{FVect}_\text{k}$ is a Hopf-Frobenius algebra. Hopf-Frobenius algebras provide a notion of duality, and give us a "dual" Hopf algebra that is isomorphic to the usual dual Hopf algebra in a compact closed category. We use this isomorphism to construct a Hopf algebra isomorphic to the Drinfeld double that is defined on $H\otimes H$ rather than $H\otimes H^*$.}
  }
  

  Copy to Clipboard

• SZX-Calculus: Scalable Graphical Quantum Reasoning
  Titouan Carette, Dominic Horsman and Simon Perdrix
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
  Keywords: ZX-calculus, Scalable ZX, Error correcting codes.

  We introduce the Scalable ZX-calculus (SZX-calculus for short), a formal and compact graphical language for the design and verification of quantum computations. The SZX-calculus is an extension of the ZX-calculus, a powerful framework that captures graphically the fundamental properties of quantum mechanics through its complete set of rewrite rules. The ZX-calculus is, however, a low level language, with each wire representing a single qubit. This limits its ability to handle large and elaborate quantum evolutions. We extend the ZX-calculus to registers of qubits and allow compact representation of sub-diagrams via binary matrices. We show soundness and completeness of the SZX-calculus and provide two examples of applications, for graph states and error correcting codes.

  @inproceedings{SZXCalculus,
      author = {Titouan Carette and Dominic Horsman and Simon Perdrix},
      title = {{SZX-Calculus: Scalable Graphical Quantum Reasoning}},
      year = {2019},
      booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
      editor = {Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {138},
      pages = {55:1--55:15},
      publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-117-7},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.MFCS.2019.55},
      urldate = {2019-04-30},
      link = {https://arxiv.org/abs/1905.00041},
      url = {http://drops.dagstuhl.de/opus/volltexte/2019/10999},
      keywords = {ZX-calculus, Scalable ZX, Error correcting codes},
      abstract = {We introduce the Scalable ZX-calculus (SZX-calculus for short), a formal and compact graphical language for the design and verification of quantum computations. The SZX-calculus is an extension of the ZX-calculus, a powerful framework that captures graphically the fundamental properties of quantum mechanics through its complete set of rewrite rules. The ZX-calculus is, however, a low level language, with each wire representing a single qubit. This limits its ability to handle large and elaborate quantum evolutions. We extend the ZX-calculus to registers of qubits and allow compact representation of sub-diagrams via binary matrices. We show soundness and completeness of the SZX-calculus and provide two examples of applications, for graph states and error correcting codes.},
      urn = {urn:nbn:de:0030-drops-109999},
      video = {https://www.youtube.com/watch?v=rVPPV356X4I}
  }
  

  Copy to Clipboard

• Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms
  Niel de Beaudrap, Ross Duncan, Dominic Horsman and Simon Perdrix
  Show abstract ⇲ Show bibdata ⇲

  Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019
  Keywords: ZX-calculus, Lattice Surgery, Pauli Fusion, Surface Code, gflow.

  We present an abstract model of quantum computation, the Pauli Fusion model, whose primitive operations correspond closely to generators of the ZX calculus (a formal graphical language for quantum computing). The fundamental operations of Pauli Fusion are also straightforward abstractions of basic processes in some leading proposed quantum technologies. These operations have non-deterministic heralded effects, similarly to measurement-based quantum computation. We describe sufficient conditions for Pauli Fusion procedures to be deterministically realisable, so that it performs a given transformation independently of its non-deterministic outcomes. This provides an operational model to realise ZX terms beyond the circuit model.

  @inproceedings{deBeaudrap2020Paulifusion,
      author = {de Beaudrap, Niel and Duncan, Ross and Horsman, Dominic and Perdrix, Simon},
      title = {{Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms}},
      year = {2020},
      booktitle = {Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019},
      editor = {Coecke, Bob and Leifer, Matthew},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {318},
      pages = {85-105},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.318.6},
      urldate = {2019-04-29},
      link = {https://arxiv.org/abs/1904.12817},
      keywords = {ZX-calculus, Lattice Surgery, Pauli Fusion, Surface Code, gflow},
      abstract = {We present an abstract model of quantum computation, the Pauli Fusion model, whose primitive operations correspond closely to generators of the ZX calculus (a formal graphical language for quantum computing). The fundamental operations of Pauli Fusion are also straightforward abstractions of basic processes in some leading proposed quantum technologies. These operations have non-deterministic heralded effects, similarly to measurement-based quantum computation. We describe sufficient conditions for Pauli Fusion procedures to be deterministically realisable, so that it performs a given transformation independently of its non-deterministic outcomes. This provides an operational model to realise ZX terms beyond the circuit model.}
  }
  

  Copy to Clipboard

• Circuit Relations for Real Stabilizers: Towards TOF+H
  Cole Comfort
  Show abstract ⇲ Show bibdata ⇲

  arXiv:1904.10614
  Keywords: Completeness, Clifford Fragment, ZX-calculus, Toffoli, Real Fragment.

  The real stabilizer fragment of quantum mechanics was shown to have a complete axiomatization in terms of the angle-free fragment of the ZX-calculus. This fragment of the ZX-calculus---although abstractly elegant---is stated in terms of identities, such as spider fusion which generally do not have interpretations as circuit transformations. We complete the category CNOT generated by the controlled not gate and the computational ancillary bits, presented by circuit relations, to the real stabilizer fragment of quantum mechanics. This is performed first, by adding the Hadamard gate and the scalar sqrt 2 as generators. We then construct translations to and from the angle-free fragment of the ZX-calculus, showing that they are inverses. We then discuss how this could potentially lead to a complete axiomatization, in terms of circuit relations, for the approximately universal fragment of quantum mechanics generated by the Toffoli gate, Hadamard gate and computational ancillary bits.

  @article{comfort2019circuit,
      author = {Comfort, Cole},
      title = {{Circuit Relations for Real Stabilizers: Towards TOF+H}},
      year = {2019},
      journal = {arXiv preprint arXiv:1904.10614},
      urldate = {2019-04-24},
      link = {http://arxiv.org/abs/1904.10614},
      keywords = {Completeness, Clifford Fragment, ZX-calculus, Toffoli, Real Fragment},
      abstract = {The real stabilizer fragment of quantum mechanics was shown to have a complete axiomatization in terms of the angle-free fragment of the ZX-calculus. This fragment of the ZX-calculus---although abstractly elegant---is stated in terms of identities, such as spider fusion which generally do not have interpretations as circuit transformations.   We complete the category CNOT generated by the controlled not gate and the computational ancillary bits, presented by circuit relations, to the real stabilizer fragment of quantum mechanics. This is performed first, by adding the Hadamard gate and the scalar sqrt 2 as generators. We then construct translations to and from the angle-free fragment of the ZX-calculus, showing that they are inverses.   We then discuss how this could potentially lead to a complete axiomatization, in terms of circuit relations, for the approximately universal fragment of quantum mechanics generated by the Toffoli gate, Hadamard gate and computational ancillary bits.}
  }
  

  Copy to Clipboard

• Graphical Fourier Theory and the Cost of Quantum Addition
  Stach Kuijpers, John van de Wetering and Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲

  arXiv:1904.07551
  Keywords: ZH-calculus, ZX-calculus, Fourier, Toffoli, Phase gadgets.

  The ZX-calculus is a convenient formalism for expressing and reasoning about quantum circuits at a low level, whereas the recently-proposed ZH-calculus yields convenient expressions of mid-level quantum gates such as Toffoli and CCZ. In this paper, we will show that the two calculi are linked by Fourier transform. In particular, we will derive new Fourier expansion rules using the ZH-calculus, and show that we can straightforwardly pass between ZH- and ZX-diagrams using them. Furthermore, we demonstrate that the graphical Fourier expansion of a ZH normal-form corresponds to the standard Fourier transform of a semi-Boolean function. As an illustration of the calculational power of this technique, we then show that several tricks for reducing the T-gate cost of Toffoli circuits, which include for instance quantum adders, can be derived using graphical Fourier theory and straightforwardly generalized to more qubits.

  @article{GraphicalFourier2019,
      author = {Kuijpers, Stach and van de Wetering, John and  Kissinger, Aleks},
      title = {{Graphical Fourier Theory and the Cost of Quantum Addition}},
      year = {2019},
      journal = {arXiv preprint arXiv:1904.07551},
      urldate = {2019-04-16},
      link = {https://arxiv.org/abs/1904.07551},
      keywords = {ZH-calculus, ZX-calculus, Fourier, Toffoli, Phase gadgets},
      abstract = {The ZX-calculus is a convenient formalism for expressing and reasoning about quantum circuits at a low level, whereas the recently-proposed ZH-calculus yields convenient expressions of mid-level quantum gates such as Toffoli and CCZ. In this paper, we will show that the two calculi are linked by Fourier transform. In particular, we will derive new Fourier expansion rules using the ZH-calculus, and show that we can straightforwardly pass between ZH- and ZX-diagrams using them. Furthermore, we demonstrate that the graphical Fourier expansion of a ZH normal-form corresponds to the standard Fourier transform of a semi-Boolean function. As an illustration of the calculational power of this technique, we then show that several tricks for reducing the T-gate cost of Toffoli circuits, which include for instance quantum adders, can be derived using graphical Fourier theory and straightforwardly generalized to more qubits.}
  }
  

  Copy to Clipboard

• Completeness of the Phase-free ZH-calculus
  John van de Wetering and Sal Wolffs
  Show abstract ⇲ Show bibdata ⇲

  arXiv:1904.07545
  Keywords: ZH-Calculus, Completeness, Triangle.

  The ZH-calculus is a graphical calculus for linear maps between qubits that allows a natural representation of the Toffoli+Hadamard gate set. The original version of the calculus, which allows every generator to be labelled by an arbitrary complex number, was shown to be complete by Backens and Kissinger. Even though the calculus is complete, this does not mean it allows one to easily reason in restricted settings such as is the case in quantum computing. In this paper we study the fragment of the ZH-calculus that is phase-free, and thus is closer aligned to physically implementable maps. We present a modified rule-set for the phase-free ZH-calculus and show that it is complete. We further discuss the minimality of this rule-set and we give an intuitive interpretation of the rules. Our completeness result follows by reducing to Vilmart's rule-set for the phase-free \(\Delta\)ZX-calculus.

  @article{PhasefreeZH2019,
      author = {van de Wetering, John and Wolffs, Sal},
      title = {{Completeness of the Phase-free ZH-calculus}},
      year = {2019},
      journal = {arXiv preprint arXiv:1904.07545},
      urldate = {2019-04-16},
      link = {https://arxiv.org/abs/1904.07545},
      keywords = {ZH-Calculus, Completeness, Triangle},
      abstract = {The ZH-calculus is a graphical calculus for linear maps between qubits that allows a natural representation of the Toffoli+Hadamard gate set. The original version of the calculus, which allows every generator to be labelled by an arbitrary complex number, was shown to be complete by Backens and Kissinger. Even though the calculus is complete, this does not mean it allows one to easily reason in restricted settings such as is the case in quantum computing. In this paper we study the fragment of the ZH-calculus that is phase-free, and thus is closer aligned to physically implementable maps. We present a modified rule-set for the phase-free ZH-calculus and show that it is complete. We further discuss the minimality of this rule-set and we give an intuitive interpretation of the rules. Our completeness result follows by reducing to Vilmart's rule-set for the phase-free $\Delta$ZX-calculus. }
  }
  

  Copy to Clipboard

• PyZX: Large Scale Automated Diagrammatic Reasoning
  Aleks Kissinger and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019
  Keywords: ZX-calculus, Optimisation, PyZX, Automation.

  The ZX-calculus is a graphical language for reasoning about ZX-diagrams, a tensor network-like language that can represent arbitrary linear maps between qubits. Using the ZX-calculus, we can intuitively reason about quantum mechanics, and optimise and validate quantum circuits. In this paper we introduce PyZX, an open source library for automated reasoning with large ZX-diagrams. We give a brief introduction to the ZX-calculus, then show how PyZX implements methods for circuit optimisation, equality validation, and visualisation and how it can be used in tandem with other software. We end with a set of challenges that when solved would expand the power of automated diagrammatic reasoning.

  @inproceedings{kissinger2019Pyzx,
      author = {Kissinger, Aleks and van de Wetering, John},
      title = {{PyZX: Large Scale Automated Diagrammatic Reasoning}},
      year = {2020},
      booktitle = {Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019},
      editor = {Coecke, Bob and Leifer, Matthew},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {318},
      pages = {229-241},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.318.14},
      urldate = {2019-04-09},
      link = {https://arxiv.org/abs/1904.04735},
      keywords = {ZX-calculus, Optimisation, PyZX, Automation},
      abstract = {The ZX-calculus is a graphical language for reasoning about ZX-diagrams, a tensor network-like language that can represent arbitrary linear maps between qubits. Using the ZX-calculus, we can intuitively reason about quantum mechanics, and optimise and validate quantum circuits. In this paper we introduce PyZX, an open source library for automated reasoning with large ZX-diagrams. We give a brief introduction to the ZX-calculus, then show how PyZX implements methods for circuit optimisation, equality validation, and visualisation and how it can be used in tandem with other software. We end with a set of challenges that when solved would expand the power of automated diagrammatic reasoning.},
      video = {https://www.youtube.com/watch?v=JafI_LZts2g}
  }
  

  Copy to Clipboard

• CNOT circuit extraction for topologically-constrained quantum memories
  Aleks Kissinger and Arianne Meijer-van de Griend
  Show abstract ⇲ Show bibdata ⇲

  Quantum Information and Computation
  Keywords: Optimisation, Circuit extraction, Applied, ZX-Supported.

  Many physical implementations of quantum computers impose stringent memory constraints in which 2-qubit operations can only be performed between qubits which are nearest neighbours in a lattice or graph structure. Hence, before a computation can be run on such a device, it must be mapped onto the physical architecture. That is, logical qubits must be assigned physical locations in the quantum memory, and the circuit must be replaced by an equivalent one containing only operations between nearest neighbours. In this paper, we give a new technique for quantum circuit mapping (a.k.a. routing), based on Gaussian elimination constrained to certain optimal spanning trees called Steiner trees. We give a reference implementation of the technique for CNOT circuits and show that it significantly out-performs general-purpose routines on CNOT circuits. We then comment on how the technique can be extended straightforwardly to the synthesis of CNOT+Rz circuits and as a modification to a recently-proposed circuit simplification/extraction procedure for generic circuits based on the ZX-calculus.

  @article{Kissinger2020CNOT,
      author = { Kissinger, Aleks and  Meijer-van de Griend, Arianne },
      title = {{CNOT circuit extraction for topologically-constrained quantum memories}},
      year = {2020},
      journal = {Quantum Information and Computation},
      volume = {20},
      issue = {7--8},
      pages = {581--596},
      doi = {10.26421/QIC20.7-8},
      urldate = {2019-04-01},
      link = {https://arxiv.org/abs/1904.00633},
      keywords = {Optimisation, Circuit extraction, Applied, ZX-Supported},
      abstract = {Many physical implementations of quantum computers impose stringent memory constraints in which 2-qubit operations can only be performed between qubits which are nearest neighbours in a lattice or graph structure. Hence, before a computation can be run on such a device, it must be mapped onto the physical architecture. That is, logical qubits must be assigned physical locations in the quantum memory, and the circuit must be replaced by an equivalent one containing only operations between nearest neighbours. In this paper, we give a new technique for quantum circuit mapping (a.k.a. routing), based on Gaussian elimination constrained to certain optimal spanning trees called Steiner trees. We give a reference implementation of the technique for CNOT circuits and show that it significantly out-performs general-purpose routines on CNOT circuits. We then comment on how the technique can be extended straightforwardly to the synthesis of CNOT+Rz circuits and as a modification to a recently-proposed circuit simplification/extraction procedure for generic circuits based on the ZX-calculus. }
  }
  

  Copy to Clipboard

• Finite Verification of Infinite Families of Diagram Equations
  Hector Miller-Bakewell
  Show abstract ⇲ Show bibdata ⇲

  Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019
  Keywords: ZX-calculus, !-Boxes, ZH-calculus, ZW-calculus, Verification, Automation.

  The ZX, ZW and ZH calculi are all complete graphical calculi for reasoning about pure state qubit quantum mechanics. All of these languages use certain diagrammatic decorations, called !-boxes and phase variables, to indicate not just one diagram but an infinite family of diagrams. In this same manner one can express infinite families of equations between diagrams, and these decorations are powerful enough to allow for complete rulesets expressing any equivalence in pure state qubit quantum mechanics. We present here results that show that equations between separable infinite families of diagrams are finitely verifiable; that is to say that to verify these infinite families of equations it suffices to check a finite subset of that family, provided a condition we call separability is met. The results we present in this paper not only construct such a verifying subfamily directly, but also generalise to any diagrammatic calculus that satisfies certain simple conditions.

  @inproceedings{MillerBakewell2020finite,
      author = {Miller-Bakewell, Hector},
      title = {{Finite Verification of Infinite Families of Diagram Equations}},
      year = {2020},
      booktitle = {Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019},
      editor = {Coecke, Bob and Leifer, Matthew},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {318},
      pages = {27-52},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.318.3},
      urldate = {2019-04-01},
      link = {https://arxiv.org/abs/1904.00706},
      keywords = {ZX-calculus, !-Boxes, ZH-calculus, ZW-calculus, Verification, Automation},
      abstract = {The ZX, ZW and ZH calculi are all complete graphical calculi for reasoning about pure state qubit quantum mechanics. All of these languages use certain diagrammatic decorations, called !-boxes and phase variables, to indicate not just one diagram but an infinite family of diagrams. In this same manner one can express infinite families of equations between diagrams, and these decorations are powerful enough to allow for complete rulesets expressing any equivalence in pure state qubit quantum mechanics. We present here results that show that equations between separable infinite families of diagrams are finitely verifiable; that is to say that to verify these infinite families of equations it suffices to check a finite subset of that family, provided a condition we call separability is met. The results we present in this paper not only construct such a verifying subfamily directly, but also generalise to any diagrammatic calculus that satisfies certain simple conditions.}
  }
  

  Copy to Clipboard

• Reducing T-count with the ZX-calculus
  Aleks Kissinger and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲

  Physical Review A
  Keywords: ZX-calculus, Clifford+T, T-count, Optimisation, PyZX, Automation, Phase Gadgets, Applied, Verification.

  Reducing the number of non-Clifford quantum gates present in a circuit is an important task for efficiently implementing quantum computations, especially in the fault-tolerant regime. We present a new method for reducing the number of T-gates in a quantum circuit based on the ZX-calculus, which matches or beats previous approaches to T-count reduction on the majority of our benchmark circuits in the ancilla-free case, in some cases yielding up to 50\% improvement. Our method begins by representing the quantum circuit as a ZX-diagram, a tensor network-like structure that can be transformed and simplified according to the rules of the ZX-calculus. We then show that a recently-proposed simplification strategy can be extended to reduce T-count using a new technique called phase teleportation. This technique allows non-Clifford phases to combine and cancel by propagating non-locally through a generic quantum circuit. Phase teleportation does not change the number or location of non-phase gates and the method also applies to arbitrary non-Clifford phase gates as well as gates with unknown phase parameters in parametrised circuits. Furthermore, the simplification strategy we use is powerful enough to validate equality of many circuits. In particular, we use it to show that our optimised circuits are indeed equal to the original ones. We have implemented the routines of this paper in the open-source library PyZX.

  @article{kissinger2019tcount,
      author = {Kissinger, Aleks and van de Wetering, John},
      title = {{Reducing T-count with the ZX-calculus}},
      year = {2020},
      journal = {Physical Review A},
      volume = {102},
      issue = {2},
      month = {8},
      pages = {022406},
      numpages = {10},
      publisher = {American Physical Society},
      doi = {10.1103/PhysRevA.102.022406},
      urldate = {2019-03-25},
      link = {https://arxiv.org/abs/1903.10477},
      keywords = {ZX-calculus, Clifford+T, T-count, Optimisation, PyZX, Automation, Phase Gadgets, Applied, Verification},
      abstract = {Reducing the number of non-Clifford quantum gates present in a circuit is an important task for efficiently implementing quantum computations, especially in the fault-tolerant regime. We present a new method for reducing the number of T-gates in a quantum circuit based on the ZX-calculus, which matches or beats previous approaches to T-count reduction on the majority of our benchmark circuits in the ancilla-free case, in some cases yielding up to 50\% improvement. Our method begins by representing the quantum circuit as a ZX-diagram, a tensor network-like structure that can be transformed and simplified according to the rules of the ZX-calculus. We then show that a recently-proposed simplification strategy can be extended to reduce T-count using a new technique called phase teleportation. This technique allows non-Clifford phases to combine and cancel by propagating non-locally through a generic quantum circuit. Phase teleportation does not change the number or location of non-phase gates and the method also applies to arbitrary non-Clifford phase gates as well as gates with unknown phase parameters in parametrised circuits. Furthermore, the simplification strategy we use is powerful enough to validate equality of many circuits. In particular, we use it to show that our optimised circuits are indeed equal to the original ones. We have implemented the routines of this paper in the open-source library PyZX.}
  }
  

  Copy to Clipboard

• Completeness of the ZX-Calculus
  Emmanuel Jeandel, Simon Perdrix and Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  Logical Methods in Computer Science
  Keywords: ZX-calculus, Completeness, Triangle, Clifford+T, Universal Fragment.

  The ZX-Calculus is a graphical language for diagrammatic reasoning in quantum mechanics and quantum information theory. It comes equipped with an equational presentation. We focus here on a very important property of the language: completeness, which roughly ensures the equational theory captures all of quantum mechanics. We first improve on the known-to-be-complete presentation or the so-called Clifford fragment of the language - a restriction that is not universal - by adding some axioms. Thanks to a system of back-and-forth translation between the ZX-Calculus and a third-party complete graphical language, we prove that the provided axiomatisation is complete for the first approximately universal fragment of the language, namely Clifford+T. We then prove that the expressive power of this presentation, though aimed at achieving completeness for the aforementioned restriction, extends beyond Clifford+T, to a class of diagrams that we call linear with Clifford+T constants. We use another version of the third-party language - and an adapted system of back-and-forth translation - to complete the language for the ZX-Calculus as a whole, that is, with no restriction. We briefly discuss the added axioms, and finally, we provide a complete axiomatisation for an altered version of the language which involves an additional generator, making the presentation simpler.

  @article{jeandel2019completeness,
      author = {Jeandel, Emmanuel and Perdrix, Simon and Vilmart, Renaud},
      title = {{Completeness of the ZX-Calculus}},
      year = {2020},
      journal = {Logical Methods in Computer Science},
      month = {6},
      doi = {10.23638/LMCS-16(2:11)2020},
      urldate = {2019-03-13},
      link = {https://arxiv.org/abs/1903.06035},
      keywords = {ZX-calculus, Completeness, Triangle, Clifford+T, Universal Fragment},
      abstract = {The ZX-Calculus is a graphical language for diagrammatic reasoning in quantum mechanics and quantum information theory. It comes equipped with an equational presentation. We focus here on a very important property of the language: completeness, which roughly ensures the equational theory captures all of quantum mechanics. We first improve on the known-to-be-complete presentation or the so-called Clifford fragment of the language - a restriction that is not universal - by adding some axioms. Thanks to a system of back-and-forth translation between the ZX-Calculus and a third-party complete graphical language, we prove that the provided axiomatisation is complete for the first approximately universal fragment of the language, namely Clifford+T. We then prove that the expressive power of this presentation, though aimed at achieving completeness for the aforementioned restriction, extends beyond Clifford+T, to a class of diagrams that we call linear with Clifford+T constants. We use another version of the third-party language - and an adapted system of back-and-forth translation - to complete the language for the ZX-Calculus as a whole, that is, with no restriction. We briefly discuss the added axioms, and finally, we provide a complete axiomatisation for an altered version of the language which involves an additional generator, making the presentation simpler.}
  }
  

  Copy to Clipboard

• Completeness of Graphical Languages for Mixed States Quantum Mechanics
  Titouan Carette, Emmanuel Jeandel, Simon Perdrix and Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
  Keywords: Completeness, Category Theory, Mixed States.

  There exist several graphical languages for quantum information processing, like quantum circuits, ZX-Calculus, ZW-Calculus, etc. Each of these languages forms a dagger-symmetric monoidal category (dagger-SMC) and comes with an interpretation functor to the dagger-SMC of (finite dimension) Hilbert spaces. In the recent years, one of the main achievements of the categorical approach to quantum mechanics has been to provide several equational theories for most of these graphical languages, making them complete for various fragments of pure quantum mechanics. We address the question of the extension of these languages beyond pure quantum mechanics, in order to reason on mixed states and general quantum operations, i.e. completely positive maps. Intuitively, such an extension relies on the axiomatisation of a discard map which allows one to get rid of a quantum system, operation which is not allowed in pure quantum mechanics. We introduce a new construction, the discard construction, which transforms any dagger-symmetric monoidal category into a symmetric monoidal category equipped with a discard map. Roughly speaking this construction consists in making any isometry causal. Using this construction we provide an extension for several graphical languages that we prove to be complete for general quantum operations. However this construction fails for some fringe cases like the Clifford+T quantum mechanics, as the category does not have enough isometries.

  @inproceedings{carette_completeness_2019,
      author = {Titouan Carette and Emmanuel Jeandel and Simon Perdrix and Renaud Vilmart},
      title = {{Completeness of Graphical Languages for Mixed States Quantum Mechanics}},
      year = {2019},
      booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
      editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
      series = {Leibniz International Proceedings in Informatics (LIPIcs)},
      volume = {132},
      pages = {108:1--108:15},
      publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
      address = {Dagstuhl, Germany},
      isbn = {978-3-95977-109-2},
      issn = {1868-8969},
      doi = {10.4230/LIPIcs.ICALP.2019.108},
      urldate = {2019-02-19},
      link = {http://arxiv.org/abs/1902.07143},
      keywords = {Completeness, Category Theory, Mixed States},
      abstract = {There exist several graphical languages for quantum information processing, like quantum circuits, ZX-Calculus, ZW-Calculus, etc. Each of these languages forms a dagger-symmetric monoidal category (dagger-SMC) and comes with an interpretation functor to the dagger-SMC of (finite dimension) Hilbert spaces. In the recent years, one of the main achievements of the categorical approach to quantum mechanics has been to provide several equational theories for most of these graphical languages, making them complete for various fragments of pure quantum mechanics. We address the question of the extension of these languages beyond pure quantum mechanics, in order to reason on mixed states and general quantum operations, i.e. completely positive maps. Intuitively, such an extension relies on the axiomatisation of a discard map which allows one to get rid of a quantum system, operation which is not allowed in pure quantum mechanics. We introduce a new construction, the discard construction, which transforms any dagger-symmetric monoidal category into a symmetric monoidal category equipped with a discard map. Roughly speaking this construction consists in making any isometry causal. Using this construction we provide an extension for several graphical languages that we prove to be complete for general quantum operations. However this construction fails for some fringe cases like the Clifford+T quantum mechanics, as the category does not have enough isometries.}
  }
  

  Copy to Clipboard

• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
  Ross Duncan, Aleks Kissinger, Simon Perdrix and John van de Wetering
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Quantum
  Keywords: ZX-calculus, Optimisation, PyZX, Automation, Local Complementation, Gflow, Applied.

  We present a completely new approach to quantum circuit optimisation, based on the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower-level language for describing quantum computations graphically. Then, using the rules of the ZX-calculus, we give a simplification strategy for ZX-diagrams based on the two graph transformations of local complementation and pivoting and show that the resulting reduced diagram can be transformed back into a quantum circuit. While little is known about extracting circuits from arbitrary ZX-diagrams, we show that the underlying graph of our simplified ZX-diagram always has a graph-theoretic property called generalised flow, which in turn yields a deterministic circuit extraction procedure. For Clifford circuits, this extraction procedure yields a new normal form that is both asymptotically optimal in size and gives a new, smaller upper bound on gate depth for nearest-neighbour architectures. For Clifford+T and more general circuits, our technique enables us to to 'see around' gates that obstruct the Clifford structure and produce smaller circuits than naive 'cut-and-resynthesise' methods.

  @article{duncan2019graph,
      author = {Duncan, Ross and Kissinger, Aleks and Perdrix, Simon and van de Wetering, John},
      title = {{Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus}},
      year = {2020},
      journal = {{Quantum}},
      volume = {4},
      month = {6},
      pages = {279},
      publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
      issn = {2521-327X},
      doi = {10.22331/q-2020-06-04-279},
      urldate = {2019-02-08},
      link = {https://arxiv.org/abs/1902.03178},
      keywords = {ZX-calculus, Optimisation, PyZX, Automation, Local Complementation, Gflow, Applied},
      abstract = {We present a completely new approach to quantum circuit optimisation, based on the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower-level language for describing quantum computations graphically. Then, using the rules of the ZX-calculus, we give a simplification strategy for ZX-diagrams based on the two graph transformations of local complementation and pivoting and show that the resulting reduced diagram can be transformed back into a quantum circuit. While little is known about extracting circuits from arbitrary ZX-diagrams, we show that the underlying graph of our simplified ZX-diagram always has a graph-theoretic property called generalised flow, which in turn yields a deterministic circuit extraction procedure. For Clifford circuits, this extraction procedure yields a new normal form that is both asymptotically optimal in size and gives a new, smaller upper bound on gate depth for nearest-neighbour architectures. For Clifford+T and more general circuits, our technique enables us to to 'see around' gates that obstruct the Clifford structure and produce smaller circuits than naive 'cut-and-resynthesise' methods.},
      video = {https://www.youtube.com/watch?v=Gt3sQgickn8}
  }
  

  Copy to Clipboard

• Categorical Semantics for Time Travel
  Nicola Pinzani, Stefano Gogioso and Bob Coecke
  Show abstract ⇲ Show bibdata ⇲

  2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  Keywords: Category Theory, Foundations.

  We introduce a general categorical framework to reason about quantum theory and other process theories living in spacetimes where Closed Timelike Curves (CTCs) are available, allowing resources to travel back in time and provide computational speedups. Our framework is based on a weakening of the definition of traced symmetric monoidal categories, obtained by dropping the yanking axiom and the requirement that the trace be defined on all morphisms. We show that the two leading models for quantum theory with closed timelike curves---namely the P-CTC model of Lloyd et al. and the D-CTC model of Deutsch---are captured by our framework, and in doing so we provide the first compositional description of the D-CTC model. Our description of the D-CTC model results in a process theory which respects the constraints of relativistic causality: this is in direct contrast to the P-CTC model, where CTCs are implemented by a trace and allow post-selection to be performed deterministically.

  @inproceedings{pinzani2019categorical,
      author = {Pinzani, Nicola and Gogioso, Stefano and Coecke, Bob},
      title = {{Categorical Semantics for Time Travel}},
      year = {2019},
      booktitle = {2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
      volume = {},
      number = {},
      pages = {1-20},
      doi = {10.1109/LICS.2019.8785664},
      urldate = {2019-01-31},
      link = {http://arxiv.org/abs/1902.00032},
      keywords = {Category Theory, Foundations},
      abstract = {We introduce a general categorical framework to reason about quantum theory and other process theories living in spacetimes where Closed Timelike Curves (CTCs) are available, allowing resources to travel back in time and provide computational speedups. Our framework is based on a weakening of the definition of traced symmetric monoidal categories, obtained by dropping the yanking axiom and the requirement that the trace be defined on all morphisms. We show that the two leading models for quantum theory with closed timelike curves---namely the P-CTC model of Lloyd et al. and the D-CTC model of Deutsch---are captured by our framework, and in doing so we provide the first compositional description of the D-CTC model. Our description of the D-CTC model results in a process theory which respects the constraints of relativistic causality: this is in direct contrast to the P-CTC model, where CTCs are implemented by a trace and allow post-selection to be performed deterministically.}
  }
  

  Copy to Clipboard

• Optimising Clifford Circuits with Quantomatic
  Andrew Fagan and Ross Duncan
  Show abstract ⇲ Show bibdata ⇲

  Proceedings of the 15th International Conference on Quantum Physics and Logic (QPL)
  Keywords: ZX-calculus, Quantomatic, Clifford Fragment, Optimisation, Automation, Applied.

  We present a system of equations between Clifford circuits, all derivable in the ZX-calculus, and formalised as rewrite rules in the Quantomatic proof assistant. By combining these rules with some non-trivial simplification procedures defined in the Quantomatic tactic language, we demonstrate the use of Quantomatic as a circuit optimisation tool. We prove that the system always reduces Clifford circuits of one or two qubits to their minimal form, and give numerical results demonstrating its performance on larger Clifford circuits.

  @inproceedings{FaganDuncan,
      author = {Fagan, Andrew and Duncan, Ross},
      title = {{Optimising Clifford Circuits with Quantomatic}},
      year = {2019},
      booktitle = {Proceedings of the 15th International Conference on Quantum Physics and Logic (QPL)},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {287},
      pages = {85-105},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.287.5},
      urldate = {2019-01-29},
      link = {https://arxiv.org/abs/1901.10114},
      keywords = {ZX-calculus, Quantomatic, Clifford Fragment, Optimisation, Automation, Applied},
      abstract = {We present a system of equations between Clifford circuits, all derivable in the ZX-calculus, and formalised as rewrite rules in the Quantomatic proof assistant. By combining these rules with some non-trivial simplification procedures defined in the Quantomatic tactic language, we demonstrate the use of Quantomatic as a circuit optimisation tool. We prove that the system always reduces Clifford circuits of one or two qubits to their minimal form, and give numerical results demonstrating its performance on larger Clifford circuits.}
  }
  

  Copy to Clipboard

• [Video] Completeness of the ZX-calculus 🎥
  Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  QIP 2019
  Keywords: ZX-calculus, Completeness, Clifford+T, Universal Fragment.

  @misc{Vilmart2019Video,
      author = {Vilmart, Renaud},
      title = {{Completeness of the ZX-calculus}},
      year = {2019},
      howpublished = {QIP 2019},
      urldate = {2019-01-15},
      url = {https://www.youtube.com/watch?v=K59n-JE6Alc},
      keywords = {ZX-calculus, Completeness, Clifford+T, Universal Fragment},
      abstract = {}
  }
  

  Copy to Clipboard

2018

• A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics
  Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  Keywords: ZX-calculus, Completeness, Universal Fragment, Minimality.

  Recent developments in the ZX-Calculus have resulted in complete axiomatisations first for an approximately universal restriction of the language, and then for the whole language. The main drawbacks were that the axioms that were added to achieve completeness were numerous, tedious to manipulate and lacked a physical interpretation. We present in this paper two complete axiomatisations for the general ZX-Calculus, that we believe are optimal, in that all their equations are necessary and moreover have a nice physical interpretation.

  @inproceedings{vilmarteulercompleteness,
      author = {Vilmart, Renaud},
      title = {{A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics}},
      year = {2019},
      booktitle = {2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
      volume = {},
      number = {},
      pages = {1-10},
      doi = {10.1109/LICS.2019.8785765},
      urldate = {2018-12-21},
      link = {https://arxiv.org/abs/1812.09114},
      keywords = {ZX-calculus, Completeness, Universal Fragment, Minimality},
      abstract = {Recent developments in the ZX-Calculus have resulted in complete axiomatisations first for an approximately universal restriction of the language, and then for the whole language. The main drawbacks were that the axioms that were added to achieve completeness were numerous, tedious to manipulate and lacked a physical interpretation. We present in this paper two complete axiomatisations for the general ZX-Calculus, that we believe are optimal, in that all their equations are necessary and moreover have a nice physical interpretation.}
  }
  

  Copy to Clipboard

• Efficient magic state factories with a catalyzed $|CCZångle$ to $2|T\n̊gle$ transformation
  Craig Gidney and Austin G. Fowler
  Show abstract ⇲ Show bibdata ⇲

  Quantum
  Keywords: ZX-calculus, Lattice Surgery, Surface Code, Optimisation, CCZ, Applied.

  We present magic state factory constructions for producing |CCZ⟩ states and |T⟩ states. For the |CCZ⟩ factory we apply the surface code lattice surgery construction techniques described by Fowler et al. to the fault-tolerant Toffoli. The resulting factory has a footprint of \(12d\times 6d\) (where \(d\) is the code distance) and produces one |CCZ⟩ every 5.5d surface code cycles. Our |T⟩ state factory uses the |CCZ⟩ factory's output and a catalyst |T⟩ state to exactly transform one |CCZ⟩ state into two |T⟩ states. It has a footprint \(25\%\) smaller than the factory of Fowler et al. but outputs |T⟩ states twice as quickly. We show how to generalize the catalyzed transformation to arbitrary phase angles, and note that the case \(θ=22.5^a\) produces a particularly efficient circuit for producing |\(\sqrt{T}\)⟩ states. Compared to using the \(12d\times 8d\times 6.5d\) |T⟩ factory of Fowler et al., our |CCZ⟩ factory can quintuple the speed of algorithms that are dominated by the cost of applying Toffoli gates, including Shor's algorithm and the chemistry algorithm of Babbush et al.. Assuming a physical gate error rate of \(10^{−3}\), our CCZ factory can produce \(∼10^{10}\) states on average before an error occurs. This is sufficient for classically intractable instantiations of the chemistry algorithm, but for more demanding algorithms such as Shor's algorithm the mean number of states until failure can be increased to \(∼10^{12}\) by increasing the factory footprint \(~20\%\).

  @article{magicFactories,
      author = {Gidney, Craig and Fowler, Austin G.},
      title = {{Efficient magic state factories with a catalyzed {$|CCZ\rangle$} to {$2|T\rangle$} transformation}},
      year = {2019},
      journal = {{Quantum}},
      volume = {3},
      month = {4},
      pages = {135},
      publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
      issn = {2521-327X},
      doi = {10.22331/q-2019-04-30-135},
      urldate = {2018-12-04},
      link = {https://arxiv.org/abs/1812.01238},
      url = {https://doi.org/10.22331/q-2019-04-30-135},
      keywords = {ZX-calculus, Lattice Surgery, Surface Code, Optimisation, CCZ, Applied},
      abstract = {We present magic state factory constructions for producing |CCZ⟩ states and |T⟩ states. For the |CCZ⟩ factory we apply the surface code lattice surgery construction techniques described by Fowler et al. to the fault-tolerant Toffoli. The resulting factory has a footprint of $12d\times 6d$ (where $d$ is the code distance) and produces one |CCZ⟩ every 5.5d surface code cycles. Our |T⟩ state factory uses the |CCZ⟩ factory's output and a catalyst |T⟩ state to exactly transform one |CCZ⟩ state into two |T⟩ states. It has a footprint $25\%$ smaller than the factory of Fowler et al. but outputs |T⟩ states twice as quickly. We show how to generalize the catalyzed transformation to arbitrary phase angles, and note that the case $θ=22.5^a$ produces a particularly efficient circuit for producing |$\sqrt{T}$⟩ states. Compared to using the $12d\times 8d\times 6.5d$ |T⟩ factory of Fowler et al., our |CCZ⟩ factory can quintuple the speed of algorithms that are dominated by the cost of applying Toffoli gates, including Shor's algorithm and the chemistry algorithm of Babbush et al.. Assuming a physical gate error rate of $10^{−3}$, our CCZ factory can produce $∼10^{10}$ states on average before an error occurs. This is sufficient for classically intractable instantiations of the chemistry algorithm, but for more demanding algorithms such as Shor's algorithm the mean number of states until failure can be increased to $∼10^{12}$ by increasing the factory footprint $~20\%$.}
  }
  

  Copy to Clipboard

• The rational fragment of the ZX-calculus
  Emmanuel Jeandel
  Show abstract ⇲ Show bibdata ⇲

  arXiv:1810.05377 [quant-ph]
  Keywords: ZX-calculus, Rational Fragment, Triangle, Completeness.

  We introduce here a new axiomatisation of the rational fragment of the ZX-calculus, a diagrammatic language for quantum mechanics. Compared to the previous axiomatisation introduced in [8], our axiomatisation does not use any metarule , but relies instead on a more natural rule, called the cyclotomic supplementarity rule, that was introduced previously in the literature. Our axiomatisation is only complete for diagrams using rational angles , and is not complete in the general case. Using results on diophantine geometry, we characterize precisely which diagram equality involving arbitrary angles are provable in our framework without any new axioms, and we show that our axiomatisation is continuous, in the sense that a diagram equality involving arbitrary angles is provable iff it is a limit of diagram equalities involving rational angles. We use this result to give a complete characterization of all Euler equations that are provable in this axiomatisation.

  @article{jeandel_rational_2018,
      author = {Jeandel, Emmanuel},
      title = {{The rational fragment of the ZX-calculus}},
      year = {2018},
      journal = {arXiv:1810.05377 [quant-ph]},
      month = {oct},
      urldate = {2018-10-12},
      link = {http://arxiv.org/abs/1810.05377},
      keywords = {ZX-calculus, Rational Fragment, Triangle, Completeness},
      abstract = {We introduce here a new axiomatisation of the rational fragment of the ZX-calculus, a diagrammatic language for quantum mechanics. Compared to the previous axiomatisation introduced in [8], our axiomatisation does not use any metarule , but relies instead on a more natural rule, called the cyclotomic supplementarity rule, that was introduced previously in the literature. Our axiomatisation is only complete for diagrams using rational angles , and is not complete in the general case. Using results on diophantine geometry, we characterize precisely which diagram equality involving arbitrary angles are provable in our framework without any new axioms, and we show that our axiomatisation is continuous, in the sense that a diagram equality involving arbitrary angles is provable iff it is a limit of diagram equalities involving rational angles. We use this result to give a complete characterization of all Euler equations that are provable in this axiomatisation.}
  }
  

  Copy to Clipboard

• Towards Minimality of Clifford+T ZX-Calculus
  Borun Shi
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford Masters Thesis
  Keywords: ZX-Calculus, Minimality, Master Thesis.

  ZX-calculus is a high-level graphical language used for quantum computation. A complete set of axioms for ZX-calculus has been found very recently. This thesis works towards minimizing axioms of ZX-calculus for Clifford+T quantum mechanics, a fragment consisting of an approximately universal gate set. Similar work has been done for the smaller fragment, stabilizer quantum mechanics, which motivates many of our proofs. We derive some singleton axioms and instances of axiom schemes. We establish the necessity and some weaker independence results of several axioms, by considering a variety of models. As a further step towards simplification we also consider alternative presentations of axioms that are equivalent and discuss their uses.

  @mastersthesis{Borun,
      author = {Shi, Borun},
      title = {{Towards Minimality of Clifford+T ZX-Calculus}},
      year = {2018},
      school = {University of Oxford},
      urldate = {2018-06-30},
      link = {http://www.cs.ox.ac.uk/people/bob.coecke/Borun},
      keywords = {ZX-Calculus, Minimality, Master Thesis},
      abstract = {ZX-calculus is a high-level graphical language used for quantum computation.  A complete set of axioms for ZX-calculus has been found very recently. This thesis works towards minimizing axioms of ZX-calculus for Clifford+T quantum  mechanics,  a  fragment  consisting  of  an  approximately  universal gate  set. Similar work  has  been  done  for  the  smaller  fragment,  stabilizer quantum mechanics, which motivates many of our proofs.  We derive some singleton axioms and instances of axiom schemes.  We establish the necessity and some weaker independence results of several axioms, by considering a variety of models.  As a further step towards simplification we also consider alternative  presentations  of  axioms  that  are  equivalent  and  discuss  their uses.}
  }
  

  Copy to Clipboard

• A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness
  Emmanuel Jeandel, Simon Perdrix and Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  Keywords: ZX-calculus, Normal-form, Rational Fragment, Completeness.

  Recent completeness results on the ZX-Calculus used a third-party language, namely the ZW-Calculus. As a consequence, these proofs are elegant, but sadly non-constructive. We address this issue in the following. To do so, we first describe a generic normal form for ZX-diagrams in any fragment that contains Clifford+T quantum mechanics. We give sufficient conditions for an axiomatisation to be complete, and an algorithm to reach the normal form. Finally, we apply these results to the Clifford+T fragment and the general ZX-Calculus -- for which we already know the completeness--, but also for any fragment of rational angles: we show that the axiomatisation for Clifford+T is also complete for any fragment of dyadic angles, and that a simple new rule (called cancellation) is necessary and sufficient otherwise.

  @inproceedings{ZXNormalForm,
      author = {Jeandel, Emmanuel and Perdrix, Simon and Vilmart, Renaud},
      title = {{A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness}},
      year = {2019},
      booktitle = {34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
      series = {LICS '19},
      volume = {},
      number = {},
      pages = {1-10},
      publisher = {ACM},
      doi = {10.1109/LICS.2019.8785754},
      urldate = {2018-05-14},
      link = {https://arxiv.org/abs/1805.05296},
      keywords = {ZX-calculus, Normal-form, Rational Fragment, Completeness},
      abstract = {Recent completeness results on the ZX-Calculus used a third-party language, namely the ZW-Calculus. As a consequence, these proofs are elegant, but sadly non-constructive. We address this issue in the following. To do so, we first describe a generic normal form for ZX-diagrams in any fragment that contains Clifford+T quantum mechanics. We give sufficient conditions for an axiomatisation to be complete, and an algorithm to reach the normal form. Finally, we apply these results to the Clifford+T fragment and the general ZX-Calculus -- for which we already know the completeness--, but also for any fragment of rational angles: we show that the axiomatisation for Clifford+T is also complete for any fragment of dyadic angles, and that a simple new rule (called cancellation) is necessary and sufficient otherwise.}
  }
  

  Copy to Clipboard

• ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
  Miriam Backens and Aleks Kissinger
  Show abstract ⇲ Show bibdata ⇲

  Proceedings of the 15th International Conference on Quantum Physics and Logic, Halifax, Canada, 3-7th June 2018
  Keywords: ZH-calculus, Completeness.

  We present a new graphical calculus that is sound and complete for a universal family of quantum circuits, which can be seen as the natural string-diagrammatic extension of the approximately (real-valued) universal family of Hadamard+CCZ circuits. The diagrammatic language is generated by two kinds of nodes: the so-called 'spider' associated with the computational basis, as well as a new arity-N generalisation of the Hadamard gate, which satisfies a variation of the spider fusion law. Unlike previous graphical calculi, this admits compact encodings of non-linear classical functions. For example, the AND gate can be depicted as a diagram of just 2 generators, compared to ~25 in the ZX-calculus. Consequently, N-controlled gates, hypergraph states, Hadamard+Toffoli circuits, and diagonal circuits at arbitrary levels of the Clifford hierarchy also enjoy encodings with low constant overhead. This suggests that this calculus will be significantly more convenient for reasoning about the interplay between classical non-linear behaviour (e.g. in an oracle) and purely quantum operations. After presenting the calculus, we will prove it is sound and complete for universal quantum computation by demonstrating the reduction of any diagram to an easily describable normal form.

  @inproceedings{EPTCS287.2,
      author = {Backens, Miriam and Kissinger, Aleks},
      title = {{ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity}},
      year = {2019},
      booktitle = {Proceedings of the 15th International Conference on
  Quantum Physics and Logic,
  Halifax, Canada, 3-7th June 2018},
      editor = {Selinger, Peter and Chiribella, Giulio},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {287},
      pages = {23-42},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.287.2},
      urldate = {2018-05-06},
      link = {https://arxiv.org/abs/1805.02175},
      keywords = {ZH-calculus, Completeness},
      abstract = {We present a new graphical calculus that is sound and complete for a universal family of quantum circuits, which can be seen as the natural string-diagrammatic extension of the approximately (real-valued) universal family of Hadamard+CCZ circuits. The diagrammatic language is generated by two kinds of nodes: the so-called 'spider' associated with the computational basis, as well as a new arity-N generalisation of the Hadamard gate, which satisfies a variation of the spider fusion law. Unlike previous graphical calculi, this admits compact encodings of non-linear classical functions. For example, the AND gate can be depicted as a diagram of just 2 generators, compared to ~25 in the ZX-calculus. Consequently, N-controlled gates, hypergraph states, Hadamard+Toffoli circuits, and diagonal circuits at arbitrary levels of the Clifford hierarchy also enjoy encodings with low constant overhead. This suggests that this calculus will be significantly more convenient for reasoning about the interplay between classical non-linear behaviour (e.g. in an oracle) and purely quantum operations. After presenting the calculus, we will prove it is sound and complete for universal quantum computation by demonstrating the reduction of any diagram to an easily describable normal form.}
  }
  

  Copy to Clipboard

• ZX-rules for 2-qubit Clifford+ T quantum circuits
  Bob Coecke and Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲

  International Conference on Reversible Computation
  Keywords: ZX-Calculus, Completeness, Clifford+T.

  ZX-calculus is a high-level graphical formalism for qubit computation. In this paper we give the ZX-rules that enable one to derive all equations between 2-qubit Clifford+T quantum circuits. Our rule set is only a small extension of the rules of stabilizer ZX-calculus, and substantially less than those needed for the recently achieved universal completeness. One of our rules is new, and we expect it to also have other utilities. These ZX-rules are much simpler than the complete of set Clifford+T circuit equations due to Selinger and Bian, which indicates that ZX-calculus provides a more convenient arena for quantum circuit rewriting than restricting oneself to circuit equations. The reason for this is that ZX-calculus is not constrained by a fixed unitary gate set for performing intermediate computations.

  @inproceedings{coecke2018zx,
      author = {Coecke, Bob and Wang, Quanlong},
      title = {{ZX-rules for 2-qubit Clifford+ T quantum circuits}},
      year = {2018},
      booktitle = {International Conference on Reversible Computation},
      pages = {144--161},
      organization = {Springer},
      doi = {10.1007/978-3-319-99498-7\_10},
      urldate = {2018-04-15},
      link = {https://arxiv.org/abs/1804.05356},
      keywords = {ZX-Calculus, Completeness, Clifford+T},
      abstract = {ZX-calculus is a high-level graphical formalism for qubit computation. In this paper we give the ZX-rules that enable one to derive all equations between 2-qubit Clifford+T quantum circuits. Our rule set is only a small extension of the rules of stabilizer ZX-calculus, and substantially less than those needed for the recently achieved universal completeness. One of our rules is new, and we expect it to also have other utilities. 
  These ZX-rules are much simpler than the complete of set Clifford+T circuit equations due to Selinger and Bian, which indicates that ZX-calculus provides a more convenient arena for quantum circuit rewriting than restricting oneself to circuit equations. The reason for this is that ZX-calculus is not constrained by a fixed unitary gate set for performing intermediate computations.}
  }
  

  Copy to Clipboard

• A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond
  Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  Proceedings of the 15th International Conference on Quantum Physics and Logic, Halifax, Canada, 3-7th June 2018
  Keywords: ZX-calculus, Completeness, Toffoli, Triangle.

  We consider a ZX-calculus augmented with triangle nodes which is well-suited to reason on the so-called Toffoli-Hadamard fragment of quantum mechanics. We precisely show the form of the matrices it represents, and we provide an axiomatisation which makes the language complete for the Toffoli-Hadamard quantum mechanics. We extend the language with arbitrary angles and show that any true equation involving linear diagrams which constant angles are multiple of Pi are derivable. We show that a single axiom is then necessary and sufficient to make the language equivalent to the ZX-calculus which is known to be complete for Clifford+T quantum mechanics. As a by-product, it leads to a new and simple complete axiomatisation for Clifford+T quantum mechanics.

  @inproceedings{EPTCS287.18,
      author = {Vilmart, Renaud},
      title = {{A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond}},
      year = {2019},
      booktitle = {Proceedings of the 15th International Conference on
  Quantum Physics and Logic,
  Halifax, Canada, 3-7th June 2018},
      editor = {Selinger, Peter and Chiribella, Giulio},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {287},
      pages = {313-344},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.287.18},
      urldate = {2018-04-09},
      link = {https://arxiv.org/abs/1804.03084},
      keywords = {ZX-calculus, Completeness, Toffoli, Triangle},
      abstract = {We consider a ZX-calculus augmented with triangle nodes which is well-suited to reason on the so-called Toffoli-Hadamard fragment of quantum mechanics. We precisely show the form of the matrices it represents, and we provide an axiomatisation which makes the language complete for the Toffoli-Hadamard quantum mechanics. We extend the language with arbitrary angles and show that any true equation involving linear diagrams which constant angles are multiple of Pi are derivable. We show that a single axiom is then necessary and sufficient to make the language equivalent to the ZX-calculus which is known to be complete for Clifford+T quantum mechanics. As a by-product, it leads to a new and simple complete axiomatisation for Clifford+T quantum mechanics.}
  }
  

  Copy to Clipboard

• Qutrit ZX-calculus is Complete for Stabilizer Quantum Mechanics
  Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲ Video 🎥

  Proceedings 14th International Conference on Quantum Physics and Logic, Nijmegen, The Netherlands, 3-7 July 2017
  Keywords: ZX-calculus, Qutrits, Clifford Fragment.

  In this paper, we show that a qutrit version of ZX-calculus, with rules significantly different from that of the qubit version, is complete for pure qutrit stabilizer quantum mechanics, where state preparations and measurements are based on the three dimensional computational basis, and unitary operations are required to be in the generalized Clifford group. This means that any equation of diagrams that holds true under the standard interpretation in Hilbert spaces can be derived diagrammatically. In contrast to the qubit case, the situation here is more complicated due to the richer structure of this qutrit ZX-calculus.

  @inproceedings{EPTCS266.3,
      author = {Wang, Quanlong},
      title = {{Qutrit ZX-calculus is Complete for Stabilizer Quantum Mechanics}},
      year = {2018},
      booktitle = {Proceedings 14th International Conference on
  Quantum Physics and Logic,
  Nijmegen, The Netherlands, 3-7 July 2017},
      editor = {Coecke, Bob and Kissinger, Aleks},
      series = {Electronic Proceedings in Theoretical Computer Science},
      volume = {266},
      pages = {58-70},
      publisher = {Open Publishing Association},
      doi = {10.4204/EPTCS.266.3},
      urldate = {2018-03-02},
      link = {https://arxiv.org/abs/1803.00696},
      keywords = {ZX-calculus, Qutrits, Clifford Fragment},
      abstract = {In this paper, we show that a qutrit version of ZX-calculus, with rules significantly different from that of the qubit version, is complete for pure qutrit stabilizer quantum mechanics, where state preparations and measurements are based on the three dimensional computational basis, and unitary operations are required to be in the generalized Clifford group. This means that any equation of diagrams that holds true under the standard interpretation in Hilbert spaces can be derived diagrammatically. In contrast to the qubit case, the situation here is more complicated due to the richer structure of this qutrit ZX-calculus.},
      video = {https://www.youtube.com/watch?v=eXyuV6G8800}
  }
  

  Copy to Clipboard

• Completeness of the ZX-calculus
  Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford PhD Thesis
  Keywords: ZX-calculus, ZW-calculus, triangle, Completeness, PhD Thesis.

  The ZX-calculus is an intuitive but also mathematically strict graphical language for quantum computing, which is especially powerful for the framework of quantum circuits. Completeness of the ZX-calculus means any equality of matrices with size powers of \(n\) can be derived purely diagrammatically. In this thesis, we give the first complete axiomatisation the ZX-calculus for the overall pure qubit quantum mechanics, via a translation from the completeness result of another graphical language for quantum computing -- the ZW-calculus. This paves the way for automated pictorial quantum computing, with the aid of some software like Quantomatic. Based on this universal completeness, we directly obtain a complete axiomatisation of the ZX-calculus for the Clifford+T quantum mechanics, which is approximatively universal for quantum computing, by restricting the ring of complex numbers to its subring corresponding to the Clifford+T fragment resting on the completeness theorem of the ZW-calculus for arbitrary commutative ring. Furthermore, we prove the completeness of the ZX-calculus (with just 9 rules) for 2-qubit Clifford+T circuits by verifying the complete set of 17 circuit relations in diagrammatic rewriting. This is an important step towards efficient simplification of general n-qubit Clifford+T circuits, considering that we now have all the necessary rules for diagrammatical quantum reasoning and a very simple construction of Toffoli gate within our axiomatisation framework, which is approximately universal for quantum computation together with the Hadamard gate. In addition to completeness results within the qubit related formalism, we extend the completeness of the ZX-calculus for qubit stabilizer quantum mechanics to the qutrit stabilizer system. Finally, we show with some examples the application of the ZX-calculus to the proof of generalised supplementarity, the representation of entanglement classification and Toffoli gate, as well as equivalence-checking for the UMA gate.

  @phdthesis{wang_completeness_2018,
      author = {Wang, Quanlong},
      title = {{Completeness of the ZX-calculus}},
      year = {2018},
      school = {University of Oxford},
      urldate = {2018-02-27},
      link = {http://www.cs.ox.ac.uk/people/bob.coecke/Harny.pdf},
      keywords = {ZX-calculus, ZW-calculus, triangle, Completeness, PhD Thesis},
      abstract = {The ZX-calculus is an intuitive but also mathematically strict graphical language for quantum computing, which is especially powerful for the framework of quantum circuits. Completeness of the ZX-calculus means any equality of matrices with size powers of $n$ can be derived purely diagrammatically. In this thesis, we give the first complete axiomatisation the ZX-calculus for the overall pure qubit quantum mechanics, via a translation from the completeness result of another graphical language for quantum computing -- the ZW-calculus. This paves the way for automated pictorial quantum computing, with the aid of some software like Quantomatic.
  
  Based on this universal completeness, we directly obtain a complete axiomatisation of the ZX-calculus for the Clifford+T quantum mechanics, which is approximatively universal for quantum computing, by restricting the ring of complex numbers to its subring corresponding to the Clifford+T fragment resting on the completeness theorem of the ZW-calculus for arbitrary commutative ring.
  
  Furthermore, we prove the completeness of the ZX-calculus (with just 9 rules) for 2-qubit Clifford+T circuits by verifying the complete set of 17 circuit relations in diagrammatic rewriting. This is an important step towards efficient simplification of general n-qubit Clifford+T circuits, considering that we now have all the necessary rules for diagrammatical quantum reasoning and a very simple construction of Toffoli gate within our axiomatisation framework, which is approximately universal for quantum computation together with the Hadamard gate.
  
  In addition to completeness results within the qubit related formalism, we extend the completeness of the ZX-calculus for qubit stabilizer quantum mechanics to the qutrit stabilizer system.
  
  Finally, we show with some examples the application of the ZX-calculus to the proof of generalised supplementarity, the representation of entanglement classification and Toffoli gate, as well as equivalence-checking for the UMA gate.}
  }
  

  Copy to Clipboard

• Completeness of the ZW and ZX calculi
  Kang Feng Ng
  Show abstract ⇲ Show bibdata ⇲

  University of Oxford PhD Thesis
  Keywords: ZX-calculus, ZW-calculus, Completeness, triangle, qudits, qutrits, PhD Thesis.

  The quantum circuit formalism is good as it abstracts quantum processes while keeping in mind what are the allowed processes in laboratories. However, because of this, it is kind of restricting. It will be desirable to have a higher level language which provides further abstraction. This is where ZX and ZW calculus comes in. These two calculi are diagrammatic abstraction of quantum operations, similar to quantum circuits, but is more liberal than the circuit formalism. Abstraction may be good, but it is, after all, not the actual thing; there are limitations to how much the abstraction can reason about the systems. This is the concept of completeness. If an abstraction can capture all of the system’s dynamics, then we say that it is complete. The circuit formalism and the ZX calculus are known to be incomplete, and it greatly limits their ability to reason quantum operations. This thesis is about completeness, but we won’t explore the completeness of the quantum circuit formalism; we will present a ZX calculus that is complete. The ZW calculus is complete, but it is hard to make connections to the implementable quantum operations. We could modify the calculus to obtain a calculus that is closely related to what is called fermionic circuits, but then this calculus is not known to be complete. In this thesis, we will complete it. As a bonus, we will show an even more restricted version, that may have connections to the understanding of the universe, which is complete. This may be an useful abstraction for the study of the fundamental properties of fermions. The gist of the thesis is not about the complete ZW and ZX calculi; it is the formula to produce a complete diagrammatic calculus.

  @phdthesis{ng2018thesis,
      author = {Ng, Kang Feng},
      title = {{Completeness of the ZW and ZX calculi}},
      year = {2018},
      school = {University of Oxford},
      urldate = {2018-02-26},
      link = {http://www.cs.ox.ac.uk/people/bob.coecke/KangFeng.pdf},
      keywords = {ZX-calculus, ZW-calculus, Completeness, triangle, qudits, qutrits, PhD Thesis},
      abstract = {The quantum circuit formalism is good as it abstracts quantum processes while keeping in mind what are the allowed processes in laboratories. However, because of this, it is kind of restricting. It will be desirable to have a higher level language which provides further abstraction. This is where ZX and ZW calculus comes in. These two calculi are diagrammatic abstraction of quantum operations, similar to quantum circuits, but is more liberal than the circuit formalism.
  Abstraction may be good, but it is, after all, not the actual thing; there are
  limitations to how much the abstraction can reason about the systems. This is the
  concept of completeness. If an abstraction can capture all of the system’s dynamics, then we say that it is complete. The circuit formalism and the ZX calculus are known to be incomplete, and it greatly limits their ability to reason quantum operations. This thesis is about completeness, but we won’t explore the completeness of the quantum circuit formalism; we will present a ZX calculus that is complete. The ZW calculus is complete, but it is hard to make connections to the implementable quantum operations. We could modify the calculus to obtain a calculus that is closely related to what is called fermionic circuits, but then this calculus is not known to be complete. In this thesis, we will complete it. As a bonus, we will show an even more restricted version, that may have connections to the understanding of the universe, which is complete. This may be an useful abstraction for the study of the fundamental properties of fermions.
  The gist of the thesis is not about the complete ZW and ZX calculi; it is the
  formula to produce a complete diagrammatic calculus.}
  }
  

  Copy to Clipboard

• Diagrammatic Reasoning Beyond Clifford+T Quantum Mechanics
  Emmanuel Jeandel, Simon Perdrix and Renaud Vilmart
  Show abstract ⇲ Show bibdata ⇲

  Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
  Keywords: ZX-calculus, Completeness, Triangle, Universal Fragment.

  The ZX-Calculus is a graphical language for quantum mechanics. An axiomatisation has recently been proven to be complete for an approximatively universal fragment of quantum mechanics, the so-called Clifford+T fragment. We focus here on the expressive power of this axiomatisation beyond Clifford+T Quantum mechanics. We consider the full pure qubit quantum mechanics, and mainly prove two results: (i) First, the axiomatisation for Clifford+T quantum mechanics is also complete for all equations involving some kind of linear diagrams. The linearity of the diagrams reflects the phase group structure, an essential feature of the ZX-calculus. In particular all the axioms of the ZX-calculus are involving linear diagrams. (ii) We also show that the axiomatisation for Clifford+T is not complete in general but can be completed by adding a single (non linear) axiom, providing a simpler axiomatisation of the ZX-calculus for pure quantum mechanics than the one recently introduced by Ng&Wang.

  @inproceedings{JPV-universal,
      author = {Jeandel, Emmanuel and Perdrix, Simon and Vilmart, Renaud},
      title = {{Diagrammatic Reasoning Beyond Clifford+T Quantum Mechanics}},
      year = {2018},
      booktitle = {Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science},
      series = {LICS '18},
      pages = {569--578},
      numpages = {10},
      publisher = {ACM},
      acmid = {3209139},
      address = {New York, NY, USA},
      isbn = {978-1-4503-5583-4},
      location = {Oxford, United Kingdom},
      doi = {10.1145/3209108.3209139},
      urldate = {2018-01-30},
      link = {https://arxiv.org/abs/1801.10142},
      keywords = {ZX-calculus, Completeness, Triangle, Universal Fragment},
      abstract = {The ZX-Calculus is a graphical language for quantum mechanics. An axiomatisation has recently been proven to be complete for an approximatively universal fragment of quantum mechanics, the so-called Clifford+T fragment. We focus here on the expressive power of this axiomatisation beyond Clifford+T Quantum mechanics. We consider the full pure qubit quantum mechanics, and mainly prove two results: (i) First, the axiomatisation for Clifford+T quantum mechanics is also complete for all equations involving some kind of linear diagrams. The linearity of the diagrams reflects the phase group structure, an essential feature of the ZX-calculus. In particular all the axioms of the ZX-calculus are involving linear diagrams. (ii) We also show that the axiomatisation for Clifford+T is not complete in general but can be completed by adding a single (non linear) axiom, providing a simpler axiomatisation of the ZX-calculus for pure quantum mechanics than the one recently introduced by Ng&Wang.}
  }
  

  Copy to Clipboard

• Completeness of the ZX-calculus for Pure Qubit Clifford+T Quantum Mechanics
  Kang Feng Ng and Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲

  arXiv:1801.07993
  Keywords: ZX-calculus, Completeness, Clifford+T.

  Recently, we gave a complete axiomatisation of the ZX-calculus for the overall pure qubit quantum mechanics. Based on this result, here we also obtain a complete axiomatisation of the ZX-calculus for the Clifford+T quantum mechanics by restricting the ring of complex numbers to its subring corresponding to the Clifford+T fragment resting on the completeness theorem of the ZW-calculus for arbitrary commutative ring. In contrast to the first complete axiomatisation of the ZX-calculus for the Clifford+T fragment, we have two new generators as features rather than novelties: the triangle can be employed as an essential component to construct a Toffoli gate in a very simple form, while the lambda box can be slightly extended to a generalised phase so that the generalised supplementarity (cyclotomic supplementarity ) is naturally seen as a special case of the generalised spider rule.

  @article{ng_completeness_2018,
      author = {Ng, Kang Feng and Wang, Quanlong},
      title = {{Completeness of the ZX-calculus for Pure Qubit Clifford+T Quantum Mechanics}},
      year = {2018},
      journal = {arXiv:1801.07993},
      month = {1},
      urldate = {2018-01-22},
      link = {http://arxiv.org/abs/1801.07993},
      keywords = {ZX-calculus, Completeness, Clifford+T},
      abstract = {Recently, we gave a complete axiomatisation of the ZX-calculus for the overall pure qubit quantum mechanics. Based on this result, here we also obtain a complete axiomatisation of the ZX-calculus for the Clifford+T quantum mechanics by restricting the ring of complex numbers to its subring corresponding to the Clifford+T fragment resting on the completeness theorem of the ZW-calculus for arbitrary commutative ring. In contrast to the first complete axiomatisation of the ZX-calculus for the Clifford+T fragment, we have two new generators as features rather than novelties: the triangle can be employed as an essential component to construct a Toffoli gate in a very simple form, while the lambda box can be slightly extended to a generalised phase so that the generalised supplementarity (cyclotomic supplementarity ) is naturally seen as a special case of the generalised spider rule.}
  }
  

  Copy to Clipboard

• A diagrammatic calculus of fermionic quantum circuits
  Amar Hadzihasanovic, Giovanni de Felice and Kang Feng Ng
  Show abstract ⇲ Show bibdata ⇲

  Logical Methods in Computer Science
  Keywords: ZW-Calculus, Completeness, Fermionic quantum computing.

  We introduce the fermionic ZW calculus, a string-diagrammatic language for fermionic quantum computing (FQC). After defining a fermionic circuit model, we present the basic components of the calculus, together with their interpretation, and show how the main physical gates of interest in FQC can be represented in our language. We then list our axioms, and derive some additional equations. We prove that the axioms provide a complete equational axiomatisation of the monoidal category whose objects are systems of finitely many local fermionic modes (LFMs), with maps that preserve or reverse the parity of states, and the tensor product as monoidal product. We achieve this through a procedure that rewrites any diagram in a normal form. As an example, we show how the statistics of a fermionic Mach-Zehnder interferometer can be calculated in the diagrammatic language. We conclude by giving a diagrammatic treatment of the dual-rail encoding, a standard method in optical quantum computing used to perform universal quantum computation.

  @article{hadzihasanovic2018diagrammatic,
      author = {Hadzihasanovic, Amar and de Felice, Giovanni and Ng, Kang Feng},
      title = {A diagrammatic calculus of fermionic quantum circuits},
      year = {2019},
      journal = {Logical Methods in Computer Science},
      volume = {15},
      publisher = {Episciences. org},
      doi = {10.23638/LMCS-15(3:26)2019},
      urldate = {2018-01-04},
      link = {https://arxiv.org/abs/1801.01231},
      keywords = {ZW-Calculus, Completeness, Fermionic quantum computing},
      abstract = {We introduce the fermionic ZW calculus, a string-diagrammatic language for fermionic quantum computing (FQC). After defining a fermionic circuit model, we present the basic components of the calculus, together with their interpretation, and show how the main physical gates of interest in FQC can be represented in our language. We then list our axioms, and derive some additional equations. We prove that the axioms provide a complete equational axiomatisation of the monoidal category whose objects are systems of finitely many local fermionic modes (LFMs), with maps that preserve or reverse the parity of states, and the tensor product as monoidal product. We achieve this through a procedure that rewrites any diagram in a normal form. As an example, we show how the statistics of a fermionic Mach-Zehnder interferometer can be calculated in the diagrammatic language. We conclude by giving a diagrammatic treatment of the dual-rail encoding, a standard method in optical quantum computing used to perform universal quantum computation.}
  }
  

  Copy to Clipboard

• Two Complete Axiomatisations of Pure-state Qubit Quantum Computing
  Amar Hadzihasanovic, Kang Feng Ng and Quanlong Wang
  Show abstract ⇲ Show bibdata ⇲

  Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
  Keywords: ZW-Calculus, Completeness, Universal Fragment, Normal-form.

  Categorical quantum mechanics places finite-dimensional quantum theory in the context of compact closed categories, with an emphasis on diagrammatic reasoning. In this framework, two equational diagrammatic calculi have been proposed for pure-state qubit quantum computing: the ZW calculus, developed by Coecke, Kissinger and the first author for the purpose of qubit entanglement classification, and the ZX calculus, introduced by Coecke and Duncan to give an abstract description of complementary observables. Neither calculus, however, provided a complete axiomatisation of their model. In this paper, we present extended versions of ZW and ZX, and show their completeness for pure-state qubit theory, thus solving two major open problems in categorical quantum mechanics. First, we extend the original ZW calculus to represent states and linear maps with coefficients in an arbitrary commutative ring, and prove completeness by a strategy that rewrites all diagrams into a normal form. We then extend the language and axioms of the original ZX calculus, and show their completeness for pure-state qubit theory through a translation between ZX and ZW specialised to the field of complex numbers. This translation expands the one used by Jeandel, Perdrix, and Vilmart to derive an axiomatisation of the approximately universal Clifford+T fragment; restricting the field of complex numbers to a suitable subring, we obtain an alternative axiomatisation of the same theory.

  @inproceedings{HarnyAmarCompleteness,
      author = {Hadzihasanovic, Amar and Ng, Kang Feng and Wang, Quanlong},
      title = {{Two Complete Axiomatisations of Pure-state Qubit Quantum Computing}},
      year = {2018},
      booktitle = {Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science},
      series = {LICS '18},
      pages = {502--511},
      numpages = {10},
      publisher = {ACM},
      acmid = {3209128},
      address = {New York, NY, USA},
      isbn = {978-1-4503-5583-4},
      location = {Oxford, United Kingdom},
      doi = {10.1145/3209108.3209128},
      link = {https://dl.acm.org/citation.cfm?id=3209128},
      keywords = {ZW-Calculus, Completeness, Universal Fragment, Normal-form},
      abstract = {Categorical quantum mechanics places finite-dimensional quantum theory in the context of compact closed categories, with an emphasis on diagrammatic reasoning. In this framework, two equational diagrammatic calculi have been proposed for pure-state qubit quantum computing: the ZW calculus, developed by Coecke, Kissinger and the first author for the purpose of qubit entanglement classification, and the ZX calculus, introduced by Coecke and Duncan to give an abstract description of complementary observables. Neither calculus, however, provided a complete axiomatisation of their model.
  
  In this paper, we present extended versions of ZW and ZX, and show their completeness for pure-state qubit theory, thus solving two major open problems in categorical quantum mechanics. First, we extend the original ZW calculus to represent states and linear maps with coefficients in an arbitrary commutative ring, and prove completeness by a strategy that rewrites all diagrams into a normal form. We then extend the language and axioms of the original ZX calculus, and show their completeness for pure-state qubit theory through a translation between ZX and ZW specialised to the field of complex numbers. This translation expands the one used by Jeandel, Perdrix, and Vilmart to derive an axiomatisation of the approximately universal Clifford+T fragment; restricting the field of complex numbers to a suitable subring, we obtain an alternative axiomatisation of the same theory.}
  }
  

  Copy to Clipboard