Abstract
We prove that given any two general probabilistic theories (GPTs) the following are equivalent: (i)each theory is nonclassical, meaning that neither of their state spaces is a simplex; (ii)each theory satisfies a strong notion of incompatibility equivalent to the existence of "superpositions"; and (iii)the two theories are entangleable, in the sense that their composite exhibits either entangled states or entangled measurements. Intuitively, in the post-quantum GPT setting, a superposition is a set of two binary ensembles of states that are unambiguously distinguishable if the ensemble is revealed before the measurement has occurred, but not if it is revealed after. This notion is important because we show that, just like in quantum theory, superposition in the form of strong incompatibility is sufficient to realize the Bennett-Brassard 1984 protocol for secret key distribution.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.