There and back again: A circuit extraction tale
arXiv:2003.01664 · doi:10.22331/q-2021-03-25-421
Abstract
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 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.
arXiv comment47 pages in body, 15 pages in appendices
References in corpus (32)
- Measurement-based quantum computation with cluster states
- Improved Simulation of Stabilizer Circuits
- Multi-party entanglement in graph states
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Graphical description of the action of local Clifford transformations on graph states
- Interacting Quantum Observables: Categorical Algebra and Diagrammatics
- Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
- Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
- Reducing T-count with the ZX-calculus
- Determinism in the one-way model
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Parallelizing Quantum Circuits
- The ZX-calculus is complete for stabilizer quantum mechanics
- PyZX: Large Scale Automated Diagrammatic Reasoning
- Phase Gadget Synthesis for Shallow Circuits
- Pivoting makes the ZX-calculus complete for real stabilizers
- A universal completion of the ZX-calculus
- Finding Optimal Flows Efficiently
- Making the stabilizer ZX-calculus complete for scalars
- Universal MBQC with generalised parity-phase interactions and Pauli measurements
- Optimization of Clifford Circuits
- Which graph states are useful for quantum information processing?
- Parallelizing quantum circuit synthesis
- Techniques to Reduce -Parity-Phase Circuits, Motivated by the ZX Calculus
- Graph States, Pivot Minor, and Universality of (X,Z)-measurements
- Global Quantum Circuit Optimization
- An analysis of the trade-off between spatial and temporal resources for measurement-based quantum computation
- A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
- Minimal physical resources for the realisation of measurement-based quantum computation
- Compact quantum circuits from one-way quantum computation
- Geometry-Based Optimization of One-Way Quantum Computation Measurement Patterns
- Reversibility in the Extended Measurement-based Quantum Computation
Cited by in corpus (49)
- Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
- Complex Quantum Networks: a Topical Review
- Reconstructing quantum theory from diagrammatic postulates
- ZX-calculus for the working quantum computer scientist
- Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers
- Reducing 2-QuBit Gate Count for ZX-Calculus based Quantum Circuit Optimization
- Shallow unitary decompositions of quantum Fredkin and Toffoli gates for connectivity-aware equivalent circuit averaging
- Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus
- Relating Measurement Patterns to Circuits via Pauli Flow
- Compilation of algorithm-specific graph states for quantum circuits
- A compiler for universal photonic quantum computers
- Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus
- Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
- Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
- Quantum Linear Optics via String Diagrams
- AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
- The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
- Light-Matter Interaction in the ZXW Calculus
- Completeness of the ZH-calculus
- Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation
- Building Qutrit Diagonal Gates from Phase Gadgets
- Diagrammatic Analysis for Parameterized Quantum Circuits
- Application of ZX-calculus to Quantum Architecture Search
- Picturing Counting Reductions with the ZH-Calculus
- Outcome determinism in measurement-based quantum computation with qudits
- Symbolic Synthesis of Clifford Circuits and Beyond
- Scaling W state circuits in the qudit Clifford hierarchy
- Multi-controlled Phase Gate Synthesis with ZX-calculus applied to Neutral Atom Hardware
- Flow conditions for continuous variable measurement-based quantum computing
- Optimal compilation of parametrised quantum circuits
- Complete ZX-calculi for the stabiliser fragment in odd prime dimensions
- Kindergarden quantum mechanics graduates (...or how I learned to stop gluing LEGO together and love the ZX-calculus)
- Multi-agent blind quantum computation without universal cluster states
- Entanglement and Quaternions: The graphical calculus ZQ
- ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces
- Shadow Pauli Flow: Characterising Determinism in MBQCs involving Pauli Measurements
- ZX Graphical Calculus for Continuous-Variable Quantum Processes
- A dataflow programming framework for linear optical distributed quantum computing
- The ZX-calculus as a Language for Topological Quantum Computation
- Classically Simulating Quantum Supremacy IQP Circuits through a Random Graph Approach
- Quantum Theory from Principles, Quantum Software from Diagrams
- Graphical Calculi and their Conjecture Synthesis
- Quantum Circuits in Additive Hilbert Space
- Pauli Flow on Open Graphs with Unknown Measurement Labels
- Quantum Multiple-Valued Decision Diagrams in Graphical Calculi
- Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow
- Encoding High-level Quantum Programs as SZX-diagrams
- A Graphical #SAT Algorithm for Formulae with Small Clause Density
- Three-qubit Deutsch-Jozsa in measurement-based quantum computing