Timeline for What are the fundamental differences between trapped ion quantum computers and other architectures?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 15, 2018 at 3:51 | vote | accept | Riz-waan | ||
| Apr 4, 2018 at 11:35 | comment | added | Niel de Beaudrap | @Discretelizard: I do not know enough about 'quantum annealing' to address this question, but I can address it for the purposes of the adiabatic algorithm. If we could somehow magically dispel all sources of noise for very large adiabatic computers, then they could simulate unitary circuits in polynomial time. They are therefore universal in the usual sense. (I have seen it claimed that adiabatic computation is a limiting case of quantum annealing, in which case the same holds true for quantum annealing.) The question really isn't one of computational models, but of practical engineering. | |
| Apr 4, 2018 at 9:19 | comment | added | Discrete lizard | Your remarks about 'universality' are interesting. Do similar remarks also apply to quantum annealing? That is, could we also consider quantum annealing to be 'universal' if we'd use it a bit differently? | |
| Apr 4, 2018 at 1:13 | vote | accept | Riz-waan | ||
| Jul 15, 2018 at 3:51 | |||||
| Apr 4, 2018 at 0:53 | history | answered | Niel de Beaudrap | CC BY-SA 3.0 |