The quantum query complexity of the determinant
From MaRDI portal
Publication:976107
DOI10.1016/j.ipl.2008.11.006zbMath1191.68350OpenAlexW2009579056MaRDI QIDQ976107
Thomas Thierauf, Sebastian Dörn
Publication date: 16 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.11.006
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A combinatorial approach to matrix algebra
- Quantum verification of matrix products
- Determinant: Old Algorithms, New Insights
- Quantum Algorithms for Element Distinctness
- Quantum lower bounds by polynomials
- The Quantum Query Complexity of Algebraic Properties
- The Quantum Complexity of Group Testing
- Quantum Algorithms for Matching and Network Flows
- Automata, Languages and Programming
- Automata, Languages and Programming
- Automata, Languages and Programming
- Quantum cryptanalysis of hash and claw-free functions
- Quantum lower bounds by quantum arguments
- SOFSEM 2004: Theory and Practice of Computer Science
This page was built for publication: The quantum query complexity of the determinant