The Quantum Query Complexity of Algebraic Properties

DOI10.1007/978-3-540-74240-1_22zbMath1135.68438arXiv0705.1446OpenAlexW1727340102MaRDI QIDQ5444965

Sebastian Dörn, Thomas Thierauf

Publication date: 26 February 2008

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (5)

Quantum algorithms for matching problems ⋮ A note on the search for \(k\) elements via quantum walk ⋮ Quantum Walk Based Search Algorithms ⋮ Quantum algorithm design: techniques and applications ⋮ The quantum query complexity of the determinant

This page was built for publication: The Quantum Query Complexity of Algebraic Properties