Physical Gram blocks and spectral transfer
OpenQAlgorithms.Papers.Independent.Intakenext100.P53.gram_blocks_and_transferLet and be integers. Alice and Bob have ordered -dimensional ports, and the input register has dimension . Write and . Put , , and . A resource filter gives and obeys . Alice measures ; Bob selects the reported port and discards the others. Entanglement fidelities are tested against a normalized reference-input singlet, with no correction on the selected port.
Fix an allowed total spin and magnetic number . Choose a base port and a real orthonormal basis of the actual spin-, magnetic- slice of its complement. Define the other complement bases by the physical swaps , as in Eq.(A4), and set . Their actual Gram matrix is real symmetric and has
where the last swap acts within the base complement. Writing for the matrix with columns gives . For every unit vector with , , the synthesized vector satisfies
For it is nonzero; the vector identity also holds at zero. This gives the spectral interface of Appendix A without division by a zero port-component norm. Maximum-spin attainment is recorded in the exact spectral-maximum item.
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.6, Eqs.(A1)-(A7): Gram blocks, their physical spectral transfer,
and the eigenvalue bound. Basis vectors are real physical spin states;
A4's transported bases are defined, not free data. At gamma=0 the synthesized
vector is zero; a nonzero eigenvector is asserted only when gamma>0. -/
theorem gram_blocks_and_transfer (d N t r : ℕ) (hd : 2 ≤ d) (hN : 1 ≤ N)
(ht : t ≤ (N - 1) * (d - 1)) (hparity : t % 2 = ((N - 1) * (d - 1)) % 2)
(hr : r ≤ t) (i0 : Fin N) (A : Type*) [Fintype A] [DecidableEq A]
(B : RealSpinBasis d N t r i0 A) :
(∀ i k : Fin N, ∀ a b : A,
(d : ℂ) * pbtGram B (i, a) (k, b) =
if i = k then (d : ℂ) * (if a = b then 1 else 0)
else if i = i0 ∨ k = i0 then (if a = b then 1 else 0)
else (B.frameᴴ * complementSwap (d := d) i0 i k * B.frame) a b) ∧
(∀ a b, (pbtGram B a b).im = 0) ∧ (pbtGram B).transpose = pbtGram B ∧
rhoSpinMagnetic d N t r =
((d : ℂ) ^ (N - 1))⁻¹ • (gramFrame B * (gramFrame B)ᴴ) ∧
(∀ (gamma : ℝ) (c : EuclideanSpace ℂ (Fin N × A)),
QAlgorithms.IsState c → QAlgorithms.act (pbtGram B) c = (gamma : ℂ) • c →
QAlgorithms.act (rhoSpinMagnetic d N t r) (gramSynthesis B c) =
((gamma : ℂ) / (d : ℂ) ^ (N - 1)) • gramSynthesis B c ∧
‖gramSynthesis B c‖ ^ 2 = gamma ∧
(0 < gamma → gramSynthesis B c ≠ 0) ∧
gamma ≤ ((N : ℝ) + d - 1) / d) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P53
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers satisfying , , , , and ; let , let be any finite type with decidable equality, and let be a real spin basis with matrix . Thus has real entries, , and on assignments to the sites other than . To specify these projectors, set , with all other entries zero, , and ; for a site set , let and . Then is the functional-calculus projector of for value , and is that of for value . Define by
and let be the projector for value of the sum of on all ports and the additional -dimensional site. Put
Let exchange and , define when and zero otherwise, and put . For , let have entry at complementary assignments exactly when every satisfies and , where exchanges , and entry zero otherwise. The theorem asserts simultaneously that, for all and ,
every entry of has zero imaginary part, , and . Furthermore, for every real and every vector satisfying and , its synthesis satisfies
The case is included, forcing and giving empty complementary site sets; is not assumed nonempty, and if it is empty the unit-vector hypothesis in the final implication is impossible.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.