Hannover 2003 – wissenschaftliches Programm
Bereiche | Tage | Auswahl | Suche | Downloads | Hilfe
Q: Quantenoptik
Q 13: Quantencomputer
Q 13.5: Vortrag
Montag, 24. März 2003, 17:30–17:45, F102
Implementation of the Deutsch-Josza algorithm on an ion-trap quantum — •Gavin Lancaster1, Stephan Gulde1, Mark Riebe1, Christoph Becher1, Jürgen Eschner1, Hartmut Häffner1, Ferdinand Schmidt-Kaler1, Isaac Chuang2, and Rainer Blatt1 — 1Institut für Experimentalphysik,6020 Innsbruck,Austria — 2MIT Media Lab,Cambridge,MA 02139,USA
The question as to whether a coin is fair (both sides are different) or false (both sides are the same) normally requires two observations, i.e. a look on both sides. If, however, the coin can be represented in a quantum mechanical manner and operated on by a quantum processor, only one observation is necessary to answer this question. The associated algorithm which exploits quantum coherence to outperform its classical counterpart for this particular problem is known as the Deutsch-Josza algorithm [1]. We present the experimental implementation of this algorithm using the electronic and motional states of a single, cooled and trapped 40Ca+-ion as qubits [2]. A series of laser pulses on the S1/2–D5/2-transition at 729 nm are used to manipulate the states of the ion while a novel method of compensating induced AC-Stark shifts allows us to map and control the optical phases of the pulses precisely. Upon completion of the pulse sequence, interogation of the electronic excited state population yields the solution to our problem.
[1] D. Deutsch et al., Proc. R. Soc. London A 439, 553 (1992).
[2] S. Gulde et al., Nature 421 (2003).