Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Amortization collapse for reference stabilized geometric Rényi superchannel divergences

Vinícius Mohr

Published Oct 9, 2026• 0 citations
Publisher

Abstract

Preprint, version 1 For every real order 1 < α ≤ 2, we prove that the reference-stabilized geometric Rényi divergence of two finite-dimensional deterministic physical superchannels equals its nested amortized extension. Joint inserted channels A R → B R and the external state references in the inner channel divergences range over all positive finite dimensions. The proof combines a supported matrix perspective transformer inequality with a comb contraction, a completion of positive testers, and a physical realization of positive definite testers. It includes singular supported operators and gives value +∞ for unsupported comb pairs. In the supported case, the ordinary supremum already has the same value at reference dimension |C||A||B|. A conventional proof is presented alongside a correspondence with a Lean 4 theorem and a reproducible source artifact. The result concerns the nested quantity of Hirche's Eq. (39); it does not establish collapse of the larger fully amortized quantity in Eq. (40). AI contribution and provenance. This work was developed through an AI-assisted research process initiated and directed by Vinícius Mohr. GPT-6.1-Sol and Claude Opus 5.5 agents carried out the mathematical exploration, Lean formalization, proof development, critical review, and literature searches. GPT-6.1-Sol wrote the manuscript, including the conventional proof exposition reconstructed from the formal sources. Vinícius Mohr initiated the research by directing the agents to investigate open problems from the Quantum Information and Quantum Computation Open Problem Zoo using a lean-orchestrator framework, and subsequently requested verification and manuscript preparation. A detailed account of the respective human and AI roles, proof provenance, and verification procedure is provided in the manuscript and accompanying repository.

DOI
10.5281/zenodo.23215120

Related papers

Geometric Rényi divergence and RLD Fisher information under quantum processes without definite causal order

Zixin Huang, Mark M. Wilde

Quantum experiments without a definite causal order offer new ways to distinguish devices, estimate physical parameters, and communicate. We prove a common limit on these tasks: the geometric Rényi divergence at the output of a deterministic completely positive process cannot exceed the sum of the divergences of its individual channel uses. The inequality holds for every Rényi order in $(0,1)\cup(1,2]$ and any number of independently replaceable channels. Parallel experiments with separate reference-assisted inputs approach the bound, giving an exact equality after optimization over processes. We also prove an additive bound on the right logarithmic derivative Fisher information of parameter-dependent channels under every fixed process in this class. A resulting Cramér--Rao bound limits locally unbiased estimation precision without assuming a definite causal order, and an erasure-probability example attains the bound. The proofs for the geometric Rényi divergence and RLD Fisher information follow from the requirement that every independent choice of channels produce a normalized output. We show how this requirement controls positive local operations, and how small channel perturbations convert the divergence inequality into a Fisher-information bound, including for singular channels. Further applications give finite-use bounds on channel discrimination and exclusion, together with communication and private-state-generation converses when the processes preserve the relevant comparison conditions.

quant-pharXiv:2610.39217•Oct 30, 2026•1 citation

Causal postselection and the Stein exponent for quantum superchannels

Yuxuan Zhang

For finite-dimensional quantum superchannels, the manuscript proposes equality of the asymptotic asymmetric discrimination exponents achievable by fully general causal strategies, nested adaptive strategies and parallel strategies. The exponent is the regularized superchannel relative entropy. The argument treats arbitrary finite-dimensional tester memory and gives an exponential strong converse. The nested-versus-parallel question is included in the broader theorem and is not a separate result. This deposit preserves the website manuscript, version 1.0, dated 13 November 2026, by Yuxuan Zhang. The proof uses the subchannel asymptotic equipartition theorem and causal postselection. It has undergone internal analytical review and reproducible checks. Independent expert review and comprehensive novelty verification remain outstanding. Website and reproduction package: https://yuxuanzhang1995.github.io/agentic-research/superchannel-stein-causal-postselection/QIQC originals: https://qiqc-op.com/problem/op_02bb8f8228649ac3/ and https://qiqc-op.com/problem/op_a4600b38b94042a8/

•Nov 13, 2026•0 citations

Lean-Quantum: Toward AI-Assisted Formalization of Quantum Information

Kazumi Kasaura, Kei Tsukamoto, Kento Mori +6 more

Quantum information theory is built on entropic quantities; among them, the sandwiched Rényi relative entropy is a fundamental divergence with various applications, and its data processing inequality (DPI) under quantum channels is a cornerstone result. In this work, we present a Lean 4 library for quantum information, designed as a reusable formal infrastructure for theoretical analysis. As a central demonstration of the library, we formalize the DPI for the sandwiched Rényi relative entropy for positive semidefinite operators on finite-dimensional quantum systems. The library provides a basis-independent operator-theoretic framework for finite-dimensional quantum mechanics compatible with the standard mathematical library Mathlib, including reusable interfaces for finite-dimensional systems, states, channels, tensor products, partial traces, Choi operators, Kraus representations, and Stinespring representations. It also builds infrastructure for noncommutative trace inequalities, including operator monotonicity and convexity via the real continuous functional calculus, block-operator positivity, Hilbert-Schmidt operator spaces, Jensen's operator inequality, generalized perspectives, operator power means, and Lieb-Ando trace inequalities. On top of this framework, we formalize entropy-specific ingredients for the DPI: variational formulas for the sandwiched quasi-entropy via Young and reverse-Young inequalities, tensor-product compatibility of real powers, and Haar measures on unitary groups. Together, these components yield a Lean formalization of the DPI, give strong subadditivity as a corollary, and provide the last missing component needed to complete the Lean formalization of the generalized quantum Stein's lemma. More broadly, the development provides machine-checkable foundations for future formalized and AI-assisted research in quantum information theory.

quant-pharXiv:2607.05492•Jul 8, 2026•6 citations

Exact Complete Relative-Entropy Contraction of Finite Classical-to-Quantum Channels

Ying Xie

We determine the complete equal-reference Umegaki relative-entropy contraction coefficient of every finite preparation channel after input dephasing. For prepared states ρ₁, …, ρₙ, let H be the intersection of their supports and let Aᵢ be the compression of ρᵢ⁺ to H. If H is nonzero, the coefficient is 1 − min over p in Δₙ of Tr_H[(Σᵢ pᵢAᵢ)⁻¹]; it equals one when H is zero. A noncommutative metric inequality gives the upper bound, and a weighted operator-simplex construction gives matching faithful classical–quantum input pairs with equal classical and reference marginals. Reference dimension n suffices for the supremum. The complementary coefficient is the reciprocal of an exponential left order-two Petz–Rényi radius and is multiplicative under Cartesian products. Faithful binary-input qubit-output channels can consequently have complete coefficient tending to one while their ordinary coefficient tends to zero, with reference dimension two sufficient throughout. An exact rational example has complete coefficient 9/41. The matching input family converges pointwise, has input relative entropy tending to zero, and can converge logarithmically slowly; it provides no fixed-error or capacity conclusion. A visual guide records the mathematical routes, proof dependencies, and provenance of the result.

•Nov 7, 2026•0 citations

Geometric Rényi Divergence and its Applications in Quantum Channel Capacities

Kun Fang, Hamza Fawzi

Abstract Having a distance measure between quantum states satisfying the right properties is of fundamental importance in all areas of quantum information. In this work, we present a systematic study of the geometric Rényi divergence (GRD), also known as the maximal Rényi divergence, from the point of view of quantum information theory. We show that this divergence, together with its extension to channels, has many appealing structural properties, which are not satisfied by other quantum Rényi divergences. For example we prove a chain rule inequality that immediately implies the “amortization collapse” for the geometric Rényi divergence, addressing an open question by Berta et al. [Letters in Mathematical Physics 110:2277–2336, 2020, Equation (55)] in the area of quantum channel discrimination. As applications, we explore various channel capacity problems and construct new channel information measures based on the geometric Rényi divergence, sharpening the previously best-known bounds based on the max-relative entropy while still keeping the new bounds single-letter and efficiently computable. A plethora of examples are investigated and the improvements are evident for almost all cases.

arXiv:1909.05758•Communications in Mathematical Physics•May 24, 2021•89 citations

Continuity of Regularized Channel Rényi Divergences

Jinzhao Wang, Yuxiang Yang

We prove that the regularized, stabilized sandwiched Rényi divergence of finite-dimensional quantum channels converges to their regularized relative entropy as the Rényi order tends to one. The key tool is the channel hockey-stick divergence: Gour's Stinespring approximation bound and a Schatten norm estimate amplify an asymptotic bound below one into exponential decay at higher threshold rates. For channel pairs with finite max-relative entropy, known operational connections then give exponential strong converses for parallel and adaptive discrimination, a sharp zero--one testing law, and the subchannel asymptotic equipartition property.

quant-pharXiv:2609.28635•Sep 25, 2026•1 citation
Preprint, version 1 For every real order 1 < α ≤ 2, we prove that the reference-stabilized geometric Rényi divergence of two finite-dimensional deterministic physical superchannels equals its nested amortized extension. Joint inserted channels A R → B R and the external state references in the inner channel divergences range over all positive finite dimensions. The proof combines a supported matrix perspective transformer inequality with a comb contraction, a completion of positive testers, and a physical realization of positive definite testers. It includes singular supported operators and gives value +∞ for unsupported comb pairs. In the supported case, the ordinary supremum already has the same value at reference dimension |C||A||B|. A conventional proof is presented alongside a correspondence with a Lean 4 theorem and a reproducible source artifact. The result concerns the nested quantity of Hirche's Eq. (39); it does not establish collapse of the larger fully amortized quantity in Eq. (40). AI contribution and provenance. This work was developed through an AI-assisted research process initiated and directed by Vinícius Mohr. GPT-6.1-Sol and Claude Opus 5.5 agents carried out the mathematical exploration, Lean formalization, proof development, critical review, and literature searches. GPT-6.1-Sol wrote the manuscript, including the conventional proof exposition reconstructed from the formal sources. Vinícius Mohr initiated the research by directing the agents to investigate open problems from the Quantum Information and Quantum Computation Open Problem Zoo using a lean-orchestrator framework, and subsequently requested verification and manuscript preparation. A detailed account of the respective human and AI roles, proof provenance, and verification procedure is provided in the manuscript and accompanying repository.
Quantum experiments without a definite causal order offer new ways to distinguish devices, estimate physical parameters, and communicate. We prove a common limit on these tasks: the geometric Rényi divergence at the output of a deterministic completely positive process cannot exceed the sum of the divergences of its individual channel uses. The inequality holds for every Rényi order in (0,1)∪(1,2](0,1)\cup(1,2](0,1)∪(1,2] and any number of independently replaceable channels. Parallel experiments with separate reference-assisted inputs approach the bound, giving an exact equality after optimization over processes. We also prove an additive bound on the right logarithmic derivative Fisher information of parameter-dependent channels under every fixed process in this class. A resulting Cramér--Rao bound limits locally unbiased estimation precision without assuming a definite causal order, and an erasure-probability example attains the bound. The proofs for the geometric Rényi divergence and RLD Fisher information follow from the requirement that every independent choice of channels produce a normalized output. We show how this requirement controls positive local operations, and how small channel perturbations convert the divergence inequality into a Fisher-information bound, including for singular channels. Further applications give finite-use bounds on channel discrimination and exclusion, together with communication and private-state-generation converses when the processes preserve the relevant comparison conditions.
For finite-dimensional quantum superchannels, the manuscript proposes equality of the asymptotic asymmetric discrimination exponents achievable by fully general causal strategies, nested adaptive strategies and parallel strategies. The exponent is the regularized superchannel relative entropy. The argument treats arbitrary finite-dimensional tester memory and gives an exponential strong converse. The nested-versus-parallel question is included in the broader theorem and is not a separate result. This deposit preserves the website manuscript, version 1.0, dated 13 November 2026, by Yuxuan Zhang. The proof uses the subchannel asymptotic equipartition theorem and causal postselection. It has undergone internal analytical review and reproducible checks. Independent expert review and comprehensive novelty verification remain outstanding. Website and reproduction package: https://yuxuanzhang1995.github.io/agentic-research/superchannel-stein-causal-postselection/QIQC originals: https://qiqc-op.com/problem/op_02bb8f8228649ac3/ and https://qiqc-op.com/problem/op_a4600b38b94042a8/
Quantum information theory is built on entropic quantities; among them, the sandwiched Rényi relative entropy is a fundamental divergence with various applications, and its data processing inequality (DPI) under quantum channels is a cornerstone result. In this work, we present a Lean 4 library for quantum information, designed as a reusable formal infrastructure for theoretical analysis. As a central demonstration of the library, we formalize the DPI for the sandwiched Rényi relative entropy for positive semidefinite operators on finite-dimensional quantum systems. The library provides a basis-independent operator-theoretic framework for finite-dimensional quantum mechanics compatible with the standard mathematical library Mathlib, including reusable interfaces for finite-dimensional systems, states, channels, tensor products, partial traces, Choi operators, Kraus representations, and Stinespring representations. It also builds infrastructure for noncommutative trace inequalities, including operator monotonicity and convexity via the real continuous functional calculus, block-operator positivity, Hilbert-Schmidt operator spaces, Jensen's operator inequality, generalized perspectives, operator power means, and Lieb-Ando trace inequalities. On top of this framework, we formalize entropy-specific ingredients for the DPI: variational formulas for the sandwiched quasi-entropy via Young and reverse-Young inequalities, tensor-product compatibility of real powers, and Haar measures on unitary groups. Together, these components yield a Lean formalization of the DPI, give strong subadditivity as a corollary, and provide the last missing component needed to complete the Lean formalization of the generalized quantum Stein's lemma. More broadly, the development provides machine-checkable foundations for future formalized and AI-assisted research in quantum information theory.
We determine the complete equal-reference Umegaki relative-entropy contraction coefficient of every finite preparation channel after input dephasing. For prepared states ρ₁, …, ρₙ, let H be the intersection of their supports and let Aᵢ be the compression of ρᵢ⁺ to H. If H is nonzero, the coefficient is 1 − min over p in Δₙ of Tr_H[(Σᵢ pᵢAᵢ)⁻¹]; it equals one when H is zero. A noncommutative metric inequality gives the upper bound, and a weighted operator-simplex construction gives matching faithful classical–quantum input pairs with equal classical and reference marginals. Reference dimension n suffices for the supremum. The complementary coefficient is the reciprocal of an exponential left order-two Petz–Rényi radius and is multiplicative under Cartesian products. Faithful binary-input qubit-output channels can consequently have complete coefficient tending to one while their ordinary coefficient tends to zero, with reference dimension two sufficient throughout. An exact rational example has complete coefficient 9/41. The matching input family converges pointwise, has input relative entropy tending to zero, and can converge logarithmically slowly; it provides no fixed-error or capacity conclusion. A visual guide records the mathematical routes, proof dependencies, and provenance of the result.
Abstract Having a distance measure between quantum states satisfying the right properties is of fundamental importance in all areas of quantum information. In this work, we present a systematic study of the geometric Rényi divergence (GRD), also known as the maximal Rényi divergence, from the point of view of quantum information theory. We show that this divergence, together with its extension to channels, has many appealing structural properties, which are not satisfied by other quantum Rényi divergences. For example we prove a chain rule inequality that immediately implies the “amortization collapse” for the geometric Rényi divergence, addressing an open question by Berta et al. [Letters in Mathematical Physics 110:2277–2336, 2020, Equation (55)] in the area of quantum channel discrimination. As applications, we explore various channel capacity problems and construct new channel information measures based on the geometric Rényi divergence, sharpening the previously best-known bounds based on the max-relative entropy while still keeping the new bounds single-letter and efficiently computable. A plethora of examples are investigated and the improvements are evident for almost all cases.
We prove that the regularized, stabilized sandwiched Rényi divergence of finite-dimensional quantum channels converges to their regularized relative entropy as the Rényi order tends to one. The key tool is the channel hockey-stick divergence: Gour's Stinespring approximation bound and a Schatten norm estimate amplify an asymptotic bound below one into exponential decay at higher threshold rates. For channel pairs with finite max-relative entropy, known operational connections then give exponential strong converses for parallel and adaptive discrimination, a sharp zero--one testing law, and the subchannel asymptotic equipartition property.