Recoverable PBT for an odd number of qubit ports
OpenQAlgorithms.Papers.Independent.Intakenext100.P53.recoverable_pbt_oddLet be odd and set . Use the qubit resource from Eq.(15), the success effects , and the failure projector . The inverse square root vanishes on the kernel. In the maximal-spin failure sector Alice measures
These vectors form an orthonormal basis of the failure sector, so the success and refined failure effects form a POVM. Each successful port has probability and teleports the input exactly. Writing , the unnormalized failure state on reference and all outputs is
Each refined failure outcome has probability and a normalized pure conditional state whose reference marginal is . There are unitaries on all output qubits, chosen solely from the classical refinement outcome , such that for every finite reference and density operator on , recovery followed by retaining a fixed output qubit gives in branch . Successful port gives without correction. With the same Alice measurement, ignoring the refinement and choosing a uniformly random port on failure instead gives
At the resource is a singlet and Alice's success singlet plus the three refinement vectors constitute the usual Bell measurement. This is the constructed hybrid of port selection and faithful teleportation using all outputs.
Formalization Note The printed Eq.(16) scalar is corrected as forced by its preceding normalized sandwich; even is excluded.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P53
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P53
open scoped Classical ComplexConjugate ComplexOrder Matrix Matrix.Norms.L2Operator
-- Accepted generic matrix and positive-operator interfaces. The support is the
-- orthogonal range projection; all uses below are on positive physical rho.
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P07 (support)
open QAlgorithms.Papers.Independent.Next46.P39 (inverseSqrt)
/-- PDF pp.3-4, Eqs.(16)-(18), summary p.5: explicit odd-N recoverable PBT.
The printed Eq.(16) coefficient 6*2^N/((N+2)(N+3)) is corrected to
3/((N+2)(N+3)), forced by its preceding sandwich and the normalized Eq.(15).
Unitaries depend only on the classical refinement outcome, precede every input,
and act on all B qubits. The alternative branch is correction-free port selection. -/
theorem recoverable_pbt_odd (N : ℕ) (hN : 1 ≤ N) (hodd : Odd N) :
let O := probabilisticResource N
let p0 : ℝ := 3 / (((N : ℝ) + 2) * ((N : ℝ) + 3))
ExactProbabilistic O (probabilisticSRM 2 N) ∧
(∀ i : Fin N, pbtBranchProbability O (srm 2 N i) = 1 / ((N : ℝ) + 3)) ∧
(∀ z : Refinement N, QAlgorithms.IsState (refinementVector N z)) ∧
(∀ z w : Refinement N, inner ℂ (refinementVector N z) (refinementVector N w) =
if z = w then 1 else 0) ∧
(∑ z : Refinement N, refinementEffect N z) = probabilisticSRM 2 N none ∧
(∀ z : Fin N ⊕ Refinement N, (recoveryMeasurement N z).PosSemidef) ∧
(∑ z : Fin N ⊕ Refinement N, recoveryMeasurement N z) = 1 ∧
pbtBranch O (probabilisticSRM 2 N none) =
(p0 : ℂ) • ∑ k : Fin (N + 2), QAlgorithms.pureDensity (bdDicke N k.val) ∧
pbtBranchProbability O (probabilisticSRM 2 N none) = 3 / ((N : ℝ) + 3) ∧
(∀ z : Refinement N, pbtBranchProbability O (refinementEffect N z) = p0 ∧
∃ v : EuclideanSpace ℂ (Fin 2 × Ports 2 N), QAlgorithms.IsState v ∧
pbtBranch O (refinementEffect N z) = (p0 : ℂ) • QAlgorithms.pureDensity v ∧
QAlgorithms.traceRight (QAlgorithms.pureDensity v) = (1 / 2 : ℂ) • (1 : Op (Fin 2))) ∧
(∃ U : Refinement N → Op (Ports 2 N),
(∀ z, U z ∈ Matrix.unitaryGroup (Ports 2 N) ℂ) ∧
∀ (R : Type) [Fintype R] [DecidableEq R] (T : Op (R × Fin 2)),
QAlgorithms.IsDensityMatrix T →
(∀ i : Fin N, selectPort i (pbtChannelBranch O (srm 2 N i) T) =
((1 / ((N : ℝ) + 3) : ℝ) : ℂ) • T) ∧
(∀ z : Refinement N,
selectPort (⟨0, by omega⟩ : Fin N)
(recoverBranch (U z) (pbtChannelBranch O (refinementEffect N z) T)) = (p0 : ℂ) • T)) ∧
pbtFidelity O (completedSRM 2 N) = (N : ℝ) / ((N : ℝ) + 3) ∧
probabilisticResource 1 = 1 ∧ srm 2 1 (0 : Fin 1) = portProjector (d := 2) (0 : Fin 1) ∧
refinementVector 1 (Sum.inl ()) = onePortBell false false ∧
refinementVector 1 (Sum.inr (0, false)) = onePortBell false true ∧
refinementVector 1 (Sum.inr (0, true)) = onePortBell true true := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P53
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number that is odd, the following assertions hold. To specify all the quantities involved, let be the port configurations, let , let denote the identity on the space indicated by its context, let denote conjugate transpose, and write for the matrix with entries . A density matrix means a positive semidefinite matrix of trace , and a state vector means a vector of Euclidean norm . Define the single-qubit matrices
and, on the ports, define
where a subscript means that the indicated matrix acts on port and the identity acts on all other ports. Let be the matrix obtained by applying the scalar function that is at and elsewhere to by continuous functional calculus, put , and let . The resource operator in the statement is
Define if , and otherwise, and let . For each port , let consist of configurations on all ports other than , and define the matrix
Let be the continuous functional calculus of for , let be the orthogonal projector onto the range of , and put
Thus , , and respectively expand the successful square-root effects, their failure effect, and their completed effects used in the statement; scalar inverses here and below use . Define resource coefficients
For a finite reference index set , a matrix on , and an effect on , define the branch matrix on by
Write and . If is the port configuration with value at and values elsewhere, define port selection by
For , let be the vector on whose coefficient at is when , and zero otherwise, and let be the vector on with . Set , using natural-number division, and let the refinement indices be
Their vectors and effects, and the combined measurement effects, are
where is indexed by the disjoint union of ports and refinement indices; the natural subtraction in has no underflow for these indices. With this notation, the theorem asserts that , that the effects are all positive semidefinite and sum to , and that
For every refinement index , it further asserts and the existence of a unit vector on such that
There exists a single family of unitary matrices on the ports, indexed by all , such that, for every reference type equipped with a finite enumeration and decidable equality and every density matrix on ,
The reference type is allowed to be empty; in that case there is no density matrix , so this requirement on is vacuous. The theorem also asserts the completed-effect fidelity identity
Finally, including the permitted boundary case , it asserts the following identities for the same constructions evaluated with one port:
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.