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/0612072

Entanglement Distillation; A Discourse on Bound Entanglement in Quantum Information Theory

Lieven Clarisse

Published Dec 10, 2006• 29 citations
arXivHTMLPDF

Abstract

PhD thesis (University of York). The thesis covers in a unified way the material presented in quant-ph/0403073, quant-ph/0502040, quant-ph/0504160, quant-ph/0510035, quant-ph/0512012 and quant-ph/0603283. It includes two large review chapters on entanglement and distillation.
DOI
10.48550/arxiv.quant-ph/0612072

Related papers

Purification and Distillation

Wolfgang Dür, H. J. Briegel

Most applications of entanglement in quantum information processing are based on maximally entangled pure states. Entanglement purification was introduced in the context of quantum communication to overcome noise induced on the system when sending (parts of) maximally entangled states through noisy quantum channels. It is worth mentioning that the distillation of pure entangled states is not only of practical relevance but also leads to a possible way to classify and quantify entanglement. This chapter discusses entanglement distillation of pure states. Next, it defines the notion of distillability and bound entanglement in bipartite systems for general mixed states, and also discusses necessary and sufficient conditions for distillation. After this, it considers distillation of multipartite entangled states. The chapter then focuses on entanglement distillation protocols for bipartite and multipartite systems. Finally, it details the effect of noisy local control operations and highlights the applications of entanglement purification in quantum information processing.

Wiley eBooks•Apr 18, 2016•2 citations

Seven definitions of bipartite bound entanglement

Michael Gaida, Matthias Kleinmann

Abstract An entangled state is bound entangled if one cannot combine any number of copies of the state to a maximally entangled state by using only local operations and classical communication. If one formalizes this notion of bound entanglement, one arrives immediately at four different definitions. In addition, at least three more definitions are commonly used in the literature, in particular in the very first paper on bound entanglement. Here we review critical distillation protocols and we examine how different results from quantum information theory interact in order to prove that all seven definitions are eventually equivalent. Our self-contained analysis unifies and extends previous results scattered in the literature and reveals details of the structure of bound entanglement.

arXiv:2212.11015•Journal of Physics A Mathematical and Theoretical•Aug 9, 2023•4 citations

Purification and Distillation

Wolfgang Dür, Hans J. Briegel

This chapter contains sections titled: Introduction Pure States Distillability and Bound Entanglement in Bipartite Systems Bipartite Entanglement Distillation Protocols Distillability and Bound Entanglement in Multipartite systems Entanglement Purification Protocols in Multipartite Systems Distillability with Noisy Apparatus Applications of Entanglement Purification Summary and Conclusions

Wiley eBooks•Nov 6, 2006•3 citations

Evidence for Nonadditivity of Bipartite Distillable Entanglement

Peter W. Shor, John A. Smolin, Barbara M. Terhal

Assuming the validity of a conjecture in quant-ph/9910026 and quant-ph/9910022 we show that the distillable entanglement for two bipartite states, each of which individually has zero distillable entanglement, can be nonzero. We show that this also implies that the distillable entanglement is a not convex function. Our example consists of the tensor product of a bound entangled state based on an unextendible product basis with a Werner state which lies in the class of conjectured undistillable states.

•Oct 13, 2000•2 citations

Distillation and bound entanglement

Paweł Horodecki, Ryszard Horodecki

This review provides a systematic description of the main (qualitative) results concerning entanglement theory in the context of the so called bound entanglement being a physical manifestation of basic limits for entanglement processing and quantum communication.

Quantum Information and Computation•Jul 1, 2001•87 citations

Operator-Schmidt decomposition of the quantum Fourier transform on N1 N2

Jon Tyson

Operator-Schmidt decompositions of the quantum Fourier transform on ℂ N 1 ⊗ ℂ N 2 are computed for all N 1 , N 2 ≥ 2. The decomposition is shown to be completely degenerate when N 1 is a factor of N 2 and when N 1 > N 2 . The first known special case, N 1 = N 2 = 2 n , was computed by Nielsen in his study of the communication cost of computing the quantum Fourier transform of a collection of qubits equally distributed between two parties (M A Nielsen 1998 PhD Thesis University of New Mexico ch 6 Preprint quant-ph/0011036). More generally, the special case N 1 = 2 n 1 ⩽ 2 n 2 = N 2 was computed by Nielsen et al in their study of strength measures of quantum operations (M A Nielsen et al 2002 Preprint quant-ph/0208077 (2003 Phys. Rev. A at press)). Given the Schmidt decompositions presented here, it follows that in all cases the bipartite communication cost of exact computation of the quantum Fourier transform is maximal.

arXiv:quant-ph/0210100•Journal of Physics A Mathematical and General•Jun 5, 2003•20 citations
Most applications of entanglement in quantum information processing are based on maximally entangled pure states. Entanglement purification was introduced in the context of quantum communication to overcome noise induced on the system when sending (parts of) maximally entangled states through noisy quantum channels. It is worth mentioning that the distillation of pure entangled states is not only of practical relevance but also leads to a possible way to classify and quantify entanglement. This chapter discusses entanglement distillation of pure states. Next, it defines the notion of distillability and bound entanglement in bipartite systems for general mixed states, and also discusses necessary and sufficient conditions for distillation. After this, it considers distillation of multipartite entangled states. The chapter then focuses on entanglement distillation protocols for bipartite and multipartite systems. Finally, it details the effect of noisy local control operations and highlights the applications of entanglement purification in quantum information processing.
Abstract An entangled state is bound entangled if one cannot combine any number of copies of the state to a maximally entangled state by using only local operations and classical communication. If one formalizes this notion of bound entanglement, one arrives immediately at four different definitions. In addition, at least three more definitions are commonly used in the literature, in particular in the very first paper on bound entanglement. Here we review critical distillation protocols and we examine how different results from quantum information theory interact in order to prove that all seven definitions are eventually equivalent. Our self-contained analysis unifies and extends previous results scattered in the literature and reveals details of the structure of bound entanglement.
Assuming the validity of a conjecture in quant-ph/9910026 and quant-ph/9910022 we show that the distillable entanglement for two bipartite states, each of which individually has zero distillable entanglement, can be nonzero. We show that this also implies that the distillable entanglement is a not convex function. Our example consists of the tensor product of a bound entangled state based on an unextendible product basis with a Werner state which lies in the class of conjectured undistillable states.
Operator-Schmidt decompositions of the quantum Fourier transform on ℂ N 1 ⊗ ℂ N 2 are computed for all N 1 , N 2 ≥ 2. The decomposition is shown to be completely degenerate when N 1 is a factor of N 2 and when N 1 > N 2 . The first known special case, N 1 = N 2 = 2 n , was computed by Nielsen in his study of the communication cost of computing the quantum Fourier transform of a collection of qubits equally distributed between two parties (M A Nielsen 1998 PhD Thesis University of New Mexico ch 6 Preprint quant-ph/0011036). More generally, the special case N 1 = 2 n 1 ⩽ 2 n 2 = N 2 was computed by Nielsen et al in their study of strength measures of quantum operations (M A Nielsen et al 2002 Preprint quant-ph/0208077 (2003 Phys. Rev. A at press)). Given the Schmidt decompositions presented here, it follows that in all cases the bipartite communication cost of exact computation of the quantum Fourier transform is maximal.