Rapid sampling though quantum computing

DOI10.1145/335305.335389zbMath1296.68055arXivquant-ph/9912001OpenAlexW1965289856MaRDI QIDQ3192034

Lov K. Grover

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/9912001

Mathematics Subject Classification ID

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

Related Items (2)

A new quantum claw-finding algorithm for three functions ⋮ Solving NP-Complete Problems with Quantum Search

This page was built for publication: Rapid sampling though quantum computing