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:2007.11258 · Letters in Mathematical Physics

Asymptotic relative submajorization of multiple-state boxes

Gergely Bunth, Péter Vrana

Published Jul 14, 2021• 8 citations
arXivHTMLPDF

Abstract

Abstract Pairs of states, or “boxes” are the basic objects in the resource theory of asymmetric distinguishability (Wang and Wilde in Phys Rev Res 1(3):033170, 2019. 10.1103/PhysRevResearch.1.033170 ), where free operations are arbitrary quantum channels that are applied to both states. From this point of view, hypothesis testing is seen as a process by which a standard form of distinguishability is distilled. Motivated by the more general problem of quantum state discrimination, we consider boxes of a fixed finite number of states and study an extension of the relative submajorization preorder to such objects. In this relation, a tuple of positive operators is greater than another if there is a completely positive trace nonincreasing map under which the image of the first tuple satisfies certain semidefinite constraints relative to the other one. This preorder characterizes error probabilities in the case of testing a composite null hypothesis against a simple alternative hypothesis, as well as certain error probabilities in state discrimination. We present a sufficient condition for the existence of catalytic transformations between boxes, and a characterization of an associated asymptotic preorder, both expressed in terms of sandwiched Rényi divergences. This characterization of the asymptotic preorder directly shows that the strong converse exponent for a composite null hypothesis is equal to the maximum of the corresponding exponents for the pairwise simple hypothesis testing tasks.

DOI
10.1007/s11005-021-01430-0

Related papers

Equivariant Relative Submajorization

Gergely Bunth, Péter Vrana

We study a generalization of relative submajorization that compares pairs of positive operators on representation spaces of some fixed group. A pair equivariantly relatively submajorizes another if there is an equivariant subnormalized channel that takes the components of the first pair to a pair satisfying similar positivity constraints as in the definition of relative submajorization. In the context of the resource theory approach to thermodynamics, this generalization allows one to study transformations by Gibbs-preserving maps that are in addition time-translation symmetric. We find a sufficient condition for the existence of catalytic transformations and a characterization of an asymptotic relaxation of the relation. For classical and certain quantum pairs the characterization is in terms of explicit monotone quantities related to the sandwiched quantum Rényi divergences. In the general quantum case the relevant quantities are given only implicitly. Nevertheless, we find a large collection of monotones that provide necessary conditions for asymptotic or catalytic transformations. When applied to time-translation symmetric maps, these give rise to second laws that constrain state transformations allowed by thermal operations even in the presence of catalysts.

arXiv:2108.13217•IEEE Transactions on Information Theory•Oct 13, 2022•10 citations

The Semiring of Dichotomies and Asymptotic Relative Submajorization

Christopher Perry, Péter Vrana, Albert H. Werner

We study quantum dichotomies and the resource theory of asymmetric distinguishability using a generalization of Strassen’s theorem on preordered semirings. We find that an asymptotic variant of relative submajorization, defined on unnormalized dichotomies, is characterized by real-valued monotones that are multiplicative under the tensor product and additive under the direct sum. These strong constraints allow us to classify and explicitly describe all such monotones, leading to a rate formula expressed as an optimization involving sandwiched Rényi divergences. As an application we give a new derivation of the strong converse error exponent in quantum hypothesis testing.

arXiv:2004.10587•IEEE Transactions on Information Theory•Oct 5, 2021•9 citations

Resource theory of asymmetric distinguishability for quantum channels

Xin Wang, Mark M. Wilde

This paper develops the resource theory of asymmetric distinguishability for quantum channels, generalizing the related resource theory for states [Matsumoto, arXiv:1010.1030, Wang and Wilde, Phys. Rev. Research 1, 033170 (2019)10.1103/PhysRevResearch.1.033170]. The key constituents of the channel resource theory are quantum channel boxes, consisting of a pair of quantum channels, which can be manipulated for free by means of an arbitrary quantum superchannel (the most general physical transformation of a quantum channel). One main question of the resource theory is the approximate channel box transformation problem, in which the goal is to transform an initial channel box (or boxes) to a final channel box (or boxes), while allowing for an asymmetric error in the transformation. The channel resource theory is richer than its counterpart for states because there is a wider variety of ways in which this question can be framed, either in the one-shot or n-shot regimes, with the latter having parallel and sequential variants. As in our prior work [Wang and Wilde, Phys. Rev. Research 1, 033170 (2019)10.1103/PhysRevResearch.1.033170], we consider two special cases of the general channel box transformation problem, known as distinguishability distillation and dilution. For the one-shot case, we find that the optimal values of the various tasks are equal to the nonsmooth or smooth channel min- or max-relative entropies, thus endowing all of these quantities with operational interpretations. In the asymptotic sequential setting, we prove that the exact distinguishability cost is equal to the channel max-relative entropy and the distillable distinguishability is equal to the amortized channel relative entropy of [Berta, Hirche, Kaur, and Wilde, arXiv:1808.01498]. This latter result can also be understood as a solution to Stein's lemma for quantum channels in the sequential setting. Finally, the theory simplifies significantly for environment-seizable and classical-quantum channel boxes.

Civil War Book Review•Dec 11, 2019•67 citations

On the Error Exponents of Binary State Discrimination With Composite Hypotheses

Milán Mosonyi, Zsombor Szilágyi, Mihály Weiner

The trade-off between the two types of error probabilities in binary state discrimination may be quantified in the asymptotics by various error exponents. In the composite case, where the hypotheses consist of sets of states, any such exponent is upper bounded by the infimum of the corresponding pairwise exponents of discriminating individual members of the two sets. Attainability of this upper bound may depend on the type of exponents considered; whether the problem is classical or quantum; the cardinality and the geometric properties of the sets representing the hypotheses; and also on the dimensionality of the underlying Hilbert space. Our main contribution is clarifying this landscape considerably. We show that in the quantum case unattainability is the general behaviour for all the exponents, already in finite dimension, for a simple null-hypothesis and an alternative hypothesis consisting of only two states. Moreover, the upper bound may be strict even in the infinite-dimensional classical case if the alternative hypothesis contains at least countably infinitely many states. We also prove general attainability results, e.g., for classical adversarial and arbitrarily varying hypothesis testing, and for the quantum case where all states are pure, or the states commute with every state in the opposite hypothesis.

arXiv:2011.04645•IEEE Transactions on Information Theory•Nov 8, 2021•23 citations

Error bounds for composite quantum hypothesis testing and a new characterization of the weighted Kubo-Ando geometric means

Péter E. Frenkel, Milán Mosonyi, Péter Vrana +1 more

The optimal error exponents of binary composite i.i.d.~state discrimination are trivially bounded by the worst-case pairwise exponents of discriminating individual elements of the sets representing the two hypotheses, and in the finite-dimensional classical case, these bounds in fact give exact single-copy expressions for the error exponents. In contrast, in the non-commutative case, the optimal exponents are only known to be expressible in terms of regularized divergences, resulting in formulas that, while conceptually relevant, are practically not very useful. In this paper, we develop further an approach initiated in [Mosonyi, Szilágyi, Weiner, IEEE Trans.~Inf.~Th.~68(2):1032--1067, 2022] to give improved single-copy bounds on the error exponents by comparing not only individual states from the two hypotheses, but also various unnormalized positive semi-definite operators associated to them. Here, we show a number of equivalent characterizations of such operators giving valid bounds, and show that in the commutative case, considering weighted geometric means of the states, and in the case of two states per hypothesis, considering weighted Kubo-Ando geometric means, are optimal for this approach. As a result, we give a new characterization of the weighted Kubo-Ando geometric means as the only $2$-variable operator geometric means that are block additive, tensor multiplicative, continuous on monotone decreasing sequences, and satisfy the arithmetic-geometric mean inequality. We also extend our results to composite quantum channel discrimination, and show an analogous optimality property of the weighted Kubo-Ando geometric means of two quantum channels, a notion that seems to be new. We extend this concept to defining the notion of superoperator perspective function and establish some of its basic properties, which may be of independent interest.

arXiv:2503.13379•Mar 17, 2025•6 citations

Multiple Quantum Hypothesis Testing: One-Shot Pairwise Bounds and Sharp Asymptotics

Hao-Chung Cheng, Po-Chieh Liu

We consider Bayesian discrimination among multiple quantum states and establish a dimension-free one-shot upper bound on the minimum probability of error in terms of the sum of pairwise errors. This resolves a conjecture of Audenaert and Mosonyi [J. Math. Phys. 55 (2014)] and improves the multiple quantum Chernoff bound of Li [Ann. Statist. 44 (2016)] by removing its dimension-dependent prefactor. In the asymptotic many-copy regime, our bound proves the achievability of the multiple quantum Chernoff distance for arbitrary separable Hilbert spaces, thereby settling the previously open infinite-dimensional case, and further yields constant-factor sharp asymptotics for the optimal error probability. In binary quantum hypothesis testing, we prove that the minimum error probability is characterized, up to universal constants, by a trace harmonic-mean quantity. Consequently, the optimal binary quantum error probability is within a factor of two of the optimal classical error probability for the associated Nussbaum-Szkoła distributions, complementing the lower bound of Nussbaum and Szkoła [Ann. Statist. 37 (2009)].

quant-pharXiv:2606.06246•Jun 5, 2026•5 citations
Abstract Pairs of states, or “boxes” are the basic objects in the resource theory of asymmetric distinguishability (Wang and Wilde in Phys Rev Res 1(3):033170, 2019. 10.1103/PhysRevResearch.1.033170 ), where free operations are arbitrary quantum channels that are applied to both states. From this point of view, hypothesis testing is seen as a process by which a standard form of distinguishability is distilled. Motivated by the more general problem of quantum state discrimination, we consider boxes of a fixed finite number of states and study an extension of the relative submajorization preorder to such objects. In this relation, a tuple of positive operators is greater than another if there is a completely positive trace nonincreasing map under which the image of the first tuple satisfies certain semidefinite constraints relative to the other one. This preorder characterizes error probabilities in the case of testing a composite null hypothesis against a simple alternative hypothesis, as well as certain error probabilities in state discrimination. We present a sufficient condition for the existence of catalytic transformations between boxes, and a characterization of an associated asymptotic preorder, both expressed in terms of sandwiched Rényi divergences. This characterization of the asymptotic preorder directly shows that the strong converse exponent for a composite null hypothesis is equal to the maximum of the corresponding exponents for the pairwise simple hypothesis testing tasks.
We study a generalization of relative submajorization that compares pairs of positive operators on representation spaces of some fixed group. A pair equivariantly relatively submajorizes another if there is an equivariant subnormalized channel that takes the components of the first pair to a pair satisfying similar positivity constraints as in the definition of relative submajorization. In the context of the resource theory approach to thermodynamics, this generalization allows one to study transformations by Gibbs-preserving maps that are in addition time-translation symmetric. We find a sufficient condition for the existence of catalytic transformations and a characterization of an asymptotic relaxation of the relation. For classical and certain quantum pairs the characterization is in terms of explicit monotone quantities related to the sandwiched quantum Rényi divergences. In the general quantum case the relevant quantities are given only implicitly. Nevertheless, we find a large collection of monotones that provide necessary conditions for asymptotic or catalytic transformations. When applied to time-translation symmetric maps, these give rise to second laws that constrain state transformations allowed by thermal operations even in the presence of catalysts.
We study quantum dichotomies and the resource theory of asymmetric distinguishability using a generalization of Strassen’s theorem on preordered semirings. We find that an asymptotic variant of relative submajorization, defined on unnormalized dichotomies, is characterized by real-valued monotones that are multiplicative under the tensor product and additive under the direct sum. These strong constraints allow us to classify and explicitly describe all such monotones, leading to a rate formula expressed as an optimization involving sandwiched Rényi divergences. As an application we give a new derivation of the strong converse error exponent in quantum hypothesis testing.
This paper develops the resource theory of asymmetric distinguishability for quantum channels, generalizing the related resource theory for states [Matsumoto, arXiv:1010.1030, Wang and Wilde, Phys. Rev. Research 1, 033170 (2019)10.1103/PhysRevResearch.1.033170]. The key constituents of the channel resource theory are quantum channel boxes, consisting of a pair of quantum channels, which can be manipulated for free by means of an arbitrary quantum superchannel (the most general physical transformation of a quantum channel). One main question of the resource theory is the approximate channel box transformation problem, in which the goal is to transform an initial channel box (or boxes) to a final channel box (or boxes), while allowing for an asymmetric error in the transformation. The channel resource theory is richer than its counterpart for states because there is a wider variety of ways in which this question can be framed, either in the one-shot or n-shot regimes, with the latter having parallel and sequential variants. As in our prior work [Wang and Wilde, Phys. Rev. Research 1, 033170 (2019)10.1103/PhysRevResearch.1.033170], we consider two special cases of the general channel box transformation problem, known as distinguishability distillation and dilution. For the one-shot case, we find that the optimal values of the various tasks are equal to the nonsmooth or smooth channel min- or max-relative entropies, thus endowing all of these quantities with operational interpretations. In the asymptotic sequential setting, we prove that the exact distinguishability cost is equal to the channel max-relative entropy and the distillable distinguishability is equal to the amortized channel relative entropy of [Berta, Hirche, Kaur, and Wilde, arXiv:1808.01498]. This latter result can also be understood as a solution to Stein's lemma for quantum channels in the sequential setting. Finally, the theory simplifies significantly for environment-seizable and classical-quantum channel boxes.
The trade-off between the two types of error probabilities in binary state discrimination may be quantified in the asymptotics by various error exponents. In the composite case, where the hypotheses consist of sets of states, any such exponent is upper bounded by the infimum of the corresponding pairwise exponents of discriminating individual members of the two sets. Attainability of this upper bound may depend on the type of exponents considered; whether the problem is classical or quantum; the cardinality and the geometric properties of the sets representing the hypotheses; and also on the dimensionality of the underlying Hilbert space. Our main contribution is clarifying this landscape considerably. We show that in the quantum case unattainability is the general behaviour for all the exponents, already in finite dimension, for a simple null-hypothesis and an alternative hypothesis consisting of only two states. Moreover, the upper bound may be strict even in the infinite-dimensional classical case if the alternative hypothesis contains at least countably infinitely many states. We also prove general attainability results, e.g., for classical adversarial and arbitrarily varying hypothesis testing, and for the quantum case where all states are pure, or the states commute with every state in the opposite hypothesis.
The optimal error exponents of binary composite i.i.d.~state discrimination are trivially bounded by the worst-case pairwise exponents of discriminating individual elements of the sets representing the two hypotheses, and in the finite-dimensional classical case, these bounds in fact give exact single-copy expressions for the error exponents. In contrast, in the non-commutative case, the optimal exponents are only known to be expressible in terms of regularized divergences, resulting in formulas that, while conceptually relevant, are practically not very useful. In this paper, we develop further an approach initiated in [Mosonyi, Szilágyi, Weiner, IEEE Trans.~Inf.~Th.~68(2):1032--1067, 2022] to give improved single-copy bounds on the error exponents by comparing not only individual states from the two hypotheses, but also various unnormalized positive semi-definite operators associated to them. Here, we show a number of equivalent characterizations of such operators giving valid bounds, and show that in the commutative case, considering weighted geometric means of the states, and in the case of two states per hypothesis, considering weighted Kubo-Ando geometric means, are optimal for this approach. As a result, we give a new characterization of the weighted Kubo-Ando geometric means as the only 222-variable operator geometric means that are block additive, tensor multiplicative, continuous on monotone decreasing sequences, and satisfy the arithmetic-geometric mean inequality. We also extend our results to composite quantum channel discrimination, and show an analogous optimality property of the weighted Kubo-Ando geometric means of two quantum channels, a notion that seems to be new. We extend this concept to defining the notion of superoperator perspective function and establish some of its basic properties, which may be of independent interest.
We consider Bayesian discrimination among multiple quantum states and establish a dimension-free one-shot upper bound on the minimum probability of error in terms of the sum of pairwise errors. This resolves a conjecture of Audenaert and Mosonyi [J. Math. Phys. 55 (2014)] and improves the multiple quantum Chernoff bound of Li [Ann. Statist. 44 (2016)] by removing its dimension-dependent prefactor. In the asymptotic many-copy regime, our bound proves the achievability of the multiple quantum Chernoff distance for arbitrary separable Hilbert spaces, thereby settling the previously open infinite-dimensional case, and further yields constant-factor sharp asymptotics for the optimal error probability. In binary quantum hypothesis testing, we prove that the minimum error probability is characterized, up to universal constants, by a trace harmonic-mean quantity. Consequently, the optimal binary quantum error probability is within a factor of two of the optimal classical error probability for the associated Nussbaum-Szkoła distributions, complementing the lower bound of Nussbaum and Szkoła [Ann. Statist. 37 (2009)].