Geometry of abstraction in quantum computation
From MaRDI portal
Publication:2918880
zbMath1258.81022arXiv1006.1010MaRDI QIDQ2918880
Publication date: 1 October 2012
Full work available at URL: https://arxiv.org/abs/1006.1010
Quantum computation (81P68) Semantics in the theory of computing (68Q55) Categorical semantics of formal languages (18C50) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
Monoidal computer. I: Basic computability by string diagrams, (Modular) Effect Algebras are Equivalent to (Frobenius) Antispecial Algebras, Chasing Diagrams in Cryptography, Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract)
