There and back again: A circuit extraction tale

  title={There and back again: A circuit extraction tale},
  author={Miriam Backens and Hector Miller-Bakewell and Giovanni de Felice and Leo Lobski and John van de Wetering},
Translations between the quantum circuit model and the measurement-based one-way model are useful for verification and optimisation of quantum computations. They make crucial use of a property known as gflow. While gflow is defined for one-way computations allowing measurements in three different planes of the Bloch sphere, most research so far has focused on computations containing only measurements in the XY-plane. Here, we give the first circuit-extraction algorithm to work for one-way… 

Figures and Tables from this paper

ZX-calculus for the working quantum computer scientist
This review discusses Clifford computation and graphically prove the Gottesman-Knill theorem, a recently introduced extension of the ZX-calculus that allows for convenient reasoning about Toffoli gates, and the recent completeness theorems that show that, in principle, all reasoning about quantum computation can be done using Zx-diagrams.
Quantum Theory from Principles, Quantum Software from Diagrams
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,
Completeness of the ZH-calculus
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
Entanglement and Quaternions: The graphical calculus ZQ
This paper introduces 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, and shows that this calculus is sound and complete for qubit quantum computing, while also showing that a fully spider-based representation would have been impossible.
Graphical Calculi and their Conjecture Synthesis
This work continues the exploration of graphical calculi, inside and outside of the quantum computing setting, by investigating the algebraic structures with which the authors label diagrams, and introduces two important new calculi here.
Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus
This paper establishes a correspondence between the ZH-calculus and the path-sum formalism, a technique recently introduced by Amy to verify quantum circuits, and finds a bijection between certain canonical forms of Zh-diagrams and path-Sum expressions.
AKLT-States as ZX-Diagrams: Diagrammatic Reasoning for Quantum States
The 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.
Diagrammatic Differentiation for Quantum Machine Learning
This work introduces diagrammatic differentiation for tensor calculus by generalising the dual number construction from rigs to monoidal categories and extending the method to the automatic differentation of hybrid classical-quantum circuits.
Analyzing the barren plateau phenomenon in training quantum neural network with the ZX-calculus
The barren plateaus theorem is extended from unitary 2-design circuits to any parameterized quantum circuits under certain reasonable assumptions and is shown that, for the hardware efficient ansatz and the MPS-inspired ansatz, there exist barren Plateaus.
Relating Measurement Patterns to Circuits via Pauli Flow
  • Will Simmons
  • Computer Science
    Electronic Proceedings in Theoretical Computer Science
  • 2021
It is shown that Pauli flow can similarly be identified efficiently and that any measurement pattern whose underlying graph admits a Pauliflow can be efficiently transformed into a gate-based circuit without using ancilla qubits.


Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
A simplification strategy for ZX-diagrams is given based on the two graph transformations of local complementation and pivoting and it is shown that the resulting reduced diagram can be transformed back into a quantum circuit.
Quantum Circuit Synthesis Targeting to Improve One-Way Quantum Computation Pattern Cost Metrics
A multiobjective quantum circuit synthesis method is proposed that generates a set of quantum circuits and attempts to simultaneously improve the measurement pattern cost metrics after the translation from this set ofquantum circuits.
The measurement calculus
A rigorous mathematical model underlying the one-way quantum computer is developed and a concrete syntax and operational semantics for programs, which are called patterns, are presented, and an algebra of these patterns derived from a denotational semantics are presented.
Optimization of One-Way Quantum Computation Measurement Patterns
A new scheme is proposed to perform the optimization techniques simultaneously on patterns with flow and only gflow based on their geometries, and it is shown that the time complexity of the proposed approach is improved over the previous ones.
CNOT circuit extraction for topologically-constrained quantum memories
A new technique for quantum circuit mapping, based on Gaussian elimination constrained to certain optimal spanning trees called Steiner trees, is given, which significantly out-performs general-purpose routines on CNOT circuits.
Global Quantum Circuit Optimization
A new connection between two MBQC depth optimisation procedures, known as the maximally delayed generalised flow and signal shifting, is presented, which will allow an MBZC qubit optimisation procedure known as compactification to be applied to a large class of pattern including all those obtained from any arbitrary quantum circuit.
Reducing the number of non-Clifford gates in quantum circuits
We present a method for reducing the number of non-Clifford quantum gates, in particularly T-gates, in a circuit, an important task for efficiently implementing fault-tolerant quantum computations.
Reducing T-count with the ZX-calculus
A new method for reducing the number of T-gates in a quantum circuit based on the ZX-calculus is presented, which matches or beats previous approaches to T-count reduction on the majority of benchmark circuits in the ancilla-free case, in some cases yielding up to 50% improvement.
Generalized flow and determinism in measurement-based quantum computation
We extend the notion of quantum information flow defined by Danos and Kashefi (2006 Phys. Rev. A 74 052310) for the one-way model (Raussendorf and Briegel 2001 Phys. Rev. Lett. 86 910) and present a
Which Graph States are Useful for Quantum Information Processing?
A structural characterisation of the graph states that can be used for quantum information processing and it is proved that the deterministic and uniform equiprobability classes collapse when the cardinalities of inputs and outputs are the same.