How powerful is adiabatic quantum computation?

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 279-287

  Van Dam, Wim ^a   Mosca, Michele ^b   Vazirani, Umesh ^c  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; EVOLUTIONARY ALGORITHMS; HAMILTONIANS; PERTURBATION TECHNIQUES; POLYNOMIALS; PROBLEM SOLVING; QUANTUM THEORY; SET THEORY;

QUANTUM COMPUTATIONS;

COMPUTATION THEORY;

EID: 0035189687     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2001.959902     Document Type: Article

References (14)

1. Strengths and weaknesses of quantum computing
2. Beweis des adiabatensatzes
3. A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
4. Analog analogue of digital quantum computation
5. A fast quantum mechanical algorithm for database search
6. Quantum search heuristics
7. Algorithms for quantum computation: Discrete logarithms and factoring
8. On the Power of Quantum computation