# Semi-device independent randomness certification using Mermin's proof of Kochen-Specker contextuality

Source: [Semi-device independent randomness certification using Mermin's proof of Kochen-Specker contextuality](<https://www.sota2.com/research/paper/68fa3ec51e209131ce8e827f>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T02:02:18.820Z

Authors: A. K. Pan

Published: 2020-12-27T06:53:08.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2012.13878>)

[PDF](<https://arxiv.org/pdf/2012.13878.pdf>)
