Quantum and Classical Structures in Nondeterminstic Computation

DOI10.1007/978-3-642-00834-4_13MaRDI QIDQ3616559zbMATH OpenOpenAlexFDO

Authors Dusko Pavlovic

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Abstract: In categorical quantum mechanics, classical structures characterize the classical interfaces of quantum resources on one hand, while on the other hand giving rise to some quantum phenomena. In the standard Hilbert space model of quantum theories, classical structures over a space correspond to its orthonormal bases. In the present paper, we show that classical structures in the category of relations correspond to biproducts of abelian groups. Although relations are, of course, not an interesting model of quantum computation, this result has some interesting computational interpretations. If relations are viewed as denotations of nondeterministic programs, it uncovers a wide variety of non-standard quantum structures in this familiar area of classical computation. Ironically, it also opens up a version of what in philosophy of quantum mechanics would be called an ontic-epistemic gap, as it provides no direct interface to these nonstandard quantum structures.

Recommendations

• Classical and quantum structuralism
• Classical structures based on unitaries
• Bicategorical semantics for nondeterministic computation
• Geometry of abstraction in quantum computation
• The search for structure in quantum computation

Cited in

(28)

• Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
• Relative Frobenius algebras are groupoids
• Bialgebraic foundations for the operational semantics of string diagrams
• Monoidal characterisation of groupoids and connectors
• Descriptional complexity and operations -- two non-classical cases
• On block structures in quantum computation
• Bicategorical semantics for nondeterministic computation
• 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)
• Geometry of abstraction in quantum computation
• The search for structure in quantum computation
• Quantum Nondeterministic Computation based on Statistics Superselection Rules
• Categorifying the ZX-calculus
• Paraconsistent Machines and their Relation to Quantum Computing
• Classical and quantum structuralism
• Monoidal computer. I: Basic computability by string diagrams
• Compositional quantum logic
• Completely positive classical structures and sequentializable quantum protocols
• A bestiary of sets and relations
• The quantum monad on relational structures
• Interacting quantum observables: categorical algebra and diagrammatics
• scientific article; zbMATH DE number 5066359 (Why is no real title available?)
• Classical structures based on unitaries
• Bialgebraic semantics for string diagrams
• Reversible monadic computing
• A dichotomy between twisted tensor products of bialgebras and Frobenius algebras
• Functorial semantics for relational theories

This page was built for publication: Quantum and Classical Structures in Nondeterminstic Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3616559)