2
January 2003
Quantum computer: Quick thinking
The Deutsch–Jozsa algorithm — a type of simple decision-making routine — has the potential for fast operation in a quantum computer. Whereas the analogous classical problem involves two examination steps, this algorithm can do the job in one: the quantum realm computes exponentially faster than its classical counterpart. Another milestone in the path to practical quantumcomputing has now been achieved with the demonstration of the Deutsch–Jozsa algorithm in an ion-trap quantum computer, a processor based on a single trapped 40Ca+ ion driven by laser pulses. This is the first time a quantum algorithm has been demonstrated in a potentially scalable system. A high degree of control is achieved over the quantum states needed to run the algorithm, making the development of larger processors a realistic goal.
Implementation of the Deutsch-Jozsa algorithm on an
ion-trap quantum computer
STEPHAN GULDE, MARK RIEBE,
GAVIN P. T. LANCASTER, CHRISTOPH BECHER, JÜRGEN ESCHNER, HARTMUT HÄFFNER, FERDINAND
SCHMIDT-KALER, ISAAC L. CHUANG & RAINER BLATT
Nature 421,
48–50 (2003); doi:10.1038/nature01336
| First
Paragraph | Full
Text (HTML / PDF) |
