Nonadiabatic quantum search algorithms
From MaRDI portal
Abstract: We present two new continuous time quantum search algorithms similar to the adiabatic search algorithm, but now without an adiabatic evolution. We find that both algorithms work for a wide range of values of the parameters of the Hamiltonian, and one of them has, as an additional feature that, for values of time larger than a characteristic one, it will converge to a state which can be close to the searched state.
Recommendations
Cites work
Cited in
(15)- Role of coherence in adiabatic search algorithms
- Nonadiabatic quantum search algorithm with analytical success rate
- Interaction-aided continuous time quantum search
- Controlled quantum search
- Concise quantum associative memories with nonlinear search algorithm
- On a nonlinear model in adiabatic evolutions
- Geometric pictures for quantum search algorithms
- Energy and efficiency of adiabatic quantum search algorithms
- On models of nonlinear evolution paths in adiabatic quantum algorithms
- Nonlinear quantum search using the Gross–Pitaevskii equation
- Continuous-time quantum search and time-dependent two-level quantum systems
- Singularity of Farhi–Gutmann Analog Quantum Search
- Transition probabilities in generalized quantum search Hamiltonian evolutions
- Information geometric aspects of probability paths with minimum entropy production for quantum state evolution
- Quantum computation in continuous time using dynamic invariants
This page was built for publication: Nonadiabatic quantum search algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903174)
