Mathematical Foundations of Computer Science 2004

DOI10.1007/b99679zbMath1097.68567OpenAlexW2488008928MaRDI QIDQ5311154

Harumichi Nishimura, Tomoyuki Yamakami

Publication date: 22 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99679

zbMATH Keywords

quantum computationadvicequery complexityAlgorithmic argumentnonadaptive query

Mathematics Subject Classification ID

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

Related Items (2)

Nonadaptive quantum query complexity ⋮ Adversary lower bounds for nonadaptive quantum algorithms

This page was built for publication: Mathematical Foundations of Computer Science 2004