Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
From MaRDI portal
Publication:6102995
DOI10.1007/978-3-031-15298-6_6OpenAlexW4297809257MaRDI QIDQ6102995FDOQ6102995
Publication date: 2 June 2023
Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15298-6_6
Recommendations
- Computing power of Turing machines in the framework of unsharp quantum logic
- Quantum computation of discrete logarithms in semigroups
- Quantum proof systems for iterated exponential time, and beyond
- scientific article; zbMATH DE number 1839432
- Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
- scientific article; zbMATH DE number 799789
- On exact quantum query complexity
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
quantum Turing machineschematic definitionfast quantum recursionquantum logarithmic-time computability
Cites Work
- Quantum theory, the Church–Turing principle and the universal quantum computer
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- On uniformity within \(NC^ 1\)
- Quantum computational networks
- Title not available (Why is that?)
- Quantum lower bounds by polynomials
- Recursive Predicates and Quantifiers
- Computability and Recursion
- ANALYSIS OF QUANTUM FUNCTIONS
- Theory of one-tape linear-time Turing machines
- Title not available (Why is that?)
- General recursive functions of natural numbers
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
Cited In (2)
This page was built for publication: Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102995)
