The Quantum Complexity of Group Testing

DOI10.1007/978-3-540-77566-9_44MaRDI QIDQ5448677zbMATH OpenOpenAlexFDO

Authors Sebastian Dörn, Thomas Thierauf

Publication date 7 March 2008

Published in SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77566-9_44

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Quantum computation (81P68)

Recommendations

• The Quantum Query Complexity of Algebraic Properties
• Automata, Languages and Programming
• Quantum complexity of testing group commutativity
• Mathematical Foundations of Computer Science 2003

Cited in

(10)

• A note on the search for k elements via quantum walk
• Quantum complexity of testing group commutativity
• Quantum Testers for Hidden Group Properties
• Efficient quantum algorithms for (gapped) group testing and junta testing
• Improved quantum query algorithms for triangle detection and associativity testing
• Testing commutativity of a group and the power of randomization.
• The one-way communication complexity of subgroup membership
• The Quantum Query Complexity of Algebraic Properties
• Automata, Languages and Programming
• The quantum query complexity of the determinant

This page was built for publication: The Quantum Complexity of Group Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448677)