Quantum approximate counting, simplified

DOI10.1137/1.9781611976014.5MaRDI QIDQ6538727zbMATH OpenFDO

Authors Scott Aaronson, Patrick Rall

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611976014.5

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(8)

• On query complexity measures and their relations for symmetric functions
• Simple exact quantum search
• Quantum related-key differential cryptanalysis
• Intermediate qutrit-based improved quantum arithmetic operations with application on financial derivative pricing
• Tunable quantum neural networks in the QPAC-learning framework
• Randomized and quantum query complexities of finding a king in a tournament
• A new minimax theorem for randomized algorithms
• Quantum approximate counting with nonadaptive Grover iterations

This page was built for publication: Quantum approximate counting, simplified

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