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:0904.0295 · Letters in Mathematical Physics

On the Geometric Distance Between Quantum States with Positive Partial Transposition and Private States

Jeong San Kim, Barry C. Sanders

Published Feb 24, 2010• 3 citations
arXivHTMLPDF
DOI
10.1007/s11005-010-0376-6

Related papers

Entangled symmetric states of N qubits with positive partial transpositions

Remigiusz Augusiak, Jordi Tura, Jan Samsonowicz +1 more

•Jun 14, 2012•0 citations

Hybrid quantum network design against unauthorized secret-key generation, and its memory cost

Omer Sakarya, Marek Winczewski, Adam Rutkowski +1 more

A significant number of servers that constitute the Internet are to provide private data via private communication channels to mutually anonymous registered users.Such are the servers of banks, hospitals that provide cloud storage and many others.Replacing communication channels by maximally entangled states is a promising idea for the quantum-secured Internet (QI).While it is an important idea for large distances secure communication, for the case of the mentioned class of servers pure entanglement based solution is not only unnecessary but also opens a threat.A crack stimulating a node to generate secure connections via entanglement swapping between two hackers can cause uncontrolled consumption of resources.Turning into positive a recently proven no-go result by S. Bäuml et al. [Nat. Commun. 6, 6908 (2015)], we propose a natural countermeasure against this threat.The solution bases on connections between hub-nodes and end-users realized with states that contain secure key but do not allow for swapping of this key.We then focus on the study of the quantum memory cost of such a scheme and prove a fundamental lower bound on its memory overhead.In particular, we show that to avoid the possibility of entanglement swapping, it is necessary to store at least twice as much memory than it is the case in standard quantum-repeater-based network design.For schemes employing either states with positive partial transposition that approximates certain privates states or private states hardly distinguishable from their attacked versions, we derive much tighter lower bounds on required memory.Our considerations yield upper bounds on a two-way repeater rate for states with positive partial transposition (PPT), which approximates strictly irreducible private states.As a byproduct, we provide a lower bound on the trace distance between PPT and private states, shown previously only for private bits.

arXiv:1912.07548•Physical Review Research•Oct 5, 2020•4 citations

Geometrical distance on quantum channels

Haidong Yuan, Chi‐Hang Fred Fung

•Jun 2, 2015•1 citation

Geometry of quantum states: New construction of positive maps

Dariusz Chruściński, Andrzej Kossakowski

arXiv:0902.0885•Physics Letters A•May 8, 2009•47 citations

Detecting quantum correlations by means of local noncommutativity

Yu Chen Guo, Jinchuan Hou

Quantum correlation is a key to our understanding of quantum physics. In particular, it is essential for the powerful applications to quantum information and quantum computation. There exist quantum correlations beyond entanglement, such as quantum discord (QD) and measurement-induced nonlocality (MiN) [Phys. Rev. Lett. \textbf{106}, 120401(2011)]. In [Phys. Rev. A \textbf{77}, 022113(2008)], a subclass of PPT states so-called strong positive partial transposition (SPPT) states was introduced and it was conjectured there that SPPT states are separable. However, it was illustrated with examples in [Phys. Rev. A \textbf{81}, 064101(2010)] that this conjecture is not true. Viewing the original SPPT as SPPT up to part B, in the present paper, we define SPPT state up to part A and B respectively and present a separable class of SPPT states, that is the super SPPT (SSPPT) states, in terms of local commutativity. In addition, classical-quantum (CQ) states and nullity of MiN are characterized via local commutativity. Based on CQ states, the geometric measure of quantum discord (GMQD) for infinite-dimensional case is proposed. Consequently, we highlight the relation among MiN, QD(GMQD), SSPPT and separability through a unified approach for both finite- and infinite-dimensional systems: zero MiN implies zero QD(GMQD), zero QD(GMQD) signals SSPPT and SSPPT guarantees separability, but the converses are not valid.

arXiv:1107.0355•Jul 2, 2011•8 citations

Bound entangled states with extremal properties

Piotr Badzia ̧g, Karol Horodecki, Michał Horodecki +2 more

Following recent work of Beigi and Shor, we investigate positive partial transpose (PPT) states that are ``heavily entangled.'' We first exploit volumetric methods to show that in a randomly chosen direction, there are PPT states whose distance in trace norm from separable states is (asymptotically) at least $1/4$. We then provide explicit examples of PPT states which are nearly as far from separable ones as possible. To obtain a distance of $2\ensuremath{-}\ensuremath{\epsilon}$ from the separable states, we need a dimension of ${2}^{\mathrm{poly}[log(\frac{1}{\ensuremath{\epsilon}})]}$, as opposed to ${2}^{\mathrm{poly}(\frac{1}{\ensuremath{\epsilon}})}$ given by the construction of Beigi and Shor [J. Math. Phys. 51, 042202 (2010)]. We do so by exploiting the so-called private states, introduced earlier in the context of quantum cryptography. We also provide a lower bound for the distance between private states and PPT states and investigate the distance between pure states and the set of PPT states.

arXiv:1309.7992•Physical Review A•Jul 2, 2014•9 citations
A significant number of servers that constitute the Internet are to provide private data via private communication channels to mutually anonymous registered users.Such are the servers of banks, hospitals that provide cloud storage and many others.Replacing communication channels by maximally entangled states is a promising idea for the quantum-secured Internet (QI).While it is an important idea for large distances secure communication, for the case of the mentioned class of servers pure entanglement based solution is not only unnecessary but also opens a threat.A crack stimulating a node to generate secure connections via entanglement swapping between two hackers can cause uncontrolled consumption of resources.Turning into positive a recently proven no-go result by S. Bäuml et al. [Nat. Commun. 6, 6908 (2015)], we propose a natural countermeasure against this threat.The solution bases on connections between hub-nodes and end-users realized with states that contain secure key but do not allow for swapping of this key.We then focus on the study of the quantum memory cost of such a scheme and prove a fundamental lower bound on its memory overhead.In particular, we show that to avoid the possibility of entanglement swapping, it is necessary to store at least twice as much memory than it is the case in standard quantum-repeater-based network design.For schemes employing either states with positive partial transposition that approximates certain privates states or private states hardly distinguishable from their attacked versions, we derive much tighter lower bounds on required memory.Our considerations yield upper bounds on a two-way repeater rate for states with positive partial transposition (PPT), which approximates strictly irreducible private states.As a byproduct, we provide a lower bound on the trace distance between PPT and private states, shown previously only for private bits.
Quantum correlation is a key to our understanding of quantum physics. In particular, it is essential for the powerful applications to quantum information and quantum computation. There exist quantum correlations beyond entanglement, such as quantum discord (QD) and measurement-induced nonlocality (MiN) [Phys. Rev. Lett. \textbf{106}, 120401(2011)]. In [Phys. Rev. A \textbf{77}, 022113(2008)], a subclass of PPT states so-called strong positive partial transposition (SPPT) states was introduced and it was conjectured there that SPPT states are separable. However, it was illustrated with examples in [Phys. Rev. A \textbf{81}, 064101(2010)] that this conjecture is not true. Viewing the original SPPT as SPPT up to part B, in the present paper, we define SPPT state up to part A and B respectively and present a separable class of SPPT states, that is the super SPPT (SSPPT) states, in terms of local commutativity. In addition, classical-quantum (CQ) states and nullity of MiN are characterized via local commutativity. Based on CQ states, the geometric measure of quantum discord (GMQD) for infinite-dimensional case is proposed. Consequently, we highlight the relation among MiN, QD(GMQD), SSPPT and separability through a unified approach for both finite- and infinite-dimensional systems: zero MiN implies zero QD(GMQD), zero QD(GMQD) signals SSPPT and SSPPT guarantees separability, but the converses are not valid.
Following recent work of Beigi and Shor, we investigate positive partial transpose (PPT) states that are ``heavily entangled.'' We first exploit volumetric methods to show that in a randomly chosen direction, there are PPT states whose distance in trace norm from separable states is (asymptotically) at least 1/41/41/4. We then provide explicit examples of PPT states which are nearly as far from separable ones as possible. To obtain a distance of $2\ensuremath{-}\ensuremath{\epsilon}$ from the separable states, we need a dimension of ${2}^{\mathrm{poly}[log(\frac{1}{\ensuremath{\epsilon}})]}$, as opposed to ${2}^{\mathrm{poly}(\frac{1}{\ensuremath{\epsilon}})}$ given by the construction of Beigi and Shor [J. Math. Phys. 51, 042202 (2010)]. We do so by exploiting the so-called private states, introduced earlier in the context of quantum cryptography. We also provide a lower bound for the distance between private states and PPT states and investigate the distance between pure states and the set of PPT states.