Quantum spatial search on graphs subject to dynamical noise

6 Sep 2018 Marco Cattaneo Matteo A. C. Rossi Matteo G. A. Paris Sabrina Maniscalco

We address quantum spatial search on graphs and its implementation by continuous-time quantum walks in the presence of dynamical noise. In particular, we focus on search on the complete graph and on the star graph of order $N$, proving that also the latter is optimal in the computational limit $N \gg 1$, being nearly optimal also for small $N$... (read more)

PDF Abstract