Quantum computers can search arbitrarily large databases by a single query
Lov K. Grover
Abstract
This paper shows that a quantum mechanical algorithm that can query information relating to multiple items of the database, can search a database in a single query (a query is defined as any question to the database to which the database has to return a (YES/NO) answer). A classical algorithm will be limited to the information theoretic bound of at least O(log N) queries (which it would achieve by using a binary search).
Create a lesson
Related papers
Logical CCZ state cultivation
Yuta Hirasaki, Jong Yeon Lee
Quantum-Aware Key Rank for Side-Channel Attacks evaluation
Yevgen Kotukh
Intermediate memory costs of quantum channel synthesis with a protected subsystem
Kai Liu, Deguang Han
Quantum Work Statistics from Entanglement-Assisted Invariance
Akira Sone, Akram Touil, Emery Doucet et al.
Petz Recovery through a Single Polar Transformation for Approximate Quantum Error Correction
Hanzhang Zhao, Shenglong Xu
Demonstration of a mobile ion-trap quantum device
Sara Alfaro, Dipesh Bhanushali, Sankarshan Choudapurkar et al.