The Parity Flow Formalism: Tracking Quantum Information Throughout Computation
arXiv:2505.09468 · doi:10.1103/6xlb-l92j
Abstract
We propose the Parity Flow formalism, a method for tracking the information flow in quantum circuits. This method adds labels to quantum circuit diagrams such that the action of Clifford gates can be understood as a recoding of quantum information. The action of non-Clifford gates in the encoded space can be directly deduced from those labels without backtracking. An application of flow tracking is to design resource-efficient quantum circuits by changing any present encoding via a simple set of rules. Finally, the Parity Flow formalism can be used in combination with stabilizer codes to further reduce quantum circuit depth and to reveal additional operations that can be implemented in parallel.
6 pages main + 31 pages appendices
References in corpus (21)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Charge insensitive qubit design derived from the Cooper pair box
- Improved Simulation of Stabilizer Circuits
- Quantum Error Correction for Quantum Memories
- Quantum computing with trapped ions
- Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
- Logical quantum processor based on reconfigurable atom arrays
- A programmable two-qubit quantum processor in silicon
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Stim: a fast stabilizer circuit simulator
- Low Depth Quantum Simulation of Electronic Structure
- The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
- Quantum circuit optimizations for NISQ architectures
- Phase Gadget Synthesis for Shallow Circuits
- On the CNOT-complexity of CNOT-PHASE circuits
- A linearized stabilizer formalism for systems of finite dimension
- Quantum time dynamics of 1D-Heisenberg models employing the Yang-Baxter equation for circuit compression
- Tensorized Pauli decomposition algorithm
- Phase polynomials synthesis algorithms for NISQ architectures and beyond
- Fast simulation of planar Clifford circuits
- SWAP-less Implementation of Quantum Algorithms