Quantum Speedup and Categorical Distributivity

DOI10.1007/978-3-642-38164-5_9zbMath1264.68083arXiv1303.3025OpenAlexW1610555291MaRDI QIDQ4922077

No author found.

Publication date: 28 May 2013

Published in: Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.3025

zbMATH Keywords

coherencedistributivitycategory theoryquantum computingShor's algorithmmonoidal tensors

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum circuit oracles for abstract machine computations
• Natural deduction and coherence for weakly distributive categories
• The geometry of tensor calculus. I
• Algebraically compact functors
• Introduction to extensive and distributive categories
• Braided tensor categories
• Quantum Circuits with Unbounded Fan-out
• Introduction to distributive categories
• A single quantum cannot be cloned
• Algebra and Coalgebra in Computer Science
• Coherence for categories with associativity, commutativity and distributivity
• Duality for groups