§III unnumbered: three-qutrit counterexample to cost monogamy
OpenQAlgorithms.Papers.Independent.Gap48.P35.qutrit_cost_counterexampleAll systems are finite nonzero-dimensional complex quantum systems. Density states are positive semidefinite with trace one, and is von Neumann entropy in bits. Write for formation, for maximal Holevo correlation measured on the second party, for asymptotic singlet preparation cost, for EPR distillation rate, for net common randomness, and for secret-key rate. A left arrow means communication from the second legitimate party to the first. Key secrecy includes all public transcripts. Asymptotic tasks use independent copies, vanishing error and no extra initially shared resource.
On three qutrits set and . The vector has norm one, , and each of the and marginal costs is one ebit.
This is a fixed-state counterexample to entanglement-cost monogamy. The one-ebit marginal fact is credited in the source to Yura [17].
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P35
namespace QAlgorithms.Papers.Independent.Gap48.P35
open scoped Matrix ComplexConjugate ComplexOrder
open Filter Topology
open Information100.P21 (Op)
open Information100.P08 (IsPure formation measuredCorrelation)
open Dependency50.P19 (marginalRA marginalRB)
noncomputable section
/-- PDF p.4, §III: the fixed signed three-qutrit counterexample, including its normalization, maximally mixed A marginal, log2(3) joint cost and one-ebit pair costs (credited there to Yura [17]). -/
theorem qutrit_cost_counterexample
:
let rho := pureDensity threeQutritAlternatingVector
‖threeQutritAlternatingVector‖ = 1 ∧
traceRight rho = (1 / 3 : ℂ) • (1 : Op (Fin 3)) ∧
finiteSystemPreparationCost rho = vnEntropy (traceRight rho) ∧
vnEntropy (traceRight rho) = Real.logb 2 3 ∧
Real.logb 2 3 < (1 : ℝ) + 1 ∧
finiteSystemPreparationCost (marginalRA rho) = 1 ∧ finiteSystemPreparationCost (marginalRB rho) = 1 ∧
finiteSystemPreparationCost rho < finiteSystemPreparationCost (marginalRA rho) + finiteSystemPreparationCost (marginalRB rho) := by sorry
end
end QAlgorithms.Papers.Independent.Gap48.P35
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
On three copies of , define
The declaration asserts all of the following:
where , , and for the spectrally applied function . For any bipartite matrix , the quantity means the infimum over real such that, for every , there exist natural numbers , with , and a finite local-operations-and-classical-communication map from two systems of dimension to systems of dimensions , with and . Here is the projector onto , , and all finite systems and tensor powers are reindexed by the fixed bijections used in the definitions. A finite local map is built recursively from identities by finite local Kraus measurements satisfying , followed by outcome-dependent finite local maps, with the branches summed. The definition permits , requires only one positive block length for each pair of tolerances, and takes its infimum over real rates without separately assuming that they are nonnegative.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.