# Embezzling Entangled Quantum States

@inproceedings{Dam2002EmbezzlingEQ, title={Embezzling Entangled Quantum States}, author={Wim van Dam and Patrick M. Hayden}, year={2002} }

We show that in the presence of arbitrary catalysts, any pure bipartite entangled state can be converted into any other to unlimited accuracy without the use of any communication, quantum or classical. The interconvertibility of entangled quantum states is an important question in quantum information theory, both for its own sake and because of its connec-tions to quantum error correction [2], quantum cryptography [5] and quantum communication complexity [1]. In 1999, Nielsen and Hardy supplied…

## Figures from this paper

## 11 Citations

### Quantum Teleportation and Super-Dense Coding in Operator Algebras

- MathematicsInternational Mathematics Research Notices
- 2019

We show for any $d,m\ge 2$ with $(d,m)\neq (2,2)$, the matrix-valued generalization of the (tensor product) quantum correlation set of $d$ inputs and $m$ outputs is not closed. Our argument uses a…

### Multi-Party Quantum Purity Distillation with Bounded Classical Communication

- Computer Science2022 IEEE International Symposium on Information Theory (ISIT)
- 2022

A protocol is provided for three parties, Alice, Bob and Charlie, to distill local purity from many independent copies of a given quantum state ρ<sup>ABC</sup>, to minimize the usage of the dephasing channel while maximizing the asymptotic purity.

### Separation of quantum, spatial quantum, and approximate quantum correlations

- MathematicsQuantum
- 2021

Quantum nonlocal correlations are generated by implementation of local quantum measurements on spatially separated quantum subsystems. Depending on the underlying mathematical model, various notions…

### A G ] 2 2 A ug 2 01 9 A generalization of Strassen ’ s Positivstellensatz

- Mathematics
- 2019

Strassen’s Positivstellensatz is a powerful but little known theorem on preordered commutative semirings satisfying a boundedness condition similar to Archimedeanicity. It characterizes the relaxed…

### A generalization of Strassen’s Positivstellensatz

- Mathematics
- 2018

Abstract Strassen’s Positivstellensatz is a powerful but little known theorem on preordered commutative semirings satisfying a boundedness condition similar to Archimedeanicity. It characterizes the…

### A generalization of Strassen's Positivstellensatz and its application to large deviation theory

- Mathematics
- 2018

Strassen's Positivstellensatz is a powerful but little known theorem on preordered commutative semirings satisfying a boundedness condition similar to Archimedeanicity. It characterizes the relaxed…

### Universal quantum computation in a hidden basis

- Computer Science, MathematicsQuantum Inf. Comput.
- 2010

The results to quantum-public-key authentication protocols are applied, by showing that anatural class of digital signature schemes for classical messages is insecure and an efficient algorithm for state preparation that is efficient for some classes of states (e.g. symmetric states).

### Quantum entanglement as a new information processing resource

- Physics, Computer ScienceNew Generation Computing
- 2009

This paper focuses on this new physical resource and on its various, sometimes even mysterious, consequences and impacts on computations and communications, and on the understanding of the structure, laws and limitations of entanglement itself.

### Entanglement distillation : a discourse on bound entanglement in quantum information theory

- Physics
- 2006

This thesis covers in a unified way the material presented in quant-ph/0403073,quantity/0502040, quant-Ph/0504160, quants/0510035, quant/0512012 and quant- ph/0603283.

## References

SHOWING 1-10 OF 10 REFERENCES

### METHOD OF AREAS FOR MANIPULATING THE ENTANGLEMENT PROPERTIES OF ONE COPY OF A TWO-PARTICLE PURE ENTANGLED STATE

- Mathematics
- 1999

We consider the problem of how to manipulate the entanglement properties of a general two-particle pure state, shared between Alice and Bob, by using only local operations at each end and classical…

### Conditions for a Class of Entanglement Transformations

- Physics
- 1999

Suppose Alice and Bob jointly possess a pure state, |ψ〉. Using local operations on their respective systems and classical communication it may be possible for Alice and Bob to transform |ψ〉 into…

### A continuity property of the entropy density for spin lattice systems

- Mathematics
- 1973

The entropy density of spin lattice systems is known to be a weak upper semi-continuous functional on the set of the lattice invariant states. (It is even weak discontinuous.) However we prove here…

### Quantum cryptography based on Bell's theorem.

- Mathematics, PhysicsPhysical review letters
- 1991

Practical application of the generalized Bells theorem in the so-called key distribution process in cryptography is reported. The proposed scheme is based on the Bohms version of the…

### Entanglement-Assisted Local Manipulation of Pure Quantum States

- Physics
- 1999

We demonstrate that local transformations on a composite quantum system can be enhanced in the presence of certain entangled states. These extra states act much like catalysts in a chemical reaction:…

### Entanglement of pure states for a single copy

- Computer Science
- 1999

A quantification of such an entanglement of a single copy of a pure state is proposed by means of a finite minimal set of new measures from which the optimal probability of conversion follows.

### Approximate transformations and robust manipulation of bipartite pure-state entanglement

- Physics
- 2000

We analyze approximate transformations of pure entangled quantum states by local operations and classical communication, finding explicit conversion strategies which optimize the fidelity of…

### The quantum communication complexity of sampling

- Computer Science, MathematicsProceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- 1998

An exponential gap is established between quantum and classical sampling complexity, for the set disjointness function, which is the first exponential gap for any task where the classical probabilistic algorithm is allowed to err.

### Quantum Entanglement and the Communication Complexity of the Inner Product Function

- Computer ScienceQCQC
- 1998

We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of particles in an entangled quantum…

### Mixedstate entanglement and quantum error correction

- Phys. Rev. A,
- 1996