A Simple Algorithm for Local Conversion of Pure States

Abstract

We describe an algorithm for converting one bipartite quantum state into another using only local operations and classical communication, which is much simpler than the original algorithm given by Nielsen [Phys. Rev. Lett. 83, 436 (1999)]. Our algorithm uses only a single measurement by one of the parties, followed by local unitary operations which are permutations in the local Schmidt bases.

5 pages, LaTeX, reference added

References in corpus (3)

• A Method of Areas for Manipulating the Entanglement Properties of One Copy of a Two-Particle Pure State
• Quantum secure identification using entanglement and catalysis
• Quantum authentication and key distribution using catalysis

Cited by in corpus (12)

• Research on Hidden Variable Theories: a review of recent progresses
• Faithful remote state preparation using finite classical bits and a non-maximally entangled state
• The Uniqueness Theorem for Entanglement Measures
• A uniqueness theorem for entanglement measures
• On the communication cost of entanglement transformations
• An Introduction to Quantum Entanglement: a Geometric Approach
• Resources required for exact remote state preparation
• Entanglement transformation with no classical communication
• Conditions for entanglement transformation between a class of multipartite pure states with generalized Schmidt decompositions
• Review of recent experimental progresses in Foundations of Quantum Mechanics and Quantum Information obtained in Parametric Down Conversion Experiments at IENGF
• Protocols for entanglement transformations of bipartite pure states
• Probabilistic pure state conversion on the majorization lattice