Quantum circuit oracles for abstract machine computations
From MaRDI portal
Publication:960862
DOI10.1016/J.TCS.2009.11.017zbMATH Open1195.68045OpenAlexW2090347377MaRDI QIDQ960862FDOQ960862
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)
Cites Work
- Title not available (Why is that?)
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Title not available (Why is that?)
- Quantum Complexity Theory
- Towards a quantum programming language
- Title not available (Why is that?)
- Logical Reversibility of Computation
- On traced monoidal closed categories
- Title not available (Why is that?)
- Geometry of Interaction and linear combinatory algebras
- Traced monoidal categories
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Retracing some paths in process algebra
- Coherence for compact closed categories
- Algebraically compact functors
- A categorical model for the geometry of interaction
- Games and full completeness for multiplicative linear logic
- Almost factorisable inverse semigroups
- Unique decomposition categories, Geometry of Interaction and combinatory logic
- On Halting Process of Quantum Turing Machine
- Can a Universal Quantum Computer Be Fully Quantum?
- Time/Space Trade-Offs for Reversible Computation
- A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
- Algebra and Coalgebra in Computer Science
- Geometry of Interaction and the Dynamics of Proof Reduction: A Tutorial
- Fast quantum modular exponentiation
- Categorical traces from single-photon linear optics
- Title not available (Why is that?)
- Physical Systems as Constructive Logics
- Machine semantics
Cited In (9)
- Quantum functional oracles
- Quantum circuits for OR and AND of ORs.
- A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
Uses Software
This page was built for publication: Quantum circuit oracles for abstract machine computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960862)
