§5: qq scenario equivalence
OpenQAlgorithms.Papers.Independent.Support50.P02.qq_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.
Let denote the closed qq rate regions for entanglement generation, entanglement transmission, and strong subspace transmission. Generation starts from independent pure reference/input preparations. Transmission applies separate local CPTP encoders to halves of independent Bell states. Strong transmission must preserve every pair of independent pure reference/input states, with arbitrary finite reference dimensions. In every case success uses one joint fidelity to the product target. Then
This permits the same closed region to describe all three tasks, without adding free shared randomness.
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]
/-- QQ scenario equivalence, PDF p.7 and §§5.2–5.4, pp.24–29.
Arbitrary references stay independent across senders; equality concerns CLOSED regions. -/
theorem qq_scenarios [Nonempty A] [Nonempty B] [Nonempty C]
(N : Superop (A × B) C) (hN : IsChannel N) :
qqMacCapacity N .generation = qqMacCapacity N .transmission ∧
qqMacCapacity N .transmission = qqMacCapacity 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 quantum–quantum operational regions satisfy
Each is the closure of the nonnegative rates for which, for every , every sufficiently large positive blocklength admits positive integers with , , and an appropriate code. Write , let have entries between and and zero elsewhere, and let . Generation uses unit vectors on , on , and a decoding channel , requiring squared fidelity at least between and the output obtained by applying and while leaving both references untouched. Transmission instead uses encoding channels , , with source , and imposes the same fidelity condition. Strong transmission uses such encoding and decoding channels and requires, for every positive pair of reference dimensions and every pair of unit vectors on , on , squared fidelity at least between and its encoded, transmitted, and decoded output. In all these expressions coordinates are regrouped so that references precede channel inputs or outputs. Every channel mentioned is a map for a finite family satisfying .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.