Quantum spatial search on graphs subject to dynamical noise

 |  Login

Show simple item record

dc.contributor Aalto-yliopisto fi
dc.contributor Aalto University en
dc.contributor.author Cattaneo, Marco
dc.contributor.author Rossi, Matteo A.C.
dc.contributor.author Paris, Matteo G.A.
dc.contributor.author Maniscalco, Sabrina
dc.date.accessioned 2019-01-14T09:21:47Z
dc.date.available 2019-01-14T09:21:47Z
dc.date.issued 2018-11-27
dc.identifier.citation Cattaneo , M , Rossi , M A C , Paris , M G A & Maniscalco , S 2018 , ' Quantum spatial search on graphs subject to dynamical noise ' Physical Review A , vol. 98 , no. 5 , 052347 , pp. 1-8 . DOI: 10.1103/PhysRevA.98.052347 en
dc.identifier.issn 2469-9926
dc.identifier.issn 2469-9934
dc.identifier.other PURE UUID: 614a83aa-af41-4a6e-bfa3-65f147bf1fc7
dc.identifier.other PURE ITEMURL: https://research.aalto.fi/en/publications/quantum-spatial-search-on-graphs-subject-to-dynamical-noise(614a83aa-af41-4a6e-bfa3-65f147bf1fc7).html
dc.identifier.other PURE LINK: http://www.scopus.com/inward/record.url?scp=85057560752&partnerID=8YFLogxK
dc.identifier.other PURE FILEURL: https://research.aalto.fi/files/30559896/PhysRevA.98.052347.pdf
dc.identifier.uri https://aaltodoc.aalto.fi/handle/123456789/35967
dc.description.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. en
dc.format.extent 1-8
dc.format.mimetype application/pdf
dc.language.iso en en
dc.relation.ispartofseries Physical Review A en
dc.relation.ispartofseries Volume 98, issue 5 en
dc.rights openAccess en
dc.subject.other Atomic and Molecular Physics, and Optics en
dc.subject.other 114 Physical sciences en
dc.title Quantum spatial search on graphs subject to dynamical noise en
dc.type A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä fi
dc.description.version Peer reviewed en
dc.contributor.department Centre of Excellence in Quantum Technology, QTF
dc.contributor.department University of Turku
dc.contributor.department University of Milan
dc.contributor.department Department of Applied Physics
dc.subject.keyword Atomic and Molecular Physics, and Optics
dc.subject.keyword 114 Physical sciences
dc.identifier.urn URN:NBN:fi:aalto-201901141150
dc.identifier.doi 10.1103/PhysRevA.98.052347
dc.type.version publishedVersion


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search archive


Advanced Search

article-iconSubmit a publication

Browse

My Account