Beyond the Positive Partial Transpose Squared Conjecture: The Qutrit Case

• URL: http://arxiv.org/abs/2607.15947v1
• Date: Fri, 17 Jul 2026 13:32:14 GMT
• Title: Beyond the Positive Partial Transpose Squared Conjecture: The Qutrit Case
• Abstract summary: Entanglement swapping is a fundamental operation in quantum repeaters for establishing entanglement between distant parties.<n>We show that the cone of $1$-undistillable CP maps is exactly the largest qutrit cone of CP maps.<n>Although map composition captures only the standard maximally entangled outcome in entanglement swapping, we prove that any $1$-undistillable two-qutrit state and any state of Schmidt number at most two cannot generate terminal entanglement.
• Score: 0.42970700836450476
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entanglement swapping is a fundamental operation in quantum repeaters for establishing entanglement between distant parties. The positive partial transpose (PPT) squared conjecture asks whether two PPT entangled links can generate terminal entanglement through entanglement swapping, or equivalently, whether the composition of two PPT maps is always entanglement breaking. Motivated by this conjecture, we investigate the map-composition problem beyond the PPT setting. For qutrit completely positive (CP) maps, we prove that the composition of any CP map whose Choi matrix is $1$-undistillable with any CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in either order. Moreover, we show that the cone of $1$-undistillable CP maps is exactly the largest qutrit cone of CP maps whose composition with every CP map whose Choi matrix has Schmidt number at most two is entanglement breaking in both orders. Finally, although map composition captures only the standard maximally entangled outcome in entanglement swapping, we prove that any $1$-undistillable two-qutrit state and any state of Schmidt number at most two cannot generate terminal entanglement under an arbitrary selective measurement on the intermediate systems.

Related papers

• On quantum channels: extreme points, topology, and categorical properties [0.0]
  In this thesis, quantum channels are studied from the point of view of Mathematics.<n>We studied the CPTP and UCPTP channels, the latter being the unital channels.<n>Topological invariants can be computed from decompositions of a space such as CW structures.
  arXiv  Detail & Related papers  (2026-08-21T02:51:31Z)
• Every PPT channel has finite entanglement breaking index [6.52489063705362]
  We prove that every PPT linear map has finite entanglement breaking index.<n>We also show that a large family of PPT maps, which strictly contains the class of 2-superpositive maps, has entanglement breaking index bounded above by 3.
  arXiv  Detail & Related papers  (2026-08-13T17:59:28Z)
• Detecting bipartite entanglement with PnCP maps and non-negative polynomials [0.7036032466145112]
  We show how to generate PnCP maps based on the construction of certain positive non-Sum-of-Squares.<n>We numerically investigate their entanglement power, demonstrating notably that they are capable of detecting entangled states.
  arXiv  Detail & Related papers  (2026-05-28T18:00:06Z)
• Random entanglement percolation on realistic quantum networks [51.56484100374058]
  We study random entanglement percolation in heterogeneous quantum networks.<n>We focus on polarization-dependent loss (PDL) as a physical source of random edge entanglement in photonic networks.
  arXiv  Detail & Related papers  (2026-04-23T18:00:00Z)
• Projections with Respect to Bures Distance and Fidelity: Closed-Forms and Applications [11.458853556386797]
  We derive projections with respect to fidelity (equivalently, the Bures and purified distances) onto several sets of interest.<n>These include projections of bipartite positive semidefinite (PSD) matrices onto the set of PSD matrices with a given marginal.<n>We show that the pretty good measurement - associated with a weighted ensemble - is the fidelity projection of the ensemble onto the set of measurements.
  arXiv  Detail & Related papers  (2026-02-16T13:23:50Z)
• $k$-Positivity and high-dimensional bound entanglement under symplectic group symmetry [6.52489063705362]
  We study the structure of $k$-positivity and Schmidt numbers for classes of linear maps and bipartite quantum states exhibiting symplectic group symmetry.<n>Our results offer a natural and analytically tractable framework in which both strong forms of positive indecomposability and high degrees of PPT entanglement can be studied systematically.
  arXiv  Detail & Related papers  (2026-02-10T15:03:58Z)
• Optimization of Time-Dependent Decoherence Rates and Coherent Control for a Qutrit System [77.34726150561087]
  Incoherent control makes the decoherence rates depending on time in a specific controlled manner. We consider the problem of maximizing the Hilbert-Schmidt overlap between the system's final state $rho(T)$ and a given target state $rho_rm target.
  arXiv  Detail & Related papers  (2023-08-08T01:28:50Z)
• Annihilating Entanglement Between Cones [77.34726150561087]
  We show that Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation.
  arXiv  Detail & Related papers  (2021-10-22T15:02:39Z)
• Exact Recovery in the General Hypergraph Stochastic Block Model [92.28929858529679]
  This paper investigates fundamental limits of exact recovery in the general d-uniform hypergraph block model (d-HSBM) We show that there exists a sharp threshold such that exact recovery is achievable above the threshold and impossible below it.
  arXiv  Detail & Related papers  (2021-05-11T03:39:08Z)
• Guaranteeing Completely Positive Quantum Evolution [2.578242050187029]
  We transform an initial NCP map to a CP map through composition with the asymmetric depolarizing map. We prove that the composition can always be made CP without completely depolarizing in any direction. We show that asymmetric depolarization has many advantages over SPA in preserving the structure of the original NCP map.
  arXiv  Detail & Related papers  (2021-04-30T20:53:19Z)
• Efficient Depth Completion Using Learned Bases [94.0808155168311]
  We propose a new global geometry constraint for depth completion. By assuming depth maps often lay on low dimensional subspaces, a dense depth map can be approximated by a weighted sum of full-resolution principal depth bases.
  arXiv  Detail & Related papers  (2020-12-02T11:57:37Z)
• Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds Revisited [46.682733513730334]
  We propose new problem-independent lower bounds on the sample complexity and regret in episodic MDPs. Our main contribution is a novel lower bound of $Omega((H3SA/epsilon2)log (1/delta))$ on the sample complexity of an $(varepsilon,delta)$-PAC algorithm for best policy identification in a non-stationary MDP.
  arXiv  Detail & Related papers  (2020-10-07T17:23:01Z)
• Decomposable Pauli diagonal maps and Tensor Squares of Qubit Maps [91.3755431537592]
  We show that any positive product of a qubit map with itself is decomposable. We characterize the cone of decomposable ququart Pauli diagonal maps.
  arXiv  Detail & Related papers  (2020-06-25T16:39:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.