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

arXiv:2610.06842

Quantum information processing under maximal distance measures

Bartosz Regula, Ludovico Lami, Mario Berta, Marco Tomamichel

quant-phmath-phSubmitted Oct 5, 2026• Announced Oct 6, 2026• 0 citations
arXivHTMLPDF

Abstract

The measures of distance frequently used in quantum information, such as trace distance or fidelity-based purified distance, are the smallest extensions of the corresponding distance measures in classical information theory. However, this way of extending classical distances is not unique, and a whole spectrum of other extensions can be defined. Here we study the question of how quantum information processing tasks are affected by a change of the error metrics to the maximal extensions of the classical distance measures, imposing more demanding error requirements on operational tasks. We find that the performance of some tasks, such as channel coding or quantum resource distillation, is not affected whatsoever by this change. However, for other tasks such as channel simulation and quantum resource dilution, we show that the rates are now given not by functions of the standard (Umegaki) quantum relative entropy, but ones based on the Belavkin-Staszewski relative entropy. Our results connect the Belavkin-Staszewski relative entropy with operational tasks and reveal that known reversibility results in quantum information, including the reverse Shannon theorem and the asymptotic reversibility of quantum resource transformations, no longer hold under maximal distance measures.

AI Summary

The paper asks whether asymptotic quantum-information processing rates depend on how classical error distances are extended to quantum states. It replaces trace and purified distance—the minimal extensions—with their maximal data-processing-compatible extensions, imposing stricter error criteria. Distillation and channel coding retain their standard performance whenever suitable free twirling operations exist; the equivalence holds even one-shot. Consequently, entanglement-assisted and no-signalling-assisted quantum capacities remain $I(\mathcal N)/2$. Dilution can change: under Gibbs-preserving operations, work cost becomes the Belavkin–Staszewski relative entropy $\widehat D(\rho\|\gamma)$, while extraction remains governed by Umegaki relative entropy. Pure-state entanglement cost under non-entangling or asymptotically non-entangling operations becomes $S_{1/2}(\psi_A)=2\log\operatorname{Tr}\sqrt{\psi_A}$, versus distillation yield $S(\psi_A)$. These gaps rule out the corresponding reversibility statements under maximal errors. The technical basis is a maximal extension of smooth max-relative entropy, semidefinite variational formulas, and a fixed-error asymptotic equipartition property converging to $\widehat D$. Bounds follow by optimizing classical inequalities over reverse preparation tests; twirling establishes the unchanged distillation results. No-signalling-assisted channel simulation is characterized by a regularized smooth maximal information. It equals $\widehat I(\mathcal N)/2$ for pure-output classical–quantum channels and qubit amplitude damping; the latter costs $\log(1+\sqrt{1-\gamma})$ qubits per use. Explicit mixed-output counterexamples show that $\widehat I$ is nonadditive, precluding this single-letter formula generally. General simulation rates remain regularized, and exact dilution results use the specified operation classes. Higher-order asymptotics are left open. The maximal trace distance also need not satisfy the triangle inequality and assigns distance one to distinct pure states.

No sign of AI-generated textAI use disclosed
The examples of channels in Section~\ref{sec:additivity_examples} and Appendix~\ref{sec:nonadditivity_examples} were obtained by consulting the omniscient oracle in the form of ChatGPT 6 Astra.

Error found: The exact one-shot no-signalling simulation formulas omit rounding to an integer communication dimension, yielding approximately 0.339 qubits for an example whose cost under the stated definition is 1 qubit.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
28+4 pages

Related papers

Distillation and simulation in quantum information

Kun Fang

We use the techniques of convex optimization, especially semidefinite programming, to study two kinds of fundamental tasks, i.e., distillation and simulation in quantum information theory. We investigate these tasks in a unified framework of resource theory and focus on their computation and characterization with finite resources. Particularly we study the tradeoff among relevant parameters such as the number of resource copies, resource transformation rate, error tolerance and success probability. In the first part, we study the task of distillation for two different resources, maximally entangled state and maximally coherent state, representing nonlocal and local “quantumness” respectively. For entanglement distillation, we derive an efficiently computable second-order estimation of the distillation rate for general quantum states, which are tight for quantum states of practical interest. Our study overcomes the limitation of conventional research either focusing on the asymptotic rate or ignoring the computability. For the coherence distillation, we perform finite analysis for both deterministic and probabilistic scenarios. Our results unveil several new features of coherence from a resource theoretic viewpoint and contribute to an increased understanding of the fundamental properties of different sets of free operations. In the second part, we investigate the resource cost of simulating a quantum channel via quantum coherence or another quantum channel. We introduce the channel’s analogs of max-relative entropy, logarithmic robustness and max-information of quantum states, providing their operational interpretation with the channel simulation cost via different resources. Particularly, we establish the asymptotic equipartition property of the channel’s max-information, that is, it converges to the quantum mutual information of the channel in the independent and identically distributed asymptotic limit. As applications, this asymptotic equipartition property implies the quantum reverse Shannon theorem in the presence of non-signalling correlations. From the perspective of resource theory, the worth of a resource can usually be characterized by the minimum distance to a set of useless resources under a proper distance measure. We give such characterization for all the tasks studied in this thesis, and find that the distance measure for the distillation and simulation process naturally corresponds to the quantum hypothesis testing relative entropy and the max-relative entropy, respectively.

•Jan 1, 2018•1 citation

Operational distance and fidelity for quantum channels

V. P. Belavkin, Giacomo Mauro D’Ariano, Maxim Raginsky

We define and study a fidelity criterion for quantum channels, which we term the minimax fidelity, through a noncommutative generalization of maximal Hellinger distance between two positive kernels in classical probability theory. Like other known fidelities for quantum channels, the minimax fidelity is well defined for channels between finite-dimensional algebras, but it also applies to a certain class of channels between infinite-dimensional algebras (explicitly, those channels that possess an operator-valued Radon-Nikodym density with respect to the trace in the sense of Belavkin-Staszewski) and induces a metric on the set of quantum channels that is topologically equivalent to the CB-norm distance between channels, precisely in the same way as the Bures metric on the density operators associated with statistical states of quantum-mechanical systems, derived from the well-known fidelity (“generalized transition probability”) of Uhlmann, is topologically equivalent to the trace-norm distance.

arXiv:quant-ph/0408159•Journal of Mathematical Physics•May 20, 2005•52 citations

Tight any-shot quantum decoupling

Mario Berta, Hao-Chung Cheng, Yongsheng Yao

Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime. Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.

quant-pharXiv:2602.17430•Feb 20, 2026•13 citations

Optimal extensions of resource measures and their applications

Gilad Gour, Marco Tomamichel

We develop a framework to extend resource measures from one domain to a larger one. We find that all extensions of resource measures are bounded between two quantities that we call the minimal and maximal extensions. We discuss various applications of our framework. We show that any relative entropy (i.e., an additive function on pairs of quantum states that satisfies the data processing inequality) must be bounded by the min and max relative entropies. We prove that the generalized trace distance, the generalized fidelity, and the purified distance are optimal extensions. And in entanglement theory we introduce a technique to extend pure-state entanglement measures to mixed bipartite states.

arXiv:2006.12408•Physical Review A•Dec 1, 2020•28 citations

INFORMATION DIVERGENCE FOR QUANTUM CHANNELS

S.J. HAMMERSLEY, V. P. Belavkin

Many definitions of relative information (often called relative entropy) have been proposed in order to characterise the ‘distance’ as information divergence between states. One such class of relative informations are the quasi-entropies proposed by Petz in 66 (of which the standard Araki-Umegaki form, 53 , is a particular example). This paper axiomatises the idea of relative information and then proceeds to build a large class of examples that satisfy these axioms. By using the Radon-Nikodym derivative for completely positive maps as an ‘operational density’ for channels, along with a theorem by Belavkin and Ohya, 57 , for taking the supremum over local couplings these ideas are then lifted beyond the realm of states into that of quantum channels. This method for extending information quantities to channels was pioneered by V.P. Belavkin, with respect to fidelity, 61 (see 60 for an in-depth presentation of the subject).

•Mar 1, 2006•4 citations

A strengthened data processing inequality for the Belavkin–Staszewski relative entropy

Andreas Blühm, Ángela Capel

In this work, we provide a strengthening of the data processing inequality for the relative entropy introduced by Belavkin and Staszewski (BS-entropy). This extends previous results by Carlen and Vershynina for the relative entropy and other standard [Formula: see text]-divergences. To this end, we provide two new equivalent conditions for the equality case of the data processing inequality for the BS-entropy. Subsequently, we extend our result to a larger class of maximal [Formula: see text]-divergences. Here, we first focus on quantum channels which are conditional expectations onto subalgebras and use the Stinespring dilation to lift our results to arbitrary quantum channels.

arXiv:1904.10768•Reviews in Mathematical Physics•Aug 22, 2019•14 citations
The measures of distance frequently used in quantum information, such as trace distance or fidelity-based purified distance, are the smallest extensions of the corresponding distance measures in classical information theory. However, this way of extending classical distances is not unique, and a whole spectrum of other extensions can be defined. Here we study the question of how quantum information processing tasks are affected by a change of the error metrics to the maximal extensions of the classical distance measures, imposing more demanding error requirements on operational tasks. We find that the performance of some tasks, such as channel coding or quantum resource distillation, is not affected whatsoever by this change. However, for other tasks such as channel simulation and quantum resource dilution, we show that the rates are now given not by functions of the standard (Umegaki) quantum relative entropy, but ones based on the Belavkin-Staszewski relative entropy. Our results connect the Belavkin-Staszewski relative entropy with operational tasks and reveal that known reversibility results in quantum information, including the reverse Shannon theorem and the asymptotic reversibility of quantum resource transformations, no longer hold under maximal distance measures.
The paper asks whether asymptotic quantum-information processing rates depend on how classical error distances are extended to quantum states. It replaces trace and purified distance—the minimal extensions—with their maximal data-processing-compatible extensions, imposing stricter error criteria.
Distillation and channel coding retain their standard performance whenever suitable free twirling operations exist; the equivalence holds even one-shot. Consequently, entanglement-assisted and no-signalling-assisted quantum capacities remain I(N)/2I(\mathcal N)/2I(N)/2. Dilution can change: under Gibbs-preserving operations, work cost becomes the Belavkin–Staszewski relative entropy D^(ρ∥γ)\widehat D(\rho\|\gamma)D(ρ∥γ), while extraction remains governed by Umegaki relative entropy. Pure-state entanglement cost under non-entangling or asymptotically non-entangling operations becomes S1/2(ψA)=2log⁡Tr⁡ψAS_{1/2}(\psi_A)=2\log\operatorname{Tr}\sqrt{\psi_A}S1/2​(ψA​)=2logTrψA​​, versus distillation yield S(ψA)S(\psi_A)S(ψA​). These gaps rule out the corresponding reversibility statements under maximal errors.
The technical basis is a maximal extension of smooth max-relative entropy, semidefinite variational formulas, and a fixed-error asymptotic equipartition property converging to D^\widehat DD. Bounds follow by optimizing classical inequalities over reverse preparation tests; twirling establishes the unchanged distillation results.
No-signalling-assisted channel simulation is characterized by a regularized smooth maximal information. It equals I^(N)/2\widehat I(\mathcal N)/2I(N)/2 for pure-output classical–quantum channels and qubit amplitude damping; the latter costs log⁡(1+1−γ)\log(1+\sqrt{1-\gamma})log(1+1−γ​) qubits per use. Explicit mixed-output counterexamples show that I^\widehat II is nonadditive, precluding this single-letter formula generally. General simulation rates remain regularized, and exact dilution results use the specified operation classes. Higher-order asymptotics are left open. The maximal trace distance also need not satisfy the triangle inequality and assigns distance one to distinct pure states.
We use the techniques of convex optimization, especially semidefinite programming, to study two kinds of fundamental tasks, i.e., distillation and simulation in quantum information theory. We investigate these tasks in a unified framework of resource theory and focus on their computation and characterization with finite resources. Particularly we study the tradeoff among relevant parameters such as the number of resource copies, resource transformation rate, error tolerance and success probability. In the first part, we study the task of distillation for two different resources, maximally entangled state and maximally coherent state, representing nonlocal and local “quantumness” respectively. For entanglement distillation, we derive an efficiently computable second-order estimation of the distillation rate for general quantum states, which are tight for quantum states of practical interest. Our study overcomes the limitation of conventional research either focusing on the asymptotic rate or ignoring the computability. For the coherence distillation, we perform finite analysis for both deterministic and probabilistic scenarios. Our results unveil several new features of coherence from a resource theoretic viewpoint and contribute to an increased understanding of the fundamental properties of different sets of free operations. In the second part, we investigate the resource cost of simulating a quantum channel via quantum coherence or another quantum channel. We introduce the channel’s analogs of max-relative entropy, logarithmic robustness and max-information of quantum states, providing their operational interpretation with the channel simulation cost via different resources. Particularly, we establish the asymptotic equipartition property of the channel’s max-information, that is, it converges to the quantum mutual information of the channel in the independent and identically distributed asymptotic limit. As applications, this asymptotic equipartition property implies the quantum reverse Shannon theorem in the presence of non-signalling correlations. From the perspective of resource theory, the worth of a resource can usually be characterized by the minimum distance to a set of useless resources under a proper distance measure. We give such characterization for all the tasks studied in this thesis, and find that the distance measure for the distillation and simulation process naturally corresponds to the quantum hypothesis testing relative entropy and the max-relative entropy, respectively.
We define and study a fidelity criterion for quantum channels, which we term the minimax fidelity, through a noncommutative generalization of maximal Hellinger distance between two positive kernels in classical probability theory. Like other known fidelities for quantum channels, the minimax fidelity is well defined for channels between finite-dimensional algebras, but it also applies to a certain class of channels between infinite-dimensional algebras (explicitly, those channels that possess an operator-valued Radon-Nikodym density with respect to the trace in the sense of Belavkin-Staszewski) and induces a metric on the set of quantum channels that is topologically equivalent to the CB-norm distance between channels, precisely in the same way as the Bures metric on the density operators associated with statistical states of quantum-mechanical systems, derived from the well-known fidelity (“generalized transition probability”) of Uhlmann, is topologically equivalent to the trace-norm distance.
Quantum information decoupling is a fundamental primitive in quantum information theory, underlying various applications in quantum physics. We prove a novel one-shot decoupling theorem formulated in terms of quantum relative entropy distance, with the decoupling error bounded by two sandwiched Rényi conditional entropies. In the asymptotic i.i.d. setting of standard information decoupling via partial trace, we show that this bound is ensemble-tight in quantum relative entropy distance and thereby yields a characterization of the associated decoupling error exponent in the low-cost-rate regime. Leveraging this framework, we derive several operational applications formulated in terms of purified distance: (i) single-letter expressions for the exact error exponents of quantum state merging in the low-entanglement-cost and high-entanglement-distillation-rate regimes, in terms of Petz-Rényi conditional entropies, and (ii) regularized expressions for achievable error exponents of entanglement distillation and quantum channel coding in terms of Petz-Rényi coherent informations. We further prove that these achievable bounds are tight for maximally correlated states and generalized dephasing channels, respectively, for the high distillation-rate/coding-rate regimes.
We develop a framework to extend resource measures from one domain to a larger one. We find that all extensions of resource measures are bounded between two quantities that we call the minimal and maximal extensions. We discuss various applications of our framework. We show that any relative entropy (i.e., an additive function on pairs of quantum states that satisfies the data processing inequality) must be bounded by the min and max relative entropies. We prove that the generalized trace distance, the generalized fidelity, and the purified distance are optimal extensions. And in entanglement theory we introduce a technique to extend pure-state entanglement measures to mixed bipartite states.
Many definitions of relative information (often called relative entropy) have been proposed in order to characterise the ‘distance’ as information divergence between states. One such class of relative informations are the quasi-entropies proposed by Petz in 66 (of which the standard Araki-Umegaki form, 53 , is a particular example). This paper axiomatises the idea of relative information and then proceeds to build a large class of examples that satisfy these axioms. By using the Radon-Nikodym derivative for completely positive maps as an ‘operational density’ for channels, along with a theorem by Belavkin and Ohya, 57 , for taking the supremum over local couplings these ideas are then lifted beyond the realm of states into that of quantum channels. This method for extending information quantities to channels was pioneered by V.P. Belavkin, with respect to fidelity, 61 (see 60 for an in-depth presentation of the subject).
In this work, we provide a strengthening of the data processing inequality for the relative entropy introduced by Belavkin and Staszewski (BS-entropy). This extends previous results by Carlen and Vershynina for the relative entropy and other standard [Formula: see text]-divergences. To this end, we provide two new equivalent conditions for the equality case of the data processing inequality for the BS-entropy. Subsequently, we extend our result to a larger class of maximal [Formula: see text]-divergences. Here, we first focus on quantum channels which are conditional expectations onto subalgebras and use the Stinespring dilation to lift our results to arbitrary quantum channels.