Progress in quantum algorithms

DOI10.1007/s11128-004-3878-2zbMath1075.68602MaRDI QIDQ2386407

Peter W. Shor

Publication date: 22 August 2005

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-004-3878-2

zbMATH Keywords

quantum algorithms; NP-complete; short survey

Mathematics Subject Classification ID

81P68: Quantum computation

81-02: Research exposition (monographs, survey articles) pertaining to quantum theory

Related Items

Quantum cryptography: Protecting our future networks with quantum mechanics, Natural Quantum Operational Semantics with Predicates, Computational complexity of the landscape. I., Self-protected quantum algorithms based on quantum state tomography, Quantum algorithm design: techniques and applications, Classical-processing and quantum-processing signal separation methods for qubit uncoupling, Models of quantum computation and quantum programming languages

Cites Work

• Why haven't more quantum algorithms been found?
• Lattice problems in NP ∩ coNP
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Exponential algorithmic speedup by a quantum walk
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Strengths and Weaknesses of Quantum Computing
• The complexity of theorem-proving procedures
• Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item