pith. sign in

arxiv: 1903.04406 · v1 · pith:YFLRGTUYnew · submitted 2019-03-11 · 🪐 quant-ph · math.OC

Bernstein's socks and polynomial-time provable coherence

classification 🪐 quant-ph math.OC
keywords bernsteinpolynomial-timeprovabletheoryanotherapproachboundedcertificate
0
0 comments X
read the original abstract

We recently introduced a bounded rationality approach for the theory of desirable gambles. It is based on the unique requirement that being non-negative for a gamble has to be defined so that it can be provable in polynomial-time. In this paper we continue to investigate properties of this class of models. In particular we verify that the space of Bernstein polynomials in which non-negativity is specified by the Krivine-Vasilescu certificate is yet another instance of this theory. As a consequence, we show how it is possible to construct in it a thought experiment uncovering entanglement with classical (hence non quantum) coins.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.