Two complete axiomatisations of pure-state qubit quantum computing

DOI10.1145/3209108.3209128zbMath1452.81079OpenAlexW2798910219WikidataQ64356750 ScholiaQ64356750MaRDI QIDQ5145325

Quanlong Wang, Amar Hadzihasanovic, Kang Feng Ng

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3209108.3209128

zbMATH Keywords

monoidal categoriesquantum computationcategorical quantum mechanicsstring diagrams

Mathematics Subject Classification ID

Quantum computation (81P68) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Related Items (12)

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Graphical CSS Code Transformation Using ZX Calculus ⋮ Light-Matter Interaction in the ZXW Calculus ⋮ Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The structure of sum-over-paths, its consequences, and completeness for Clifford ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}

This page was built for publication: Two complete axiomatisations of pure-state qubit quantum computing