1 / 17

Quantum algorithms in the presence of decoherence: optical experiments

Quantum algorithms in the presence of decoherence: optical experiments. Masoud Mohseni, Jeff Lundeen, Kevin Resch and Aephraim Steinberg Department of Physics, University of Toronto. Friendly neighborhood theorists: Daniel Lidar, Sara Schneider,...

eddy
Download Presentation

Quantum algorithms in the presence of decoherence: optical experiments

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Quantum algorithms in the presence of decoherence: optical experiments Masoud Mohseni, Jeff Lundeen, Kevin Resch and Aephraim Steinberg Department of Physics, University of Toronto Friendly neighborhood theorists: Daniel Lidar, Sara Schneider,... Helpful summer student: Guillaume Foucaud

  2. Motivation Photons are an ideal system for carrying quantum info. (Nonscalable) linear-optics quantum computation may prove essential as part of quantum communications links. Efficient (scalable) linear-optical quantum computation is a very promising avenue of research, relying on the same toolbox (and more). In any quantum computation scheme, the smoky dragon is decoherence and errors. Without error correction, quantum computation would be nothing but a pipe dream. We demonstrate how decoherence-free subspaces (DFSs) may be incorporated into a prototype optical quantum algorithm.

  3. Prototype algorithm: Deutsch's Problem (2-qbit version) An oracle takes as input a bit x, and calculates an unknown one-bit function f(x). [quantum version: inputs x&y; outputs x & y  f(x)] Our mission, should we decide to accept it: Determine, with as few queries as possible, whether or not f(0) = f(1). Classically: must measure both f(0) and f(1). [For n-bit extension, need at least 2n-1+1 queries] Quantum mechanically: a single query suffices. [Even for n-bit problem, since only yes/no outcome desired.]

  4. DJ algorithm and 4-rail qubits y f(x) Photon number basis Computational basis 1 1st qubit 2nd qubit 2 3 4 Standard Deutsch-Jozsa Algorithm Alice Bob (oracle) Alice H x x H y H Physical realization of qubits We use a four-rail representation of our two physical qubits and encode the logical states 00, 01, 10 and 11 by a photon traveling down one of the four optical rails numbered 1, 2, 3 and 4, respectively. [Cf. Cerf, Adami, & Kwiat, PRA 57, R1477 (1998)]

  5. Implementation of simple gates 00 00 00 00 NOT-2 NOT-1 01 01 01 01 X 10 10 10 10 11 11 11 11 X 00 00 00 00 CNOT-1 CNOT-2 01 01 01 01 10 10 10 10 11 11 11 11 00+01 00 00+10 00 Hadamard-2 Hadamard-1 00-01 01 01+11 01 H 10+11 10 00-10 10 10-11 11 01-11 H 11 It is easy to implement a universal set up of one and two qubit operations in such a representation Quantumgate Four rails implementation Quantumgate Four rails implementation swap between two rails 50/50 beam splitters

  6. Implementation of the oracle Constant oracle-00 f(0)=f(1)=0 Constant oracle-11 f(0)=f(1)=1 00 00 00 00 01 01 01 01 10 10 10 10 11 11 X 11 11 The transformations introduced by the 4 possible functions or “oracles” can also be implemented in this representation. Balanced oracle-01 f(0)=0,f(1)=1 Balanced oracle-10 f(0)=1,f(1)=0 00 00 00 00 01 01 01 01 X X 10 10 10 10 11 11 11 11

  7. Error model and decoherence-free subspaces 11 11 10 eif 10 00 00 01 eif 01 But after oracle, only qubit 1 is needed for calculation. Encode this logical qubit in either DFS: (00,11) or (01,10). Modified Deutsch-Jozsa Quantum Circuit H x x H y y f(x) H Consider a source of dephasing which acts symmetrically on states 01 and 10 (rails 2 and 3)… DFSs: see Lidar, Chuang, Whaley, PRL 81, 2594 (1998) et cetera. Implementations: see Kwiat et al., Science 290,498 (2000) and Kielpinski et al., Science 291, 1013 (2001).

  8. Schematic of DJ, some failures Schematic diagram of D-J interferometer Interfering 1 with 4 and 2 with 3 is as effective as interfering 1 with 3 and 2 with 4 -- but insensitive to this decoherence model. 1 2 3 4 Oracle 1 00 2 01 3 10 4 11 1 2 4 3 “Click” at either det. 1 or det. 2 (i.e., qubit 1 low) indicates a constant function; each looks at an interferometer comparing the two halves of the oracle.

  9. DJ experimental setup Experimental Setup Random Noise 1 2 1 3 4 23 2 Preparation 4 Oracle 3 4 B Swap D 4 Phase Shifter 3 C A PBS Detector Waveplate Mirror

  10. DJ without noise -- raw data Constant function Balanced function C B Original encoding DFS Encoding C B C B B C B C

  11. DJ without noise -- results Constant function Balanced function C B Original encoding DFS Encoding C B C B B C B C

  12. DJ with noise-- results Original Encoding DFS Encoding C B C B B C B C Constant function Balanced function C B

  13. Coming Attractions:Non-orthogonal State Discrimination • Non-orthogonal quantum states cannot be distinguished • with certainty. • This is one of the central features of quantum information • which leads to secure (eavesdrop-proof) communications. • Crucial element: we must learn how to distinguish quantum • states as well as possible -- and we must know how well • a potential eavesdropper could do. (work with J. Bergou et al.)

  14. Theory: how to distinguish non-orthogonal states optimally Step 1: Repeat the letters "POVM" over and over. Step 2: Ask Janos, Mark, and Yuqing for help. The view from the laboratory: A measurement of a two-state system can only yield two possible results. If the measurement isn't guaranteed to succeed, there are three possible results: (1), (2), and ("I don't know"). Therefore, to discriminate between two non-orth. states, we need to use an expanded (3D or more) system. To distinguish 3 states, we need 4D or more.

  15. Experimental layout (ancilla)

  16. Success! "Definitely 3" "Definitely 2" "Definitely 1" "I don't know" The correct state was identified 55% of the time-- Much better than the 33% maximum for standard measurements.

  17. Summary • We have demonstrated the utility of decoherence-free subspaces in a prototype linear-optical quantum algorithm. • The introduction of localized turbulent airflow produced a type of “collective” optical dephasing, leading to large error rates. • With the DFS encoding, the error rate in the presence of noise was reduced to 7%, essentially its pre-noise value. • We note that the choice of a DFS may be easier to motivate via consideration of the physical system than from purely theoretical (quantum circuit) considerations! • More recent results: successfully distinguish among 3 non-orthogonal states 55% of the time, where standard quantum measurements are limited to 33%. Also: "state filtering" or discrimination of mixed states.

More Related