How fast can quantum annealers count?

DOI10.1088/1751-8113/47/23/235304zbMath1294.81039arXiv1301.4956OpenAlexW1976351175MaRDI QIDQ5495127

Itay Hen

Publication date: 31 July 2014

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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

zbMATH Keywords

quantum countingGrover's search algorithmadiabatic quantum computingquantum annealers

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68) Information theory (general) (94A15)

Related Items (2)

Models in quantum computing: a systematic review ⋮ How quantum is the speedup in adiabatic unstructured search?

This page was built for publication: How fast can quantum annealers count?