Theorem 2: regularized qq capacity pentagons
OpenQAlgorithms.Papers.Independent.Support50.P02.qq_regularizedLet be a completely positive, trace-preserving channel between finite, positive-dimensional complex quantum registers. Alice and Bob control separate inputs. Codes use independent sender preparations, local encoders, one joint memoryless channel and one joint decoder, with external references untouched and no free shared resources. Fidelity is squared Uhlmann fidelity, trace distance is the full trace norm, and entropies are in bits. Write and for the closed operational classical–quantum and quantum–quantum capacity regions, using joint output fidelity and nonnegative rates.
For independent pure states and , let . Every information quantity in a fixed set of inequalities is evaluated on this same state. Here and is entropy in bits.
Let be the union over these inputs of the nonnegative rate pairs satisfying all three inequalities
Then
The product constraint applies between senders, while each sender may entangle inputs across channel uses.
Formalization Note The printed strict signs are corrected to non-strict signs before closure, preserving zero-rate faces.
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]
/-- Theorem 2, PDF p.8, proof pp.17–22: product sender inputs, all THREE
bounds on one state. Same explicit non-strict boundary correction as Theorem 1.
The p.18 one-use N tensor n notation is read as N before subsequent k-blocking. -/
theorem qq_regularized [Nonempty A] [Nonempty B] [Nonempty C]
(N : Superop (A × B) C) (hN : IsChannel N) :
qqMacCapacity N = closure (regularized (fun n => qqOne (macPower N n))) := 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 nonempty finite types with decidable equality and a channel , where “channel” means a map with a finite Kraus representation , , the default, generation, quantum–quantum capacity is the closure of the following set of pairs. Choose any positive blocklength , positive reference dimensions , and unit vectors , , and form
grouping the references before the inputs. A pair belongs to this set exactly when some such choices give
Here , are the chosen references, in a subscript denotes the whole output , partial traces define the marginals, and with applied by continuous functional calculus. The capacity on the left is the closure of nonnegative rates such that, for every , every sufficiently large positive blocklength admits positive integers , with , , unit vectors on and , and a decoding channel , whose reference–decoded output has squared fidelity at least with , after the corresponding coordinate regrouping. The matrix has entries between and and zero elsewhere, and squared fidelity means . The existential blocklength on the right is strictly positive; reference dimensions are otherwise unrestricted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.