Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact singlet sandwiches of rho and its support

Open
QAlgorithms.Papers.Independent.Intakenext100.P53.singlet_sandwiches

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let N≥1N\ge1N≥1 and d≥2d\ge2d≥2 be integers. Alice and Bob have NNN ordered ddd-dimensional ports, and the input register CCC has dimension ddd. Write s=(d−1)/2s=(d-1)/2s=(d−1)/2 and ∣S⟩=d−1/2∑m=−ss(−1)s−m∣s,m⟩∣s,−m⟩|S\rangle=d^{-1/2}\sum_{m=-s}^s(-1)^{s-m}|s,m\rangle|s,-m\rangle∣S⟩=d−1/2∑m=−ss​(−1)s−m∣s,m⟩∣s,−m⟩. Put Pi=∣S⟩⟨S∣AiC⊗IAˉiP_i=|S\rangle\langle S|_{A_iC}\otimes I_{\bar A_i}Pi​=∣S⟩⟨S∣Ai​C​⊗IAˉi​​, σi=d−(N−1)Pi\sigma_i=d^{-(N-1)}P_iσi​=d−(N−1)Pi​, and ρ=∑iσi\rho=\sum_i\sigma_iρ=∑i​σi​. A resource filter OOO gives ∣ΨO⟩=(OA⊗IB)∣S⟩⊗N|\Psi_O\rangle=(O_A\otimes I_B)|S\rangle^{\otimes N}∣ΨO​⟩=(OA​⊗IB​)∣S⟩⊗N and obeys tr⁡(O†O)=dN\operatorname{tr}(O^\dagger O)=d^Ntr(O†O)=dN. Alice measures ACACAC; 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.

For every port iii, let ViV_iVi​ insert the normalized Ai,CA_i,CAi​,C singlet into a vector on the complementary ports. Then

Vi†ρVi=N+d2−1dN+1IAˉi,Vi†(supp⁡ρ)Vi=IAˉi.V_i^\dagger\rho V_i=\frac{N+d^2-1}{d^{N+1}}I_{\bar A_i},\qquad V_i^\dagger(\operatorname{supp}\rho)V_i=I_{\bar A_i}.Vi†​ρVi​=dN+1N+d2−1​IAˉi​​,Vi†​(suppρ)Vi​=IAˉi​​.

These are identities of operators on the actual complement. At N=1N=1N=1 this space is one-dimensional and the first coefficient equals one. They supply the identities used in Appendix C's SRM fidelity bound; the unrestricted-scale squared inequality in its intermediate calculation is not asserted.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P53
Formal statement
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.7, Eq.(C1): operator-valued singlet sandwiches, including N=1.
No unrestricted-a squared lower bound from Eq.(C2) is asserted. -/
theorem singlet_sandwiches (d N : ℕ) (hd : 2 ≤ d) (hN : 1 ≤ N) (i : Fin N) :
    (singletInsert (d := d) i)ᴴ * pbtRho d N * singletInsert i =
      (((((N : ℝ) + (d : ℝ) ^ 2 - 1) / (d : ℝ) ^ (N + 1)) : ℝ) : ℂ) •
        (1 : Op (PortComplement d N i)) ∧
    (singletInsert (d := d) i)ᴴ * support (pbtRho d N) * singletInsert i =
      (1 : Op (PortComplement d N i)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P53

end
Source
Some remarks on port-based teleportation, arXiv:1506.01555v2, PDF p. 7, Appendix C Eq.(C1): singlet sandwiches of rho and its support
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For all natural numbers d≥2d\ge2d≥2 and N≥1N\ge1N≥1, and every i∈{0,…,N−1}i\in\{0,\ldots,N-1\}i∈{0,…,N−1}, let P={0,…,d−1}{0,…,N−1}P=\{0,\ldots,d-1\}^{\{0,\ldots,N-1\}}P={0,…,d−1}{0,…,N−1}, let Ci={0,…,d−1}{j:0≤j<N, j≠i}C_i=\{0,\ldots,d-1\}^{\{j:0\le j<N,\ j\ne i\}}Ci​={0,…,d−1}{j:0≤j<N, j=i}, and define Si:CCi→CP×{0,…,d−1}S_i:\mathbb C^{C_i}\to\mathbb C^{P\times\{0,\ldots,d-1\}}Si​:CCi​→CP×{0,…,d−1} by

(Si)(x,c),r={(−1)x(i)/d,c=d−1−x(i) and x∣{j≠i}=r,0,otherwise.(S_i)_{(x,c),r}= \begin{cases} (-1)^{x(i)}/\sqrt d,&c=d-1-x(i)\ \text{and }x|_{\{j\ne i\}}=r,\\ 0,&\text{otherwise}. \end{cases}(Si​)(x,c),r​={(−1)x(i)/d​,0,​c=d−1−x(i) and x∣{j=i}​=r,otherwise.​

Set R=d−(N−1)∑j=0N−1SjSj†R=d^{-(N-1)}\sum_{j=0}^{N-1}S_jS_j^\daggerR=d−(N−1)∑j=0N−1​Sj​Sj†​, and let ΠR\Pi_RΠR​ be the orthogonal projection onto the range of RRR. Then

Si†RSi=N+d2−1dN+1ICCiandSi†ΠRSi=ICCi.S_i^\dagger R S_i=\frac{N+d^2-1}{d^{N+1}}I_{\mathbb C^{C_i}} \qquad\text{and}\qquad S_i^\dagger\Pi_R S_i=I_{\mathbb C^{C_i}}.Si†​RSi​=dN+1N+d2−1​ICCi​​andSi†​ΠR​Si​=ICCi​​.

Here †\dagger† denotes conjugate transpose; when N=1N=1N=1, CiC_iCi​ consists of the single empty configuration, so the identities on the right are one-dimensional.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me