Device-independent certification of two bits of randomness from one entangled bit and Gisin's elegant Bell inequality
classification
🪐 quant-ph
keywords
maximalrandomnessbellbitscompletedevice-independentelegantentanglement
read the original abstract
We prove that as conjectured by Ac\'{\i}n et al. [Phys. Rev. A 93, 040102(R) (2016)], two bits of randomness can be certified in a device-independent way from one bit of entanglement using the maximal quantum violation of Gisin's elegant Bell inequality. This suggests a surprising connection between maximal entanglement, complete sets of mutually unbiased bases, and elements of symmetric informationally complete positive operator-valued measures, on one side, and the optimal way of certifying maximal randomness, on the other.
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.