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:0906.5255 · Journal of Physics A Mathematical and Theoretical

Symmetric extendibility for a class of qudit states

Kedar S Ranade

Published Sep 30, 2009• 9 citations
arXivHTMLPDF

Abstract

The concept of symmetric extendibility has recently drawn attention in the context of tolerable error rates in quantum cryptography, where it can be used to decide whether quantum states shared between two parties can be purified by means of entanglement purification with one-way classical communication only. Unfortunately, at present there exists no simple general criterion to decide whether a state possesses a symmetric extension or not. In this paper, we derive criteria for symmetric extendibility within subclasses of all two-qudit states. Using these criteria, we can completely solve the problem for a two-parameter family of two-qudit states, which includes the isotropic states as a subclass.

DOI
10.1088/1751-8113/42/42/425302

Related papers

Symmetric extendibility for qudits and tolerable error rates in quantum cryptography

Kedar S. Ranade

Symmetric extendibility of quantum states has recently drawn attention in the context of quantum cryptography to judge whether quantum states shared between two distant parties can be purified by means of one-way error correction protocols. In this paper we study the symmetric extendibility in a specific class of two-qudit states, i.e., states composed of two $d$-level systems, in order to find upper bounds on tolerable error rates for a wide class of qudit-based quantum cryptographic protocols using two-way error correction. In important cases these bounds coincide with previously known lower bounds, thereby proving sharpness of these bounds in arbitrary finite-dimensional systems.

arXiv:0906.0163•Physical Review A•Aug 3, 2009•9 citations

The symmetric extendibility of quantum states

Marcin L Nowakowski

Abstract Studies on the symmetric extendibility of quantum states have become particularly important in the context of the analysis of one-way quantum measures of entanglement, and the distillability and security of quantum protocols. In this paper we analyze composite systems containing a symmetric extendible part, with particular attention devoted to the one-way security of such systems. Further, we introduce a new one-way entanglement monotone based on the best symmetric approximation of a quantum state and the extendible number of a quantum state. We underpin these results with geometric observations about the structures of multi-party settings which posses substantial symmetric extendible components in their subspaces. The impossibility of reducing the maximal symmetric extendibility by means of the one-way local operations and classical communication method is pointed out on multiple copies. Finally, we state a conjecture linking symmetric extendibility with the one-way distillability and security of all quantum states, analyzing the behavior of a private key in the neighborhood of symmetric extendible states.

arXiv:1504.00388•Journal of Physics A Mathematical and Theoretical•Aug 26, 2016•7 citations

Symmetric extension of two-qubit states

Jianxin Chen, Zhengfeng Ji, David W. Kribs +2 more

A bipartite state ${\ensuremath{\rho}}_{AB}$ is symmetric extendible if there exists a tripartite state ${\ensuremath{\rho}}_{AB{B}^{\ensuremath{'}}}$ whose $AB$ and $A{B}^{\ensuremath{'}}$ marginal states are both identical to ${\ensuremath{\rho}}_{AB}$. Symmetric extendibility of bipartite states is of vital importance in quantum information because of its central role in separability tests, one-way distillation of Einstein-Podolsky-Rosen pairs, one-way distillation of secure keys, quantum marginal problems, and antidegradable quantum channels. We establish a simple analytic characterization for symmetric extendibility of any two-qubit quantum state ${\ensuremath{\rho}}_{AB}$; specifically, $\mathrm{tr}({\ensuremath{\rho}}_{B}^{2})\ensuremath{\ge}\mathrm{tr}({\ensuremath{\rho}}_{AB}^{2})\ensuremath{-}4\sqrt{det{\ensuremath{\rho}}_{AB}}$. As a special case we solve the bosonic three-representability problem for the two-body reduced density matrix.

arXiv:1310.3530•Physical Review A•Sep 17, 2014•41 citations

Complete family of separability criteria

Andrew C. Doherty, Pablo A. Parrilo, Federico M. Spedalieri

We introduce a family of separability criteria that are based on the existence of extensions of a bipartite quantum state \ensuremath{\rho} to a larger number of parties satisfying certain symmetry properties. It can be easily shown that all separable states have the required extensions, so the nonexistence of such an extension for a particular state implies that the state is entangled. One of the main advantages of this approach is that searching for the extension can be cast as a convex optimization problem known as a semidefinite program. Whenever an extension does not exist, the dual optimization constructs an explicit entanglement witness for the particular state. These separability tests can be ordered in a hierarchical structure whose first step corresponds to the well-known positive partial transpose (Peres-Horodecki) criterion, and each test in the hierarchy is at least as powerful as the preceding one. This hierarchy is complete, in the sense that any entangled state is guaranteed to fail a test at some finite point in the hierarchy, thus showing it is entangled. The entanglement witnesses corresponding to each step of the hierarchy have well-defined and very interesting algebraic properties that, in turn, allow for a characterization of the interior of the set of positive maps. Coupled with some recent results on the computational complexity of the separability problem, which has been shown to be NP hard, this hierarchy of tests gives a complete and also computationally and theoretically appealing characterization of mixed bipartite entangled states.

arXiv:quant-ph/0308032•Physical Review A•Feb 18, 2004•467 citations

On Symmetric Bound Entangled States of Two Qudits

Dariusz Chruściński, Takashi Matsuoka, Tatsunori Saito +2 more

We provide a symmetric class of 2-qudit bound entangled states within a so-called magic simplex of Bell diagonal states. This class generalizes well-known family of 2-qutrit states introduced by Horodecki.

Open Systems & Information Dynamics•Nov 25, 2013•1 citation

Symmetric Extendability of Quantum States and the Extreme Limits of Quantum Key Distribution

Sumeet Khatri

We investigate QKD protocols with two-way classical post-processing that are based on the well-known six-state and BB84 signal states. In these QKD protocols, the source (Alice) sends quantum signals to the receiver (Bob), who measures them, leaving only classical data on both sides. Our goal is to find the highest value of the quantum bit-error rate (QBER) $Q$ for which two-way classical post-processing protocols on the data can distill secret keys. Using the BB84 signal states, such protocols currently exist for $Q<\\frac{1}{5}$. On the other hand, for $Q\\geq\\frac{1}{4}$ no such protocol can exist as the observed data is compatible with an intercept-resend attack. This leaves the interesting question of whether successful two-way protocols exist in the interval $\\frac{1}{5}\\leq Q<\\frac{1}{4}$. For the six-state signal states, the corresponding interval is known to be $\\frac{5-\\sqrt{5}}{10}\\leq Q<\\frac{1}{3}$. \n\t \n\tWe search for two-way protocols because it turns out that within these intervals Alice and Bob's correlations are symmetrically extendable, meaning that Bob and the eavesdropper (Eve) are completely indistinguishable from Alice's point of view, making any one-way Alice-to-Bob post-processing protocol insecure. A two-way protocol might be able to break the symmetry between Bob and Eve, and it must do so in order to distill a secret key because any two-way protocol will necessarily terminate with a one-way communication step, at which point the symmetric extendability of Alice and Bob's updated correlations must be checked again. \n \nWe first show that the search for two-way protocols breaking the symmetric extendability of Alice and Bob's correlations can be restricted to a search over post-selection protocols if all we care about is whether secret key can at all be distilled and not about the rate of distillation. We then provide strong analytical and numerical evidence to suggest that no two-way classical post-processing protocol exists within the gap when the six-state signal states are used. \n\t \n\tUnder quantum entanglement distillation protocols, it is known that secret key can be distilled right up to the intercept-resend bounds of $\\frac{1}{4}$ and $\\frac{1}{3}$ for the BB84 and six-state signal states, respectively. We therefore want to know whether classical post-processing protocols are just as good at distilling secret keys as quantum ones. Our results appear to indicate that they are not.

•Oct 13, 2016•3 citations
The concept of symmetric extendibility has recently drawn attention in the context of tolerable error rates in quantum cryptography, where it can be used to decide whether quantum states shared between two parties can be purified by means of entanglement purification with one-way classical communication only. Unfortunately, at present there exists no simple general criterion to decide whether a state possesses a symmetric extension or not. In this paper, we derive criteria for symmetric extendibility within subclasses of all two-qudit states. Using these criteria, we can completely solve the problem for a two-parameter family of two-qudit states, which includes the isotropic states as a subclass.
Symmetric extendibility of quantum states has recently drawn attention in the context of quantum cryptography to judge whether quantum states shared between two distant parties can be purified by means of one-way error correction protocols. In this paper we study the symmetric extendibility in a specific class of two-qudit states, i.e., states composed of two ddd-level systems, in order to find upper bounds on tolerable error rates for a wide class of qudit-based quantum cryptographic protocols using two-way error correction. In important cases these bounds coincide with previously known lower bounds, thereby proving sharpness of these bounds in arbitrary finite-dimensional systems.
Abstract Studies on the symmetric extendibility of quantum states have become particularly important in the context of the analysis of one-way quantum measures of entanglement, and the distillability and security of quantum protocols. In this paper we analyze composite systems containing a symmetric extendible part, with particular attention devoted to the one-way security of such systems. Further, we introduce a new one-way entanglement monotone based on the best symmetric approximation of a quantum state and the extendible number of a quantum state. We underpin these results with geometric observations about the structures of multi-party settings which posses substantial symmetric extendible components in their subspaces. The impossibility of reducing the maximal symmetric extendibility by means of the one-way local operations and classical communication method is pointed out on multiple copies. Finally, we state a conjecture linking symmetric extendibility with the one-way distillability and security of all quantum states, analyzing the behavior of a private key in the neighborhood of symmetric extendible states.
A bipartite state ${\ensuremath{\rho}}_{AB}$ is symmetric extendible if there exists a tripartite state ${\ensuremath{\rho}}_{AB{B}^{\ensuremath{'}}}$ whose ABABAB and $A{B}^{\ensuremath{'}}$ marginal states are both identical to ${\ensuremath{\rho}}_{AB}$. Symmetric extendibility of bipartite states is of vital importance in quantum information because of its central role in separability tests, one-way distillation of Einstein-Podolsky-Rosen pairs, one-way distillation of secure keys, quantum marginal problems, and antidegradable quantum channels. We establish a simple analytic characterization for symmetric extendibility of any two-qubit quantum state ${\ensuremath{\rho}}_{AB}$; specifically, $\mathrm{tr}({\ensuremath{\rho}}_{B}^{2})\ensuremath{\ge}\mathrm{tr}({\ensuremath{\rho}}_{AB}^{2})\ensuremath{-}4\sqrt{det{\ensuremath{\rho}}_{AB}}$. As a special case we solve the bosonic three-representability problem for the two-body reduced density matrix.
We introduce a family of separability criteria that are based on the existence of extensions of a bipartite quantum state \ensuremath{\rho} to a larger number of parties satisfying certain symmetry properties. It can be easily shown that all separable states have the required extensions, so the nonexistence of such an extension for a particular state implies that the state is entangled. One of the main advantages of this approach is that searching for the extension can be cast as a convex optimization problem known as a semidefinite program. Whenever an extension does not exist, the dual optimization constructs an explicit entanglement witness for the particular state. These separability tests can be ordered in a hierarchical structure whose first step corresponds to the well-known positive partial transpose (Peres-Horodecki) criterion, and each test in the hierarchy is at least as powerful as the preceding one. This hierarchy is complete, in the sense that any entangled state is guaranteed to fail a test at some finite point in the hierarchy, thus showing it is entangled. The entanglement witnesses corresponding to each step of the hierarchy have well-defined and very interesting algebraic properties that, in turn, allow for a characterization of the interior of the set of positive maps. Coupled with some recent results on the computational complexity of the separability problem, which has been shown to be NP hard, this hierarchy of tests gives a complete and also computationally and theoretically appealing characterization of mixed bipartite entangled states.
We investigate QKD protocols with two-way classical post-processing that are based on the well-known six-state and BB84 signal states. In these QKD protocols, the source (Alice) sends quantum signals to the receiver (Bob), who measures them, leaving only classical data on both sides. Our goal is to find the highest value of the quantum bit-error rate (QBER) QQQ for which two-way classical post-processing protocols on the data can distill secret keys. Using the BB84 signal states, such protocols currently exist for Q<frac15Q<\\frac{1}{5}Q<frac15. On the other hand, for Qgeqfrac14Q\\geq\\frac{1}{4}Qgeqfrac14 no such protocol can exist as the observed data is compatible with an intercept-resend attack. This leaves the interesting question of whether successful two-way protocols exist in the interval frac15leqQ<frac14\\frac{1}{5}\\leq Q<\\frac{1}{4}frac15leqQ<frac14. For the six-state signal states, the corresponding interval is known to be frac5−sqrt510leqQ<frac13\\frac{5-\\sqrt{5}}{10}\\leq Q<\\frac{1}{3}frac5−sqrt510leqQ<frac13. \n\t \n\tWe search for two-way protocols because it turns out that within these intervals Alice and Bob's correlations are symmetrically extendable, meaning that Bob and the eavesdropper (Eve) are completely indistinguishable from Alice's point of view, making any one-way Alice-to-Bob post-processing protocol insecure. A two-way protocol might be able to break the symmetry between Bob and Eve, and it must do so in order to distill a secret key because any two-way protocol will necessarily terminate with a one-way communication step, at which point the symmetric extendability of Alice and Bob's updated correlations must be checked again. \n \nWe first show that the search for two-way protocols breaking the symmetric extendability of Alice and Bob's correlations can be restricted to a search over post-selection protocols if all we care about is whether secret key can at all be distilled and not about the rate of distillation. We then provide strong analytical and numerical evidence to suggest that no two-way classical post-processing protocol exists within the gap when the six-state signal states are used. \n\t \n\tUnder quantum entanglement distillation protocols, it is known that secret key can be distilled right up to the intercept-resend bounds of frac14\\frac{1}{4}frac14 and frac13\\frac{1}{3}frac13 for the BB84 and six-state signal states, respectively. We therefore want to know whether classical post-processing protocols are just as good at distilling secret keys as quantum ones. Our results appear to indicate that they are not.