Semi-device independent randomness certification using Mermin's proof of Kochen-Specker contextuality
arXiv:2012.13878 · doi:10.1140/epjd/s10053-021-00105-8
Abstract
Randomness is a potential resource for cryptography, simulations and algorithms. Non-local correlations violating Bell's inequality certify the generation of bit strings whose randomness is guaranteed in a device-independent manner. We provide interesting semi-device independent randomness certification protocols by Kochen-Specker (KS) contextuality. For this, we first cast the Mermin's magic-square proof of KS contextuality for two-qubit system as a semi-device independent communication game in prepare-measure scenario. This provides a semi-device independent certification of two-bit of randomness. Further, by using Mermin's magic-star proof of KS theorem involving three-qubit system, we certify three-bit of randomness. We conjecture that our proposals can be extended to certify any arbitrary bit of randomness through a suitable KS proof of contextuality valid for higher dimensional system.
References in corpus (14)
- Device-independent security of quantum cryptography against collective attacks
- A simple test for hidden variables in spin-1 system
- Experimentally testable state-independent quantum contextuality
- State-independent experimental test of quantum contextuality
- Device-independent tests of classical and quantum dimensions
- Experimental non-classicality of an indivisible quantum system
- Experimental test of quantum contextuality in neutron interferometry
- State-independent quantum contextuality with single photons
- Preparation contextuality powers parity-oblivious multiplexing
- Strong Kochen-Specker theorem and incomputability of quantum randomness
- Proposed experiment for testing quantum contextuality with neutrons
- Sharing non-locality and non-trivial preparation contextuality using same family of Bell expressions
- Device-independent certification of Hilbert space dimension using a family of Bell expressions
- Device-independent certification of two bits of randomness from one entangled bit and Gisin's elegant Bell inequality