Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform qubit preparations realized by local projective measurements of a singlet

Open
QAlgorithms.Papers.Independent.Intakethird100.P01.qubitSourcePurification

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let X=(ψx)x∈{0,1}X=(\psi_x)_{x\in\{0,1\}}X=(ψx​)x∈{0,1}​ and Z=(ϕz)z∈{0,1}Z=(\phi_z)_{z\in\{0,1\}}Z=(ϕz​)z∈{0,1}​ be any two orthonormal bases of C2\mathbb C^2C2. Share the normalized singlet

∣Ψ−⟩=∣01⟩−∣10⟩2.|\Psi^-\rangle=\frac{|01\rangle-|10\rangle}{\sqrt2}.∣Ψ−⟩=2​∣01⟩−∣10⟩​.

For a desired vector ψ=(a,b)\psi=(a,b)ψ=(a,b), use the first-qubit measurement vector vψ=(b‾,−a‾)v_\psi=(\overline b,-\overline a)vψ​=(b,−a). For each basis these vectors form a complete orthonormal projective measurement. Each outcome has probability 1/21/21/2, and the conditional density operator of the second qubit is the pure density operator of the corresponding desired vector. If Mx=∣vψx⟩⟨vψx∣M_x=|v_{\psi_x}\rangle\langle v_{\psi_x}|Mx​=∣vψx​​⟩⟨vψx​​∣ and Nz=∣vϕz⟩⟨vϕz∣N_z=|v_{\phi_z}\rangle\langle v_{\phi_z}|Nz​=∣vϕz​​⟩⟨vϕz​​∣, then

max⁡x,z∥MxNz∥op2=max⁡x,z∣⟨ψx,ϕz⟩∣2.\max_{x,z}\|\sqrt{M_x}\sqrt{N_z}\|_{\mathrm{op}}^2 =\max_{x,z}|\langle\psi_x,\phi_z\rangle|^2.x,zmax​∥Mx​​Nz​​∥op2​=x,zmax​∣⟨ψx​,ϕz​⟩∣2.

Thus the two source descriptions give the same preparation quality, defined as minus the base-two logarithm of this overlap. Equality of the emitted density operators makes the assertion independent of a global phase convention.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P01
Formal statement
namespace QAlgorithms.Papers.Independent.Intakethird100.P01

open scoped BigOperators ComplexConjugate ComplexOrder

-- Accepted extended entropy: the finite-real smoothing helper excludes radius >= 1.

open QAlgorithms.Papers.Independent.Information100.P67
  (IsSubnormalized purifiedDistance conditionalMaxEntropy smoothConditionalMaxEntropyExtended)

noncomputable section

/-- PDF pp.9,11: any two orthonormal pure qubit bases admit the stated singlet preparation,
with uniform outcomes and the same preparation/measurement overlap. Density equality avoids
imposing an unphysical global-phase convention on remote preparations. -/
theorem qubitSourcePurification (X Z : Bool → EuclideanSpace ℂ Bool)
    (hX : Orthonormal ℂ X) (hZ : Orthonormal ℂ Z) :
    IsState singletKet ∧ RealizesUniformQubitBasis X ∧ RealizesUniformQubitBasis Z ∧
      preparationMeasurementOverlap X Z = preparationOverlap X Z := by sorry

end

end QAlgorithms.Papers.Independent.Intakethird100.P01
Source
Tight Finite-Key Analysis for Quantum Cryptography, arXiv:1103.4130v2, PDF p. 11, Supplementary Note 1, source-model reduction; also Methods, PDF p.9
Read-back

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

For any two orthonormal families X,Z:{false,true}→C2X,Z:\{\mathrm{false},\mathrm{true}\}\to\mathbb C^2X,Z:{false,true}→C2, meaning ⟨Xx,Xy⟩=⟨Zx,Zy⟩=δxy\langle X_x,X_y\rangle=\langle Z_x,Z_y\rangle=\delta_{xy}⟨Xx​,Xy​⟩=⟨Zx​,Zy​⟩=δxy​, let s∈C{false,true}2s\in\mathbb C^{\{\mathrm{false},\mathrm{true}\}^2}s∈C{false,true}2 have entries s(false,true)=1/2s(\mathrm{false},\mathrm{true})=1/\sqrt2s(false,true)=1/2​, s(true,false)=−1/2s(\mathrm{true},\mathrm{false})=-1/\sqrt2s(true,false)=−1/2​, and zero otherwise. For each B∈{X,Z}B\in\{X,Z\}B∈{X,Z}, define vB,x=(Bx(true)‾,−Bx(false)‾)v_{B,x}=(\overline{B_x(\mathrm{true})},-\overline{B_x(\mathrm{false})})vB,x​=(Bx​(true)​,−Bx​(false)​), PB,x(i,j)=vB,x(i)vB,x(j)‾P_{B,x}(i,j)=v_{B,x}(i)\overline{v_{B,x}(j)}PB,x​(i,j)=vB,x​(i)vB,x​(j)​, cB,x(j)=∑ivB,x(i)‾s(i,j)c_{B,x}(j)=\sum_i\overline{v_{B,x}(i)}s(i,j)cB,x​(j)=∑i​vB,x​(i)​s(i,j), and RB,x(i,j)=cB,x(i)cB,x(j)‾R_{B,x}(i,j)=c_{B,x}(i)\overline{c_{B,x}(j)}RB,x​(i,j)=cB,x​(i)cB,x​(j)​, with all indices Boolean. The theorem asserts that ∥s∥=1\|s\|=1∥s∥=1; for each such BBB, the vectors vB,xv_{B,x}vB,x​ form an orthonormal family, ∑xPB,x=I\sum_xP_{B,x}=I∑x​PB,x​=I, and every Boolean xxx satisfies PB,x⪰0P_{B,x}\succeq0PB,x​⪰0, PB,x2=PB,xP_{B,x}^2=P_{B,x}PB,x2​=PB,x​, tr⁡RB,x=1/2\operatorname{tr}R_{B,x}=1/2trRB,x​=1/2, and 2RB,x(i,j)=Bx(i)Bx(j)‾2R_{B,x}(i,j)=B_x(i)\overline{B_x(j)}2RB,x​(i,j)=Bx​(i)Bx​(j)​; and

max⁡x,z∥PX,x PZ,z∥op2=max⁡x,z∣⟨Xx,Zz⟩∣2.\max_{x,z}\left\|\sqrt{P_{X,x}}\,\sqrt{P_{Z,z}}\right\|_{\mathrm{op}}^2 = \max_{x,z}|\langle X_x,Z_z\rangle|^2.x,zmax​​PX,x​​PZ,z​​​op2​=x,zmax​∣⟨Xx​,Zz​⟩∣2.

Here the square roots use continuous functional calculus with the real square-root function, and the operator norm is induced by the Euclidean norm.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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