§VII (60)–(61): symmetric qutrit dilation and zero unassisted capacity
OpenQAlgorithms.Papers.Independent.Support50.P11.qutrit_symmetric_dilation_zero_capacityLet on a qutrit. In the ordered basis , define , with and the usual alternating Levi-Civita symbol. Then
for every operator , identifying the environment and output bases. Moreover the channel is antidegradable, in the operational sense that its environment output can be mapped by a CPTP channel to its channel output, and
This is the paper's concrete symmetric qutrit example with zero unassisted quantum capacity.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P11
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)
open QAlgorithms.Papers.Independent.Information100.P21 (pt)
open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)
open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer)
open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.10, (60)--(61): the concrete qutrit self-complementary isometry,
antidegradability and zero operational unassisted quantum quantumCodeCapacity. -/
theorem qutrit_symmetric_dilation_zero_capacity :
wernerIsometryᴴ * wernerIsometry = 1 ∧
(∀ X : Matrix (Fin 3) (Fin 3) ℂ,
traceRight (wernerIsometry * X * wernerIsometryᴴ) = wernerHolevoChannel 3 1 X ∧
traceLeft (wernerIsometry * X * wernerIsometryᴴ) = wernerHolevoChannel 3 1 X) ∧
HasAntidegradingDilation (wernerHolevoChannel 3 1) ∧ quantumCodeCapacity .UA (wernerHolevoChannel 3 1) = 0 := by sorry
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Define , with indices , by if , , or ; otherwise set it to if , and to otherwise. Define . The assertion is that , that for every complex matrix ,
and that has an antidegrading dilation: there exist a positive integer , a matrix with , and a channel such that for every . In addition, the following supremum in equals zero: range over all real for which the optimal unassisted fidelity for and tends to as . For a positive , that optimal fidelity is the real supremum over channels , of
where projects onto ; the tensor power is the linear map whose action on products of matrix units is the corresponding product of 's outputs. Channels mean finite Kraus maps with . The rate , for which , is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.