Progress in quantum algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5787962 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2079375 (Why is no real title available?)
- scientific article; zbMATH DE number 1559521 (Why is no real title available?)
- scientific article; zbMATH DE number 1796833 (Why is no real title available?)
- scientific article; zbMATH DE number 1406124 (Why is no real title available?)
- Coins make quantum walks faster
- Exponential algorithmic speedup by a quantum walk
- Lattice problems in NP ∩ coNP
- On the Power of Quantum Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- Strengths and Weaknesses of Quantum Computing
- The complexity of theorem-proving procedures
- Why haven't more quantum algorithms been found?
Cited in
(9)- Why haven't more quantum algorithms been found?
- Quantum algorithm design: techniques and applications
- Natural Quantum Operational Semantics with Predicates
- Computational complexity of the landscape. I.
- Models of quantum computation and quantum programming languages
- Quantum cryptography: protecting our future networks with quantum mechanics
- Classical-processing and quantum-processing signal separation methods for qubit uncoupling
- Self-protected quantum algorithms based on quantum state tomography
- Quantum Algorithms
This page was built for publication: Progress in quantum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386407)