Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1811.04636 · Entropy

Robust Diabatic Grover Search by Landau–Zener–Stückelberg Oscillations

Yosi Atia, Yonathan Oren, Nadav Katz

Published Sep 25, 2019• 6 citations
arXivHTMLPDF

Abstract

Quantum computation by the adiabatic theorem requires a slowly-varying Hamiltonian with respect to the spectral gap. We show that the Landau–Zener–Stückelberg oscillation phenomenon, which naturally occurs in quantum two-level systems under non-adiabatic periodic drive, can be exploited to find the ground state of an N-dimensional Grover Hamiltonian. The total runtime of this method is O ( 2 n ) , which is equal to the computational time of the Grover algorithm in the quantum circuit model. An additional periodic drive can suppress a large subset of Hamiltonian control errors by using coherent destruction of tunneling, thus outperforming previous algorithms.

DOI
10.3390/e21100937

Related papers

Landau-Zener-Stückelberg spectroscopy of a fluxonium quantum circuit

Valentín Reparaz, María José Sánchez, Maximiliano Gatto +2 more

In this work, we study the time-averaged populations obtained for a fluxonium circuit under a large amplitude nonresonant periodic drive. We present numerical simulations of the time evolution which consider the multi-level structure of the driven quantum circuit, looking for a realistic modeling closer to experimental implementations. The Landau-Zener-Stückelberg spectra show resonances that can be understood as originated from constructive interference favoring transitions to higher levels. For a truncated two-level system (TLS) the resonance patterns can be interpreted using a simplified description of the avoided crossing that takes into account the dynamic phase accumulated at each operation point. For the multilevel case, we derive an effective two-level Hamiltonian using a Schrieffer-Wolff transformation starting from the Floquet Hamiltonian in the Sambe space. Our study provides predictive insight into experimental outcomes, offering an intuitive interpretation that could also support the implementation of fast-non-adiabatic single-qubit gates and entangling protocols.

arXiv:2504.21691•Physical review. B./Physical review. B•Jul 23, 2025•2 citations

An adiabatic oracle for Grover's algorithm

Bin Yan, Nikolai A. Sinitsyn

Grover's search algorithm was originally proposed for circuit-based quantum computers. A crucial part of it is to query an oracle -- a black-box unitary operation. Generation of this oracle is formally beyond the original algorithm design. Here, we propose a realization of Grover's oracle for a large class of searching problems using a quantum annealing step. The time of this step grows only logarithmically with the size of the database. This suggests an efficient path to application of Grover's algorithm to practically important problems, such as finding the ground state of a Hamiltonian with a spectral gap over its ground state.

arXiv:2207.05665•Jul 12, 2022•1 citation

Optimizing adiabatic quantum pathways via a learning algorithm

Xiaodong Yang, Ran Liu, Jun Li +1 more

Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand us to accelerate the evolution so that the adiabatic errors can be prevented from accumulation. Here, by treating this trade-off task as a multiobjective optimization problem, we propose a gradient-free learning algorithm with pulse smoothing technique to search optimal adiabatic quantum pathways and apply it to the Landau-Zener Hamiltonian and Grover search Hamiltonian. Numerical comparisons with a linear schedule, local adiabatic theorem induced schedule, and gradient-based algorithm searched schedule reveal that the proposed method can achieve significant performance improvements in terms of the adiabatic time and the instantaneous ground-state population maintenance. The proposed method can be used to solve more complex and real adiabatic quantum computation problems.

arXiv:2006.15300•Physical Review A•Jul 16, 2020•10 citations

Open-System Adiabatic Quantum Search under Dephasing

Afaf El Kalai, Peter J. Eder, Christian B. Mendl

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.

quant-pharXiv:2603.28506•Physical Review A•Mar 31, 2026•0 citations

Quantum search by local adiabatic evolution

Jérémie Roland, Nicolas J. Cerf

The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, which tends to the solution. We apply this time-dependent Hamiltonian approach to Grover's problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order $\sqrt{N},$ where N is the number of items in the database. We thus recover the advantage of Grover's standard algorithm as compared to a classical search, scaling as N. This is in contrast with the constant-rate adiabatic approach of Farhi et al. (e-print quant-ph/0001106), where the requirement of adiabaticity is expressed only globally, resulting in a time of order N.

arXiv:quant-ph/0107015•Physical Review A•Mar 26, 2002•629 citations

Alternative fast quantum logic gates using nonadiabatic Landau-Zener-Stückelberg-Majorana transitions

A. I. Ryzhov, O. V. Ivakhnenko, Sergey N Shevchenko +2 more

A conventional realization of quantum logic gates and control is based on resonant Rabi oscillations of the occupation probability of the system. This approach has certain limitations and complications, like counter-rotating terms. We study an alternative paradigm for implementing quantum logic gates based on Landau-Zener-Stückelberg-Majorana (LZSM) interferometry with nonresonant driving and the alternation of adiabatic evolution and nonadiabatic transitions. Compared to Rabi oscillations, the main differences are a nonresonant driving frequency and a small number of periods in the external driving. We explore the dynamics of a multilevel quantum system under LZSM drives and optimize the parameters for increasing the gate speed. We define the parameters of the external driving required for implementing a specific quantum logic gate using the adiabatic-impulse model. In particular, we demonstrate the implementations of single-qubit X, Y, Hadamard gates, and two-qubit i and gates using the LZSM transitions. The considered LZSM approach for implementing arbitrary quantum logic gates can be applied to a large variety of multilevel quantum systems and external driving. Published by the American Physical Society 2024

arXiv:2310.17932•Physical Review Research•Sep 26, 2024•15 citations
Quantum computation by the adiabatic theorem requires a slowly-varying Hamiltonian with respect to the spectral gap. We show that the Landau–Zener–Stückelberg oscillation phenomenon, which naturally occurs in quantum two-level systems under non-adiabatic periodic drive, can be exploited to find the ground state of an N-dimensional Grover Hamiltonian. The total runtime of this method is O ( 2 n ) , which is equal to the computational time of the Grover algorithm in the quantum circuit model. An additional periodic drive can suppress a large subset of Hamiltonian control errors by using coherent destruction of tunneling, thus outperforming previous algorithms.
In this work, we study the time-averaged populations obtained for a fluxonium circuit under a large amplitude nonresonant periodic drive. We present numerical simulations of the time evolution which consider the multi-level structure of the driven quantum circuit, looking for a realistic modeling closer to experimental implementations. The Landau-Zener-Stückelberg spectra show resonances that can be understood as originated from constructive interference favoring transitions to higher levels. For a truncated two-level system (TLS) the resonance patterns can be interpreted using a simplified description of the avoided crossing that takes into account the dynamic phase accumulated at each operation point. For the multilevel case, we derive an effective two-level Hamiltonian using a Schrieffer-Wolff transformation starting from the Floquet Hamiltonian in the Sambe space. Our study provides predictive insight into experimental outcomes, offering an intuitive interpretation that could also support the implementation of fast-non-adiabatic single-qubit gates and entangling protocols.
Grover's search algorithm was originally proposed for circuit-based quantum computers. A crucial part of it is to query an oracle -- a black-box unitary operation. Generation of this oracle is formally beyond the original algorithm design. Here, we propose a realization of Grover's oracle for a large class of searching problems using a quantum annealing step. The time of this step grows only logarithmically with the size of the database. This suggests an efficient path to application of Grover's algorithm to practically important problems, such as finding the ground state of a Hamiltonian with a spectral gap over its ground state.
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand us to accelerate the evolution so that the adiabatic errors can be prevented from accumulation. Here, by treating this trade-off task as a multiobjective optimization problem, we propose a gradient-free learning algorithm with pulse smoothing technique to search optimal adiabatic quantum pathways and apply it to the Landau-Zener Hamiltonian and Grover search Hamiltonian. Numerical comparisons with a linear schedule, local adiabatic theorem induced schedule, and gradient-based algorithm searched schedule reveal that the proposed method can achieve significant performance improvements in terms of the adiabatic time and the instantaneous ground-state population maintenance. The proposed method can be used to solve more complex and real adiabatic quantum computation problems.
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.
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, which tends to the solution. We apply this time-dependent Hamiltonian approach to Grover's problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order N,\sqrt{N},N​, where N is the number of items in the database. We thus recover the advantage of Grover's standard algorithm as compared to a classical search, scaling as N. This is in contrast with the constant-rate adiabatic approach of Farhi et al. (e-print quant-ph/0001106), where the requirement of adiabaticity is expressed only globally, resulting in a time of order N.
A conventional realization of quantum logic gates and control is based on resonant Rabi oscillations of the occupation probability of the system. This approach has certain limitations and complications, like counter-rotating terms. We study an alternative paradigm for implementing quantum logic gates based on Landau-Zener-Stückelberg-Majorana (LZSM) interferometry with nonresonant driving and the alternation of adiabatic evolution and nonadiabatic transitions. Compared to Rabi oscillations, the main differences are a nonresonant driving frequency and a small number of periods in the external driving. We explore the dynamics of a multilevel quantum system under LZSM drives and optimize the parameters for increasing the gate speed. We define the parameters of the external driving required for implementing a specific quantum logic gate using the adiabatic-impulse model. In particular, we demonstrate the implementations of single-qubit X, Y, Hadamard gates, and two-qubit i and gates using the LZSM transitions. The considered LZSM approach for implementing arbitrary quantum logic gates can be applied to a large variety of multilevel quantum systems and external driving. Published by the American Physical Society 2024