The quantum black-box complexity of majority

DOI10.1007/s00453-002-0981-6zbMath1012.68073arXivquant-ph/0109101OpenAlexW2097185551MaRDI QIDQ1871636

Thomas P. Hayes, Dieter van Melkebeek, Samuel Kutin

Publication date: 4 May 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0109101

zbMATH Keywords

quantum computingquery complexitymajority functionLas Vegas algorithms

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Related Items (5)

Finding a majority ball with majority answers ⋮ Adaptive majority problems for restricted query graphs and for weighted sets ⋮ Revisiting Deutsch-Jozsa algorithm ⋮ Finding a non-minority ball with majority answers ⋮ On exact quantum query complexity

This page was built for publication: The quantum black-box complexity of majority