arXiv:2610.18049 · New Journal of Physics
Scalable long-distance quantum fan-out gates with reduced resource overhead
Wen-Qiang Liu, Hai-Rui Wei
Abstract
Scalable long-distance quantum gates are essential for distributed quantum computation and scalable quantum networks. We propose an efficient scheme for implementing an $n$-qubit fan-out gate $C^n$ (also known as a controlled-NOT-$\cdots$-NOT gate) across spatially separated parties. Our protocol requires only a pre-shared $n$-qubit Greenberger-Horne-Zeilinger state, $n$ local controlled-NOT (CNOT) gates, and feed-forward operations, thereby reducing both the CNOT and Hadamard gate counts by $(n-2)$ when compared with the standard decomposition-based approach. We further develop two optical architectures to implement the heralded and post-selected $n$-photon fan-out gates, respectively. These schemes require fewer single photons resources and achieve higher success probabilities than their decomposition-based counterparts, representing significant improvements. The results indicate that our approach is experimentally feasible and pave the way toward practical long-distance quantum computation.
AI Summary
The paper addresses implementing an $n$-qubit fan-out gate—one control flipping $n-1$ targets—across spatially separated nodes with fewer resources than decomposing it into remote CNOTs. It presents a gate-teleportation protocol using one shared $n$-qubit GHZ state, $n$ local CNOTs, ancillary measurements, and outcome-dependent Pauli corrections. Explicit state expansions establish the three-qubit protocol and its generalization to arbitrary, potentially entangled inputs. Including entanglement preparation, the circuit uses $2n-1$ CNOTs and one Hadamard, versus $3n-3$ CNOTs and $n-1$ Hadamards for the stated decomposition baseline. Two polarization-encoded linear-optical architectures are proposed. The heralded version measures only ancillary photons and has conditional success probability $2^{-n}$ given a GHZ resource. Including the specified GHZ-generation procedure, its success probability is $2^{-(3n-1)}$, using $2n$ ancillary source photons. The post-selected version instead uses Bell-pair-derived resources and verifies photon occupancy in computational outputs; reported total probabilities are $2^{-5n/2}$ for even $n$ and $2^{-(5n-3)/2}$ for odd $n$. These results follow from optical state transformations and photon-counting conditions. The noise analysis assumes global depolarization of the GHZ resource and gives a root-fidelity lower bound $F\geq\sqrt{1-p+p/2^n}$. Practical limitations discussed include resource-state decoherence, photon loss, and imperfect sources, transmission, and detection. With specified component efficiencies, the estimated three-qubit heralded efficiency is $1.6\times10^{-3}$. Success probabilities decrease exponentially with gate size; the post-selected implementation requires output measurements rather than preserving usable computational photons.
Error found: The post-selected three-qubit optical gate succeeds with probability 1/16 conditional on the prepared ancillary state, or 1/128 including the paper’s Bell-pair preparation probability, rather than the reported 1/8 and 1/64. The paper explicitly defines Pauli Z as an off-diagonal operator, whereas its branch decompositions and feed-forward protocol require the standard diagonal phase-flip operator. The noise calculation incorrectly represents a generally mixed, improperly normalized nonideal contribution as a pure-state projector, invalidating its displayed fidelity equality but not the stated lower bound.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Journal reference
- New Journal of Physics 28 104507 (2026)
- DOI
- 10.1088/1367-2630/aeaf0f
- Comments
- 18 pages, 8 figures