Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Metadata
slug: meunson-deesuwan-2026-cumulant-renyi-qdpi
bibkey: meunson2026cumulant
doi: 10.48550/arXiv.2606.31205
url: https://arxiv.org/abs/2606.31205v1
triage: theorem
motivation_gids:
  - D5/S3/QuantumChannels/CumulantRenyiDataProcessingRefutation.result

Data processing fails for the cumulant-based Rényi functional at every order above one

Problem

A. Meunson and T. Deesuwan, Cumulant-based quantum relative Rényi functional, arXiv:2606.31205v1, define for (Definition 3, Section IV)

on pairs with . The abstract and the conclusion state that the quantum data-processing inequality (QDPI) for arbitrary CPTP maps remains open. The verbatim sentences and Definition 3 are in the literature note. This question differs from Conjecture 15 of the same paper (, commutativity-preserving channels), settled in the earlier dossier.

Issue #13439 fixes the reading. QDPI α asserts for every dimension , every pair of positive definite density matrices and every CPTP map with positive definite outputs. Matrix logarithms are continuous functional calculus, as in the frozen module. claim asserts that some satisfies QDPI α. Faithful inputs meet the support condition, so refuting this restricted claim refutes QDPI for the paper’s functional at every .

Motivation

Data processing is the property that makes a Rényi-type quantity a divergence: Petz Rényi divergences satisfy it for and sandwiched ones for , as the paper recalls in Section III. The paper offers the functional as a candidate quantum Rényi divergence; its Section VIII.C (PDF p. 21) reports a preliminary study that found no violation for in random qubit pairs per run. D5/S3/QuantumChannels/CumulantRenyiDataProcessingRefutation.result shows that the inequality fails at every .

Gap

Issue #13439 records the literature check before any Lean. The paper has a single version; the abstract and conclusion state the question as open. The earlier study (J. Phys.: Conf. Ser. 3168 (2025) 012014) is numerical only. The repository contains only the refutation for this paper. The search seat’s bounded checks of INSPIRE, Google Scholar, MathDB and formal-conjectures found no settlement; the Semantic Scholar citation API was rate limited. not-found-in-searched-scope.

Route

Fix , put , , and .

  1. Witness. and are self-adjoint involutions, and so is . The states and are positive definite with trace one and spectrum . Here is the frozen qubitZ. The channel is complete dephasing, the frozen standard-basis pinching pinchingEnd, which equals the Kraus map with Kraus operators and .
  2. Input. Two-point functional calculus gives and with . Hence and , so
  3. Output. The outputs are and with and , both positive definite. So
  4. Strict monotonicity of and give , contradicting QDPI α.

Falsifier

The proof would fail if were not an involution, if the dephasing map were not CPTP, or if the scalar comparison did not place below .

Evidence

The canonical source is D5/S3/QuantumChannels/CumulantRenyiDataProcessingRefutation.lean. Its public declarations are cuRenyi, QDPI, claim and result; the witness and twenty-one supporting identities are private. Its direct frozen dependencies are IsDensity, IsCPTP and pauli of D5/S3/QuantumChannels/CoPRelativeQuantumnessRefutation, qubitZ and qubit_weyl_star of D5/S3/Quantum/FiniteDimensional, pinching_apply of D5/S3/QuantumChannels/Pinching, pinchingEnd of D5/S3/QuantumChannels/ProjectionDiagnostics/StaticDynamicScalarSeparation, cfc_log_diagonal of D5/S3/Quantum/Dynamics/EntropyProductionCoherenceDeletionIdentity, and MatrixMap, MatrixMap.of_kraus and MatrixMap.of_kraus_isCompletelyPositive of D5/S3/Quantum/Foundation/FiniteKrausChannel. The proof uses only the standard axioms propext, Classical.choice and Quot.sound; no sorry, native_decide, or new axiom. make lean builds the module in 12 s; lake env lean on it peaks at 5,852,708,864 bytes resident.

Numerical check (mpmath, 60 digits): at the increase is 8.58, 1.57, 0.342 and 0.213 at , 1.25, 2 and 3. Positive control: the commuting pair , at under the same channel gives equal values (0.328504066972 before and after).

Triage

Tier 1 question stated in the abstract and conclusion of a 2026 paper, preregistered in issue #13439 before any Lean. theorem; resolution refuted.

declarationproof_shapeescape_witnessadmission_basis
resultbind-onlynoneopen-problem-resolution

The twenty-one private theorems are bind-only and each is used on the proof path of result (CLAUDE.md §3.2 「有消费的辅助声明」). Utility is certified-instance with a typed refutes edge to claim; there is no digestion atom.

What the settlement shows

Proved by result: QDPI fails at every .

Established inside the proof of result. The proof applies QDPI α at dimension two to positive definite density matrices and the standard-basis pinching channel, with positive definite outputs (the application of the hypothesis at the end of result); so restricting to qubits or to faithful states and outputs does not restore the inequality. The private lemmas of the module prove with a self-adjoint involution (log_state, involutions, trace_input), and the scalar bounds (scalar_gap_general).

Argued, not formalized.

  • Mechanism. The input states have the same spectrum and Bloch directions apart, so the large parts of and cancel: the involution has operator norm 1, so the logarithm difference has norm . Dephasing keeps weight above of on the basis vector where has weight , so the classical output value grows like . The functional measures the logarithm difference, which noncommutativity shrinks, while the channel output sees the eigenvalue ratio itself.
  • Complete dephasing fixes the identity matrix, so requiring unital channels does not restore the inequality.
  • Complete dephasing sends every pair to diagonal matrices, which commute, so it is commutativity preserving. The analogue of the paper’s CoP-QDPI for therefore fails on the same witness.
  • For a commuting input pair whose outputs commute, both sides reduce to classical Rényi divergences of distributions related by one stochastic matrix. The classical inequality for is the frozen D5/S3/RenyiDivergence/DataProcessingAboveOne.renyi_divergence_channel_le_of_one_lt_of_ac, so a violation with commuting outputs needs noncommuting inputs, as here. The reduction step is not formalized.

Computed (mpmath, 60 digits, grid ). Within this family the first violating eigenvalue ratio is about at , at , at , at , at and at . At and there is no violation (). This is consistent with the random sampling of Section VIII.C, whose typical qubit states have moderate eigenvalue ratios. The same formula extended to also increases under the channel in this family: the first violating ratio is about at , at and at .

Open. Whether violations exist near with bounded eigenvalue ratio, a characterization of channels or state pairs on which the functional contracts, and a proof for are not established here.

Effect on the paper. The open question of the abstract and conclusion is answered negatively for every , so the functional is not a quantum Rényi divergence in the sense of data processing at any . The proved positivity, classical reduction, additivity, unitary invariance, continuity and monotonicity in do not depend on QDPI and are not affected. The conjecture was refuted separately.

ASSUMED-UNVERIFIED

The bounded literature check does not establish exhaustive worldwide novelty, priority, or the absence of an independent proof. The search seat’s database readings are seat-reported.