Any ordering of output ports realizes the same vacuum broadcast channel
ProvedQAlgorithms.Papers.Independent.Support50.P48.beam_splitter_orderingLet and let the receiver and environment port weights sum to one. Fix any ordering of these ports. There exist continuing-port transmissivities such that, whenever the residual intensity is positive,
The successive vacuum beam splitters have exactly the same full number-basis amplitudes as the single-input vacuum splitting isometry with port amplitudes . Their output density operators therefore agree for every normal input, including arbitrary reference systems. At stages with zero residual intensity the remaining ports carry vacuum, so their splitter parameters can be chosen freely in .
This permits the port reorderings used in the broadcast-cut converse. Formalization Note Stages are zero-indexed. A positive signal-amplitude phase convention is fixed for all output ports; fixed local phase rotations recover the source convention, including the negative Charlie coefficient in (2). The environment remains in the equality, so tracing it also gives equal broadcast outputs.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P48
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P48
open Filter
open scoped BigOperators ENNReal NNReal Topology
open QAlgorithms.Papers.Independent.Dependency50.P30
(PureLossBroadcastParameters thermalEntropyBits)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsDensity IsSeparable)
open QAlgorithms.Papers.Independent.Frontier18.P07
(extendedEntropyNats extendedRelativeEntropyNats)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.2, alternative realizations; PDF p.6, Fig.3 and (30).
For any ordering of all receiver/environment ports there are m physical vacuum
splitters with the printed continuing-port fractions at active stages. At zero
residual intensity any [0,1] continuation works. Equality holds on the full
referenced channel, without a photon cutoff; fixed local output phases match
(1)-(3). Here eta includes the environment and therefore sums to one. -/
theorem beam_splitter_ordering {m : ℕ} (hm : 0 < m)
(eta : Fin (m + 1) → ℝ≥0) (heta : (∑ i, eta i) = 1)
(order : Equiv.Perm (Fin (m + 1))) :
∃ t : Fin m → ℝ,
(∀ j, 0 ≤ t j ∧ t j ≤ 1) ∧
(∀ j, 0 < residualIntensity eta order j.val →
t j = residualIntensity eta order (j.val + 1) /
residualIntensity eta order j.val) ∧
(∀ out n, sequentialAmplitude t order out n = vacuumAmplitude eta out n) ∧
(∀ (R : Type) (rho : State (R × ℕ)),
IsDensity (referencedVacuumOutput (sequentialAmplitude t order) rho.coefficients) ∧
referencedVacuumOutput (sequentialAmplitude t order) rho.coefficients =
referencedVacuumOutput (vacuumAmplitude eta) rho.coefficients) := by sorry
end QAlgorithms.Papers.Independent.Support50.P48
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , every family indexed by with , and every permutation of these indices, there exists a function with all satisfying the following simultaneous assertions. Define
For each , if , then ; when , this implication imposes no ratio condition. For every occupation function and every , let and define
Here is natural-number subtraction truncated at zero, binomial coefficients vanish when the lower argument exceeds the upper argument, and all zeroth powers, including , are one. The asserted equality is for every , including . Finally, for every type and every state on , write for its coefficient matrix and, for either amplitude function , define
The theorem asserts that is a density matrix and . Here the assumption that is a state, and the conclusion that is a density matrix, mean precisely that each matrix admits an expansion with square-summable complex vectors and , every finite quadratic form is real and nonnegative, and its real diagonal entries are summable with sum one. No countability or nonemptiness assumption is imposed on ; if is empty, there are no such states, so the assertion quantified over is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.