Unstructured adiabatic quantum search
From MaRDI portal
Recommendations
- Energy and efficiency of adiabatic quantum search algorithms
- Optimality of partial adiabatic search and its circuit model
- Quantum search in structured database using local adiabatic evolution and spectral methods
- On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
- On the circuit model of global adiabatic search algorithm
Cited in
(19)- Controlled quantum search
- How quantum is the speedup in adiabatic unstructured search?
- Is the addition of an assisted driving Hamiltonian always useful for adiabatic evolution?
- Partial adiabatic quantum search algorithm and its extensions
- Quantum search in structured database using local adiabatic evolution and spectral methods
- On the optimal schedule of adiabatic quantum computing
- On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
- Hamiltonian and Measuring Time for Analog Quantum Search
- A modified adiabatic quantum algorithm for evaluation of Boolean functions
- Adiabatic evolution under quantum control
- Energy and efficiency of adiabatic quantum search algorithms
- How to make assisted driving Hamiltonian useful in quantum adiabatic computation?
- Nonadiabatic quantum search algorithms
- On the adiabatic evolution of one-dimensional projector Hamiltonians
- Continuous-time quantum algorithms for unstructured problems
- A study of heuristic guesses for adiabatic quantum computation
- Quantum computation in continuous time using dynamic invariants
- On the circuit model of global adiabatic search algorithm
- Adiabatic quantum counting by geometric phase estimation
This page was built for publication: Unstructured adiabatic quantum search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768661)
