Quantum circuit oracles for abstract machine computations
From MaRDI portal
Publication:960862
DOI10.1016/j.tcs.2009.11.017zbMath1195.68045OpenAlexW2090347377MaRDI QIDQ960862
Publication date: 29 March 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.11.017
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Related Items (4)
Can a Quantum Computer Run the von Neumann Architecture? ⋮ A categorical analogue of the monoid semiring construction ⋮ On the Functor ℓ2 ⋮ Quantum Speedup and Categorical Distributivity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A categorical model for the geometry of interaction
- Machine semantics
- Coherence for compact closed categories
- Algebraically compact functors
- Geometry of Interaction and the Dynamics of Proof Reduction: A Tutorial
- Fast quantum modular exponentiation
- On Halting Process of Quantum Turing Machine
- A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
- On traced monoidal closed categories
- Time/Space Trade-Offs for Reversible Computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Almost factorisable inverse semigroups
- Games and full completeness for multiplicative linear logic
- Quantum Complexity Theory
- Unique decomposition categories, Geometry of Interaction and combinatory logic
- Can a Universal Quantum Computer Be Fully Quantum?
- Geometry of Interaction and linear combinatory algebras
- Towards a quantum programming language
- Traced monoidal categories
- Physical Systems as Constructive Logics
- Algebra and Coalgebra in Computer Science
- Logical Reversibility of Computation
- Retracing some paths in process algebra
This page was built for publication: Quantum circuit oracles for abstract machine computations