Adversary Lower Bounds for Nonadaptive Quantum Algorithms
From MaRDI portal
Publication:3511461
DOI10.1007/978-3-540-69937-8_20zbMath1155.68398arXiv0804.1440OpenAlexW2571124126MaRDI QIDQ3511461
Natacha Portier, Penghui Yao, Jürgen Landes, Pascal Koiran
Publication date: 10 July 2008
Published in: Logic, Language, Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.1440
Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: Adversary Lower Bounds for Nonadaptive Quantum Algorithms
