Quantum and Classical Structures in Nondeterminstic Computation
From MaRDI portal
Publication:3616559
DOI10.1007/978-3-642-00834-4_13zbMath1229.68039arXiv0812.2266OpenAlexW1780247516MaRDI QIDQ3616559
Publication date: 26 March 2009
Published in: Quantum Interaction (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.2266
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Related Items (15)
Monoidal computer. I: Basic computability by string diagrams ⋮ A Bestiary of Sets and Relations ⋮ Categorifying the ZX-calculus ⋮ A dichotomy between twisted tensor products of bialgebras and Frobenius algebras ⋮ Unnamed Item ⋮ Relative Frobenius algebras are groupoids ⋮ Reversible monadic computing ⋮ Interacting quantum observables: categorical algebra and diagrammatics ⋮ Compositional Quantum Logic ⋮ Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) ⋮ Bialgebraic foundations for the operational semantics of string diagrams ⋮ 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) ⋮ Monoidal characterisation of groupoids and connectors
This page was built for publication: Quantum and Classical Structures in Nondeterminstic Computation
