Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4.5: classical random bit from a Bell pair

Open
QAlgorithms.Papers.Independent.Intakethird100.P03.random_bit_simulation

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

prove2quantum

Apply a Hadamard to the first of two zero bits and a CNOT to copy its classical basis value into the second. The normalized result and its reduced density operator are

∣ψ⟩=∣00⟩+∣11⟩2,Tr⁡2(∣ψ⟩⟨ψ∣)=(1/2001/2).|\psi\rangle=\frac{|00\rangle+|11\rangle}{\sqrt2},\qquad \operatorname{Tr}_2(|\psi\rangle\langle\psi|)=\begin{pmatrix}1/2&0\\0&1/2\end{pmatrix}.∣ψ⟩=2​∣00⟩+∣11⟩​,Tr2​(∣ψ⟩⟨ψ∣)=(1/20​01/2​).

Discarding the second bit therefore produces an unbiased classical random bit. This describes local random-bit simulation, without asserting quantum cloning.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P03
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate Kronecker

namespace QAlgorithms.Papers.Independent.Intakethird100.P03

open QAlgorithms.Papers.Independent.Renew46.P01 (cleanVector)

attribute [local instance] Classical.propDecidable

/-- PDF p.14, §2.4.5: tracing out the copy yields an unbiased classical bit. -/
theorem random_bit_simulation :
    randomBitBell = ((Real.sqrt 2)⁻¹ : ℂ) • (ket (false, false) + ket (true, true)) ∧
    IsState randomBitBell ∧
    traceRight (pureDensity randomBitBell) =
      Matrix.diagonal (fun _ : Bool => (1 / 2 : ℂ)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P03

end
Source
Quantum measurements and the Abelian Stabilizer Problem, arXiv:quant-ph/9511026v1, PDF p. 14, §2.4.5: classical random bit from a Bell pair
Read-back

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

Let rrr be the two-qubit vector obtained by applying H=12(111−1)H=\frac1{\sqrt2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}H=2​1​(11​1−1​), in the Boolean order false, true, to a first qubit initially false, leaving a second qubit initially false, and then applying ∣a,b⟩↦∣a,b⊕a⟩|a,b\rangle\mapsto|a,b\mathbin{\oplus}a\rangle∣a,b⟩↦∣a,b⊕a⟩. The assertion is the conjunction of

r=12(∣false,false⟩+∣true,true⟩),∥r∥=1,∑h∈{false,true}r(j,h)r(k,h)‾={12,j=k,0,j≠kr=\frac1{\sqrt2}\bigl(|\mathrm{false},\mathrm{false}\rangle+ |\mathrm{true},\mathrm{true}\rangle\bigr),\qquad \|r\|=1,\qquad \sum_{h\in\{\mathrm{false},\mathrm{true}\}} r(j,h)\overline{r(k,h)} = \begin{cases} \frac12,&j=k,\\ 0,&j\ne k \end{cases}r=2​1​(∣false,false⟩+∣true,true⟩),∥r∥=1,h∈{false,true}∑​r(j,h)r(k,h)​={21​,0,​j=k,j=k​

for every Boolean j,kj,kj,k. Thus the last equality explicitly traces out the second coordinate of the matrix with entries r(a)r(b)‾r(a)\overline{r(b)}r(a)r(b)​.

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