§2.4.5: classical random bit from a Bell pair
OpenQAlgorithms.Papers.Independent.Intakethird100.P03.random_bit_simulationApply 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
Discarding the second bit therefore produces an unbiased classical random bit. This describes local random-bit simulation, without asserting quantum cloning.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P03
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be the two-qubit vector obtained by applying , in the Boolean order false, true, to a first qubit initially false, leaving a second qubit initially false, and then applying . The assertion is the conjunction of
for every Boolean . Thus the last equality explicitly traces out the second coordinate of the matrix with entries .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.