The common SRM of three optimal qubit protocols
OpenQAlgorithms.Papers.Independent.Intakenext100.P53.common_optimal_srmLet and , with the physical singlet signals and their sum as in Eqs.(4)-(5). Put and , using support inverses. For the parity-correct physical spins of qubits, let be their actual spectral projectors and . Define the normalized filters
The completed effects form a deterministic POVM. They maximize entanglement fidelity with fixed , and with they attain the global maximum over normalized resources and deterministic POVMs. With , the effects and the separate failure effect form an exact probabilistic PBT protocol attaining the global maximum success probability. Both lifted filters commute with , and the support effects for are again .
This is the coincidence of the physical measurements in the three cases, excluding fixed-resource probabilistic PBT. The Eq.(14) numerator is corrected from to using the source's intrinsic sector dimension.
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 p.3, Eqs.(12)-(15): the three optimal qubit protocols share SRM.
Each optimizer is constructed; optimality is a conclusion. The Eq.(14)
normalization is corrected to 2^(N+2) with intrinsic sector dimensions.
Fixed-resource probabilistic PBT is deliberately excluded. -/
theorem common_optimal_srm (N : ℕ) (hN : 1 ≤ N) :
DeterministicPOVM (completedSRM 2 N) ∧
(∀ E : Fin N → Op (AC 2 N), DeterministicPOVM E →
pbtFidelity (1 : Op (Ports 2 N)) E ≤
pbtFidelity (1 : Op (Ports 2 N)) (completedSRM 2 N)) ∧
NormalizedResource (deterministicResource N) ∧
(∀ (O : Op (Ports 2 N)) (E : Fin N → Op (AC 2 N)),
NormalizedResource O → DeterministicPOVM E →
pbtFidelity O E ≤ pbtFidelity (deterministicResource N) (completedSRM 2 N)) ∧
ExactProbabilistic (probabilisticResource N) (probabilisticSRM 2 N) ∧
(∀ (O : Op (Ports 2 N)) (E : Option (Fin N) → Op (AC 2 N)),
ExactProbabilistic O E → pbtSuccessProbability O E ≤
pbtSuccessProbability (probabilisticResource N) (probabilisticSRM 2 N)) ∧
pbtRho 2 N * liftA (deterministicResource N) = liftA (deterministicResource N) * pbtRho 2 N ∧
pbtRho 2 N * liftA (probabilisticResource N) = liftA (probabilisticResource N) * pbtRho 2 N ∧
(∀ i, transformedSRM (deterministicResource N) i = srm 2 N i) := 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 , let , , and , with . For each , let insert this vector on port and the final factor: its entry from a complementary configuration to is when and restricts to away from , and is zero otherwise. Put , , the orthogonal projector onto the range of , , , , and , ; the function in this calculus has value zero at zero. To specify the two resource matrices, take , , , , , , and . Define
Here the site operators act with identities elsewhere, and the spectral indicators use continuous functional calculus. For any complex matrix on , define . For a matrix on , define its unnormalized branch matrix by
Let have entry at , where ranges over configurations away from , and puts at and elsewhere. Put and . A resource is normalized exactly when ; a deterministic measurement means for every and ; an exact probabilistic pair means a normalized resource and positive effects indexed by summing to , with for every . The theorem asserts that is a deterministic measurement and maximizes over all deterministic measurements; is normalized and for every normalized complex matrix and every deterministic measurement ; is an exact probabilistic pair, and every exact probabilistic pair satisfies ; commutes with both and ; and, for every , writing and , one has . No positivity or unitarity requirement is imposed on the competing resource matrices beyond their stated trace normalization.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.