Theorem 9: ancilla purity classifier
ProvedQAlgorithms.Papers.Independent.Advance50.P50.theorem9Fix , , and , with nonempty classes of purity and . Write for their union and . Use an ancilla initially in , two copies of , and an ancilla-only Hermitian measurement. There is a fixed input-independent realization and ancilla observable such that
The model is -invariant on all density matrices and perfectly separates the purity classes in exact expectation. This is the existential realization in the theorem; it does not assert realizability of every tensor by an ancilla-only measurement.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P50
noncomputable section
namespace QAlgorithms.Papers.Independent.Advance50.P50
open MeasureTheory ProbabilityTheory
open scoped ComplexConjugate ENNReal
-- Exact accepted primitives; no paper-local redeclarations.
open QAlgorithms.Papers.Independent.Information100.P63 (Mat tensorPower)
open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)
open QAlgorithms.Papers.Independent.Gap48.P38 (subsystemReduction)
open QAlgorithms.Papers.Independent.Information100.P32 (purity)
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
-- Matrices carry the associative commutator bracket X*Y-Y*X.
attribute [local instance 100] LieRing.ofAssociativeRing
/-- PDF pp.25–26, Theorem 9: an actual ancilla-only realization with A=Z,
S=SWAP, unit eigenvalue on |0>, exact purity response and perfect separation.
The statement does not assume every A,S has an ancilla-only realization. -/
theorem theorem9 {n : ℕ} (hn : 1 ≤ n) (b : ℝ)
(hb : 1 / (2 : ℝ) ^ n ≤ b ∧ b < 1)
(hpure : ∃ rho : Mat (Qubits n), IsDensityMatrix rho ∧ purity rho = 1)
(hmixed : ∃ rho : Mat (Qubits n), IsDensityMatrix rho ∧ purity rho = b) :
∃ M : AncillaModel (Qubits n),
(M.unitary : Mat (Bool × Copies (Qubits n) 2)) = swapTestMatrix (Qubits n) ∧
M.observable = pauliZ ∧
M.effective = Matrix.kronecker pauliZ (copySwap (Qubits n)) ∧
act pauliZ (ket false) = ket false ∧
DomainInvariant (Matrix.unitaryGroup (Qubits n) ℂ : Set (Mat (Qubits n)))
{rho | IsDensityMatrix rho} M.response ∧
(∀ rho, IsDensityMatrix rho → M.response rho = purity rho) ∧
SeparatesPurity b M.response := by sorry
end QAlgorithms.Papers.Independent.Advance50.P50
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and real number satisfying , assume there exists a positive semidefinite matrix of trace one on -bit strings with , and there also exists such a matrix with . Put , let swap the two coordinates, let , and let , with Boolean coordinates ordered . There exists a model consisting of a unitary on and a Hermitian Boolean-indexed observable , such that
Writing , where , the conclusion further states that for every unitary on and every positive semidefinite trace-one ; that for every such ; and that whenever are positive semidefinite trace-one matrices with respective purities and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.