UNDERSTANDING QUANTUM ALGORITHMS VIA QUERY COMPLEXITY

DOI10.1142/9789813272880_0181zbMath1490.68108arXiv1712.06349MaRDI QIDQ5122156

Andris Ambainis

Publication date: 22 September 2020

Published in: Proceedings of the International Congress of Mathematicians (ICM 2018) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

81P68: Quantum computation

41A10: Approximation by polynomials

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

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