Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0908.2482 · Physical Review A

Generic two-qubit photonic gates implemented by number-resolving photodetection

Dmitry B. Uskov, A. Matthew Smith, Lev Kaplan

Published Jan 5, 2010• 12 citations
arXivHTMLPDF

Abstract

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 Knill-Laflamme-Milburn-type two-qubit entangling gates. We find that while any two-qubit controlled-$U$ gate, including controlled-NOT (CNOT) and controlled-sign gates, can be implemented using only two ancilla resources with a 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 a two-fold reduction in overhead ancilla resources compared to standard triple-CNOT and double-$B$ gate decompositions.

DOI
10.1103/physreva.81.012303

Related papers

Imperfect linear-optical photonic gates with number-resolving photodetection

A. Matthew Smith, Dmitry B. Uskov, L. H. Ying +1 more

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.

arXiv:1105.4211•Physical Review A•Sep 29, 2011•3 citations

Maximal success probabilities of linear-optical quantum gates

Dmitry B. Uskov, Lev Kaplan, A. Matthew Smith +2 more

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\text{ }40$. This compares well to $S={(2/27)}^{2}/2\ensuremath{\approx}0.002\text{ }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)].

arXiv:0808.1926•Physical Review A•Apr 20, 2009•49 citations

Linear optical fan-out gates using fewer ancillary single photons with enhanced success probability

Wen-Qiang Liu, Hai-Rui Wei

Photonic quantum gates are fundamental building blocks for a wide range of optical quantum information processing tasks. We propose an efficient linear-optical scheme for implementing a post-selected three-qubit fan-out gate (also known as a controlled-NOT-NOT gate) using only two ancillary single photons and linear optical elements. The scheme can be generalized to an $n$-qubit fan-out gate, requiring $(n-1)$ ancillary single photons and $(3n-3)$ polarizing beam splitters (PBSs), with a success probability of $\left(\frac{1}{4}\right)^{n-1}$. Compared to the standard gate decomposition approach, which requires $(2n-2)$ ancillary single photons, $(5n-5)$ PBSs, and yields a success probability of $\left(\frac{1}{8}\right)^{n-1}$. Our scheme significantly reduces the resource overhead and improves the success probability. We further evaluate the gate performance and demonstrate improved robustness compared to gate decomposition-based methods.

quant-pharXiv:2608.15608•Physical Review Applied•Aug 18, 2026•0 citations

Minimal ancilla for boosting type-I photonic fusion

A. A. Melkozerov, S. S. Straupe, M. Yu. Saygin

Fusion gates enable the creation of large entangled photonic states for linear-optical quantum computing and communication protocols. However, their success probability is limited to $1/2$ without additional photonic resources. Previous schemes for boosting type-I fusion have used four ancillary single photons or a two-qubit Bell state, whose preparation is probabilistic and resource intensive. Here we propose a boosted type-I fusion gate using only two independent ancillary single photons and no entangled ancillary input. It achieves a direct success probability of $5/8$, matching that of the previous four-single-photon proposal while using half as many ancillary photons. The circuit is predominantly passive, with a single active element that applies a phase shift or swaps two modes according to intermediate photodetection outcomes. Unlike the previous schemes, successful outputs occupy fixed modes and require no further conditional output routing. In particular, we show that the gate is more robust to heralded ancillary-photon loss than previously proposed boosted gates and reduces the average number of single photons required to generate a six-qubit ring graph state by more than $4.6\%$ compared with other type-I schemes. It therefore offers a resource-efficient primitive for scalable fusion-based photonic quantum information processing.

quant-pharXiv:2610.34257•Oct 27, 2026•0 citations

Experimental Implementation of Optimal Linear-Optical Controlled-Unitary Gates

Karel Lemr, Karol Bartkiewicz, Antonín Černoch +2 more

We show that it is possible to reduce the number of two-qubit gates needed for the construction of an arbitrary controlled-unitary transformation by up to 2 times using a tunable controlled-phase gate. On the platform of linear optics, where two-qubit gates can only be achieved probabilistically, our method significantly reduces the amount of components and increases success probability of a two-qubit gate. The experimental implementation of our technique presented in this Letter for a controlled single-qubit unitary gate demonstrates that only one tunable controlled-phase gate is needed instead of two standard controlled-not gates. Thus, not only do we increase the success probability by about 1 order of magnitude (with the same resources), but also avoid the need for conducting quantum nondemolition measurement otherwise required to join two probabilistic gates. Subsequently, we generalize our method to a higher order, showing that n-times controlled gates can be optimized by replacing blocks of controlled-not gates with tunable controlled-phase gates.

arXiv:1410.4318•Physical Review Letters•Apr 16, 2015•17 citations

Single-photon-boosted type-I fusion gates

A. A. Melkozerov, S. S. Straupe, M. Yu. Saygin

Fusion measurements are a key primitive for linear-optical quantum computing and quantum networks. Type-I and type-II fusion gates are widely used to combine small entangled resource states into larger photonic states, but without ancillary resources their success probability is limited to $1/2$. Existing $3/4$-efficient type-I schemes rely on entangled Bell-pair ancillary states, whose preparation is itself probabilistic and resource-intensive. Here we propose a boosted type-I fusion gate using only four ancillary single photons and standard linear-optical primitives. For multiqubit GHZ and graph states, the gate succeeds directly with probability $5/8$, while a distillation protocol converts partially entangled outcomes into additional successful events, raising the total success probability to $11/16$ after one stage and asymptotically to $3/4$. We quantify the practical advantage of this scheme by estimating the photonic resources required for generating representative large entangled photonic states and show that the proposed gate significantly reduces the required overhead compared with existing schemes. These results expand the set of resource-efficient linear-optical primitives and enable a substantial reduction in the resource requirements for scalable photonic quantum computing and quantum communication.

quant-pharXiv:2603.27315•Physical Review Applied•Mar 31, 2026•0 citations
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 Knill-Laflamme-Milburn-type two-qubit entangling gates. We find that while any two-qubit controlled-UUU gate, including controlled-NOT (CNOT) and controlled-sign gates, can be implemented using only two ancilla resources with a success probability S>0.05S>0.05S>0.05, a generic SU(4) operation requires three unentangled ancilla photons, with success S>0.0063S>0.0063S>0.0063. Specifically, we obtain a maximal success probability close to 0.0072 for the BBB 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 a two-fold reduction in overhead ancilla resources compared to standard triple-CNOT and double-BBB gate decompositions.
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.
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/27S=2/27S=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 40S=0.003\text{ }40S=0.003 40. This compares well to $S={(2/27)}^{2}/2\ensuremath{\approx}0.002\text{ }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)].
Photonic quantum gates are fundamental building blocks for a wide range of optical quantum information processing tasks. We propose an efficient linear-optical scheme for implementing a post-selected three-qubit fan-out gate (also known as a controlled-NOT-NOT gate) using only two ancillary single photons and linear optical elements. The scheme can be generalized to an nnn-qubit fan-out gate, requiring (n−1)(n-1)(n−1) ancillary single photons and (3n−3)(3n-3)(3n−3) polarizing beam splitters (PBSs), with a success probability of (14)n−1\left(\frac{1}{4}\right)^{n-1}(41​)n−1. Compared to the standard gate decomposition approach, which requires (2n−2)(2n-2)(2n−2) ancillary single photons, (5n−5)(5n-5)(5n−5) PBSs, and yields a success probability of (18)n−1\left(\frac{1}{8}\right)^{n-1}(81​)n−1. Our scheme significantly reduces the resource overhead and improves the success probability. We further evaluate the gate performance and demonstrate improved robustness compared to gate decomposition-based methods.
Fusion gates enable the creation of large entangled photonic states for linear-optical quantum computing and communication protocols. However, their success probability is limited to 1/21/21/2 without additional photonic resources. Previous schemes for boosting type-I fusion have used four ancillary single photons or a two-qubit Bell state, whose preparation is probabilistic and resource intensive. Here we propose a boosted type-I fusion gate using only two independent ancillary single photons and no entangled ancillary input. It achieves a direct success probability of 5/85/85/8, matching that of the previous four-single-photon proposal while using half as many ancillary photons. The circuit is predominantly passive, with a single active element that applies a phase shift or swaps two modes according to intermediate photodetection outcomes. Unlike the previous schemes, successful outputs occupy fixed modes and require no further conditional output routing. In particular, we show that the gate is more robust to heralded ancillary-photon loss than previously proposed boosted gates and reduces the average number of single photons required to generate a six-qubit ring graph state by more than 4.6%4.6\%4.6% compared with other type-I schemes. It therefore offers a resource-efficient primitive for scalable fusion-based photonic quantum information processing.
We show that it is possible to reduce the number of two-qubit gates needed for the construction of an arbitrary controlled-unitary transformation by up to 2 times using a tunable controlled-phase gate. On the platform of linear optics, where two-qubit gates can only be achieved probabilistically, our method significantly reduces the amount of components and increases success probability of a two-qubit gate. The experimental implementation of our technique presented in this Letter for a controlled single-qubit unitary gate demonstrates that only one tunable controlled-phase gate is needed instead of two standard controlled-not gates. Thus, not only do we increase the success probability by about 1 order of magnitude (with the same resources), but also avoid the need for conducting quantum nondemolition measurement otherwise required to join two probabilistic gates. Subsequently, we generalize our method to a higher order, showing that n-times controlled gates can be optimized by replacing blocks of controlled-not gates with tunable controlled-phase gates.
Fusion measurements are a key primitive for linear-optical quantum computing and quantum networks. Type-I and type-II fusion gates are widely used to combine small entangled resource states into larger photonic states, but without ancillary resources their success probability is limited to 1/21/21/2. Existing 3/43/43/4-efficient type-I schemes rely on entangled Bell-pair ancillary states, whose preparation is itself probabilistic and resource-intensive. Here we propose a boosted type-I fusion gate using only four ancillary single photons and standard linear-optical primitives. For multiqubit GHZ and graph states, the gate succeeds directly with probability 5/85/85/8, while a distillation protocol converts partially entangled outcomes into additional successful events, raising the total success probability to 11/1611/1611/16 after one stage and asymptotically to 3/43/43/4. We quantify the practical advantage of this scheme by estimating the photonic resources required for generating representative large entangled photonic states and show that the proposed gate significantly reduces the required overhead compared with existing schemes. These results expand the set of resource-efficient linear-optical primitives and enable a substantial reduction in the resource requirements for scalable photonic quantum computing and quantum communication.