Theorem 1 — Quantum union bounds for success and conditional disturbance
OpenGaoQuantumUnion.theorem1For a density operator and a finite sequence of orthogonal projectors, let , and . The target retains both conclusions of Theorem 1:
together with exactly when all individual failures vanish. The model is finite dimensional; the trace distance is unhalved. The branch-positivity condition applies only to conditional disturbance, preserving the full unconditional probability statement. The equality assertion is for the probability bound.
import Definitions.Def_GaoQuantumUnion_Model open Matrix WildeQIT GaoQuantumUnion open scoped MatrixOrder ComplexOrder ComplexConjugate set_option autoImplicit false
namespace GaoQuantumUnion
theorem theorem1 {ι : Type} [Fintype ι] [DecidableEq ι] {N : ℕ}
(ρ : Matrix ι ι ℂ) (hρ : IsDensityOperator ρ)
(P : Fin N → Matrix ι ι ℂ) (hP : ∀ i, IsProjector (P i)) :
1-4*failureSum P ρ ≤ successProb P ρ ∧
(0 < successProb P ρ → traceDist ρ (postState P ρ) ≤ 2*Real.sqrt (failureSum P ρ)) ∧
(successProb P ρ=1-4*failureSum P ρ ↔ ∀ i, failureTerm (P i) ρ=0) := by sorry
end GaoQuantumUnion
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent blind read-back agent)
For every finite type equipped with decidable equality, every natural number (including ), every complex matrix with rows and columns indexed by such that is positive semidefinite and , and every family of complex matrices on the same index type such that and for every , define when and when , define , , , , and , where denotes conjugate transpose, is the identity matrix, and the complex inverse of is defined to be (so when ). Then all three assertions hold: ; if , then , where the matrix square root is the positive semidefinite square root and the scalar square root is the real square root, whose value is on negative inputs; and if and only if for every with . The distance in the second assertion is exactly the displayed real trace, with no factor of , and that assertion imposes a bound only under the strict hypothesis . For , the sum is empty and equals , the condition on all is vacuous, and the definitions give , , and . The finite index type is allowed to be empty, in which case the trace is and no matrix satisfies the required trace-one hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.