The Quantum Query Complexity of Read-Many Formulas

DOI10.1007/978-3-642-33090-2_30zbMath1365.68261arXiv1112.0548OpenAlexW1915058039MaRDI QIDQ2912853

Robin Kothari, Andrew M. Childs, Shelby Kimmel

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (6)

Improving quantum query complexity of Boolean matrix multiplication using graph collision ⋮ The average sensitivity of bounded-depth formulas ⋮ Quantum Complexity of Boolean Matrix Multiplication and Related Problems ⋮ Quantum algorithm for dynamic programming approach for DAGs and applications ⋮ A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ ⋮ Quantum branch-and-bound algorithm and its application to the travelling salesman problem

This page was built for publication: The Quantum Query Complexity of Read-Many Formulas