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:2104.03452 · The European Physical Journal Plus

Unified catalytic entropy principles of general states

Ming‐Xing Luo, Xiaojun Wang

Published Feb 14, 2024• 2 citations
arXivHTMLPDF
DOI
10.1140/epjp/s13360-024-04972-z

Related papers

Classical entropy of quasi-free states

Horia Scutaru

Physics Letters A•Apr 1, 1995•6 citations

Delocalized and dynamical catalytic randomness and information flow

Seok Hyung Lie, Hyunseok Jeong

We generalize the theory of catalytic quantum randomness to distributed and dynamical settings. First, we expand the theory of catalytic quantum randomness by calculating the amount of (R\'enyi) entropy catalytically extractable from a distributed or dynamical randomness source. We show that no entropy can be catalytically extracted when one cannot implement local projective measurement on randomness source without altering its state. As an application, we prove that quantum operation cannot be hidden in correlation between two parties without using randomness, which is the dynamical generalization of the no-hiding theorem. Moreover, the formalism of distributed catalysis is applied to develop a formal definition of semantic quantum information and it follows that utilizing semantic information is equivalent to catalysis using a catalyst already correlated with the transforming system. By doing so, we unify the utilization of semantic and nonsemantic quantum information and conclude that one can always extract more information from an incompletely depleted classical randomness source, but it is not possible for quantum randomness sources.

arXiv:2206.11469•Physical Review A•Apr 24, 2023•5 citations

Robustness of quantum data hiding against entangled catalysts and memory

Aby Philip, Alexander Streltsov

Quantum data hiding stores classical information in bipartite quantum states that are, in principle, perfectly distinguishable, yet remain almost indistinguishable without access to a quantum communication channel. Here, we investigate whether this limitation can be overcome when the communicating parties are assisted by additional quantum resources. We develop a general framework for state discrimination that unifies catalytic and memory-assisted local discrimination protocols and analyze their power to reveal hidden information. We prove that when the hiding states are separable, neither entangled catalysts nor quantum memory can increase the optimal discrimination probability, establishing the robustness of separable data-hiding schemes. In contrast, for some entangled states, a reusable quantum memory turns locally indistinguishable states into ones that can be discriminated almost perfectly. Our results delineate the fundamental limits of catalytic and memory-assisted state discrimination and identify separable encodings as a robust strategy for quantum data hiding.

quant-pharXiv:2511.04408•Nov 7, 2025•4 citations

The entropy density of quasi free states

M. Fannes

Communications in Mathematical Physics•Dec 1, 1973•15 citations

Catalytic quantum randomness as a correlational resource

Seok Hyung Lie, Hyunseok Jeong

Catalysts are substances that assist transformation of other resourceful objects without being consumed in the process. However, the fact that their ``catalytic power'' is limited and can be depleted is often overlooked, especially in the recently developing theories on catalysis of quantum randomness utilizing building correlation with catalyst. In this work, we establish a resource theory of one-shot catalytic randomness in which uncorrelatedness is consumed in catalysis of randomness. We do so by completely characterizing bipartite unitary operators that can be used to implement catalysis of randomness using partial transpose. By doing so, we find that every catalytic channel is factorizable, and therefore there exists a unital channel that is not catalytic. We define a family of catalytic entropies that quantifies catalytically extractable R\'enyi entropies from a quantum state and show how much the degeneracy of a quantum state can boost the catalytic entropy beyond its ordinary entropy. Based on this, we demonstrate that a randomness source can be actually exhausted after a certain amount of randomness is extracted. We apply this theory to systems under superselection rules that forbids superposition of certain quantum states and find that nonmaximally mixed states can yield the maximal catalytic entropy. We discuss implications of this theory to various topics, including catalytic randomness absorption, the no-secret theorem, and the possibility of multiparty infinite catalysis.

arXiv:2104.00300•Physical Review Research•Oct 29, 2021•16 citations

Maximum entropy and approximate descriptions of pure states

Angel Ricardo Plastino, Angel Ricardo Plastino

Physics Letters A•Nov 1, 1993•55 citations
We generalize the theory of catalytic quantum randomness to distributed and dynamical settings. First, we expand the theory of catalytic quantum randomness by calculating the amount of (R\'enyi) entropy catalytically extractable from a distributed or dynamical randomness source. We show that no entropy can be catalytically extracted when one cannot implement local projective measurement on randomness source without altering its state. As an application, we prove that quantum operation cannot be hidden in correlation between two parties without using randomness, which is the dynamical generalization of the no-hiding theorem. Moreover, the formalism of distributed catalysis is applied to develop a formal definition of semantic quantum information and it follows that utilizing semantic information is equivalent to catalysis using a catalyst already correlated with the transforming system. By doing so, we unify the utilization of semantic and nonsemantic quantum information and conclude that one can always extract more information from an incompletely depleted classical randomness source, but it is not possible for quantum randomness sources.
Quantum data hiding stores classical information in bipartite quantum states that are, in principle, perfectly distinguishable, yet remain almost indistinguishable without access to a quantum communication channel. Here, we investigate whether this limitation can be overcome when the communicating parties are assisted by additional quantum resources. We develop a general framework for state discrimination that unifies catalytic and memory-assisted local discrimination protocols and analyze their power to reveal hidden information. We prove that when the hiding states are separable, neither entangled catalysts nor quantum memory can increase the optimal discrimination probability, establishing the robustness of separable data-hiding schemes. In contrast, for some entangled states, a reusable quantum memory turns locally indistinguishable states into ones that can be discriminated almost perfectly. Our results delineate the fundamental limits of catalytic and memory-assisted state discrimination and identify separable encodings as a robust strategy for quantum data hiding.
Catalysts are substances that assist transformation of other resourceful objects without being consumed in the process. However, the fact that their ``catalytic power'' is limited and can be depleted is often overlooked, especially in the recently developing theories on catalysis of quantum randomness utilizing building correlation with catalyst. In this work, we establish a resource theory of one-shot catalytic randomness in which uncorrelatedness is consumed in catalysis of randomness. We do so by completely characterizing bipartite unitary operators that can be used to implement catalysis of randomness using partial transpose. By doing so, we find that every catalytic channel is factorizable, and therefore there exists a unital channel that is not catalytic. We define a family of catalytic entropies that quantifies catalytically extractable R\'enyi entropies from a quantum state and show how much the degeneracy of a quantum state can boost the catalytic entropy beyond its ordinary entropy. Based on this, we demonstrate that a randomness source can be actually exhausted after a certain amount of randomness is extracted. We apply this theory to systems under superselection rules that forbids superposition of certain quantum states and find that nonmaximally mixed states can yield the maximal catalytic entropy. We discuss implications of this theory to various topics, including catalytic randomness absorption, the no-secret theorem, and the possibility of multiparty infinite catalysis.