§5: cq scenario equivalence
OpenQAlgorithms.Papers.Independent.Support50.P02.cq_scenariosLet 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 , let be the closure of achievable cq rates for entanglement generation, entanglement transmission, and strong subspace transmission, respectively. The first two use uniform classical messages and average joint classical/Bell fidelity. The third requires the joint classical/quantum fidelity bound for every message and every pure reference/input state of Bob, permitting private stochastic classical encoding. Then
This identifies the three operational tasks asymptotically, not their exact finite-code performances.
Formalization Note The strong task tests the original message, consistent with the inverse cyclic relabeling on p.25. Extra channel blocks used to establish random seeds count toward the blocklength; there is no free shared seed.
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]
/-- CQ scenario equivalence, PDF p.7 and §§5.2–5.4, pp.24–29.
The strong criterion tests m, with the p.25 inverse relabeling correction.
Shared seeds in the proof are generated by extra channel blocks and charged;
p.29 derandomization requires existence of a good seed, not every seed. -/
theorem cq_scenarios [Nonempty A] [Nonempty B] [Nonempty C]
(N : Superop (A × B) C) (hN : IsChannel N) :
cqMacCapacity N .generation = cqMacCapacity N .transmission ∧
cqMacCapacity N .transmission = cqMacCapacity N .strong := 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 any nonempty finite types with decidable equality and any channel , the three classical–quantum operational regions satisfy
Each region is the closure of the nonnegative rates such that, for every , every sufficiently large positive integer admits positive integers with , , and a code of the indicated kind. Set , let have entries between and and zero elsewhere, and use squared fidelity . A generation code supplies unit vectors on , a unit vector on , and a decoding channel ; the average over of the squared fidelity between and the decoded output must be at least , where acts on the two inputs, the reference is untouched, and entries between unequal decoded message labels are set to zero. A transmission code has the same condition, but Bob’s source is for an encoding channel . A strong code permits density matrices for Alice and requires encoding and decoding channels such that, for every message , every positive reference dimension , and every unit vector on , the corresponding dephased decoded output has squared fidelity at least with , using input . Coordinates are regrouped to place references first. All density matrices are positive semidefinite with trace one, and every channel mentioned, including , has a finite Kraus representation with Kraus operators satisfying .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.