Optimal Quantum Adversary Lower Bounds for Ordered Search

DOI10.1007/978-3-540-70575-8_71zbMath1153.68363arXiv0708.3396OpenAlexW1601135701MaRDI QIDQ3521972

Troy Lee, Andrew M. Childs

Publication date: 28 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0708.3396

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Quantum Walks ⋮ Quantum Query Algorithms Are Completely Bounded Forms

This page was built for publication: Optimal Quantum Adversary Lower Bounds for Ordered Search