UNDERSTANDING QUANTUM ALGORITHMS VIA QUERY COMPLEXITY

DOI10.1142/9789813272880_0181zbMath1490.68108arXiv1712.06349OpenAlexW2972412185MaRDI 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

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Approximation by polynomials (41A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (11)

Approximate Degree in Classical and Quantum Computing ⋮ Quantum algorithm for Dyck language with multiple types of brackets ⋮ The improvement of decision tree construction algorithm based on quantum heuristic algorithms ⋮ Quantum attribute-based encryption: a comprehensive study ⋮ From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm ⋮ Lifting query complexity to time-space complexity for two-way finite automata ⋮ Unnamed Item ⋮ A relational time-symmetric framework for analyzing the quantum computational speedup ⋮ Extended learning graphs for triangle finding ⋮ Adjacent vertices can be hard to find by quantum walks ⋮ Quantum algorithms for string processing

This page was built for publication: UNDERSTANDING QUANTUM ALGORITHMS VIA QUERY COMPLEXITY