Unnumbered main example: nondegradable channels with equal private and quantum capacities
OpenQAlgorithms.Papers.Independent.Support50.P07.nondegradable_equalCapacities_exampleThere exist extremal qubit channels , each with a two-dimensional environment, such that is degradable but not antidegradable and is antidegradable but not degradable. Their product is extremal among all CPTP maps on two qubits and is neither degradable nor antidegradable and satisfies
Here is the operational unassisted quantum capacity.
All quantum registers are finite and nonzero, states have trace one, pure vectors have norm one, and entropy and logarithms are in bits. Operational private capacities use memoryless powers, positive blocklengths and message counts, uniform messages, arbitrary mixed block inputs, and normalized decoding POVMs. A code is good when its joint decoded message/environment state has full trace norm less than the error from a perfectly correlated uniform pair tensor its actual common environment marginal. Rates use every positive error and rate slack at all sufficiently large blocklengths. Symmetric assistance allows one arbitrary finite symmetric channel per block without charging its dimension.
This result supplies a capacity identity or bound for the channel family and resource model stated above.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P07
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
namespace QAlgorithms.Papers.Independent.Support50.P07
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
dilationPower idealJoint maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Claimed50.P24 (productDilation)
open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation)
variable {A B E C D F : Type}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype E] [DecidableEq E] [Fintype C] [DecidableEq C]
variable [Fintype D] [DecidableEq D] [Fintype F] [DecidableEq F]
/-- PDF p.5, example acknowledged to Debbie Leung [27]: an actual product of
extremal qubit channels supplies the existential nondegradable example. Extremality
is in the full convex set of CPTP receiver maps, including for their product.
No genericity measure is invented. Quantum capacity and mixing cost are identified. -/
theorem nondegradable_equalCapacities_example :
∃ U V : Matrix (Fin 2 × Fin 2) (Fin 2) ℂ,
IsIsometry U ∧ IsIsometry V ∧
receiverChannel U ∈ Set.extremePoints ℝ
{N : Superop (Fin 2) (Fin 2) | IsChannel N} ∧
receiverChannel V ∈ Set.extremePoints ℝ
{N : Superop (Fin 2) (Fin 2) | IsChannel N} ∧
receiverChannel (productDilation U V) ∈ Set.extremePoints ℝ
{N : Superop (Fin 2 × Fin 2) (Fin 2 × Fin 2) | IsChannel N} ∧
IsDegradable U ∧ ¬ IsAntidegradable U ∧
IsAntidegradable V ∧ ¬ IsDegradable V ∧
¬ IsDegradable (productDilation U V) ∧ ¬ IsAntidegradable (productDilation U V) ∧
degradableMixingCost (productDilation U V) = maximumCoherentInformation U ∧
QAlgorithms.Papers.Independent.Information100.P80.quantumCapacity
(receiverChannel (productDilation U V)) = maximumCoherentInformation U ∧
fullTracePrivateCapacity (productDilation U V) = QAlgorithms.Papers.Independent.Information100.P80.quantumCapacity
(receiverChannel (productDilation U V)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
There exist matrices with , having all the properties below. For a dilation , write and . A channel is a map for a finite family satisfying . Say that is degradable when and there is a channel with on every matrix; say that it is antidegradable when and there is a channel with on every matrix. Define their product dilation by
The channels and are extreme points of the real convex set of all channels from matrices to matrices, and is an extreme point of the corresponding real convex set of channels on matrices. Moreover, is degradable and is not antidegradable; is antidegradable and is not degradable; and is neither degradable nor antidegradable. For a density matrix, meaning a positive semidefinite matrix of trace , let , with zero eigenvalues contributing zero, and define
Define as the real infimum of over all integers , weights with , positive integers , isometries each of which is degradable or antidegradable, and channels , such that
for every matrix ; zero weights are allowed. Define as the real supremum of rates such that, for every and , there exists for which every admits , input density matrices on , and a measurement , , on the receiver output, whose joint matrix has blocks
and zero entries between different or , and satisfies
Here . Define as the real supremum of nonnegative rates admitting a sequence of positive integers and encoding and decoding channels , , whose entanglement fidelities
tend to , and for which, for every , eventually; is the projector onto . This sequence includes , with empty tensor products and total division by zero. The asserted numerical equalities are
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.