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:2604.01217

Conditional channel entropy sets fundamental limits on thermodynamic quantum information processing

Himanshu Badhani, Siddhartha Das

quant-phcond-mat.othercs.IThep-thmath-phSubmitted Apr 1, 2026• Announced Apr 2, 2026• 0 citations• Revised Jun 23, 2026 (v2)
v1 · Apr 1, 2026v2 · Jun 23, 2026
arXivHTMLPDF

Abstract

The thermodynamic resourcefulness of quantum channels primarily depends on their underlying causal structure and their ability to generate quantum correlations. We quantify this interplay within the resource theory of athermality for bipartite quantum channels in the presence of a side channel acting as memory, referred to as the resource theory of conditional athermality. For channels with trivial output Hamiltonians, we characterize the optimal one-shot rates for distilling the identity gate from a given channel, as well as the cost of simulating the channel using the identity gate, under conditional Gibbs-preserving superchannels. We show that these rates have a direct trade-off relation with the conditional channel entropies, attributing operational significance to signaling in quantum processes. Furthermore, we establish an asymptotic equipartition property for the conditional channel min-entropy for classes of channels that are either tele-covariant or no-signaling from the non-conditioning input to the conditioning output. As a consequence, we demonstrate asymptotic reversibility of the resource theory for these channels. The asymptotic conditional athermality capacity of a tele-covariant channel is half the superdense coding capacity of its Choi state. Our work establishes the conditional channel entropy as a primitive information-theoretic concept for quantum processes, elucidating its potential for wider applications in quantum information science.

Comments
Fixed bugs, added some more observations, 33+20 pages, 1 table, 3 figures

Related papers

Thermodynamic work capacity of quantum information processing

Anonymous, G S Dhanuja, Siddhartha Das

We introduce the resource-theoretic free energy of a quantum channel as the maximal work extractable from the channel as its output equilibrates to a thermal state and its reference system remains locally intact. It is proportional to the relative entropy between the given channel and the absolutely thermal channel. It attains a clear operational meaning as twice the asymptotic rates of athermality distillation and formation under Gibbs-preserving superchannels, which map one absolutely thermal channel to another for a given bath, thereby revealing the asymptotic reversibility of the resource theory of athermality for quantum channels. Consequently, we establish that the optimal extractable work in converting one channel to another through the asymptotic athermality distillation and formation tasks equals the difference in their free energies. We call this optimal work the thermodynamic work capacity of channel conversion. Quantum information processing and computing fundamentally concern the manipulation and transformation of quantum channels, which encompass quantum states, their transformations, and measurements. A quantitative characterization of the optimal thermodynamic work gain or expenditure in quantum information processing constitutes a key step toward formulating thermodynamics of quantum processes.

arXiv:2510.23731•APS Open Science•Jul 24, 2026•0 citations

Thermodynamic criteria for signaling in quantum channels

Yutong Luo, Simon Milz, Felix C. Binder

Signaling quantum channels are fundamental to quantum communication, enabling the transfer of information from input to output states. In contrast, thermalization erases information about the initial state. This raises a crucial question: How does the thermalizing tendency of a quantum channel constrain its signaling power and vice versa? In this work, we address this question by considering three thermodynamic tasks associated with a quantum channel: the generation, preservation, and transmission of athermality. We provide faithful measures for athermality generation and athermality preservation of quantum channels, and prove that their difference quantifies athermality transmission. Analyzing these thermodynamic tasks, we find that the signaling ability of a quantum channel is upper-bounded by its athermality preservation and lower-bounded by its athermality transmission, thereby establishing a fundamental relationship between signaling and thermodynamic properties of channels for quantum communication. We demonstrate this interplay for the example of the quantum switch, revealing an explicit trade-off between the signaling ability and athermality of the quantum channels it can implement.

arXiv:2506.20428•Physical Review Research•Nov 23, 2025•1 citation

Cone-restricted information theory

Ian George, Eric Chitambar

Abstract The max-relative entropy and the conditional min-entropy of a quantum state plays a central role in one-shot and zero-error quantum information theory. One attractive feature of this quantity is that it can be expressed as an optimization over the cone of positive semidefinite operators. Recently, it was shown that when replacing this cone with the cone of separable operators, a new type of conditional min-entropy emerges that admits an operational interpretation in terms of communicating classical information over a quantum channel. In this work, we explore more deeply the idea of building information-theoretic quantities from different base cones and determine which results in quantum information theory rely upon the positive semidefinite cone and which can be generalized. In terms of asymptotic information processing, we find that the standard equipartition properties break down if a given cone fails to approximate the positive semidefinite cone sufficiently well. We also show that the near-equivalence of the smooth max and Hartley entropies breaks down in this setting. We present parallel results for the extended conditional min-entropy, which requires extending the notion of k-superpositive channels to superchannels. On the other hand, we show that for classical-quantum states the separable cone is sufficient to re-cover the asymptotic theory, thereby drawing a strong distinction between the fully and partial quantum settings. We also present operational uses of this framework. We show that the cone restricted min-entropy of a Choi operator captures a measure of entanglement-assisted noiseless classical communication using restricted measurements. We also introduce a novel min-entropy-like quantity that captures the conditions for when one quantum channel can be transformed into another using bistochastic pre-processing. Lastly, we relate this framework to general conic norms and their non-additivity. Throughout this work, we concretely study generalized entropies in resource theories that capture locality and resource theories of coherence/Abelian symmetries.

arXiv:2206.04300•Journal of Physics A Mathematical and Theoretical•May 31, 2024•6 citations

Classical communication cost of a bipartite quantum channel assisted by non-signalling correlations

Chengkai Zhu, Xuanqiang Zhao, Xin Wang

Understanding the classical communication cost of simulating a quantum channel is a fundamental problem in quantum information theory, which becomes even more intriguing when considering the role of non-locality in quantum information processing. This paper investigates the bidirectional classical communication cost of simulating a bipartite quantum channel assisted by non-signalling correlations, which are permitted across the spatial dimension between the two parties. By introducing non-signalling superchannels, we present lower and upper bounds on the one-shot $ε$-error one-way classical communication cost of a bipartite channel via its smooth max-relative entropy of one-way classical communication, and establish that the asymptotic exact cost is given by its max-relative entropy of one-way classical communication. For the bidirectional scenario, we derive semidefinite programming (SDP) formulations for the one-shot exact bidirectional classical communication cost via non-signalling bipartite superchannels. We further introduce a channel's bipartite conditional min-entropy as an efficiently computable lower bound on the asymptotic cost of bidirectional classical communication. Our results in both one-shot and asymptotic settings provide lower bounds on the entanglement-assisted simulation cost in scenarios where entanglement is available to the two parties. Moreover, we propose a seesaw-based algorithm to compute an upper bound on the minimum simulation error via local operations and shared entanglement, which provides valuable insights into the relationship between non-signalling bipartite superchannels and more physically realizable protocols. Numerical experiments demonstrate the effectiveness of our bounds in estimating communication costs for various quantum channels, showing that our bounds can be tight in different scenarios.

arXiv:2408.02506•Aug 5, 2024•0 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•0 citations

Conditional entropy and information of quantum processes

Siddhartha Das, Kaumudibikash Goswami, Vivek Pandey

What would be a reasonable definition of the conditional entropy of bipartite quantum processes, and what novel insight would it provide? We develop this notion using four information-theoretic axioms and define the corresponding quantitative formulas. Our definitions of the conditional entropies of channels are based on the generalized state and channel divergences, for instance, quantum relative entropy. We find that the conditional entropy of quantum channels has potential to reveal insights for quantum processes that aren't already captured by the existing entropic functions, entropy or conditional entropy, of the states and channels. The von Neumann conditional entropy $S[A|B]_{\mathcal{N}}$ of the channel $\mathcal{N}_{A'B'\to AB}$ is based on the quantum relative entropy, with system pairs $A',A$ and $B',B$ being nonconditioning and conditioning systems, respectively. We identify a connection between the underlying causal structure of a bipartite channel and its conditional entropy. In particular, we provide a necessary and sufficient condition for a bipartite quantum channel $\mathcal{N}_{A'B'\to AB}$ in terms of its von Neumann conditional entropy $S[A|B]_{\mathcal{N}}$, to have no causal influence from $A'$ to $B$. As a consequence, if $S[A|B]_{\mathcal{N}}< -\log|A|$ then the channel necessarily has causal influence (signaling) from $A'$ to $B$. Our definition of the conditional entropy establishes the strong subadditivity of the entropy for quantum channels. We also study the total amount of correlations possible due to quantum processes by defining the multipartite mutual information of quantum channels.

arXiv:2410.01740•Oct 2, 2024•0 citations
The thermodynamic resourcefulness of quantum channels primarily depends on their underlying causal structure and their ability to generate quantum correlations. We quantify this interplay within the resource theory of athermality for bipartite quantum channels in the presence of a side channel acting as memory, referred to as the resource theory of conditional athermality. For channels with trivial output Hamiltonians, we characterize the optimal one-shot rates for distilling the identity gate from a given channel, as well as the cost of simulating the channel using the identity gate, under conditional Gibbs-preserving superchannels. We show that these rates have a direct trade-off relation with the conditional channel entropies, attributing operational significance to signaling in quantum processes. Furthermore, we establish an asymptotic equipartition property for the conditional channel min-entropy for classes of channels that are either tele-covariant or no-signaling from the non-conditioning input to the conditioning output. As a consequence, we demonstrate asymptotic reversibility of the resource theory for these channels. The asymptotic conditional athermality capacity of a tele-covariant channel is half the superdense coding capacity of its Choi state. Our work establishes the conditional channel entropy as a primitive information-theoretic concept for quantum processes, elucidating its potential for wider applications in quantum information science.
We introduce the resource-theoretic free energy of a quantum channel as the maximal work extractable from the channel as its output equilibrates to a thermal state and its reference system remains locally intact. It is proportional to the relative entropy between the given channel and the absolutely thermal channel. It attains a clear operational meaning as twice the asymptotic rates of athermality distillation and formation under Gibbs-preserving superchannels, which map one absolutely thermal channel to another for a given bath, thereby revealing the asymptotic reversibility of the resource theory of athermality for quantum channels. Consequently, we establish that the optimal extractable work in converting one channel to another through the asymptotic athermality distillation and formation tasks equals the difference in their free energies. We call this optimal work the thermodynamic work capacity of channel conversion. Quantum information processing and computing fundamentally concern the manipulation and transformation of quantum channels, which encompass quantum states, their transformations, and measurements. A quantitative characterization of the optimal thermodynamic work gain or expenditure in quantum information processing constitutes a key step toward formulating thermodynamics of quantum processes.
Signaling quantum channels are fundamental to quantum communication, enabling the transfer of information from input to output states. In contrast, thermalization erases information about the initial state. This raises a crucial question: How does the thermalizing tendency of a quantum channel constrain its signaling power and vice versa? In this work, we address this question by considering three thermodynamic tasks associated with a quantum channel: the generation, preservation, and transmission of athermality. We provide faithful measures for athermality generation and athermality preservation of quantum channels, and prove that their difference quantifies athermality transmission. Analyzing these thermodynamic tasks, we find that the signaling ability of a quantum channel is upper-bounded by its athermality preservation and lower-bounded by its athermality transmission, thereby establishing a fundamental relationship between signaling and thermodynamic properties of channels for quantum communication. We demonstrate this interplay for the example of the quantum switch, revealing an explicit trade-off between the signaling ability and athermality of the quantum channels it can implement.
Abstract The max-relative entropy and the conditional min-entropy of a quantum state plays a central role in one-shot and zero-error quantum information theory. One attractive feature of this quantity is that it can be expressed as an optimization over the cone of positive semidefinite operators. Recently, it was shown that when replacing this cone with the cone of separable operators, a new type of conditional min-entropy emerges that admits an operational interpretation in terms of communicating classical information over a quantum channel. In this work, we explore more deeply the idea of building information-theoretic quantities from different base cones and determine which results in quantum information theory rely upon the positive semidefinite cone and which can be generalized. In terms of asymptotic information processing, we find that the standard equipartition properties break down if a given cone fails to approximate the positive semidefinite cone sufficiently well. We also show that the near-equivalence of the smooth max and Hartley entropies breaks down in this setting. We present parallel results for the extended conditional min-entropy, which requires extending the notion of k-superpositive channels to superchannels. On the other hand, we show that for classical-quantum states the separable cone is sufficient to re-cover the asymptotic theory, thereby drawing a strong distinction between the fully and partial quantum settings. We also present operational uses of this framework. We show that the cone restricted min-entropy of a Choi operator captures a measure of entanglement-assisted noiseless classical communication using restricted measurements. We also introduce a novel min-entropy-like quantity that captures the conditions for when one quantum channel can be transformed into another using bistochastic pre-processing. Lastly, we relate this framework to general conic norms and their non-additivity. Throughout this work, we concretely study generalized entropies in resource theories that capture locality and resource theories of coherence/Abelian symmetries.
Understanding the classical communication cost of simulating a quantum channel is a fundamental problem in quantum information theory, which becomes even more intriguing when considering the role of non-locality in quantum information processing. This paper investigates the bidirectional classical communication cost of simulating a bipartite quantum channel assisted by non-signalling correlations, which are permitted across the spatial dimension between the two parties. By introducing non-signalling superchannels, we present lower and upper bounds on the one-shot εεε-error one-way classical communication cost of a bipartite channel via its smooth max-relative entropy of one-way classical communication, and establish that the asymptotic exact cost is given by its max-relative entropy of one-way classical communication. For the bidirectional scenario, we derive semidefinite programming (SDP) formulations for the one-shot exact bidirectional classical communication cost via non-signalling bipartite superchannels. We further introduce a channel's bipartite conditional min-entropy as an efficiently computable lower bound on the asymptotic cost of bidirectional classical communication. Our results in both one-shot and asymptotic settings provide lower bounds on the entanglement-assisted simulation cost in scenarios where entanglement is available to the two parties. Moreover, we propose a seesaw-based algorithm to compute an upper bound on the minimum simulation error via local operations and shared entanglement, which provides valuable insights into the relationship between non-signalling bipartite superchannels and more physically realizable protocols. Numerical experiments demonstrate the effectiveness of our bounds in estimating communication costs for various quantum channels, showing that our bounds can be tight in different scenarios.
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.
What would be a reasonable definition of the conditional entropy of bipartite quantum processes, and what novel insight would it provide? We develop this notion using four information-theoretic axioms and define the corresponding quantitative formulas. Our definitions of the conditional entropies of channels are based on the generalized state and channel divergences, for instance, quantum relative entropy. We find that the conditional entropy of quantum channels has potential to reveal insights for quantum processes that aren't already captured by the existing entropic functions, entropy or conditional entropy, of the states and channels. The von Neumann conditional entropy S[A∣B]NS[A|B]_{\mathcal{N}}S[A∣B]N​ of the channel NA′B′→AB\mathcal{N}_{A'B'\to AB}NA′B′→AB​ is based on the quantum relative entropy, with system pairs A′,AA',AA′,A and B′,BB',BB′,B being nonconditioning and conditioning systems, respectively. We identify a connection between the underlying causal structure of a bipartite channel and its conditional entropy. In particular, we provide a necessary and sufficient condition for a bipartite quantum channel NA′B′→AB\mathcal{N}_{A'B'\to AB}NA′B′→AB​ in terms of its von Neumann conditional entropy S[A∣B]NS[A|B]_{\mathcal{N}}S[A∣B]N​, to have no causal influence from A′A'A′ to BBB. As a consequence, if S[A∣B]N<−log⁡∣A∣S[A|B]_{\mathcal{N}}< -\log|A|S[A∣B]N​<−log∣A∣ then the channel necessarily has causal influence (signaling) from A′A'A′ to BBB. Our definition of the conditional entropy establishes the strong subadditivity of the entropy for quantum channels. We also study the total amount of correlations possible due to quantum processes by defining the multipartite mutual information of quantum channels.