Fault-ignorant Quantum Search
Quantum Physics
2014-07-28 v2 Mathematical Physics
math.MP
Abstract
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.
Cite
@article{arxiv.1307.0771,
title = {Fault-ignorant Quantum Search},
author = {Peter Vrana and David Reeb and Daniel Reitzner and Michael M. Wolf},
journal= {arXiv preprint arXiv:1307.0771},
year = {2014}
}
Comments
v1: 15+8 pages, 4 figures; v2: 19+8 pages, 4 figures, published version (Introduction section significantly expanded, presentation clarified, results and order unchanged)