Bounds On Augmented Automata And Quantum Adiabatic Optimization
Quantum computing has generated a lot of interested in the past two decades. Research into powerful models of quantum computation has yielded important and elegant results like an efficient algorithm for factoring and a quadratic speed-up for unordered search. At the same time, given the current dif...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2005/518 |