No Arabic abstract
We use the numerical optimization techniques of Uskov et al. [PRA 81, 012303 (2010)] to investigate the behavior of the success rates for KLM style [Nature 409, 46 (2001)] two- and three-qubit entangling gates. The methods are first demonstrated at perfect fidelity, and then extended to imperfect gates. We find that as the perfect fidelity condition is relaxed, the maximum attainable success rates increase in a predictable fashion depending on the size of the system, and we compare that rate of increase for several gates.
We combine numerical optimization techniques [Uskov et al., Phys. Rev. A 79, 042326 (2009)] with symmetries of the Weyl chamber to obtain optimal implementations of generic linear-optical KLM-type two-qubit entangling gates. We find that while any two-qubit controlled-U gate, including CNOT and CS, can be implemented using only two ancilla resources with success probability S > 0.05, a generic SU(4) operation requires three unentangled ancilla photons, with success S > 0.0063. Specifically, we obtain a maximal success probability close to 0.0072 for the B gate. We show that single-shot implementation of a generic SU(4) gate offers more than an order of magnitude increase in the success probability and two-fold reduction in overhead ancilla resources compared to standard triple-CNOT and double-B gate decompositions.
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 success rates higher than the current theoretical maximum (S=2/27) for perfect fidelity. These experimental setups are within the reach of many experimental groups and would provide an interesting experiment in photonic quantum computing.
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 that the computer will function correctly. We have also performed simulations of some small logic gates and estimate the efficiency and noise levels required for the linear optical quantum computer to function properly.
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 2-qubit CS (or 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 3-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.00340$. This compares well with $S=(2/27)^2/2 approx 0.00274$, obtainable by combining two CNOT gates and a passive quantum filter [PRA 68, 064303 (2003)]. The general optimization approach can easily be applied to other areas of interest, such as quantum error correction, cryptography, and metrology [arXiv:0807.4906, PRL 99 070801 (2007)].
We present a linear-optical implementation of a class of two-qubit partial SWAP gates for polarization states of photons. Different gate operations, including the SWAP and entangling square root of SWAP, can be obtained by changing a classical control parameter -- namely the path difference in the interferometer. Reconstruction of output states, full process tomography and evaluation of entanglement of formation prove very good performance of the gates.