Halos and undecidability of tensor stable positive maps

Author:

van der Eyden MirteORCID,Netzer TimORCID,De las Cuevas GemmaORCID

Abstract

Abstract A map P is tensor stable positive (tsp) if P n is positive for all n, and essential tsp if it is not completely positive or completely co-positive. Are there essential tsp maps? Here we prove that there exist essential tsp maps on the hypercomplex numbers. It follows that there exist bound entangled states with a negative partial transpose (NPT) on the hypercomplex, that is, there exists NPT bound entanglement in the halo of quantum states. We also prove that tensor stable positivity on the matrix multiplication tensor is undecidable, and conjecture that tensor stable positivity is undecidable. Proving this conjecture would imply existence of essential tsp maps, and hence of NPT bound entangled states.

Funder

Austrian Science Fund

Publisher

IOP Publishing

Subject

General Physics and Astronomy,Mathematical Physics,Modeling and Simulation,Statistics and Probability,Statistical and Nonlinear Physics

Reference33 articles.

1. Classical deterministic complexity of Edmonds’ problem and quantum entanglement;Gurvits,2003

2. Strong NP-hardness of the quantum separability problem;Gharibian;Quantum Inf. Comput.,2008

3. Fundamental limitations in the purifications of tensor networks;De las Cuevas;J. Math. Phys.,2016

4. Tensor decompositions on simplicial complexes with invariance;De las Cuevas,2019

5. Optimal bounds on the positivity of a matrix from a few moments;De las Cuevas;Commun. Math. Phys.,2020

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3