Chunhao Wang, PhD candidate
David R. Cheriton School of Computer Science
We give a dissipative quantum search algorithm that is based on a novel dissipative query model. If there are $N$ items and $M$ of them are marked, this algorithm performs a fixed-point quantum search using $O(\sqrt{N/M}\log(1/\epsilon))$ queries with error bounded by $\epsilon$. In addition, we present a continuous-time version of this algorithm in terms of Lindblad evolution.
200 University Avenue West
Waterloo, ON N2L 3G1
Canada