OPTIMAL ANNEALING PATHS FOR ADIABATIC QUANTUM COMPUTATION
Shor’s algorithm shows that circuit-model quantum computers can factorize integers in polynomial time – exponentially more efficiently than classical computers. There is currently no analogous algorithm for Adiabatic Quantum Computers(AQCs). We illustrate through a number of factorization problems t...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10222/14381 |