A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
arXiv:quant-ph/0512008 · doi:10.1016/j.physleta.2006.01.098
Abstract
Deutsch-Jozsa algorithm has been implemented via a quantum adiabatic evolution by S. Das et al. [Phys. Rev. A 65, 062310 (2002)]. This adiabatic algorithm gives rise to a quadratic speed up over classical algorithms. We show that a modified version of the adiabatic evolution in that paper can improve the performance to constant time.
2 pages, no figure
Cited by in corpus (12)
- Adiabatic Quantum Computing
- Adiabatic quantum optimization in presence of discrete noise: Reducing the problem dimensionality
- Error suppression in adiabatic quantum computing with qubit ensembles
- Continuous-Time Quantum Algorithms for Unstructured Problems
- Quantum search by partial adiabatic evolution
- Quantum adiabatic brachistochrone for open systems
- Lower bounds for adiabatic quantum algorithms by quantum speed limits
- Error-run-time trade-off in the adiabatic approximation beyond scaling relations
- Superposition of Macroscopically Distinct States in Adiabatic Quantum Computation
- Majorization in Quantum Adiabatic Algorithms
- Programming tools for Analogue Quantum Computing in the High-Performance Computing Context -- A Review
- Improving adiabatic quantum factorization via chopped random-basis optimization