4.4 Article

ENTANGLEABILITY OF CONES

Journal

GEOMETRIC AND FUNCTIONAL ANALYSIS
Volume 31, Issue 2, Pages 181-205

Publisher

SPRINGER BASEL AG
DOI: 10.1007/s00039-021-00565-5

Keywords

Tensor product of cones; Entangleability; General probabilistic theories

Categories

Funding

  1. ANR (France) under the grant StoQ [2014-CE25-0003]
  2. European Research Council under the Starting Grant GQCOP [637352]
  3. Foundational Questions Institute [FQXi-RFP-IPW-1907]
  4. Alexander von Humboldt Foundation
  5. Spanish MINECO [MTM2017-88385-P]
  6. Comunidad de Madrid [QUITEMAD-CM P2018/TCS4342]
  7. Slovak Research and Development Agency [APVV-16-0073]
  8. Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) [447948357]
  9. ERC [683107/TempoQ]
  10. [VEGA 2/0142/20]
  11. [SEV-2015-0554-16-3]

Ask authors/readers for more resources

This research solves a long-standing conjecture by Barker, showing that the minimal and maximal tensor products of two finite-dimensional proper cones coincide if and only if one of the cones is generated by a linearly independent set. The proof techniques involve a combination of convex geometry, elementary algebraic topology, and computations inspired by quantum information theory. The motivation behind the study comes from foundational physics, demonstrating that any two non-classical systems modeled by general probabilistic theories can be entangled.
We solve a long-standing conjecture by Barker, proving that the minimal and maximal tensor products of two finite-dimensional proper cones coincide if and only if one of the two cones is generated by a linearly independent set. Here, given two proper cones C-1, C-2, their minimal tensor product is the cone generated by products of the form x(1) circle times x(2), where x(1) is an element of C-1 and x(2) is an element of C-2, while their maximal tensor product is the set of tensors that are positive under all product functionals phi(1) circle times phi(2), where phi(1)vertical bar C-1 >= 0 and phi(2)vertical bar C-2 >= 0. Our proof techniques involve a mix of convex geometry, elementary algebraic topology, and computations inspired by quantum information theory. Our motivation comes from the foundations of physics: as an application, we show that any two non-classical systems modelled by general probabilistic theories can be entangled.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available