Adiabatic Quantum Computation and Deutsch's Algorithm
arXiv:quant-ph/0111032 · doi:10.1103/PhysRevA.65.062310
Abstract
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both global and local adiabatic evolutions.
6 Pages, Revtex. Typos corrected, references added. Published version
Cited by in corpus (18)
- Adiabatic Quantum Computing
- Quantum computation in continuous time using dynamic invariants
- A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
- Experimental implementation of local adiabatic evolution algorithms by an NMR quantum information processor
- Cavity state preparation using adiabatic transfer
- A hybrid classical-quantum approach to solve the heat equation using quantum annealers
- Error suppression in adiabatic quantum computing with qubit ensembles
- Adiabatic quantum optimization in presence of discrete noise: Reducing the problem dimensionality
- Quantum search by partial adiabatic evolution
- Topology hidden behind the breakdown of adiabaticity
- Measuring adiabaticity in non-equilibrium quantum systems
- Quantum adiabatic brachistochrone for open systems
- Quantum Factorization of 143 on a Dipolar-Coupling NMR system
- A relation between fidelity and quantum adiabatic evolution
- Lower bounds for adiabatic quantum algorithms by quantum speed limits
- The Dynamics of Entanglement in the Adiabatic Search and Deutsch Algorithms
- Majorization in Quantum Adiabatic Algorithms
- Quantifying Dynamical Total Coherence in a Resource Non-increasing Framework