Device- and semi–device-independent random numbers based on noninequality paradox

Abstract

In this work, we propose device independent true random numbers generation protocols based on non-inequality paradoxes such as Hardy's and Cabello's non-locality argument. The efficiency of generating randomness in our protocols are far better than any other proposed protocols certified by CHSH inequality or other non-locality test involving inequalities. Thus, highlighting non-inequality paradox as an important resource for device independent quantum information processing in particular generating true randomness. As a byproduct, we find that the non-local bound of the Cabello's argument with arbitrary dimension is the same as the one achieved in the qubits system. More interestingly, we propose a new dimension witness paradox based on the Cabello's argument, which can be used for constructing semi-device-independent true random numbers generation protocol.