Maximal success probabilities of linear-optical quantum gates

نویسندگان

  • Dmitry B. Uskov
  • Lev Kaplan
  • A. Matthew Smith
  • Sean D. Huver
  • Jonathan P. Dowling
چکیده

Numerical optimization is used to design linear-optical devices that implement a desired quantum gate with perfect fidelity, while maximizing the success rate. For the two-qubit controlled-sign or controlled NOT CNOT gate, we provide numerical evidence that the maximum success rate is S=2 /27 using two unentangled ancilla resources; interestingly, additional ancilla resources do not increase the success rate. For the three-qubit Toffoli gate, we show that perfect fidelity is obtained with only three unentangled ancilla photons—less than in any existing scheme—with a maximum S=0.003 40. This compares well to S= 2 /27 2 /2 0.002 74, obtainable by combining two CNOT gates and a passive quantum filter T. C. Ralph, K. J. Resch, and A. Gilchrist, Phys. Rev. A 75, 022313 2007 . The general optimization approach can easily be applied to other areas of interest, such as quantum error correction, cryptography, and metrology M. M. Wilde and D. B. Uskov, Phys. Rev. A 79, 022305 2009 ; G. A. Durkin and J. P. Dowling, Phys. Rev. Lett. 99, 070801 2007 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proposed Experiment in Two-qubit Linear Optical Photonic Gates for Maximal Success Rates

Here we propose an experiment in linear optical quantum computing (LOQC) using the framework first developed by Knill, Laflamme and Milburn. This experiment will test the ideas of the authors’ previous work on imperfect LOQC gates using number-resolving photon detectors. We suggest a relatively simple physical apparatus capable of producing CZ gates with controllable fidelity less than 1 and su...

متن کامل

Linear optics quantum computing – construction of small networks and asymptotic scaling

In the paradigm of linear optics, quantum states of optical field modes are manipulated by means of photon sources, beam splitters, and photodetectors. This restriction of the allowed interactions introduces non-unit success probabilities into every non-trivial computation irrevocably. The resulting probabilistic nature of this architecture opens up questions about scalability of this approach ...

متن کامل

Linear-optical implementations of the iSWAP and controlled NOT gates based on conventional detectors

The majority of linear-optical nondestructive implementations of universal quantum gates are based on single-photon resolving detectors. We propose two implementations, which are nondestructive (i.e., destroying only ancilla states) and work with conventional detectors (i.e., those which do not resolve number of photons). Moreover, we analyze a recently proposed scheme of Wang et al. [J. Opt. S...

متن کامل

Imperfect Detectors in Linear Optical Quantum Computers

We discuss the effects of imperfect photon detectors suffering from loss and noise on the reliability of linear optical quantum computers. We show that for a given detector efficiency, there is a maximum achievable success probability, and that increasing the number of ancillary photons and detectors used for one controlled sign flip gate beyond a critical point will decrease the probability th...

متن کامل

Minimal resources for linear optical one-way computing

We address the question of how many maximally entangled photon pairs are needed to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily probabilistic with known optimal success probability, this question amounts to finding the optimal strategy for building up cluster states, from the perspective of classical ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009