Publication:5368760

DOI10.4230/LIPIcs.CCC.2016.26zbMath1380.68185arXiv1512.04016MaRDI QIDQ5368760

Shalev Ben-David, Scott Aaronson

Publication date: 10 October 2017

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

zbMATH Keywords

quantum computing; query complexity; structural complexity; decision-tree complexity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q12: Quantum algorithms and complexity in the theory of computing