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

IEEE International Symposium on Information Theory (ISIT)

Universal quantum state merging

Igor Bjelaković, Holger Boche, Gisbert Janßen

Published Jul 1, 2011• 0 citations
Publisher

Abstract

We consider quantum state merging under uncertainty of the state held by the merging parties. More precisely we determine the optimal entanglement rate of a merging process when the state is unknown up to membership in a certain set of states. We find that merging is possible at the lowest rate allowed by the individual states.
DOI
10.1109/isit.2011.6034290

Related papers

Universal quantum state merging

I. Bjelaković, H. Boche, G. Janßen

We determine the optimal entanglement rate of quantum state merging when assuming that the state is unknown except for its membership in a certain set of states. We find that merging is possible at the lowest rate allowed by the individual states. Additionally, we establish a lower bound for the classical cost of state merging under state uncertainty. To this end we give an elementary proof for the cost in case of a perfectly known state which makes no use of the “resource framework.” As applications of our main result, we determine the capacity for one-way entanglement distillation if the source is not perfectly known. Moreover, we give another achievability proof for the entanglement generation capacity over compound quantum channels.

arXiv:1106.2850•Journal of Mathematical Physics•Mar 1, 2013•13 citations

Entanglement and Coherence in Quantum State Merging

Alexander Streltsov, Eric Chitambar, Swapan Rana +3 more

Understanding the resource consumption in distributed scenarios is one of the main goals of quantum information theory. A prominent example for such a scenario is the task of quantum state merging, where two parties aim to merge their tripartite quantum state parts. In standard quantum state merging, entanglement is considered to be an expensive resource, while local quantum operations can be performed at no additional cost. However, recent developments show that some local operations could be more expensive than others: it is reasonable to distinguish between local incoherent operations and local operations which can create coherence. This idea leads us to the task of incoherent quantum state merging, where one of the parties has free access to local incoherent operations only. In this case the resources of the process are quantified by pairs of entanglement and coherence. Here, we develop tools for studying this process and apply them to several relevant scenarios. While quantum state merging can lead to a gain of entanglement, our results imply that no merging procedure can gain entanglement and coherence at the same time. We also provide a general lower bound on the entanglement-coherence sum and show that the bound is tight for all pure states. Our results also lead to an incoherent version of Schumacher compression: in this case the compression rate is equal to the von Neumann entropy of the diagonal elements of the corresponding quantum state.

arXiv:1603.07508•Physical Review Letters•Jun 17, 2016•139 citations

Quantum state merging with bound entanglement

Alexander Streltsov

Abstract Quantum state merging is one of the most important protocols in quantum information theory. In this task two parties aim to merge their parts of a pure tripartite state by making use of additional singlets while preserving correlations with a third party. We study a variation of this scenario where the shared state is not necessarily pure, and the merging parties have free access to local operations, classical communication, and positive partial transpose (PPT) entangled states. We provide general conditions for a state to admit perfect merging, and present a family of fully separable states which cannot be perfectly merged if the merging parties have no access to additional singlets. We also show that free PPT entangled states do not give any advantage for merging of pure states, and the conditional entropy plays the same role as in standard quantum state merging quantifying the rate of additional singlets needed to perfectly merge the state.

arXiv:1508.03753•New Journal of Physics•Jan 29, 2020•4 citations

Universal distillation of quantum entanglement

Ryuji Takagi, Kaito Watanabe, Takaya Matsuura +2 more

Distillable entanglement---the maximum rate of Bell states extractable from the given noisy entangled states via local operations and classical communication (LOCC)---has been a central quantity to characterize the operational value of entangled states. However, this operational meaning had been known to be valid only under a crucial assumption: both parties know the description of the input state and can choose the protocol tailored to it, which does not necessarily reflect the natural operational setting. Here, we show that the distillable entanglement is the fundamental operational quantity even without this assumption. We present a universal LOCC protocol---whose description does not depend on the input state and thus works universally for any input---that achieves the distillable entanglement of an arbitrary unknown input state. Our result therefore lifts the distillable entanglement to a robust notion of an operationally meaningful quantity and clarifies that input-state knowledge is not necessary to achieve the optimal rate of entanglement distillation. Our protocol is based on state merging for compound states, together with the uniform convergence property of the finite-block quantity toward distillable entanglement.

quant-pharXiv:2609.40215•Oct 1, 2026•2 citations

Quantum disentanglers

Vladimír Bužek, Mark S. Hillery

It is not possible to disentangle a qubit in an unknown state $|\ensuremath{\psi}〉$ from a set of $N\ensuremath{-}1$ ancilla qubits prepared in a specific reference state $|0〉.$ That is, it is not possible to perfectly perform the transformation $(|\ensuremath{\psi},0,\dots{},0〉+|0,\ensuremath{\psi},\dots{},0〉+\ensuremath{\cdot}\ensuremath{\cdot}\ensuremath{\cdot}+|0,0,\dots{},\ensuremath{\psi}〉)\ensuremath{\rightarrow}|0,\dots{},0〉\ensuremath{\bigotimes}|\ensuremath{\psi}〉.$ The question is then how well we can do? We consider a number of different methods of extracting an unknown state from an entangled state formed from that qubit and a set of ancilla qubits in a known state. Measuring the whole system is, as expected, the least effective method. We present various quantum ``devices'' which disentangle the unknown qubit from the set of ancilla qubits. In particular, we present the optimal universal disentangler which disentangles the unknown qubit with a fidelity that does not depend on the state of the qubit, and a probabilistic disentangler which performs the perfect disentangling transformation, but with a probability less than 1.

arXiv:quant-ph/0006047•Physical Review A•Oct 11, 2000•8 citations

Single-shot Quantum State Merging

Mario Berta

We consider an unknown quantum state shared between two parties, Alice and Bob, and ask how much quantum communication is needed to transfer the full state to Bob. This problem is known as state merging and was introduced in [Horodecki et al., Nature, 436, 673 (2005)]. It has been shown that for free classical communication the minimal number of quantum bits that need to be sent from Alice to Bob is given by the conditional von Neumann entropy. However this result only holds asymptotically (in the sense that Alice and Bob share initially many identical copies of the state) and it was unclear how much quantum communication is necessary to merge a single copy. We show that the minimal amount of quantum communication needed to achieve this single-shot state merging is given by minus the smooth conditional min-entropy of Alice conditioned on the environment. This gives an operational meaning to the smooth conditional min-entropy.

arXiv:0912.4495•Dec 22, 2009•108 citations
We determine the optimal entanglement rate of quantum state merging when assuming that the state is unknown except for its membership in a certain set of states. We find that merging is possible at the lowest rate allowed by the individual states. Additionally, we establish a lower bound for the classical cost of state merging under state uncertainty. To this end we give an elementary proof for the cost in case of a perfectly known state which makes no use of the “resource framework.” As applications of our main result, we determine the capacity for one-way entanglement distillation if the source is not perfectly known. Moreover, we give another achievability proof for the entanglement generation capacity over compound quantum channels.
Understanding the resource consumption in distributed scenarios is one of the main goals of quantum information theory. A prominent example for such a scenario is the task of quantum state merging, where two parties aim to merge their tripartite quantum state parts. In standard quantum state merging, entanglement is considered to be an expensive resource, while local quantum operations can be performed at no additional cost. However, recent developments show that some local operations could be more expensive than others: it is reasonable to distinguish between local incoherent operations and local operations which can create coherence. This idea leads us to the task of incoherent quantum state merging, where one of the parties has free access to local incoherent operations only. In this case the resources of the process are quantified by pairs of entanglement and coherence. Here, we develop tools for studying this process and apply them to several relevant scenarios. While quantum state merging can lead to a gain of entanglement, our results imply that no merging procedure can gain entanglement and coherence at the same time. We also provide a general lower bound on the entanglement-coherence sum and show that the bound is tight for all pure states. Our results also lead to an incoherent version of Schumacher compression: in this case the compression rate is equal to the von Neumann entropy of the diagonal elements of the corresponding quantum state.
Abstract Quantum state merging is one of the most important protocols in quantum information theory. In this task two parties aim to merge their parts of a pure tripartite state by making use of additional singlets while preserving correlations with a third party. We study a variation of this scenario where the shared state is not necessarily pure, and the merging parties have free access to local operations, classical communication, and positive partial transpose (PPT) entangled states. We provide general conditions for a state to admit perfect merging, and present a family of fully separable states which cannot be perfectly merged if the merging parties have no access to additional singlets. We also show that free PPT entangled states do not give any advantage for merging of pure states, and the conditional entropy plays the same role as in standard quantum state merging quantifying the rate of additional singlets needed to perfectly merge the state.
Distillable entanglement---the maximum rate of Bell states extractable from the given noisy entangled states via local operations and classical communication (LOCC)---has been a central quantity to characterize the operational value of entangled states. However, this operational meaning had been known to be valid only under a crucial assumption: both parties know the description of the input state and can choose the protocol tailored to it, which does not necessarily reflect the natural operational setting. Here, we show that the distillable entanglement is the fundamental operational quantity even without this assumption. We present a universal LOCC protocol---whose description does not depend on the input state and thus works universally for any input---that achieves the distillable entanglement of an arbitrary unknown input state. Our result therefore lifts the distillable entanglement to a robust notion of an operationally meaningful quantity and clarifies that input-state knowledge is not necessary to achieve the optimal rate of entanglement distillation. Our protocol is based on state merging for compound states, together with the uniform convergence property of the finite-block quantity toward distillable entanglement.
It is not possible to disentangle a qubit in an unknown state $|\ensuremath{\psi}〉$ from a set of $N\ensuremath{-}1$ ancilla qubits prepared in a specific reference state ∣0〉.|0〉.∣0〉. That is, it is not possible to perfectly perform the transformation $(|\ensuremath{\psi},0,\dots{},0〉+|0,\ensuremath{\psi},\dots{},0〉+\ensuremath{\cdot}\ensuremath{\cdot}\ensuremath{\cdot}+|0,0,\dots{},\ensuremath{\psi}〉)\ensuremath{\rightarrow}|0,\dots{},0〉\ensuremath{\bigotimes}|\ensuremath{\psi}〉.$ The question is then how well we can do? We consider a number of different methods of extracting an unknown state from an entangled state formed from that qubit and a set of ancilla qubits in a known state. Measuring the whole system is, as expected, the least effective method. We present various quantum ``devices'' which disentangle the unknown qubit from the set of ancilla qubits. In particular, we present the optimal universal disentangler which disentangles the unknown qubit with a fidelity that does not depend on the state of the qubit, and a probabilistic disentangler which performs the perfect disentangling transformation, but with a probability less than 1.
We consider an unknown quantum state shared between two parties, Alice and Bob, and ask how much quantum communication is needed to transfer the full state to Bob. This problem is known as state merging and was introduced in [Horodecki et al., Nature, 436, 673 (2005)]. It has been shown that for free classical communication the minimal number of quantum bits that need to be sent from Alice to Bob is given by the conditional von Neumann entropy. However this result only holds asymptotically (in the sense that Alice and Bob share initially many identical copies of the state) and it was unclear how much quantum communication is necessary to merge a single copy. We show that the minimal amount of quantum communication needed to achieve this single-shot state merging is given by minus the smooth conditional min-entropy of Alice conditioned on the environment. This gives an operational meaning to the smooth conditional min-entropy.