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/0311133 · IEEE Transactions on Information Theory

The existence of quantum entanglement catalysts

Xiaoming Sun, Runyao Duan, Mingsheng Ying

Published Jan 1, 2005• 26 citations
arXivHTMLPDF

Abstract

Without additional resources, it is often impossible to transform one entangled quantum state into another with local quantum operations and classical communication. Jonathan and Plenio (Phys. Rev. Lett., vol. 83, p. 3566, 1999) presented an interesting example showing that the presence of another state, called a catalyst, enables such a transformation without changing the catalyst. They also pointed out that in general it is very hard to find an analytical condition under which a catalyst exists. In this paper, we study the existence of catalysts for two incomparable quantum states. For the simplest case of 2/spl times/2 catalysts for transformations from one 4/spl times/4 state to another, a necessary and sufficient condition for existence is found. For the general case, we give an efficient polynomial time algorithm to decide whether a k/spl times/k catalyst exists for two n/spl times/n incomparable states, where k is treated as a constant.

DOI
10.1109/tit.2004.839477

Related papers

General entanglement-assisted transformation for bipartite pure quantum states

Wei Song, Yan Hua Huang, Nai-Le Liu +1 more

We introduce the general catalysts for pure entanglement transformations under local operations and classical communications in such a way that we disregard the profit and loss of entanglement of the catalysts per se. As such, the possibilities of pure entanglement transformations are greatly expanded. Remarkably, we find an interesting phenomenon that, in some situations, incomparable pairs ${| ψ> ,| ϕ> \} $ and ${| χ> ,| χ^{\prime}> \} $ can assist each other mutually so as to realize the transformation $| ψ> | χ> \to| ϕ> | χ^{\prime}>$. We also design an efficient algorithm to detect whether a $k\times k$ general catalyst exists for a given entanglement transformation. This algorithm can as well be exploited to witness the existence of standard catalysts.

arXiv:quant-ph/0603085•Journal of Physics A Mathematical and Theoretical•Jan 9, 2007•2 citations

Efficient entanglement-assisted transformation for bipartite pure states

Somshubhro Bandyopadhyay, Vwani Roychowdhury

We show that entanglement-assisted transformations of bipartite entangled states can be more efficient than catalysis [Jonathan and Plenio, Phys. Rev. Lett. 83, 3566 (1999)], i.e., given two incomparable bipartite states not only can the transformation be enabled by performing collective operations with an auxiliary entangled state, but the entanglement of the auxiliary state itself can be enhanced. We refer to this phenomenon as supercatalysis. We provide results on the properties of supercatalysis and its relationship with catalysis. In particular, we obtain a useful necessary and sufficient condition for catalysis, and provide several sufficient conditions for supercatalysis and study the extent to which entanglement of the auxiliary state can be enhanced via supercatalysis.

arXiv:quant-ph/0107101•Physical Review A•Mar 21, 2002•12 citations

Catalyst-Assisted Probabilistic Entanglement Transformation

Y. Feng, Runyao Duan, Mingsheng Ying

We are concerned with catalyst-assisted probabilistic entanglement transformations. A necessary and sufficient condition is presented under which there exist partial catalysts that can increase the maximal transforming probability of a given entanglement transformation. We also design an algorithm which leads to an efficient method for finding the most economical partial catalysts with minimal dimension. The mathematical structure of catalyst-assisted probabilistic transformation is carefully investigated.

arXiv:quant-ph/0404154•IEEE Transactions on Information Theory•Feb 28, 2005•21 citations

Partial recovery of quantum entanglement

Runyao Duan, Yuan Feng, Mingsheng Ying

Suppose Alice and Bob try to transform an entangled state shared between them into another one by local operations and classical communications. Then in general a certain amount of entanglement contained in the initial state will decrease in the process of transformation. However, an interesting phenomenon called partial entanglement recovery shows that it is possible to recover some amount of entanglement by adding another entangled state and transforming the two entangled states collectively. In this paper, we are mainly concerned with the feasibility of partial entanglement recovery. The basic problem we address is whether a given state is useful in recovering entanglement lost in a specified transformation. In the case where the source and target states of the original transformation satisfy the strict majorization relation, a necessary and sufficient condition for partial entanglement recovery is obtained. For the general case we give two sufficient conditions. We also give an efficient algorithm for the feasibility of partial entanglement recovery in polynomial time. As applications, we establish some interesting connections between partial entanglement recovery and the generation of maximally entangled states, quantum catalysis, mutual catalysis, and multiple-copy entanglement transformation.

arXiv:quant-ph/0404047•IEEE Transactions on Information Theory•Jul 1, 2006•5 citations

Mutual catalysis of entanglement transformations for pure entangled states

Xun‐Li Feng, Zhongyang Wang, Zhizhan Xu

We study the mutual catalysis of entanglement transformations, which refers to the fact that each of the two entanglement transformations cannot occur with certainty by local operations and classical communication independently, but both can occur jointly if collective local operations are performed on both of the initial entangled states. We surprisingly find that mutually catalyzed transformations can be realized even in the case when the standard entanglement catalyzed transformations [D. Jonathan and M. B. Plenio, Phys. Rev. Lett. 83, 3566 (1999)] are forbidden.

Physical Review A•Jan 4, 2002•10 citations

Necessary conditions for entanglement catalysts

Yuval R. Sanders, Gilad Gour

Given a pure state transformation $\ensuremath{\psi}\ensuremath{\mapsto}\ensuremath{\phi}$ restricted to entanglement-assisted local operations with classical communication, we determine a lower bound for the dimension of a catalyst allowing that transformation. Our bound is stated in terms of the generalized concurrence monotones (the usual concurrence of two qubits is one such monotone). We further provide tools for deriving further conditions upon catalysts of pure state transformations.

arXiv:0904.2048•Physical Review A•May 6, 2009•26 citations
Without additional resources, it is often impossible to transform one entangled quantum state into another with local quantum operations and classical communication. Jonathan and Plenio (Phys. Rev. Lett., vol. 83, p. 3566, 1999) presented an interesting example showing that the presence of another state, called a catalyst, enables such a transformation without changing the catalyst. They also pointed out that in general it is very hard to find an analytical condition under which a catalyst exists. In this paper, we study the existence of catalysts for two incomparable quantum states. For the simplest case of 2/spl times/2 catalysts for transformations from one 4/spl times/4 state to another, a necessary and sufficient condition for existence is found. For the general case, we give an efficient polynomial time algorithm to decide whether a k/spl times/k catalyst exists for two n/spl times/n incomparable states, where k is treated as a constant.
We introduce the general catalysts for pure entanglement transformations under local operations and classical communications in such a way that we disregard the profit and loss of entanglement of the catalysts per se. As such, the possibilities of pure entanglement transformations are greatly expanded. Remarkably, we find an interesting phenomenon that, in some situations, incomparable pairs ${| ψ> ,| ϕ> \} $ and ${| χ> ,| χ^{\prime}> \} $ can assist each other mutually so as to realize the transformation ∣ψ>∣χ>→∣ϕ>∣χ′>| ψ> | χ> \to| ϕ> | χ^{\prime}>∣ψ>∣χ>→∣ϕ>∣χ′>. We also design an efficient algorithm to detect whether a k×kk\times kk×k general catalyst exists for a given entanglement transformation. This algorithm can as well be exploited to witness the existence of standard catalysts.
We show that entanglement-assisted transformations of bipartite entangled states can be more efficient than catalysis [Jonathan and Plenio, Phys. Rev. Lett. 83, 3566 (1999)], i.e., given two incomparable bipartite states not only can the transformation be enabled by performing collective operations with an auxiliary entangled state, but the entanglement of the auxiliary state itself can be enhanced. We refer to this phenomenon as supercatalysis. We provide results on the properties of supercatalysis and its relationship with catalysis. In particular, we obtain a useful necessary and sufficient condition for catalysis, and provide several sufficient conditions for supercatalysis and study the extent to which entanglement of the auxiliary state can be enhanced via supercatalysis.
We are concerned with catalyst-assisted probabilistic entanglement transformations. A necessary and sufficient condition is presented under which there exist partial catalysts that can increase the maximal transforming probability of a given entanglement transformation. We also design an algorithm which leads to an efficient method for finding the most economical partial catalysts with minimal dimension. The mathematical structure of catalyst-assisted probabilistic transformation is carefully investigated.
Suppose Alice and Bob try to transform an entangled state shared between them into another one by local operations and classical communications. Then in general a certain amount of entanglement contained in the initial state will decrease in the process of transformation. However, an interesting phenomenon called partial entanglement recovery shows that it is possible to recover some amount of entanglement by adding another entangled state and transforming the two entangled states collectively. In this paper, we are mainly concerned with the feasibility of partial entanglement recovery. The basic problem we address is whether a given state is useful in recovering entanglement lost in a specified transformation. In the case where the source and target states of the original transformation satisfy the strict majorization relation, a necessary and sufficient condition for partial entanglement recovery is obtained. For the general case we give two sufficient conditions. We also give an efficient algorithm for the feasibility of partial entanglement recovery in polynomial time. As applications, we establish some interesting connections between partial entanglement recovery and the generation of maximally entangled states, quantum catalysis, mutual catalysis, and multiple-copy entanglement transformation.
We study the mutual catalysis of entanglement transformations, which refers to the fact that each of the two entanglement transformations cannot occur with certainty by local operations and classical communication independently, but both can occur jointly if collective local operations are performed on both of the initial entangled states. We surprisingly find that mutually catalyzed transformations can be realized even in the case when the standard entanglement catalyzed transformations [D. Jonathan and M. B. Plenio, Phys. Rev. Lett. 83, 3566 (1999)] are forbidden.
Given a pure state transformation $\ensuremath{\psi}\ensuremath{\mapsto}\ensuremath{\phi}$ restricted to entanglement-assisted local operations with classical communication, we determine a lower bound for the dimension of a catalyst allowing that transformation. Our bound is stated in terms of the generalized concurrence monotones (the usual concurrence of two qubits is one such monotone). We further provide tools for deriving further conditions upon catalysts of pure state transformations.