A lower bound for quantum search of an ordered list

DOI10.1016/S0020-0190(99)00069-1zbMath1002.68035OpenAlexW1973725012WikidataQ127526557 ScholiaQ127526557MaRDI QIDQ1606939

Ronald de Wolf, Harry Buhrman

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00069-1

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68)

Related Items (1)

Quantum and classical query complexities of local search are polynomially related

This page was built for publication: A lower bound for quantum search of an ordered list