Adiabatic quantum counting by geometric phase estimation

From MaRDI portal
Publication:989904

DOI10.1007/S11128-009-0132-YzbMATH Open1194.81052arXiv0805.1387OpenAlexW2155126709MaRDI QIDQ989904FDOQ989904


Authors: Chi Zhang, A. Papageorgiou, Zhaohui Wei Edit this on Wikidata


Publication date: 23 August 2010

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, alpha, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a Berry phase 2pialpha. By estimating the Berry phase, we can approximate alpha, and solve the problem. For an error bound epsilon, the algorithm can solve the problem with cost of order (frac1epsilon)3/2, which is not as good as the optimal algorithm in the quantum circuit model, but better than the classical random algorithm. Moreover, since the Berry phase is a purely geometric feature, the result may be robust to decoherence and resilient to certain noise.


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




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Adiabatic quantum counting by geometric phase estimation

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