An Exponentially Fast Quantum Search Algorithm

2000/11/27 by Goong Chen, Chen, Goong, Zijian Diao +1 · 2 citations
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/0011109

openalex publication_date 2000/11/27 · arxiv created 2003/02/11 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper has been withdrawn by the authors.

Cited by

• Deterministic Quantum Search via Recursive Oracle Expansion
• A note on quantum one-way permutations

Related

• An Algorithm to Speed Up Quantum Search
• Chen and Diao's quantum search algorithm is not exponentially fast
• Faster Database search in Quantum Computing
• An Alternative Algorithm for the Database Search Problem on a Quantum Computer
• A fast quantum search algorithm by controlled measurement and qubit comparison implying the complexity class inclusion NP in BQP