Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper revisits an optimal-scheduling result for adiabatic quantum search under dephasing and derives closed-form schedules, minimum runtimes, and achievable fidelities for the adiabatic Grover framework. Its most useful claim for quantum algorithm researchers is that the apparent benefit of strong dephasing is a Zeno-type stabilization effect, not a true speedup over unitary Grover search, and that an energy-time argument sets a threshold beyond which noise-assisted acceleration is ruled out. Readers evaluating noise-tolerant search strategies should treat the analysis as a clarification of limits rather than a route to improved scaling.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Open-System Adiabatic Quantum Search under Dephasing

arXiv2 min read

arXiv:2603.28506v2 Announce Type: replace Abstract: Adiabatic quantum algorithms must evolve slowly enough to suppress non-adiabatic transitions while remaining fast enough to be practical. In open systems, this trade-off is reshaped by decoherence. For Hamiltonians subject to dephasing Lindbladians, Avron et al. [Phys. Rev. A 82, 040304(R) (2010)] showed that a unique timetable exists that maximizes the fidelity with a target state. This optimal schedule is characterized by a constant tunneling rate along the adiabatic path. In this work, we revisit their analysis and apply it to the adiabatic Grover search framework, obtaining closed-form expressions for the optimal evolution schedule, the minimum runtime, and the resulting achievable fidelity. Moreover, by invoking an energy-time uncertainty argument, we identify a critical dephasing threshold beyond which further noise-assisted acceleration is prohibited, showing that the apparent advantage of strong dephasing is a Zeno-type stabilization mechanism rather than a conventional algorithmic speedup over unitary Grover search.

Abstract:Adiabatic quantum algorithms must evolve slowly enough to suppress non-adiabatic transitions while remaining fast enough to be practical. In open systems, this trade-off is reshaped by decoherence. For Hamiltonians subject to dephasing Lindbladians, Avron et al. [Phys. Rev. A 82, 040304(R) (2010)] showed that a unique timetable exists that maximizes the fidelity with a target state. This optimal schedule is characterized by a constant tunneling rate along the adiabatic path. In this work, we revisit their analysis and apply it to the adiabatic Grover search framework, obtaining closed-form expressions for the optimal evolution schedule, the minimum runtime, and the resulting achievable fidelity. Moreover, by invoking an energy-time uncertainty argument, we identify a critical dephasing threshold beyond which further noise-assisted acceleration is prohibited, showing that the apparent advantage of strong dephasing is a Zeno-type stabilization mechanism rather than a conventional algorithmic speedup over unitary Grover search.

arXiv:2603.28506 [quant-ph]

(or arXiv:2603.28506v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2603.28506 Focus to learn more arXiv-issued DOI via DataCite

Phys. Rev. A 114, 042411 (2026)

https://doi.org/10.1103/9q9k-92cf Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 250 words

Related coverage