scholarly journals Promised and Distributed Quantum Search

2005 ◽  
pp. 430-439 ◽  
Author(s):  
Shengyu Zhang
Keyword(s):  
Quantum Search

scholarly journals Implementation of efficient quantum search algorithms on NISQ computers

2021 ◽  
Vol 20 (7) ◽  
Author(s):  
Kun Zhang ◽  
Pooja Rao ◽  
Kwangmin Yu ◽  
Hyunkyung Lim ◽  
Vladimir Korepin
Keyword(s):  
Search Algorithms ◽  
Quantum Search ◽  
Quantum Search Algorithms

Quantum Key Agreement Protocol Based on Quantum Search Algorithm

2021 ◽  
Author(s):  
Xi Huang ◽  
Shi-Bin Zhang ◽  
Yan Chang ◽  
Chi Qiu ◽  
Dong-Mei Liu ◽  
...  
Keyword(s):  
Key Agreement ◽  
Search Algorithm ◽  
Quantum Search ◽  
Quantum Key Agreement ◽  
Quantum Search Algorithm ◽  
Key Agreement Protocol ◽  
Quantum Key Agreement Protocol

scholarly journals Dark states of quantum search cause imperfect detection

2020 ◽  
Vol 2 (4) ◽  
Author(s):  
Felix Thiel ◽  
Itay Mualem ◽  
Dror Meidan ◽  
Eli Barkai ◽  
David A. Kessler
Keyword(s):  
Quantum Search ◽  
Imperfect Detection

scholarly journals Simple Algorithm for Partial Quantum Search

2006 ◽  
Vol 5 (1) ◽  
pp. 5-10 ◽  
Author(s):  
Vladimir E. Korepin ◽  
Lov K. Grover
Keyword(s):  
Simple Algorithm ◽  
Quantum Search

A quantum search algorithm for future spacecraft attitude determination

2011 ◽  
Vol 68 (7-8) ◽  
pp. 1208-1218 ◽  
Author(s):  
Jack Tsai ◽  
Fu-Yuen Hsiao ◽  
Yi-Ju Li ◽  
Jen-Fu Shen
Keyword(s):  
Attitude Determination ◽  
Search Algorithm ◽  
Spacecraft Attitude ◽  
Quantum Search ◽  
Quantum Search Algorithm

scholarly journals Nonlinear quantum search using the Gross–Pitaevskii equation

2013 ◽  
Vol 15 (6) ◽  
pp. 063014 ◽  
Author(s):  
David A Meyer ◽  
Thomas G Wong
Keyword(s):  
Pitaevskii Equation ◽  
Quantum Search ◽  
Nonlinear Quantum

scholarly journals Grover’s quantum search algorithm for an arbitrary initial mixed state

2002 ◽  
Vol 66 (6) ◽  
Author(s):  
Eli Biham ◽  
Dan Kenigsberg
Keyword(s):  
Mixed State ◽  
Search Algorithm ◽  
Quantum Search ◽  
Quantum Search Algorithm

How significant are the known collision and element distinctness quantum algorithms?

2004 ◽  
Vol 4 (3) ◽  
pp. 201-206
Author(s):  
L. Grover ◽  
T. Rudolph
Keyword(s):  
Search Algorithm ◽  
Quantum Algorithms ◽  
Search Space ◽  
Space Complexity ◽  
Quantum Search ◽  
Quantum Search Algorithm ◽  
Time Space ◽  
Simple Quantum ◽  
Structured Problems ◽  
Better Than

Quantum search is a technique for searching $N$ possibilities for a desired target in $O(\sqrt{N})$ steps. It has been applied in the design of quantum algorithms for several structured problems. Many of these algorithms require significant amount of quantum hardware. In this paper we propose the criterion that an algorithm which requires $O(S)$ hardware should be considered significant if it produces a speedup of better than $O\left(\sqrt{S}\right)$ over a simple quantum search algorithm. This is because a speedup of $O\left(\sqrt{S}\right)$ can be trivially obtained by dividing the search space into $S$ separate parts and handing the problem to $S$ independent processors that do a quantum search (in this paper we drop all logarithmic factors when discussing time/space complexity). Known algorithms for collision and element distinctness exactly saturate the criterion.

Sign in / Sign up

Export Citation Format

Share Document