Designing exceptional-point-based graphs yielding topologically guaranteed quantum search

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Quantum walks underlie an important class of quantum computing algorithms, and represent promising approaches in various simulations and practical applications. Here we design stroboscopically monitored quantum walks and their subsequent graphs that can naturally boost target searches. We show how to construct walks with the property that all the eigenvalues of the non-Hermitian survival operator, describing the mixed effects of unitary dynamics and the back-action of measurement, coalesce to zero, corresponding to an exceptional point whose degree is the size of the system. Generally, the resulting search is guaranteed to succeed in a bounded time for any initial condition, which is faster than classical random walks or quantum walks on typical graphs. We then show how this efficient quantum search is related to a quantized topological winding number and further discuss the connection of the problem to an effective massless Dirac particle.

Original languageEnglish
Article number023141
JournalPhysical Review Research
Issue number2
StatePublished - Apr 2023

Bibliographical note

Publisher Copyright:
© 2023 authors. Published by the American Physical Society. Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.


Dive into the research topics of 'Designing exceptional-point-based graphs yielding topologically guaranteed quantum search'. Together they form a unique fingerprint.

Cite this