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:quant-ph/0302139

Compressing compound states

Michał Horodecki, Paweł Horodecki, Jonathan Oppenheim

Published Feb 19, 2003• 2 citations
arXivHTMLPDF

Abstract

Quantum compression can be thought of not only as compression of a signal, but also as a form of cooling. In this view, one is interested not in the signal, but in obtaining purity. In compound systems, one may be interested to cool the system to obtain {\it local purity} by use of local operations and classical communication [Oppenheim et al. Phys. Rev. Lett. 89,180402 (2002)]. Here we compare it with usual compression and find that it can be represented as compression with suitably restricted means.

DOI
10.48550/arxiv.quant-ph/0302139

Related papers

Compression of Quantum Information

Michał Horodecki

We review the theory of compression of quantum information. In particular, compression of pure as well as mixed signal states is presented in unified framework. Open problems and perspectives are discussed.

Fortschritte der Physik•Jul 1, 2001•1 citation

Distillation of local purity from quantum states

Igor Devetak

Recently Horodecki et al. [Phys. Rev. Lett. 90, 100402 (2003)] introduced an important quantum information processing paradigm, in which two parties sharing many copies of the same bipartite quantum state distill local pure states by means of local unitary operations assisted by a one-way (two-way) completely dephasing channel. Local pure states are a valuable resource from a thermodynamical point of view, since they allow thermal energy to be converted into work by local quantum heat engines. We give a simple information-theoretical characterization of the one-way distillable local purity, which turns out to be closely related to a previously known operational measure of classical correlations, the one-way distillable common randomness.

arXiv:quant-ph/0406234•Physical Review A•Jun 7, 2005•79 citations

Entanglement manipulation of multipartite pure states with finite rounds of classical communication

Julio I. de Vicente, Cornelia Spee, David Sauerwein +1 more

We studied pure state transformations using local operations assisted by finitely many rounds of classical communication (${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$) [C. Spee, J. I. de Vicente, D. Sauerwein, and B. Kraus [Phys. Rev. Lett. (to be published)], arXiv:1606.04418]. Here, we present the details of some of the proofs and generalize the construction of examples of state transformations via ${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$ which require a probabilistic step. However, we also present explicit examples of SLOCC classes where any separable transformation can be realized by a protocol in which each step is deterministic (all-det-${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$). Such transformations can be considered as natural generalizations of bipartite transformations. Furthermore, we provide examples of pure state transformations which are possible via separable transformations, but not via ${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$. We also analyze an interesting genuinely multipartite effect which we call locking or unlocking the power of other parties. This means that one party can prevent or enable the implementation of LOCC transformations by other parties. Moreover, we investigate the maximally entangled set restricted to ${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$ and show how easily computable bounds on some entanglement measures can be derived by restricting to ${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$.

arXiv:1607.05145•Physical Review A•Jan 23, 2017•56 citations

Lossless Quantum Compression

Caroline Rogers, Rajagopal Nagarajan

We describe lossless quantum compression of unknown mixtures (of non-orthogonal states) and give an expression of the optimal rate of compression.

arXiv:quant-ph/0508170•Aug 23, 2005•2 citations

Protecting the Quantum Interference of Cat States by Phase-Space Compression

Xiaozhou Pan, Jonathan Schwinger, Ni-Ni Huang +7 more

Compressing the spectral content of quantum interference features in Schr\"odinger cat states to lower frequencies protects them against photon loss and preserves the most valuable characteristics that enable many quantum technologies.

arXiv:2212.01271•Physical Review X•Apr 7, 2023•42 citations

Quantum Communication Using Coherent Rejection Sampling

Anurag Anshu, Vamsi Krishna Devabathini, Rahul Jain

Compression of a message up to the information it carries is key to many tasks involved in classical and quantum information theory. Schumacher [B. Schumacher, Phys. Rev. A 51, 2738 (1995)PLRAAN1050-294710.1103/PhysRevA.51.2738] provided one of the first quantum compression schemes and several more general schemes have been developed ever since [M. Horodecki, J. Oppenheim, and A. Winter, Commun. Math. Phys. 269, 107 (2007); CMPHAY0010-361610.1007/s00220-006-0118-xI. Devetak and J. Yard, Phys. Rev. Lett. 100, 230501 (2008); PRLTAO0031-900710.1103/PhysRevLett.100.230501A. Abeyesinghe, I. Devetak, P. Hayden, and A. Winter, Proc. R. Soc. A 465, 2537 (2009)PRLAAZ1364-502110.1098/rspa.2009.0202]. However, the one-shot characterization of these quantum tasks is still under development, and often lacks a direct connection with analogous classical tasks. Here we show a new technique for the compression of quantum messages with the aid of entanglement. We devise a new tool that we call the convex split lemma, which is a coherent quantum analogue of the widely used rejection sampling procedure in classical communication protocols. As a consequence, we exhibit new explicit protocols with tight communication cost for quantum state merging, quantum state splitting, and quantum state redistribution (up to a certain optimization in the latter case). We also present a port-based teleportation scheme which uses a fewer number of ports in the presence of information about input.

arXiv:1410.3031•Physical Review Letters•Sep 21, 2017•90 citations
Quantum compression can be thought of not only as compression of a signal, but also as a form of cooling. In this view, one is interested not in the signal, but in obtaining purity. In compound systems, one may be interested to cool the system to obtain {\it local purity} by use of local operations and classical communication [Oppenheim et al. Phys. Rev. Lett. 89,180402 (2002)]. Here we compare it with usual compression and find that it can be represented as compression with suitably restricted means.
Recently Horodecki et al. [Phys. Rev. Lett. 90, 100402 (2003)] introduced an important quantum information processing paradigm, in which two parties sharing many copies of the same bipartite quantum state distill local pure states by means of local unitary operations assisted by a one-way (two-way) completely dephasing channel. Local pure states are a valuable resource from a thermodynamical point of view, since they allow thermal energy to be converted into work by local quantum heat engines. We give a simple information-theoretical characterization of the one-way distillable local purity, which turns out to be closely related to a previously known operational measure of classical correlations, the one-way distillable common randomness.
We studied pure state transformations using local operations assisted by finitely many rounds of classical communication (LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​) [C. Spee, J. I. de Vicente, D. Sauerwein, and B. Kraus [Phys. Rev. Lett. (to be published)], arXiv:1606.04418]. Here, we present the details of some of the proofs and generalize the construction of examples of state transformations via LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​ which require a probabilistic step. However, we also present explicit examples of SLOCC classes where any separable transformation can be realized by a protocol in which each step is deterministic (all-det-LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​). Such transformations can be considered as natural generalizations of bipartite transformations. Furthermore, we provide examples of pure state transformations which are possible via separable transformations, but not via LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​. We also analyze an interesting genuinely multipartite effect which we call locking or unlocking the power of other parties. This means that one party can prevent or enable the implementation of LOCC transformations by other parties. Moreover, we investigate the maximally entangled set restricted to LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​ and show how easily computable bounds on some entanglement measures can be derived by restricting to LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​.
Compression of a message up to the information it carries is key to many tasks involved in classical and quantum information theory. Schumacher [B. Schumacher, Phys. Rev. A 51, 2738 (1995)PLRAAN1050-294710.1103/PhysRevA.51.2738] provided one of the first quantum compression schemes and several more general schemes have been developed ever since [M. Horodecki, J. Oppenheim, and A. Winter, Commun. Math. Phys. 269, 107 (2007); CMPHAY0010-361610.1007/s00220-006-0118-xI. Devetak and J. Yard, Phys. Rev. Lett. 100, 230501 (2008); PRLTAO0031-900710.1103/PhysRevLett.100.230501A. Abeyesinghe, I. Devetak, P. Hayden, and A. Winter, Proc. R. Soc. A 465, 2537 (2009)PRLAAZ1364-502110.1098/rspa.2009.0202]. However, the one-shot characterization of these quantum tasks is still under development, and often lacks a direct connection with analogous classical tasks. Here we show a new technique for the compression of quantum messages with the aid of entanglement. We devise a new tool that we call the convex split lemma, which is a coherent quantum analogue of the widely used rejection sampling procedure in classical communication protocols. As a consequence, we exhibit new explicit protocols with tight communication cost for quantum state merging, quantum state splitting, and quantum state redistribution (up to a certain optimization in the latter case). We also present a port-based teleportation scheme which uses a fewer number of ports in the presence of information about input.