The query complexity of order-finding

DOI10.1016/j.ic.2004.04.001zbMath1069.68054arXivquant-ph/9911124OpenAlexW1973682419MaRDI QIDQ596296

Richard Cleve

Publication date: 10 August 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/9911124

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Related Items (5)

Forrelation: A Problem That Optimally Separates Quantum from Classical Computing ⋮ Property testing for cyclic groups and beyond ⋮ Sample complexity of hidden subgroup problem ⋮ Quantum algorithms for algebraic problems ⋮ Deterministic algorithms for the hidden subgroup problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zeros of L-functions
• Quantum algorithms revisited
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Quantum Complexity Theory
• The Difference Between Consecutive Primes
• Primes in short intervals

This page was built for publication: The query complexity of order-finding