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/0611107 · Physics Letters A

Optimal and covariant single-copy LOCC transformation between two two-qubit states

Kamil Brádler

Published Feb 15, 2007• 0 citations
arXivHTMLPDF
DOI
10.1016/j.physleta.2007.01.067

Related papers

Efficient LOCC Discrimination of Orthogonal Quantum States: Limitations of Assisted Entanglement and Resource Optimization in Single-Copy Protocols

Jieqi Liu, Lin Chen, Ziwei Chen

Annals of Physics•Mar 17, 2026•0 citations

Optimal enhancement of the fidelity of two qubits.

Frank Verstraete, Henri Verschelde

We consider a single copy of a mixed state of two qubits and prove tight lower and upper bounds for its fidelity in terms of its concurrence or negativity. Next we derive the optimal filtering operations and the optimal trace-preserving local operations assisted by classical communication (LOCC) such as to maximize the fidelity of a given copy of a mixed state of two qubits. The optimal LOCC operations turn out to be very simple and implementable by 1-LOCC protocols, and always yield a fidelity larger then 1/2 if the original state was entangled.

Physical Review A•Jan 1, 2002•6 citations

Entanglement transformation between two-qubit mixed states by LOCC

Dechao Li

Physics Letters A•Aug 6, 2009•5 citations

When Do Local Operations and Classical Communication Suffice for Two-Qubit State Discrimination?

Eric Chitambar, Runyao Duan, Min-Hsiu Hsieh

In this paper, we consider the conditions under which a given ensemble of two-qubit states can be optimally distinguished by local operations and classical communication (LOCC). We begin by completing the perfect distinguishability problem of two-qubit ensembles-both for separable operations and LOCC-by providing necessary and sufficient conditions for the perfect discrimination of one pure and one mixed state. Then, for the well-known task of minimum error discrimination, it is shown that almost all two-qubit ensembles consisting of three pure states cannot be optimally discriminated using LOCC. This is surprising considering that any two pure states can be distinguished optimally by LOCC. Special attention is given to ensembles that lack entanglement, and we prove an easy sufficient condition for when a set of three product states cannot be optimally distinguished by LOCC, thus providing new examples of the phenomenon known as non-locality without entanglement. We next consider an example of N parties who each share the same state but who are ignorant of its identity. The state is drawn from the rotationally invariant trine ensemble, and we establish a tight connection between the N-copy ensemble and Shor's lifted single-copy ensemble. For any finite N, we prove that optimal identification of the states cannot be achieved by LOCC; however, as N→∞, LOCC can indeed discriminate the states optimally. This is the first result of its kind. Finally, we turn to the task of unambiguous discrimination and derive new lower bounds on the LOCC inconclusive probability for symmetric states. When applied to the double trine ensemble, this leads to a rather different distinguishability character than when the minimum error probability is considered.

arXiv:1308.1737•IEEE Transactions on Information Theory•Jan 31, 2014•51 citations

Entanglement transformation between ensembles of three-qubit GHZ-type states by LOCC

Guo-Fu Weng

Physics Letters A•Jan 29, 2011•0 citations

Power and Limitations of Distributed Quantum State Purification

Benchi Zhao, Yu-Ao Chen, Xuanqiang Zhao +3 more

Quantum state purification protocols, which mitigate noise by converting multiple copies of noisy quantum states into fewer copies with a lower noise level, have applications in quantum communication and computation with imperfect devices. Here, we systematically study the task of state purification in distributed quantum systems, demanding that purification be achieved by local operations and classical communication (LOCC). We prove that, in the presence of depolarizing noise, no LOCC purification protocol starting from two copies can work blindly for all the states in three important sets: the set of all pure two-qubit states, the set of all two-qubit maximally entangled states, and the Bell basis. In stark contrast, we show that a targeted, single-state purification is always achievable in the presence of depolarizing noise, and we provide an explicit analytical LOCC protocol for every given two-qubit state. For arbitrary finite sets of pure states and arbitrary noise profiles, we develop an optimization-based algorithm that systematically designs LOCC purification protocols, and we demonstrate it through concrete examples. Overall, our results identify both fundamental limitations and practical noise-reduction strategies for distributed quantum information processing.

arXiv:2509.08691•Physical Review Letters•Feb 2, 2026•3 citations
We consider a single copy of a mixed state of two qubits and prove tight lower and upper bounds for its fidelity in terms of its concurrence or negativity. Next we derive the optimal filtering operations and the optimal trace-preserving local operations assisted by classical communication (LOCC) such as to maximize the fidelity of a given copy of a mixed state of two qubits. The optimal LOCC operations turn out to be very simple and implementable by 1-LOCC protocols, and always yield a fidelity larger then 1/2 if the original state was entangled.
In this paper, we consider the conditions under which a given ensemble of two-qubit states can be optimally distinguished by local operations and classical communication (LOCC). We begin by completing the perfect distinguishability problem of two-qubit ensembles-both for separable operations and LOCC-by providing necessary and sufficient conditions for the perfect discrimination of one pure and one mixed state. Then, for the well-known task of minimum error discrimination, it is shown that almost all two-qubit ensembles consisting of three pure states cannot be optimally discriminated using LOCC. This is surprising considering that any two pure states can be distinguished optimally by LOCC. Special attention is given to ensembles that lack entanglement, and we prove an easy sufficient condition for when a set of three product states cannot be optimally distinguished by LOCC, thus providing new examples of the phenomenon known as non-locality without entanglement. We next consider an example of N parties who each share the same state but who are ignorant of its identity. The state is drawn from the rotationally invariant trine ensemble, and we establish a tight connection between the N-copy ensemble and Shor's lifted single-copy ensemble. For any finite N, we prove that optimal identification of the states cannot be achieved by LOCC; however, as N→∞, LOCC can indeed discriminate the states optimally. This is the first result of its kind. Finally, we turn to the task of unambiguous discrimination and derive new lower bounds on the LOCC inconclusive probability for symmetric states. When applied to the double trine ensemble, this leads to a rather different distinguishability character than when the minimum error probability is considered.
Quantum state purification protocols, which mitigate noise by converting multiple copies of noisy quantum states into fewer copies with a lower noise level, have applications in quantum communication and computation with imperfect devices. Here, we systematically study the task of state purification in distributed quantum systems, demanding that purification be achieved by local operations and classical communication (LOCC). We prove that, in the presence of depolarizing noise, no LOCC purification protocol starting from two copies can work blindly for all the states in three important sets: the set of all pure two-qubit states, the set of all two-qubit maximally entangled states, and the Bell basis. In stark contrast, we show that a targeted, single-state purification is always achievable in the presence of depolarizing noise, and we provide an explicit analytical LOCC protocol for every given two-qubit state. For arbitrary finite sets of pure states and arbitrary noise profiles, we develop an optimization-based algorithm that systematically designs LOCC purification protocols, and we demonstrate it through concrete examples. Overall, our results identify both fundamental limitations and practical noise-reduction strategies for distributed quantum information processing.