Unveiling NPT bound problem: From Distillability Sets to Inequalities and Multivariable Insights
Abstract: Equivalence between Positive Partial Transpose (PPT) entanglement and bound entanglement is a long-standing open problem in quantum information theory. So far limited progress has been made, even on the seemingly simple case of Werner states bound entanglement. The primary challenge is to give a concise mathematical representation of undistillability. To this end, we propose a decomposition of the N-undistillability verification into $log(N)$ repeated steps of 1-undistillability verification. For Werner state N-undistillability verification, a bound for N-undistillability is given, which is independent of the dimensionality of Werner states. Equivalent forms of inequalities for both rank one and two matrices are presented, before transforming the two-undistillability case into a matrix analysis problem. A new perspective is also attempted by seeing it as a non-convex multi-variable function, proving its critical points and conjecturing Hessian positivity, which would make them local minimums.
- M. Horodecki, P. Horodecki, and R. Horodecki, Mixed-state entanglement and distillation: Is there a “bound” entanglement in nature?, Physical Review Letters 80, 5239–5242 (1998).
- P. Horodecki, Łukasz Rudnicki, and K. Życzkowski, Five open problems in quantum information (2020), arXiv:2002.03233 [quant-ph] .
- L. Chen and D. u. Doković, Distillability of non-positive-partial-transpose bipartite quantum states of rank four, Physical Review A 94, 10.1103/physreva.94.052318 (2016a).
- L. Chen, C. Feng, and H. He, On the distillability problem of two-copy 4×4444\times 44 × 4 Werner states: matrices A, B of at most four nonzero entries, Quant. Inf. Proc. 22, 108 (2023).
- T. Ding and L. Chen, Entanglement distillation in terms of schmidt rank and matrix rank (2023), arXiv:2304.05563 [quant-ph] .
- L. Lami, B. Regula, and A. Streltsov, Catalysis cannot overcome bound entanglement (2023), arXiv:2305.03489 [quant-ph] .
- F. G. S. L. Brandão, M. Christandl, and J. Yard, Faithful squashed entanglement, Communications in Mathematical Physics 306, 805–830 (2011).
- N. Johnston, Characterizing operations preserving separability measures via linear preserver problems, Linear and Multilinear Algebra 59, 1171–1187 (2011).
- K. K. Sharma and S. N. Pandey, Dzyaloshinskii-moriya interaction as an agent to free the bound entangled states (2016), arXiv:1501.00942 [quant-ph] .
- M. van der Eyden, T. Netzer, and G. De las Cuevas, Halos and undecidability of tensor stable positive maps, Journal of Physics A: Mathematical and Theoretical 55, 264006 (2022).
- L. Chen and D. u. Doković, Distillability of non-positive-partial-transpose bipartite quantum states of rank four, Physical Review A 94, 10.1103/physreva.94.052318 (2016b).
- J. Watrous, Many copies may be required for entanglement distillation, Physical Review Letters 93, 10.1103/physrevlett.93.010502 (2004).
- R. F. Werner, Quantum states with einstein-podolsky-rosen correlations admitting a hidden-variable model, Phys. Rev. A 40, 4277 (1989).
- M. Horodecki and P. Horodecki, Reduction criterion of separability and limits for a class of protocols of entanglement distillation (1998), arXiv:quant-ph/9708015 [quant-ph] .
- D. Doković, On two-distillable werner states, Entropy 18, 216 (2016).
- A. Peres, Separability criterion for density matrices, Physical Review Letters 77, 1413 (1996).
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge University Press, 2010).
- M. Horodecki, P. Horodecki, and R. Horodecki, Inseparable two spin- 1212\frac{1}{2}divide start_ARG 1 end_ARG start_ARG 2 end_ARG density matrices can be distilled to a singlet form, Phys. Rev. Lett. 78, 574 (1997).
- P. C. Rico, New partial trace inequalities and distillability of werner states (2023), arXiv:2310.05726 [math-ph] .
- R. A. Horn and C. R. Johnson, Topics in Matrix Analysis (Cambridge University Press, 1991).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
