Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms
arXiv:1904.12817 · doi:10.4204/EPTCS.318.6
Abstract
We present an abstract model of quantum computation, the "Pauli Fusion" model, whose primitive operations correspond closely to generators of the ZX calculus (a formal graphical language for quantum computing). The fundamental operations of Pauli Fusion are also straightforward abstractions of basic processes in some leading proposed quantum technologies. These operations have non-deterministic heralded effects, similarly to measurement-based quantum computation. We describe sufficient conditions for Pauli Fusion procedures to be deterministically realisable, so that it performs a given transformation independently of its non-deterministic outcomes. This provides an operational model to realise ZX terms beyond the circuit model.
arXiv commentIn Proceedings QPL 2019, arXiv:2004.14750
References in corpus (13)
- Resource-efficient linear optical quantum computation
- Surface code quantum computing by lattice surgery
- Interacting Quantum Observables: Categorical Algebra and Diagrammatics
- Determinism in the one-way model
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- The ZX-calculus is complete for stabilizer quantum mechanics
- The ZX calculus is a language for surface code lattice surgery
- On the qubit routing problem
- Pivoting makes the ZX-calculus complete for real stabilizers
- Verifying the Steane code with Quantomatic
- Finding Optimal Flows Efficiently
- Lecture notes on Optical Quantum Computing