PPT Entanglement with Correlated Catalysis: Monotones and Irreversibility
Jingsong Ao, Aby Philip, Alexander Streltsov
Abstract
Quantum catalysts can overcome otherwise impossible quantum state transformations without being consumed, and allowing them to become correlated with the output makes this assistance substantially more powerful. This raises a fundamental question for entanglement theory: which limitations on state manipulation remain when such correlated catalysts are freely available? We answer this question in the positive-partial-transpose (PPT) resource theory, which allows a substantially broader class of operations than local operations and classical communication (LOCC). We identify general conditions under which regularized relative-entropy measures become strongly superadditive, and use them to construct monotones that constrain correlated catalytic PPT transformations without any knowledge of the catalyst. In particular, we prove that the regularized PPT relative entropy is fully additive and strongly superadditive, resolving an open problem in entanglement theory. Most importantly, these constraints show that even arbitrary correlated catalysts cannot restore asymptotic reversibility: for an explicit state, the optimal entanglement distillation rate remains strictly smaller than the entanglement cost. Thus, substantial catalytic assistance does not remove some of the fundamental limitations of mixed-state entanglement manipulation.
Create a lesson
Related papers
Continuous variable distributed quantum sensing in integrated photonics
Bethany Puzio, Oliver M. Green, Joel F. Tasker et al.
Securing quantum error correction against misleading advice from AI agents
A. Barış Özgüler
Exact logical error rates for magic state cultivation
Kwok Ho Wan, Ainhoa Zapirain
Hamiltonian engineering via pulses: beyond group averaging
Ivan Beschastnyi, Lucah Patel, David Tinoco
Logarithmic-depth quantum simulation of boson sampling
Changhun Oh
Entanglement swapping across a five-node relay in a multiplexed quantum-classical network
Andrew R. Cameron, Jordan M. Thomas, Alexandru Macridin et al.