Research
Linear optical fan-out gates using fewer ancillary single photons with enhanced success probability
Overview Research area: Linear optical quantum computing, specifically photonic multi-qubit logic gates built from polarizing beam splitters (PBSs), half-wave plates (HWPs), ancillary single photons,

- arXiv
- 2608.15608
- Published
- 2026-08-16
- Authors
- Wen-Qiang Liu, Hai-Rui Wei
AI summary
Overview
Research area: Linear optical quantum computing, specifically photonic multi-qubit logic gates built from polarizing beam splitters (PBSs), half-wave plates (HWPs), ancillary single photons, and post-selection.
Technical level: Intermediate. The conceptual idea is accessible, but following the full derivations requires comfort with polarization-encoded qubits, bipartite/multipartite state algebra, and fidelity analysis.
Scope (one sentence): The paper proposes a linear-optical construction of post-selected n-qubit fan-out (controlled-NOT-…-NOT, C^n) gates that uses (n−1) ancillary single photons and (3n−3) PBSs to reach a success probability of (1/4)^{n−1}, and it compares this against standard gate-decomposition approaches and against imperfect-PBS fidelity.
What This Paper Is About
Fan-out gates — one control qubit flipping (n−1) target qubits — are basic building blocks for error correction, entanglement generation, and circuit optimization, but photonic versions are hard to build because photons interact weakly. A straightforward way to make an n-qubit fan-out gate is to decompose it into (n−1) separate CNOT gates, but that multiplies the optical resource cost and lowers the overall success probability. The authors ask whether a direct linear-optical design, using only simple ancillary single photons rather than multiphoton entangled GHZ states, can implement the gate with fewer components and a higher chance of success.
Key Contributions
- A direct three-qubit C^3 gate design. A post-selected controlled-NOT-NOT gate built from two ancillary single photons (each prepared in |H⟩), diagonal PBSs, regular PBSs, and two HWPs at 22.5°, with an overall success probability of 1/16.
- A scalable n-qubit generalization. The construction extends to a C^n gate requiring (n−1) ancillary single photons and (3n−3) PBSs, with success probability (1/4)^{n−1} — compared with (2n−2) ancillary single photons, (5n−5) PBSs, and (1/8)^{n−1} for the standard decomposition approach as stated in the abstract.
- Removal of the GHZ-state requirement. The prior photonic fan-out proposal relied on an ancillary maximally entangled GHZ state; this scheme needs only product-state ancillary single photons, relaxing experimental demands.
- Imperfect-PBS performance analysis. The authors model PBS imperfection via an angular deviation θ and polarization extinction ratio r, derive an average PBS fidelity formula, and use it to estimate gate fidelity and robustness versus decomposition-based methods.
Main Findings
- C^3 success probability is 1/16. The scheme proceeds in stages, each succeeding with probability 1/4 (a post-selection for exactly one photon in each of four intermediate paths, then another), giving 1/4 × 1/4 = 1/16.
- General scaling: (1/4)^{n−1} success probability. The n-qubit gate succeeds only when exactly one photon exits every output path; the two stages each contribute 1/2^{n−1}, so the product is 1/4^{n−1}.
- Resource reduction versus decomposition. Abstract-level comparison: our scheme uses (n−1) ancillary single photons and (3n−3) PBSs versus (2n−2) ancillary single photons and (5n−5) PBSs for the decomposition approach, while raising success probability from (1/8)^{n−1} to (1/4)^{n−1}.
- Table 2 comparison across CNOT building blocks. Decomposition using the no-ancilla CNOT [17,18] needs (5n−5) PBSs, 0 ancillary single photons, and gives (1/9)^{n−1}; using the two-ancilla CNOT [28,29] needs (5n−5) PBSs, 2(n−1) ancillary single photons, and gives (1/8)^{n−1}; using the entangled-pair CNOT [21,22,23] needs (4n−4) PBSs, (n−1) ancillary entangled photon pairs, and gives (1/4)^{n−1}. The proposed scheme uses (3n−3) PBSs, (n−1) ancillary single photons, 0 entangled pairs, and (1/4)^{n−1}.
- Average PBS fidelity of 0.9992 is obtained at θ = 2×10⁻³ rad and r = 0.2×10⁻³, from the derived closed-form expression for F̄_PBS.
- Estimated C^3 gate fidelity of 0.9952, computed as (0.9992)^6 because the C^3 setup uses six PBSs; the n-qubit version is estimated as 0.9992^{3n−3}, versus 0.9992^{5n−5} for the (5n−5)-PBS decomposition variants.
- The gate is destructive / not heralded. The authors state success cannot be inferred solely from the ancillary-photon detectors in paths 6 and 8, unlike some decomposition-based CNOT schemes marked as nondestructive in Table 2.
- n = 2 reduces to a CNOT gate with success probability 1/4.
- Feed-forward rule. If the number of V-polarized photons in the measured ancillary string is even, no correction is needed; if odd, a Pauli-Z is applied to the control photon (path 7 for C^3, path 4n−5 in general).
Methodology in Plain English
Qubits are encoded in a photon's polarization: horizontal (|H⟩) for logical 0, vertical (|V⟩) for logical 1. The design pairs each target photon with a spare "ancilla" photon prepared in |H⟩ and sends the pair through a special beam splitter that works in the diagonal (|+⟩/|−⟩) basis, so that photons with the same polarization go to different outputs and photons with opposite polarization leave together. Detecting exactly one photon in each of the resulting four paths "selects" a useful entangled-looking state, at the cost of discarding the cases where two photons end up in the same path.
Next, the control photon is routed through ordinary PBSs that transmit H and reflect V; these pick out the cases where the control and target photons share the same polarization, which is how the conditional flip is enacted. Finally, half-wave plates at 22.5° (Hadamard operations) are placed in the ancilla output paths, and coincidence detection on those ancilla photons tells the experimenter whether the correct gate happened or whether one extra Pauli-Z correction on the control photon is needed. The whole procedure only counts as a success if exactly one photon emerges from every output path — that is the post-selection.
For the imperfect-PBS study, the authors replace each beam splitter with a unitary containing two error parameters (angular misalignment θ and finite extinction ratio r), compute how far the real two-photon output state deviates from the ideal one, average that overlap over input states to get a single PBS fidelity, and then raise it to the number of PBSs in the circuit to estimate total gate fidelity. They note that calcite beam displacers can substitute for PBSs and that the parameters used are based on experimentally characterized beam-displacer imperfections.
Why This Matters
Research impact. The work offers a resource-efficiency argument for direct linear-optical fan-out gates: fewer ancilla photons, fewer PBSs, and a success probability that matches the best entangled-pair-assisted CNOT decomposition ((1/4)^{n−1}) without needing entangled pairs or GHZ states. It also provides a reusable fidelity model for PBS imperfections, which is relevant to anyone budgeting optical loss in photonic circuits.
Real-world applications (as motivated by the paper):
- Quantum error correction, where fan-out operations are listed as essential components.
- Fault-tolerant quantum computing architectures.
- Generation of entangled states and measurement-based quantum computing.
- Circuit optimization in photonic quantum information processing.
Industry relevance. Photonic quantum computing is pursued by hardware companies and national labs; any scheme that cuts the number of beam splitters and ancillary sources per gate directly affects optical table footprint, alignment stability, and detector count. The paper notes the gate needs 2(n−1) detectors, so detector budget is an explicit scaling cost.
Future Directions
- Overcoming destructive post-selection. The authors suggest developing nondestructive photonic qubit detection, or using more ancillary photons, so success can be verified without consuming the output.
- Experimental demonstration. The scheme is analyzed theoretically; a tabletop realization with calcite beam displacers, and a measured fidelity to compare against the 0.9992-based predictions, is the natural next step.
- Fuller error budgets. Beyond PBS imperfection, the paper lists finite detector efficiency, single-photon source imperfections, detector dark counts, and nonideal behavior of other optical elements as unquantified here — each would need modeling for a realistic device.
- Scaling questions. Because success probability falls as (1/4)^{n−1}, understanding whether multiplexing, improved ancilla sources, or nondestructive detection can keep larger-n fan-out gates practical is left open.
Target Audience
Graduate students and researchers in photonic quantum information processing who are designing linear-optical circuits and care about resource counts (ancilla photons, PBSs, detectors) and success probabilities; also useful for experimentalists assembling polarization-encoded gates who need a concrete estimate of how PBS misalignment and finite extinction ratio propagate into gate fidelity. Readers without prior exposure to polarization encoding and post-selection will need background reading, since the paper's derivations are notation-heavy.
Authors’ abstract
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.