Two complete axiomatisations of pure-state qubit quantum computing
From MaRDI portal
Recommendations
- A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
- Diagrammatic reasoning beyond Clifford+T quantum mechanics
- A diagrammatic axiomatisation for qubit entanglement
- The ZX-calculus is complete for stabilizer quantum mechanics
- ZX-calculus: cyclotomic supplementarity and incompleteness for Clifford+T quantum mechanics
Cited in
(33)- A note of coherence for duality quantum computers acting on pure states
- Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus}
- The structure of sum-over-paths, its consequences, and completeness for Clifford
- scientific article; zbMATH DE number 7449988 (Why is no real title available?)
- Interacting Quantum Observables
- Graph states and the necessity of Euler decomposition
- A diagrammatic axiomatisation for qubit entanglement
- A diagrammatic axiomatisation of fermionic quantum circuits
- Finite verification of infinite families of diagram equations
- Pauli fusion: a computational model to realise quantum transformations from ZX terms
- Quantum and braided ZX calculus
- scientific article; zbMATH DE number 7561601 (Why is no real title available?)
- SZX-calculus: scalable graphical quantum reasoning
- Interacting quantum observables: categorical algebra and diagrammatics
- Diagrammatic reasoning beyond Clifford+T quantum mechanics
- A diagrammatic calculus of fermionic quantum circuits
- scientific article; zbMATH DE number 7327933 (Why is no real title available?)
- Graphical CSS Code Transformation Using ZX Calculus
- Light-Matter Interaction in the ZXW Calculus
- Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes
- Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
- Addition and differentiation of ZX-diagrams
- An algebraic axiomatisation of ZX-calculus
- Diagrammatic differentiation for quantum machine learning
- Quantum algorithms and oracles with the scalable ZX-calculus
- A near-minimal axiomatisation of ZX-calculus for pure qubit quantum mechanics
- A recipe for quantum graphical languages
- Quantum circuit completeness: extensions and simplifications
- Approximate optimisation of quantum circuits using the ZX calculus with phase squashing
- A graphical \#SAT algorithm for formulae with small clause density
- Minimal equational theories for quantum circuits
- A complete graphical language for linear optical circuits with finite-photon-number sources and detectors
- Minimality in finite-dimensional ZW-calculi
This page was built for publication: Two complete axiomatisations of pure-state qubit quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145325)