Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions
From MaRDI portal
Cites work
- A programming language characterizing quantum polynomial time
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- ANALYSIS OF QUANTUM FUNCTIONS
- Computability and Recursion
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
- General recursive functions of natural numbers.
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- scientific article; zbMATH DE number 1418357 (Why is no real title available?)
- Local transition functions of quantum Turing machines
- Mathematical Foundations of Computer Science 2004
- Oracle Separation of BQP and PH
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Quantum Complexity Theory
- Quantum computational networks
- Quantum lower bounds by polynomials
- Quantum lower bounds by quantum arguments
- Recursive Predicates and Quantifiers
- SOFSEM 2004: Theory and Practice of Computer Science
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
Cited in
(2)
This page was built for publication: Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646016)
