Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Search Form

Phil Wittmer

Published Oct 10, 2006• 0 citations
OpenAlex

Related papers

Searching for Quantum Programs and Quantum Protocols

Susan Stepney, John A. Clark

We review how computational search techniques inspired by biological evolution have been used to discover quantum circuits and quantum algorithms. We discuss issues in representing quantum artefacts in a form suitable for evolutionary search, various quantum artefacts that have been discovered through evolutionary search, and future prospects for this approach.

Journal of Computational and Theoretical Nanoscience•May 1, 2008•12 citations

Quantum Search

Prateek Tandon, Stanley Lam, Ben Shih +3 more

Synthesis lectures on quantum computing•Jan 1, 2017•0 citations

Quantum Search

Sergei Kurgalin, Sergei Borzunov

Texts in computer science•Jan 1, 2021•0 citations

Connectivity effects in the coined quantum walk search algorithm

Neil B. Lovett, Viv M. Kendon

We show numerically how the quantum walk search algorithm depends on both the spatial dimension and connectivity of the structure being searched. We investigate this using a simple form of tunnelling to interpolate between lattices.

International Conference on Quantum Information•Jan 1, 2011•0 citations

Improved Algorithm and Lower Bound for Variable Time Quantum Search

Andris Ambainis, Martins Kokainis, Jevgēnijs Vihrovs

We study variable time search, a form of quantum search where queries to different items take different time. Our first result is a new quantum algorithm that performs variable time search with complexity $O(\sqrt{T}\log n)$ where $T=\sum_{i=1}^n t_i^2$ with $t_i$ denoting the time to check the $i$-th item. Our second result is a quantum lower bound of $Ω(\sqrt{T\log T})$. Both the algorithm and the lower bound improve over previously known results by a factor of $\sqrt{\log T}$ but the algorithm is also substantially simpler than the previously known quantum algorithms.

arXiv:2302.06749•Leibniz international proceedings in informatics•Jan 1, 2023•11 citations

Quantum Search Algorithm

Jerzy Klamka

WORLD SCIENTIFIC eBooks•Nov 1, 2010•0 citations
We study variable time search, a form of quantum search where queries to different items take different time. Our first result is a new quantum algorithm that performs variable time search with complexity O(Tlog⁡n)O(\sqrt{T}\log n)O(T​logn) where T=∑i=1nti2T=\sum_{i=1}^n t_i^2T=∑i=1n​ti2​ with tit_iti​ denoting the time to check the iii-th item. Our second result is a quantum lower bound of Ω(Tlog⁡T)Ω(\sqrt{T\log T})Ω(TlogT​). Both the algorithm and the lower bound improve over previously known results by a factor of log⁡T\sqrt{\log T}logT​ but the algorithm is also substantially simpler than the previously known quantum algorithms.