Same-code output spectra, entropies, and coherent information
ProvedQAlgorithms.Papers.Independent.Support50.P40.coherentInformation_identityFix an additive code encoding one qubit into physical qubits, with a normalized orthogonal logical basis , a valid commuting stabilizer with independent generators and no , and complete compatible coset representatives . Let , , , and . Prepare the normalized vector . Pass only the physical code register through independent depolarization, obtaining , and set .
Both outputs are density matrices. The vectors form an orthonormal basis, as do the generalized Bell vectors . Their diagonalizations and entropies in bits are
The last quantity is the signed concatenation yield for this same code and input; no optimization over inputs is performed.
Formalization Note Printed Eq. (29) uses amplitudes instead of . Normalization, Eqs. (7)–(9), and Eq. (35) force the stated correction; independent moderation remains required.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P40
namespace QAlgorithms.Papers.Independent.Support50.P40
open QAlgorithms QAlgorithms.Stabilizer
open scoped ComplexConjugate Matrix
noncomputable section
/-- PDF pp.14--15, Eqs.(21)--(30): both diagonalizations, both entropy
identities, and coherent information per use for this same code and input.
Eq.(29)'s printed `1/2` amplitudes are corrected as explained in `codeBellInput`.
Neither an input maximization nor a general capacity formula is asserted. -/
theorem coherentInformation_identity {m : ℕ} (C : InnerCode m) (T : CosetChoices C)
(f : ℝ) (hf0 : 0 ≤ f) (hf1 : f ≤ 1) :
IsState (codeBellInput C) ∧ IsDensityMatrix (outputQ C f) ∧ IsDensityMatrix (outputRQ C f) ∧
Orthonormal ℂ (fun ib : Qubits m × Bool => errorBasis C T ib.1 ib.2) ∧
Orthonormal ℂ (fun ij : Qubits m × Pauli => bellBasis C T ij.1 ij.2) ∧
outputQ C f = ∑ ib : Qubits m × Bool,
((syndromeMass C T f ib.1 / 2 : ℝ) : ℂ) • pureDensity (errorBasis C T ib.1 ib.2) ∧
outputRQ C f = ∑ ij : Qubits m × Pauli,
(jointMass C T f ij.1 ij.2 : ℂ) • pureDensity (bellBasis C T ij.1 ij.2) ∧
vnEntropy (outputQ C f) = 1 + finiteEntropyBits (syndromeMass C T f) ∧
vnEntropy (outputRQ C f) = finiteEntropyBits (fun ij : Qubits m × Pauli => jointMass C T f ij.1 ij.2) ∧
(vnEntropy (outputQ C f) - vnEntropy (outputRQ C f)) / (m + 1) = signedYield C T f := by sorry
end
end QAlgorithms.Papers.Independent.Support50.P40
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any natural number, put , and write . Use the usual Boolean-basis Pauli matrices , with , and let for a Pauli label string . The inner-code data consist of a subgroup of the unitary matrices on , contained in the subgroup generated by all for , whose elements commute pairwise and none of which is ; and orthonormal vectors spanning exactly the common fixed space of . Set
and require . Let have columns . For label strings, denotes multiplication with the phase discarded, equivalently coordinatewise addition modulo under , , , . The representative data consist of strings for and for , with the all-identity string, such that every label string belongs to for exactly one , every , every element of belongs to for exactly one , and
for every and every complex matrix . For every real satisfying , let count nonidentity labels and define
The operation applies separately to each block indexed by the reference bit. Define , with zero entries contributing , and define the matrix entropy by
where is obtained through continuous functional calculus. The theorem asserts that , that both and are positive semidefinite with trace , that the family is orthonormal, and that the family is orthonormal. It also asserts all five identities
These assertions include , when the syndrome index is the unique empty string, and ; zero-exponent powers equal .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.