Relating Measurement Patterns to Circuits via Pauli Flow

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.

arXiv commentIn Proceedings QPL 2021, arXiv:2109.04886

References in corpus (26)

• Improved Simulation of Stabilizer Circuits
• Quantum Error Correction and Orthogonal Geometry
• Instantaneous non-local computation of low T-depth quantum circuits
• The Heisenberg Representation of Quantum Computers
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Graphical description of the action of local Clifford transformations on graph states
• 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
• Basic circuit compilation techniques for an ion-trap quantum machine
• Towards Large-scale Functional Verification of Universal Quantum Circuits
• Phase Gadget Synthesis for Shallow Circuits
• There and back again: A circuit extraction tale
• ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
• Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters
• A universal completion of the ZX-calculus
• Finding Optimal Flows Efficiently
• Optimising Clifford Circuits with Quantomatic
• Finding flows in the one-way measurement model
• Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus
• Global Quantum Circuit Optimization
• Graphical Fourier Theory and the Cost of Quantum Addition
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
• Optimizing T gates in Clifford+T circuit as $\pi /4$ rotations around Paulis
• Geometry-Based Optimization of One-Way Quantum Computation Measurement Patterns

Cited by in corpus (11)

• Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
• Optimal Hadamard gate count for Clifford$+T$ synthesis of Pauli rotations sequences
• Optimizing ZX-Diagrams with Deep Reinforcement Learning
• Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
• Optimal compilation of parametrised quantum circuits
• Multi-controlled Phase Gate Synthesis with ZX-calculus applied to Neutral Atom Hardware
• A dataflow programming framework for linear optical distributed quantum computing
• String Diagrams for Defect-Based Surface Code Computing
• Shadow Pauli Flow: Characterising Determinism in MBQCs involving Pauli Measurements
• Pauli Flow on Open Graphs with Unknown Measurement Labels
• Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow