§7.1: controlled erasure MAC cq capacity
OpenQAlgorithms.Papers.Independent.Support50.P02.erasure_cqLet . Alice has a qubit, Bob a -dimensional register, and Charlie a -dimensional register with an orthogonal erasure flag . The controlled-erasure MAC measures Alice in the computational basis: outcome discards Bob's input and outputs the flag; outcome transfers Bob's input coherently to the nonflag subspace. Thus, for density operators ,
With nonnegative cq operational rates, squared joint fidelity, and entropy in bits,
Here is binary entropy and the single-letter region uses non-strict boundaries. This is the complete capacity equality, not just an achievable Bell-input point.
Formalization Note The printed Kraus family on p.32 is corrected to agree with the prose and displayed product-input action; transfer coherences are preserved.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P02
noncomputable section
open scoped BigOperators Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Support50.P02
open QAlgorithms.Papers.Independent.Information100.P67
(squaredFidelity receiverChannel complementaryChannel IsDegradable)
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C E R S I J : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype E] [DecidableEq E]
variable [Fintype R] [DecidableEq R] [Fintype S] [DecidableEq S]
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- Boundary-inclusive erasure cq formula, PDF p.8 and §7.1 pp.32–33.
The channel follows the corrected prose-defined Kraus family, not the erroneous
printed family. At d=1 this still includes the full classical bit interval. -/
theorem erasure_cq (d : ℕ) (hd : 0 < d) :
cqMacCapacity (controlledErasure d) =
{r | Nonnegative r ∧ ∃ q : ℝ, 0 ≤ q ∧ q ≤ 1 / 2 ∧
r.1 ≤ binEntropy2 q ∧ r.2 ≤ (1 - 2 * q) * Real.logb 2 d} ∧
cqMacCapacity (controlledErasure d) = cqOne (controlledErasure d) none := by sorry
end QAlgorithms.Papers.Independent.Support50.P02
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , let be the matrix map that sends the trace of the false-control diagonal block to an extra output index , retains the true-control block on , and sets the mixed entries to zero. Its classical–quantum generation capacity region is asserted to satisfy both
Here , with . The region means the closure in of the nonnegative pairs such that, for every , there is an integer for which every admits positive integers , unit vectors on the Boolean inputs for each , a unit vector on a -dimensional reference register and the -dimensional inputs, and a decoding channel from the outputs to an -dimensional classical register and a -dimensional register, with
The state results from applying independently to the input pairs in , applying the decoder while retaining the reference, and deleting entries between distinct classical output labels; has entries between pairs of matching reference and output labels and zero elsewhere. A channel means a map for a finite family with . The squared fidelity is
The region consists of nonnegative pairs obtained from some finite ensemble of unit vectors on the Boolean input, with weights summing to one, and some unit vector on a positive-dimensional reference and the -dimensional input: writing , , and , its bounds are
Here , where is applied by continuous functional calculus. There is no bound on the ensemble size in . The case is included, in which the displayed region forces .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.