§6: alternative qq regularized rectangles
OpenQAlgorithms.Papers.Independent.Support50.P02.qq_rectanglesLet 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 of the rectangles
Then
This alternative regularized description does not identify a fixed-block rectangle union with the corresponding pentagon union.
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]
/-- Alternative regularized qq rectangles, PDF p.30. The source expressly says the
older characterization remains correct; no equality of individual finite-k regions. -/
theorem qq_rectangles [Nonempty A] [Nonempty B] [Nonempty C]
(N : Superop (A × B) C) (hN : IsChannel N) :
qqMacCapacity N = closure (regularized (fun n => qqRectangles (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 , the default, generation, quantum–quantum capacity is the closure of the nonnegative rate pairs for which there exist a positive integer , positive integers , and unit vectors on , on , such that, writing
with references grouped first,
Here , marginals are partial traces, denotes the entire block output , and , where is applied by continuous functional calculus. In particular, the first bound uses the marginal retaining Alice’s reference, and the second retains Bob’s reference. The capacity is defined operationally as the closure of nonnegative rates for which every allows, at every sufficiently large positive blocklength , positive dimensions meeting , , unit source vectors on and , and a decoding channel , with squared fidelity at least between the reference–decoded output and . Coordinates are regrouped to pair the references and decoded systems; has entries between and , and squared fidelity is . Every channel, including , is required to admit a finite Kraus representation with .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.