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:2509.21308 · IEEE Transactions on Information Theory

Efficient Quantum Measurements: Computational Max- and Measured Rényi Divergences and Applications

Álvaro Yángüez, Thomas A. Hahn, Jan Kochanowski

Published Apr 2, 2026• 5 citations
arXivHTMLPDF

Abstract

Quantum information processing is limited, in practice, to efficiently implementable operations. This motivates the study of quantum divergences that preserve their operational meaning while faithfully capturing these computational constraints. Using geometric, computational, and information theoretic tools, we define two new types of computational divergences, which we termcomputational max-divergence and computational measured Rényi divergences. Both are constrained by a family of efficient binary measurements, and thus useful for state discrimination tasks in the computational setting. We prove that, in the infinite-order limit, the computational measured Rényi divergence coincides with the computational max-divergence, mirroring the corresponding relation in the unconstrained information-theoretic setting. For the many-copy regime, we introduce regularized versions and establish a one-sided computational Stein bound on achievable hypothesis-testing exponents under efficient measurements, giving the regularized computational measured relative entropy an operational meaning. We further define resource measures induced by our computational divergences and prove an asymptotic continuity bound for the computational measured relative entropy of resource. Focusing on entanglement, we relate our results to previously proposed computational entanglement measures and provide explicit separations from the information-theoretic setting. Together, these results provide a principled, cohesive approach towards state discrimination tasks and resource quantification under computational constraints.

DOI
10.1109/tit.2026.3680247

Related papers

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

Relative entropies and their use in quantum information theory

Felix Leditzky

This dissertation investigates relative entropies, also called generalized divergences, and how they can be used to characterize information-theoretic tasks in quantum information theory. The main goal is to further refine characterizations of the optimal rates for quantum source coding, state redistribution, and measurement compression with quantum side information via second order asymptotic expansions and strong converse theorems. The dissertation consists of a mathematical and an information-theoretic part. In the mathematical part, we focus on the $α$-sandwiched Rényi divergence ($α$-SRD). We first investigate the limit $α\to 0$ to determine whether this recovers the well-known $0$-Rényi relative divergence. We then prove various new results for entropic quantities derived from the $α$-SRD, including dimension bounds and useful bounds in terms of the fidelity between two quantum states. Furthermore, we derive a necessary and sufficient algebraic condition for equality in the data processing inequality (viz. monotonicity under quantum operations) for the $α$-SRD, and give applications to entropic bounds. In the information-theoretic part, we first derive the second order asymptotics of visible quantum source coding using a mixed source. For the achievability part, we develop universal quantum source codes achieving a given second order rate for a memoryless source. As a corollary of the main result, we obtain the second order asymptotics of quantum source coding using a single memoryless source. We then prove strong converse theorems for state redistribution (with or without feedback) and measurement compression with quantum side information. The key ingredients in proving these theorems are the aforementioned fidelity bounds on Rényi entropic quantities derived from the $α$-SRD.

arXiv:1611.08802•Nov 27, 2016•30 citations

Test-Measured Rényi Divergences

Milán Mosonyi, Fumio Hiai

One possibility of defining a quantum Rényi$\alpha $-divergence of two quantum states is to optimize the classical Rényi$\alpha $-divergence of their post-measurement probability distributions over all possible measurements (measured Rényi divergence), and maybe regularize these quantities over multiple copies of the two states (regularized measured Rényi$\alpha $-divergence). A key observation behind the theorem for the strong converse exponent of asymptotic binary quantum state discrimination is that the regularized measured Rényi$\alpha $-divergence coincides with the sandwiched Rényi$\alpha $-divergence when$\alpha >1$. Moreover, it also follows from the same theorem that to achieve this, it is sufficient to consider 2-outcome measurements (tests) for any number of copies (this is somewhat surprising, as achieving the measured Rényi$\alpha $-divergence for$n$copies might require a number of measurement outcomes that diverges in$n$, in general). In view of this, it seems natural to expect the same when$\alpha < 1$; however, we show that this is not the case. In fact, we show that even for commuting states (classical case) the regularized quantity attainable using 2-outcome measurements is in general strictly smaller than the Rényi$\alpha $-divergence (which is unique in the classical case). In the general quantum case this shows that the above “regularized test-measured” Rényi$\alpha $-divergence is not even a quantum extension of the classical Rényi divergence when$\alpha < 1$, in sharp contrast to the$\alpha >1$case.

arXiv:2201.05477•IEEE Transactions on Information Theory•Sep 26, 2022•16 citations

Locally-Measured Rényi Divergences

Tobias Rippchen, Sreejith Sreekumar, Mario Berta

We propose an extension of the classical Rényi divergences to quantum states through an optimization over probability distributions induced by restricted sets of measurements. In particular, we define the notion of locally-measured Rényi divergences, where the set of allowed measurements originates from variants of locality constraints between (distant) partiesAandB. We then derive variational bounds on the locally-measured Rényi divergences and systematically discuss when these bounds become exact characterizations. As an application, we evaluate the locally-measured Rényi divergences on variants of highly symmetric data-hiding states, showcasing the reduced distinguishing power of locality-constrained measurements. For n-fold tensor powers, we further employ our variational formulae to derive corresponding additivity results, which gives the locally-measured Rényi divergences operational meaning as optimal rate exponents in asymptotic locally-measured hypothesis testing.

arXiv:2405.05037•IEEE Transactions on Information Theory•May 19, 2025•16 citations

Accessible Quantum Correlations Under Complexity Constraints

Álvaro Yángüez, Noam Avidan, Jan Kochanowski +1 more

Quantum systems may contain underlying correlations which are inaccessible to computationally bounded observers. We capture this distinction through a framework that analyses bipartite states only using efficiently implementable quantum channels. This leads to a complexity-constrained max-divergence and a corresponding computational min-entropy. The latter quantity recovers the standard operational meaning of the conditional min-entropy: in the fully quantum case, it quantifies the largest overlap with a maximally entangled state attainable via efficient operations on the conditional subsystem. For classical-quantum states, it further reduces to the optimal guessing probability of a computationally bounded observer with access to side information. Lastly, in the absence of side information, the computational min-entropy simplifies to a computational notion of the operator norm. We then establish strong separations between the information-theoretic and complexity-constrained notions of min-entropy. For pure states, there exist highly entangled families of states with extremal min-entropy whose efficiently accessible entanglement in terms of computational min-entropy is exponentially suppressed. For mixed states, the separation is even sharper: the information-theoretic conditional min-entropy can be highly negative while the complexity-constrained quantity remains nearly maximal. Under the cryptographic Learning with Errors hardness assumption, we construct efficiently preparable states exhibiting both separations, even when their preparation circuits are fully known. Overall, our results demonstrate that computational constraints can fundamentally limit the quantum correlations that are observable in practice.

quant-pharXiv:2604.15540•Apr 20, 2026•1 citation

A limit of the quantum Rényi divergence

Nilanjana Datta, Felix Leditzky

Recently, an interesting quantity called the quantum Rényi divergence (or 'sandwiched' Rényi relative entropy) was defined for pairs of positive semi-definite operators ρ and σ. It depends on a parameter α and acts as a parent quantity for other relative entropies which have important operational significance in quantum information theory: the quantum relative entropy and the min- and max-relative entropies. There is, however, another relative entropy, called the 0-relative Rényi entropy, which plays a key role in the analysis of various quantum information-processing tasks in the one-shot setting. We prove that the 0-relative Rényi entropy is obtainable from the quantum Rényi divergence only if ρ and σ have equal supports. This, along with existing results in the literature, suggests that it suffices to consider two essential parent quantities from which operationally relevant entropic quantities can be derived—the quantum Rényi divergence with parameter α ⩾ 1/2, and the α-relative Rényi entropy with α ∈ [0, 1).

arXiv:1308.5961•Journal of Physics A Mathematical and Theoretical•Jan 8, 2014•53 citations
Quantum information processing is limited, in practice, to efficiently implementable operations. This motivates the study of quantum divergences that preserve their operational meaning while faithfully capturing these computational constraints. Using geometric, computational, and information theoretic tools, we define two new types of computational divergences, which we termcomputational max-divergence and computational measured Rényi divergences. Both are constrained by a family of efficient binary measurements, and thus useful for state discrimination tasks in the computational setting. We prove that, in the infinite-order limit, the computational measured Rényi divergence coincides with the computational max-divergence, mirroring the corresponding relation in the unconstrained information-theoretic setting. For the many-copy regime, we introduce regularized versions and establish a one-sided computational Stein bound on achievable hypothesis-testing exponents under efficient measurements, giving the regularized computational measured relative entropy an operational meaning. We further define resource measures induced by our computational divergences and prove an asymptotic continuity bound for the computational measured relative entropy of resource. Focusing on entanglement, we relate our results to previously proposed computational entanglement measures and provide explicit separations from the information-theoretic setting. Together, these results provide a principled, cohesive approach towards state discrimination tasks and resource quantification under computational constraints.
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.
This dissertation investigates relative entropies, also called generalized divergences, and how they can be used to characterize information-theoretic tasks in quantum information theory. The main goal is to further refine characterizations of the optimal rates for quantum source coding, state redistribution, and measurement compression with quantum side information via second order asymptotic expansions and strong converse theorems. The dissertation consists of a mathematical and an information-theoretic part. In the mathematical part, we focus on the ααα-sandwiched Rényi divergence (ααα-SRD). We first investigate the limit α→0α\to 0α→0 to determine whether this recovers the well-known 000-Rényi relative divergence. We then prove various new results for entropic quantities derived from the ααα-SRD, including dimension bounds and useful bounds in terms of the fidelity between two quantum states. Furthermore, we derive a necessary and sufficient algebraic condition for equality in the data processing inequality (viz. monotonicity under quantum operations) for the ααα-SRD, and give applications to entropic bounds. In the information-theoretic part, we first derive the second order asymptotics of visible quantum source coding using a mixed source. For the achievability part, we develop universal quantum source codes achieving a given second order rate for a memoryless source. As a corollary of the main result, we obtain the second order asymptotics of quantum source coding using a single memoryless source. We then prove strong converse theorems for state redistribution (with or without feedback) and measurement compression with quantum side information. The key ingredients in proving these theorems are the aforementioned fidelity bounds on Rényi entropic quantities derived from the ααα-SRD.
One possibility of defining a quantum Rényi$\alpha −divergenceoftwoquantumstatesistooptimizetheclassicalReˊnyi-divergence of two quantum states is to optimize the classical Rényi−divergenceoftwoquantumstatesistooptimizetheclassicalReˊnyi\alpha −divergenceoftheirpost−measurementprobabilitydistributionsoverallpossiblemeasurements(measuredReˊnyidivergence),andmayberegularizethesequantitiesovermultiplecopiesofthetwostates(regularizedmeasuredReˊnyi-divergence of their post-measurement probability distributions over all possible measurements (measured Rényi divergence), and maybe regularize these quantities over multiple copies of the two states (regularized measured Rényi−divergenceoftheirpost−measurementprobabilitydistributionsoverallpossiblemeasurements(measuredReˊnyidivergence),andmayberegularizethesequantitiesovermultiplecopiesofthetwostates(regularizedmeasuredReˊnyi\alpha −divergence).AkeyobservationbehindthetheoremforthestrongconverseexponentofasymptoticbinaryquantumstatediscriminationisthattheregularizedmeasuredReˊnyi-divergence). A key observation behind the theorem for the strong converse exponent of asymptotic binary quantum state discrimination is that the regularized measured Rényi−divergence).AkeyobservationbehindthetheoremforthestrongconverseexponentofasymptoticbinaryquantumstatediscriminationisthattheregularizedmeasuredReˊnyi\alpha −divergencecoincideswiththesandwichedReˊnyi-divergence coincides with the sandwiched Rényi−divergencecoincideswiththesandwichedReˊnyi\alpha −divergencewhen-divergence when−divergencewhen\alpha >1.Moreover,italsofollowsfromthesametheoremthattoachievethis,itissufficienttoconsider2−outcomemeasurements(tests)foranynumberofcopies(thisissomewhatsurprising,asachievingthemeasuredReˊnyi. Moreover, it also follows from the same theorem that to achieve this, it is sufficient to consider 2-outcome measurements (tests) for any number of copies (this is somewhat surprising, as achieving the measured Rényi.Moreover,italsofollowsfromthesametheoremthattoachievethis,itissufficienttoconsider2−outcomemeasurements(tests)foranynumberofcopies(thisissomewhatsurprising,asachievingthemeasuredReˊnyi\alpha −divergencefor-divergence for−divergenceforncopiesmightrequireanumberofmeasurementoutcomesthatdivergesincopies might require a number of measurement outcomes that diverges incopiesmightrequireanumberofmeasurementoutcomesthatdivergesinn,ingeneral).Inviewofthis,itseemsnaturaltoexpectthesamewhen, in general). In view of this, it seems natural to expect the same when,ingeneral).Inviewofthis,itseemsnaturaltoexpectthesamewhen\alpha < 1;however,weshowthatthisisnotthecase.Infact,weshowthatevenforcommutingstates(classicalcase)theregularizedquantityattainableusing2−outcomemeasurementsisingeneralstrictlysmallerthantheReˊnyi; however, we show that this is not the case. In fact, we show that even for commuting states (classical case) the regularized quantity attainable using 2-outcome measurements is in general strictly smaller than the Rényi;however,weshowthatthisisnotthecase.Infact,weshowthatevenforcommutingstates(classicalcase)theregularizedquantityattainableusing2−outcomemeasurementsisingeneralstrictlysmallerthantheReˊnyi\alpha −divergence(whichisuniqueintheclassicalcase).Inthegeneralquantumcasethisshowsthattheabove“regularizedtest−measured”Reˊnyi-divergence (which is unique in the classical case). In the general quantum case this shows that the above “regularized test-measured” Rényi−divergence(whichisuniqueintheclassicalcase).Inthegeneralquantumcasethisshowsthattheabove“regularizedtest−measured”Reˊnyi\alpha −divergenceisnotevenaquantumextensionoftheclassicalReˊnyidivergencewhen-divergence is not even a quantum extension of the classical Rényi divergence when−divergenceisnotevenaquantumextensionoftheclassicalReˊnyidivergencewhen\alpha < 1,insharpcontrasttothe, in sharp contrast to the,insharpcontrasttothe\alpha >1$case.
We propose an extension of the classical Rényi divergences to quantum states through an optimization over probability distributions induced by restricted sets of measurements. In particular, we define the notion of locally-measured Rényi divergences, where the set of allowed measurements originates from variants of locality constraints between (distant) partiesAandB. We then derive variational bounds on the locally-measured Rényi divergences and systematically discuss when these bounds become exact characterizations. As an application, we evaluate the locally-measured Rényi divergences on variants of highly symmetric data-hiding states, showcasing the reduced distinguishing power of locality-constrained measurements. For n-fold tensor powers, we further employ our variational formulae to derive corresponding additivity results, which gives the locally-measured Rényi divergences operational meaning as optimal rate exponents in asymptotic locally-measured hypothesis testing.
Quantum systems may contain underlying correlations which are inaccessible to computationally bounded observers. We capture this distinction through a framework that analyses bipartite states only using efficiently implementable quantum channels. This leads to a complexity-constrained max-divergence and a corresponding computational min-entropy. The latter quantity recovers the standard operational meaning of the conditional min-entropy: in the fully quantum case, it quantifies the largest overlap with a maximally entangled state attainable via efficient operations on the conditional subsystem. For classical-quantum states, it further reduces to the optimal guessing probability of a computationally bounded observer with access to side information. Lastly, in the absence of side information, the computational min-entropy simplifies to a computational notion of the operator norm. We then establish strong separations between the information-theoretic and complexity-constrained notions of min-entropy. For pure states, there exist highly entangled families of states with extremal min-entropy whose efficiently accessible entanglement in terms of computational min-entropy is exponentially suppressed. For mixed states, the separation is even sharper: the information-theoretic conditional min-entropy can be highly negative while the complexity-constrained quantity remains nearly maximal. Under the cryptographic Learning with Errors hardness assumption, we construct efficiently preparable states exhibiting both separations, even when their preparation circuits are fully known. Overall, our results demonstrate that computational constraints can fundamentally limit the quantum correlations that are observable in practice.
Recently, an interesting quantity called the quantum Rényi divergence (or 'sandwiched' Rényi relative entropy) was defined for pairs of positive semi-definite operators ρ and σ. It depends on a parameter α and acts as a parent quantity for other relative entropies which have important operational significance in quantum information theory: the quantum relative entropy and the min- and max-relative entropies. There is, however, another relative entropy, called the 0-relative Rényi entropy, which plays a key role in the analysis of various quantum information-processing tasks in the one-shot setting. We prove that the 0-relative Rényi entropy is obtainable from the quantum Rényi divergence only if ρ and σ have equal supports. This, along with existing results in the literature, suggests that it suffices to consider two essential parent quantities from which operationally relevant entropic quantities can be derived—the quantum Rényi divergence with parameter α ⩾ 1/2, and the α-relative Rényi entropy with α ∈ [0, 1).