Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
arXiv:2304.08166 · doi:10.4204/EPTCS.384.12
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.
arXiv commentIn Proceedings QPL 2023, arXiv:2308.15489. arXiv admin note: text overlap with arXiv:2205.02009
References in corpus (14)
- 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
- Phase Gadget Synthesis for Shallow Circuits
- There and back again: A circuit extraction tale
- Robust and parsimonious realisations of unitaries in the one-way model
- Making the stabilizer ZX-calculus complete for scalars
- Which graph states are useful for quantum information processing?
- Relating Measurement Patterns to Circuits via Pauli Flow
- Circuit Extraction for ZX-diagrams can be #P-hard
- An analysis of the trade-off between spatial and temporal resources for measurement-based quantum computation
Cited by in corpus (8)
- Optimizing ZX-Diagrams with Deep Reinforcement Learning
- Procedurally Optimised ZX-Diagram Cutting for Efficient T-Decomposition in Classical Simulation
- Multi-agent blind quantum computation without universal cluster states
- ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces
- Fast Classical Simulation of Quantum Circuits via Parametric Rewriting in the ZX-Calculus
- A dataflow programming framework for linear optical distributed quantum computing
- Pauli Flow on Open Graphs with Unknown Measurement Labels
- Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow