Wolf, Michael M.
- Journal Article
Rights / licenseCreative Commons Attribution 3.0 Unported
We investigate the problem of quantum searching on a noisy quantum computer. Taking a fault-ignorant approach, we analyze quantum algorithms that solve the task for various different noise strengths, which are possibly unknown beforehand. We prove lower bounds on the runtime of such algorithms and thereby find that the quadratic speedup is necessarily lost (in our noise models). However, for low but constant noise levels the algorithms we provide (based on Groverʼs algorithm) still outperform the best noiseless classical search algorithm. Show more
Journal / seriesNew Journal of Physics
Pages / Article No.
PublisherInstitute of Physics
SubjectQuantum search; Aalgorithms; Fault tolerance; Grover search; Computational complexity; Error correction; Runtime bounds
MoreShow all metadata