Description
We propose and analyze a non-unitary variant of the continuous time Grover search algorithm based on frequent Zeno-type measurements. We show that the algorithm scales similarly to the pure quantum version by deriving tight analytical lower bounds on its efficiency for arbitrary database sizes and measurement parameters. We study the behavior of the algorithm subject to noise, and find that under certain oracle and operational errors our measurement-based algorithm outperforms the standard algorithm, showing robustness against these noises.
Primary authors
Pavlo Pyshkin
(The University of the Basque Country UPV/EHU)
Aurél Gábris
(Czech Technical University in Prague)
Da-Wei Luo
(Stevens Institute of Technology)
J. Q. You
(State Key Laboratory of Modern Optical Instrumentation, Zhejiang University)
Lian-Ao Wu
(The University of the Basque Country UPV/EHU)
