Bulletin of the American Physical Society
2005 36th Meeting of the Division of Atomic, Molecular and Optical Physics
Tuesday–Saturday, May 17–21, 2005; Lincoln, Nebraska
Session J2: Quantum Information II |
Hide Abstracts |
Sponsoring Units: DCOMP GQI Chair: Charles Clark, NIST Room: Burnham Yates Conference Center Ballroom I |
Friday, May 20, 2005 8:00AM - 8:36AM |
J2.00001: AMO Science as an Enabler of Quantum Information Technology Invited Speaker: This talk will present an overview on a decade's worth of innovation and progress toward developing a quantum computer, and suggest future research directions. In the eleven years since Peter Shor's quantum algorithms, quantum information science has become one of the fastest growing areas of physics. The prospect of executing quantum algorithms with no classical counterparts that accomplish tasks far beyond the capabilities of classical computers is one of the grand challenges of modern physics. The quest for quantum computing has inspired the discovery of passive and active forms of error correction, the formulation of compelling concepts for physical quantum bits, and the construction of experimental apparatus to realize them. Steady progress on both the experimental and theoretical fronts is transforming the fundamental tenets of quantum computing from a theoretical notion to a proven reality. The search for suitable physical systems has promoted the cross-pollination of ideas and language between atomic, molecular, and optical physics and solid-state physics, to the advantage of both communities. [Preview Abstract] |
Friday, May 20, 2005 8:36AM - 9:12AM |
J2.00002: Quantum Information Processing with Trapped Ions* Invited Speaker: Trapped strings of cold ions provide an ideal system for quantum information processing. The quantum information can be stored in individual ions and these qubits can be individually prepared, the corresponding quantum states can be manipulated and measured with nearly 100{\%} detection efficiency. With a small ion-trap quantum computer based on two and three trapped Ca$^{+ }$ions as qubits we have generated in a pre-programmed way genuine quantum states. In particular, entangled states of two particles, i.e. Bell states [1], and of three particles, i.e. GHZ and W states [2], were generated using an algorithmic procedure and their decoherence was investigated. These states are of particular interest for the implementation of a three-ion quantum register: we have demonstrated selective read-out of single qubits (while protecting the other qubits) and manipulation of single qubits of the register conditioned on the read-out results. The generated states have been measured experimentally using a technique known as state tomography allowing the population and phase of the quantum system to be mapped. Moreover, quantum teleportation with trapped ions was implemented [3] and can be used as resource for the transfer of quantum information as well as for quantum information processing. \newline \newline *Institut f\"ur Experimentalphysik, Universit\"at Innsbruck, Technikerstra{\ss}e 25, A-6020 Innsbruck, Austria, and Institut f\"ur Quantenoptik und Quanteninformation, \"Osterreichische Akademie der Wissenschaften, Technikerstra{\ss}e 25, A-6020 Innsbruck, Austria. \begin{enumerate} \item C. F. Roos et al., Phys. Rev. Lett. \textbf{92}, 220402 (2004). \item C. F. Roos et al., Science \textbf{304}, 1478 (2004). \item M. Riebe et al., Nature \textbf{429}, 734 (2004). \end{enumerate} [Preview Abstract] |
Friday, May 20, 2005 9:12AM - 9:48AM |
J2.00003: Efficient quantum computation with probabilistic gates and its applications in implementation Invited Speaker: With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability p. The required computational overhead scales efficiently both with 1/p and n, where n is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability 1-p far beyond any threshold requirement. In particular, I will show two implementation schemes based on the atom-photon interaction where the above result plays a critical role. [Preview Abstract] |
Friday, May 20, 2005 9:48AM - 10:24AM |
J2.00004: Linear optics quantum computation Invited Speaker: Quantum information has a dramatic impact on computational complexity, communication and cryptography. The discovery of quantum algorithms which have no efficient classical counterpart and of quantum error correction have lead to multiple proposals to implement these protocols in the laboratory. The first suggestion to manipulate quantum information has been using photonic technologies but its main drawback was the lack of strong interaction between photons. I will describe a proposal to use single photon sources, single photon detectors and linear optics (beam splitters and phase shifters) for quantum information. The fundamental idea is to use the non linearity of the measurement process to induce interaction between photons. Although this is not a unitary operation, I will describe how it is possible to simulate efficiently approximate unitary evolution using ideas from quantum teleportation and quantum error correction. I will finish by giving an overview of recent experimental steps towards implementing these ideas. [Preview Abstract] |
Follow Us |
Engage
Become an APS Member |
My APS
Renew Membership |
Information for |
About APSThe American Physical Society (APS) is a non-profit membership organization working to advance the knowledge of physics. |
© 2024 American Physical Society
| All rights reserved | Terms of Use
| Contact Us
Headquarters
1 Physics Ellipse, College Park, MD 20740-3844
(301) 209-3200
Editorial Office
100 Motor Pkwy, Suite 110, Hauppauge, NY 11788
(631) 591-4000
Office of Public Affairs
529 14th St NW, Suite 1050, Washington, D.C. 20045-2001
(202) 662-8700