2011/05/21 by A. Matthew Smith, D. B. Uskov, L. H. Ying +1 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Computer science #Fidelity #Imperfect #Mathematics #Neural Networks and Reservoir Computing #Photodetection #Photodetector #Photonics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum mechanics #Qubit #Telecommunications #quant-ph
paper · pdf · doi:10.1103/physreva.84.032341
published in Physical Review A 84(3) (American Physical Society) · 7 pages, 7 figures
arxiv created 2011/05/21 · openalex publication_date 2011/09/29 · arxiv updated 2012/07/10 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
We use the numerical optimization techniques of Uskov et al. [Phys. Rev. A 81, 012303 (2010)] to investigate the behavior of the success rates for Knill-Laflamme-Milburn-style [Knill et al., Nature (London) 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.