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, also proving that noiseless spatial search shows optimal quantum speedup in the latter, in the computational limit N ≤ 1. The noise is modeled by independent sources of random telegraph noise (RTN), dynamically perturbing the links of the graph. We observe two different behaviors depending on the switching rate of RTN: fast noise only slightly degrades performance, whereas slow noise is more detrimental and, in general, lowers the success probability. In particular, we still find a quadratic speedup for the average running time of the algorithm, while for the star graph with external target node, we observe a transition to classical scaling. We also address how the effects of noise depend on the order of the graphs and discuss the role of the graph topology. Overall, our results suggest that realizations of quantum spatial search are possible with current technology and indicate the star graph as the perfect candidate for the implementation by noisy quantum walks, owing to its simple topology and nearly optimal performance for just a few nodes also.

Quantum spatial search on graphs subject to dynamical noise / M. Cattaneo, M.A.C. Rossi, M.G.A. Paris, S. Maniscalco. - In: PHYSICAL REVIEW A. - ISSN 2469-9926. - 98:5(2018 Nov 27). [10.1103/PhysRevA.98.052347]

Quantum spatial search on graphs subject to dynamical noise

M.G.A. Paris;
2018-11-27

Abstract

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, also proving that noiseless spatial search shows optimal quantum speedup in the latter, in the computational limit N ≤ 1. The noise is modeled by independent sources of random telegraph noise (RTN), dynamically perturbing the links of the graph. We observe two different behaviors depending on the switching rate of RTN: fast noise only slightly degrades performance, whereas slow noise is more detrimental and, in general, lowers the success probability. In particular, we still find a quadratic speedup for the average running time of the algorithm, while for the star graph with external target node, we observe a transition to classical scaling. We also address how the effects of noise depend on the order of the graphs and discuss the role of the graph topology. Overall, our results suggest that realizations of quantum spatial search are possible with current technology and indicate the star graph as the perfect candidate for the implementation by noisy quantum walks, owing to its simple topology and nearly optimal performance for just a few nodes also.
Atomic and Molecular Physics, and Optics
Settore FIS/03 - Fisica della Materia
Article (author)
File in questo prodotto:
File Dimensione Formato  
PhysRevA.98.052347.pdf

accesso aperto

Tipologia: Publisher's version/PDF
Dimensione 593.58 kB
Formato Adobe PDF
593.58 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2434/605364
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 16
  • ???jsp.display-item.citation.isi??? 16
social impact