Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation

DOI10.4204/eptcs.384.12arXiv2304.08166OpenAlexW4386096047MaRDI QIDQ6200534

Unnamed Author, Miriam Backens

Publication date: 22 March 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2304.08166

Mathematics Subject Classification ID

Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Parallelizing quantum circuits
• Picturing Quantum Processes
• The ZX-calculus is complete for stabilizer quantum mechanics
• Which Graph States are Useful for Quantum Information Processing?
• Graph States and the Necessity of Euler Decomposition
• Two complete axiomatisations of pure-state qubit quantum computing
• A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
• Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics