Interacting Quantum Observables
From MaRDI portal
Publication:3519509
DOI10.1007/978-3-540-70583-3_25zbMath1155.81316arXiv0906.4725OpenAlexW2119180894WikidataQ62472273 ScholiaQ62472273MaRDI QIDQ3519509
Publication date: 19 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.4725
Related Items
Monoidal reverse differential categories ⋮ Categorical quantum cryptography for access control in cloud computing ⋮ Tutorial: Graphical Calculus for Quantum Circuits ⋮ String Diagram Rewrite Theory I: Rewriting with Frobenius Structure ⋮ Tensors, !-graphs, and non-commutative quantum structures ⋮ Unnamed Item ⋮ Monoidal computer. I: Basic computability by string diagrams ⋮ Complementarity in categorical quantum mechanics ⋮ A compositional approach to quantum functions ⋮ A Topological Perspective on Interacting Algebraic Theories ⋮ A Bestiary of Sets and Relations ⋮ Categories of relations as models of quantum theory ⋮ Categorifying the ZX-calculus ⋮ Unnamed Item ⋮ DisCoPy: Monoidal Categories in Python ⋮ Unnamed Item ⋮ Graphical CSS Code Transformation Using ZX Calculus ⋮ Light-Matter Interaction in the ZXW Calculus ⋮ Picturing Counting Reductions with the ZH-Calculus ⋮ Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes ⋮ The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality ⋮ Contextual equivalence for signal flow graphs ⋮ Hybrid quantum-classical circuit simplification with the ZX-calculus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Towards compositional graph theory ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantum picturalism for topological cluster-state computing ⋮ Confluence of Graph Rewriting with Interfaces ⋮ Shaded tangles for the design and verification of quantum circuits ⋮ Open-graphs and monoidal theories ⋮ Bases in Diagrammatic Quantum Protocols ⋮ FJQuantum. A quantum object oriented language ⋮ Graph States and the Necessity of Euler Decomposition ⋮ Game theoretic security of quantum bit commitment ⋮ A new description of orthogonal bases ⋮ Universal Constructions for (Co)Relations: categories, monoidal categories, and props ⋮ An arbitrarily concealing and practically binding quantum bit commitment protocol ⋮ Biunitary constructions in quantum information ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bialgebraic foundations for the operational semantics of string diagrams ⋮ The ZX-calculus is complete for stabilizer quantum mechanics ⋮ Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus} ⋮ Exploring a Quantum Theory with Graph Rewriting and Computer Algebra ⋮ Toy Quantum Categories (Extended Abstract) ⋮ Phase Groups and the Origin of Non-locality for Qubits ⋮ Relating Toy Models of Quantum Computation: Comprehension, Complementarity and Dagger Mix Autonomous Categories ⋮ Graphical Calculus for Quantum Key Distribution (Extended Abstract) ⋮ Categorical quantum mechanics II: Classical-quantum interaction ⋮ Graphical reasoning in compact closed categories for quantum computation ⋮ Refinement for signal flow graphs ⋮ Systematics and symmetry in molecular phylogenetic modelling: perspectives from physics ⋮ A complete graphical calculus for Spekkens' toy bit theory ⋮ String diagram rewrite theory III: Confluence with and without Frobenius
