Abstract Wave-packet mismatch in entanglement swapping leaves which-source information and lowers the fidelity of the heralded remote pair. We determine the exact correction achievable with one independent auxiliary photon. For pure data photons with amplitude overlap c, every finite static passive network acting identically on internal states, followed by photon counting and deterministic local recovery, yields conditional Bell fidelity at most (1 + c + c2)/(2 − c + 2c2). A five-mode circuit with four two-mode mixings attains this limit and converts first-order mismatch error to second order, whereas circuits with at most three mixings in the logical-mode basis cannot exceed (1 + c)/2. At two-photon visibility 0.98, a pure auxiliary reduces the error from 1.0 × 10−2 to 3.4 × 10−5 at heralding probability 0.041. For mixed auxiliary states supported on the span of the data wave packets, quadratic suppression is possible if and only if the purity deficit vanishes at least quadratically in the mismatch. We establish a matching error law at fixed positive heralding probability. With data visibility 0.90 and auxiliary-copy visibility 0.99, the aligned circuit reduces Bell error 6.6-fold. A centered Gaussian auxiliary of optimized width preserves the optimal leading error.
Abstract Wave-packet mismatch in entanglement swapping leaves which-source information and lowers the fidelity of the heralded remote pair. We determine the exact correction achievable with one independent auxiliary photon. For pure data photons with amplitude overlap c, every finite static passive network acting identically on internal states, followed by photon counting and deterministic local recovery, yields conditional Bell fidelity at most (1 + c + c2)/(2 − c + 2c2). A five-mode circuit with four two-mode mixings attains this limit and converts first-order mismatch error to second order, whereas circuits with at most three mixings in the logical-mode basis cannot exceed (1 + c)/2. At two-photon visibility 0.98, a pure auxiliary reduces the error from 1.0 × 10−2 to 3.4 × 10−5 at heralding probability 0.041. For mixed auxiliary states supported on the span of the data wave packets, quadratic suppression is possible if and only if the purity deficit vanishes at least quadratically in the mismatch. We establish a matching error law at fixed positive heralding probability. With data visibility 0.90 and auxiliary-copy visibility 0.99, the aligned circuit reduces Bell error 6.6-fold. A centered Gaussian auxiliary of optimized width preserves the optimal leading error.
Internal-state mismatch limits heralded entanglement swapping. We determine the limits of using one independent auxiliary photon (a helper) with passive optics acting identically on every internal state, complete photon counting and deterministic local recovery. For pure data states of overlap 0<c<1, put t=1−c. Optimizing over the helper and all allowed finite networks reduces the minimum Bell error from (1−c2)/2∼t without a helper to t2/(2−c+2c2)∼t2/3. Attaining this minimum requires a pure midpoint helper and three equally spaced logical Bloch directions (a trine); the largest single-record probability at equality is (2−c+2c2)/72. For a mixed helper supported on the data-state span, let its eigenvalues be (1±r)/2 and η=1−r. Under a complete-record probability floor p≥p0, with fixed 0<p0<1/64, the optimal error has order min{t2+η,tt+η} as t,η→0. Quadratic suppression is possible precisely when η=O(t2), requiring an ideal Hong--Ou--Mandel helper self-visibility deficit of quadratic or smaller order in the data-visibility deficit. When η is proportional to t, exchange-invariant helpers leave linear error, whereas a tilted helper and a real eight-mode network attain the optimal order t3/2. The converse follows from compatibility of the optical amplitudes shared by all photon assignments. The same order holds for local unitaries, deterministic local operations and classical communication, and deterministic separable recovery, and for the average over a bounded number of accepted records at nonvanishing total acceptance probability.
Partial distinguishability limits linear-optical entanglement swapping. For pure data packets with overlap 0<c<1, static, internal-state-blind passive optics and spatial photon-number-resolving detection leave an unassisted conditional Bell error of at least ϵ=(1−c2)/2. We prove that a single independent auxiliary photon (the helper) cannot eliminate this first-order error using three or fewer two-mode mixings: the error remains at least ϵ/(1+c), even with an optimized helper, finite vacuum extensions and deterministic single-copy local operations and classical communication on the retained qubits. A fixed five-mode circuit with four mixings beats this bound for every c. Preparing the helper in the normalized sum of the phase-aligned data packets yields a selected record with probability (2−c+2c2)/72 per supplied trial and error (1−c)2/(2−c+2c2)=ϵ2/3+O(ϵ3). At c=0.99 (two-photon visibility 0.9801), the error is 3.4×10−5, compared with 1.0×10−2 without a helper and 5.0×10−3 for the best three-mixing circuit. A non-polarizing beam splitter, a partially polarizing beam splitter and a half-wave plate implement the four mixings in polarization encoding. The target Bell weight is proportional to the fully symmetric three-photon internal-state weight. For symmetric depolarized-qubit sources, we derive the exact helper-optimized three-mixing ceiling and a unique impurity threshold for each 0<c<1; stochastic impurity contributes at first order. We also give the fixed-instrument acceptance frontier, the calibration floor, and comparisons with two helpers and internal-mode filtering, which achieves higher heralding rates in the Gaussian scenarios studied.
Abstract We establish the minimum number of same-source photons needed for arbitrary-order suppression of source mismatch in photonic entanglement swapping and construct a static passive circuit family that attains it. The result applies to unencoded photons, optics that act identically on all internal states, complete photon-number-resolving detection, and local-unitary recovery of the retained qubits. For two pure source wave packets with squared overlap u, suppressing the bare mismatch error ϵ=(1−u)/2 to order ϵr at nonzero ideal success probability requires at least r photons from each source. A cyclic interferometer attains the minimum total of 2r photons at every order, with ideal acceptance 22−3r. An exact transfer expression extends the calculation to distinct wave packets and correlated classical source noise. Near a common wave packet, the leading error is proportional to the summed delayed Hong--Ou--Mandel losses along a closed tour through each source's emissions. For equally spaced emissions, losses that increase concavely with delay select chronological wiring, whereas convex growth selects a folded order; independent fluctuations add the same leading penalty to every wiring. In a Gaussian drift model, folding lowers the smallest reachable error in the compared catalogs by about 23% without adding photons. Including detection, storage, and routing losses, the photon-cost advantage depends on the target and is largest in a narrow target window; at target error 4.35×10−4, the pooled cost is lower by a factor of about 5.6 with equal acceptance and randomization options in both catalogs. A common spectral filter is cheaper in this finite-noise example; a separate pure-source analysis gives a regime with a better cyclic cost exponent.
Multipair emission is a principal source of false heralds in entanglement swapping with spontaneous parametric down-conversion sources. A conventional Bell-state measurement (BSM) cannot distinguish the desired arrival of one photon from each neighboring source from a mixed-polarization double emission by one source accompanied by vacuum from the other. We show that a cascaded network can resolve this ambiguity by allowing its successive swapping stations to perform different measurements. A direct-basis BSM rejects same-polarization double emissions, whereas a balanced equatorial analyzer, implemented by a four-mode Green Machine (GM), uses two-photon interference to reject mixed-polarization double emissions. At the same time, it recovers same-polarization inter-source events rejected by the BSM as resolved φ-type Bell heralds. Their rejection sets jointly cover both single-source two-photon classes while retaining contributions from both useful inter-source classes. We classify the passive four-mode, number-resolving analyzers satisfying this condition and identify the BSM and GM as canonical balanced representatives. Using a Gaussian-state analysis exact to all orders of multipair emission, we evaluate three-source BSM--GM and four-source BSM--GM--BSM Pure Bell Pair sources under coupling, detector, and channel loss. The three-source network suppresses the leading infidelity, while the four-source network heralds an exact Bell state in the lossless limit, a property that holds for every alternating BSM--GM chain with four or more sources. The fidelity advantage over source-count-matched all-BSM networks persists at every loss level studied, a single-channel rate advantage appears without multiplexing, and spectral multiplexing raises the Bell-pair delivery probability toward the asymptotically deterministic limit.
What can be transmitted with a fixed photon supply? An optical source that supplies exactly K photons across n modes poses a concrete communication problem: how many messages can it transmit at a chosen error probability, and which input states make the best use of those photons? This paper gives directly evaluable coding bounds for pure loss and identifies the exact optimal input ensembles for identical noisy Gaussian channels. The results allow researchers to assess finite optical blocks, quantify the information cost of fixing the photon supply, and determine when entanglement between separately constrained blocks can be dispensed with. Every message is supported on the same exact K-photon sector. Within that sector, encoding may use arbitrary mixed states and entanglement among modes, and the receiver may perform a joint measurement. Communication is unassisted. All logarithms below are natural; information is measured in nats. Finite-message bounds and the optimal third-order rate For n ≥ 2 identical pure-loss channels of transmissivity 0 < η < 1 and K ≥ 1, the number L of surviving photons has the same binomial distribution for every encoded state. Define pℓ=(ℓK)ηℓ(1−η)K−ℓ,dn,ℓ=(ℓn+ℓ−1). If ps*(M;n,K) is the best average success probability for M equiprobable messages, then ∑ℓ=0Kpℓ[1−dn,ℓM−1]+≤ps∗(M;n,K)≤∑ℓ=0Kpℓmin{1,Mdn,ℓ}. Here [x]+ = max{x,0}. The lower bound provides an achievable guarantee; the upper bound limits every admissible code. Evaluating both sums brackets the performance at a specified photon supply and block length. Their proof has a simple physical interpretation: surviving photons determine the available output dimension, while one collective-mode codebook works across all possible survivor counts. For fixed E > 0, fixed error tolerance 0 < ε < 1, Kn = ⌊nE⌋ and en = Kn/n, the bounds determine the largest message count through third order: logM∗(n,Kn,ε)=ng(ηen)+nη(1−η)enh(ηen)ΦN−1(ε)−21logn+O(1). Here g(x) = (x+1)log(x+1) − x log x, h(x) = log(1+1/x), and ΦN is the standard normal distribution function. This fixes both the fluctuation scale and the optimal −½ log n correction. The finite bounds also yield the exact decay exponent of success above capacity and a matching error exponent on a specified interval below capacity. Which inputs are optimal under Gaussian noise? For n identical nonidentity gauge-covariant Gaussian channels, with thermal photon means transformed as r ↦ ar+b, a > 0 and b ≥ max{0,a−1}, the paper determines the exact fixed-photon Holevo optimum and every ensemble attaining it. Each optimal letter places all K photons in one collective mode: ∣K,u⟩=K!(∑j=1nujaj†)K∣0⟩,∑j∣uj∣2=1. An ensemble is optimal precisely when almost all its letters have this form and its average is uniform on the K-photon sector. A finite weighted optimal ensemble exists. These collective modes may themselves extend across, and be entangled among, physical optical modes. Thus the characterization identifies the structure to optimize without imposing a Gaussian-input restriction. The central proof step combines different loss histories that end in the same output photon sector. A common ordering of the comparison eigenstates allows the separate majorization bounds to be combined. For pure loss, a quantitative rigidity estimate further converts a small Holevo deficit into closeness to collective-mode number states. Resource cost and communication across blocks At fixed positive photon density and fixed nonidentity Gaussian noise, requiring an exact photon supply incurs a Holevo penalty of ½ log n plus an explicitly determined constant, relative to the usual mean-energy value. The paper separates this cost into photon-count uncertainty and the mismatch from a thermal output distribution. For separately constrained blocks of quantum-limited loss, quantum-limited amplification or entanglement-breaking Gaussian noise, the one-block Holevo values add exactly. Every optimal letter is a product of blockwise collective-mode number states, and the repeated-block unassisted classical capacity equals the one-block Holevo value. The low-rate reliability interval outside the matching range and repeated-block additivity for intermediate Gaussian noise remain open.
Purity does not change under a phase rotation, but estimating it from successive optical pulses can still require relative-phase information. This article determines the best possible precision when an unknown single-mode source is independently prepared, undergoes photon loss, and is then rotated by a hidden correlated phase trajectory. A uniform precision law. The normal source state satisfies Tr(ρN)≤E and Tr(ρNs)≤M, with fixed E,M>0 and s≥1. The phase starts uniformly on the circle, independently of the entire sequence of independent increments, whose known Fourier spectrum is exp(−γ∣q∣β), with γ>0 and 0<β≤2. The target is the purity Pη=Tr[Lη(ρ)2] after pure loss, not the purity of the phase-averaged marginal. For m source preparations, set p=1−η, Lm=[log(m+e)]1/β and qm=⌈[logm/(2γ)]1/β⌉. The minimax expected absolute error obeys Rm(Pη)≍Fm(p),Fm(p)=Lm−sηqm+Lm−2s(1+pLm)−2s. The comparison constants are uniform for η∈[1/2,1], including transmissivities approaching one as the budget grows. An ideal adjacent-pair interference measurement, independent of the transmissivity, attains the order. The converse allows arbitrary joint measurements on the complete correlated quantum history. The same law holds for the second Rényi entropy −logPη. What loss changes. Vacuum–high-photon coherence and coherence between broad high-photon packets give two different hard pairs of legal sources. Without loss the rate is (logm)−s/β; at fixed nonzero loss it is (logm)−4s/β. Each loss level has its own output target. The faster rate therefore does not mean improved recovery of the original input purity. Both constructions retain their actual moment budgets, the same source within each experiment and complete photon tails. Mean cost, stopping and unbiased readings. Allowing arbitrary quantum memory, feedback and an observable stopping time leaves the order unchanged when only the worst-case mean number of requested raw source slots is bounded by B: RBstop(Pη)≍F⌊B⌋(1−η). Every requested slot is charged, including discarded slots and failed outcomes. An exactly unbiased purity estimator attains the same absolute-error order with finite mean cost and almost-sure termination, using rare, unbounded signed readings. Under the specified independent common-phase reset and auxiliary-reset permissions for repeated blocks, exact unbiasedness and uniformly finite mean cost rule out uniformly finite variance. This is a uniform obstruction over sources, not a claim of infinite variance at every source; exact unbiasedness is not asserted for the Rényi entropy. The analysis builds on swap/parity measurements, drift diagnostics, quadratic-functional deconvolution and randomized telescoping. Its contribution is the matching quantum-history law, its uniform loss dependence and its return to the actual mean preparation budget. The integrated 14-page PDF contains two figure groups, complete proofs and references. The figures illustrate asymptotic rate functions, not experimental data or calibrated sample requirements; detector, phase-control, storage and elapsed-time costs are separate from the source-slot optimum.