Finite rate randomness expansion (RE) which is secure against quantum adversaries is a crucial information processing task which is well studied in the case of two non-communicating parties sharing Bell non-local correlations in a device independent manner. In this paper we show that contextual correlations with only a single localized party are sufficient for RE in a semi-device independent (SDI) manner. We propose a template SDI-RE protocol which is applicable for arbitrary $N$-cycle non-contextuality (NC) inequalities and derive its RE rate under finite statistics. As a special case, we also highlight the advantages of the situation when RE is constrained by Clauser-Horne-Shimony-Holt (CHSH) inequality but with characterized measurements implemented by only a single party. Our template protocol also incorporates non-ideal statistics which may not satisfy perfect commutativity and perfect repeatability, both of which are necessary in a loophole-free test of NC inequalities. As such, several recent experimental implementations of significantly loophole-free tests of NC inequalities can be modified for secure RE following our approach.
AI Summary
The paper studies whether contextuality can support finite-size randomness expansion against quantum side information using a single localized device, rather than spatially separated Bell-test devices. It proposes spot-checking protocols for odd and even $N$-cycle noncontextuality inequalities, with KCBS ($N=5$) and locally implemented CHSH ($N=4$) as examples. The source is untrusted; measurements require partial characterization, including known dimension, repeatability and compatibility. Devices are assumed memoryless, with rounds independent but not necessarily identical.
Generation rounds use one fixed measurement, while test rounds sequentially measure adjacent settings in the cycle. A semidefinite-programming bound on single-round conditional von Neumann entropy supplies an affine min-tradeoff function for entropy accumulation. Quantum-proof extraction then gives a claimed universally composable security guarantee. Net rates subtract the randomness consumed by test selection and settings. For $n=10^{12}$ rounds, the reported rates are approximately $0.67$ bits per round for KCBS at score $0.4460$ (quantum maximum $1/\sqrt{5}$), and $0.78$ for CHSH at score $0.8526$ (maximum $(2+\sqrt{2})/4$), using test probabilities near $10^{-2}$ and acceptance width $\delta=3\times10^{-5}$.
The protocol incorporates measured repeatability and compatibility deviations by enlarging the acceptance interval. The paper identifies memorylessness as a principal limitation and leaves its removal open. Its numerical examples assume characterization errors of order $10^{-5}$, whereas a cited contextuality experiment reports a relevant compatibility deviation around $10^{-2}$. The results are theoretical rate calculations, not an experimental randomness-expansion demonstration.
Little sign of AI-generated textIncrementalStrong assumptionsPossible errorOverclaims
Central claim may not hold: The fixed-measurement entropy SDP is not justified by the protocol’s stated characterization of only repeatability, compatibility and dimension.
The paper gives no entropy-robustness bound that justifies using its ideal-measurement security calculation when repeatability and compatibility are imperfect.
The characterization requirements impose adjacent-projector orthogonality, which forces the four-cycle score to be at most 3/4 and excludes the advertised CHSH violation.
The supplied even-cycle state and measurements yield a four-cycle score of 1/2 rather than the claimed quantum maximum.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Comments
Minor changes, 14 pages, 10 figures. Comments are welcome
Finite rate randomness expansion (RE) which is secure against quantum adversaries is a crucial information processing task which is well studied in the case of two non-communicating parties sharing Bell non-local correlations in a device independent manner. In this paper we show that contextual correlations with only a single localized party are sufficient for RE in a semi-device independent (SDI) manner. We propose a template SDI-RE protocol which is applicable for arbitrary N-cycle non-contextuality (NC) inequalities and derive its RE rate under finite statistics. As a special case, we also highlight the advantages of the situation when RE is constrained by Clauser-Horne-Shimony-Holt (CHSH) inequality but with characterized measurements implemented by only a single party. Our template protocol also incorporates non-ideal statistics which may not satisfy perfect commutativity and perfect repeatability, both of which are necessary in a loophole-free test of NC inequalities. As such, several recent experimental implementations of significantly loophole-free tests of NC inequalities can be modified for secure RE following our approach.
The paper studies whether contextuality can support finite-size randomness expansion against quantum side information using a single localized device, rather than spatially separated Bell-test devices. It proposes spot-checking protocols for odd and even N-cycle noncontextuality inequalities, with KCBS (N=5) and locally implemented CHSH (N=4) as examples. The source is untrusted; measurements require partial characterization, including known dimension, repeatability and compatibility. Devices are assumed memoryless, with rounds independent but not necessarily identical.
Generation rounds use one fixed measurement, while test rounds sequentially measure adjacent settings in the cycle. A semidefinite-programming bound on single-round conditional von Neumann entropy supplies an affine min-tradeoff function for entropy accumulation. Quantum-proof extraction then gives a claimed universally composable security guarantee. Net rates subtract the randomness consumed by test selection and settings. For n=1012 rounds, the reported rates are approximately 0.67 bits per round for KCBS at score 0.4460 (quantum maximum 1/5), and 0.78 for CHSH at score 0.8526 (maximum (2+2)/4), using test probabilities near 10−2 and acceptance width δ=3×10−5.
The protocol incorporates measured repeatability and compatibility deviations by enlarging the acceptance interval. The paper identifies memorylessness as a principal limitation and leaves its removal open. Its numerical examples assume characterization errors of order 10−5, whereas a cited contextuality experiment reports a relevant compatibility deviation around 10−2. The results are theoretical rate calculations, not an experimental randomness-expansion demonstration.
In quantum cryptography, secure randomness expansion involves using a short private string of random bits to generate a longer one, even in the presence of an adversary who may have access to quantum resources. In this work, we demonstrate that local contextuality-based self-tests are sufficient to construct a randomness expansion protocol that is secure against computationally unbounded quantum adversaries. Our protocol is based on self-testing from non-contextuality inequalities and we prove that our scheme asymptotically produces secure random numbers which are O(mε)-close to uniformly distributed and private, where ε is the robustness parameter of the self-test and m is the length of the generated random bit string. Our protocol is semi-device-independent in the sense that it inherits any assumptions necessary for the underlying self-test.
Semi-device-independent randomness generation protocols based on Kochen-Specker contextuality offer the attractive features of compact devices, high rates, and ease of experimental implementation over fully device-independent (DI) protocols. Here, we investigate this paradigm and derive four results to improve the state of the art. Firstly, we introduce a family of simple, experimentally feasible orthogonality graphs (measurement compatibility structures) for which the maximum violation of the corresponding noncontextuality inequalities allows the certification of the maximum amount of log_{2}d bits of randomness from a qudit system with projective measurements for d≥3. We analytically derive the Lovász theta and fractional packing number for this graph family, and thereby prove their utility for optimal randomness generation in both randomness expansion and amplification tasks. Secondly, a central additional assumption in contextuality-based protocols over fully DI ones is that the measurements are repeatable and satisfy an intended compatibility structure. We frame a relaxation of this condition in terms of ϵ-orthogonality graphs for a parameter ϵ>0, and derive quantum correlations that allow the certification of randomness for arbitrary relaxation ϵ∈[0,1). Thirdly, it is well-known that a single qubit is noncontextual, i.e., the qubit correlations can be explained by a noncontextual hidden variable model. We show however that a single qubit is almost contextual in that there exist qubit correlations that cannot be explained by ϵ-faithful noncontextual hidden variable models for small ϵ>0. Finally, we point out possible attacks by quantum and general consistent (nonsignaling) adversaries for certain classes of contextuality tests over and above those considered in DI scenarios.
One of the distinguishing features of quantum theory is that its measurement outcomes are usually unpredictable or, equivalently, random. Moreover, this randomness is certifiable with minimal assumptions in the so-called device-independent (DI) paradigm, where a device's behavior does not need to be presupposed but can be verified through the statistics it produces. In this work, we explore various forms of randomness that are certifiable in this setting, where two users can perform two binary-outcome measurements on their shared entangled state. In this case, even though the Clauser-Horne-Shimony-Holt (CHSH) Bell-inequality violation is a pre-requisite for the generation of DI certifiable randomness, the CHSH value alone does not generally give a tight bound on the certifiable randomness. Here, we determine the certifiable randomness when zero-probability constraints are incorporated into the task of DI randomness expansion for the standard local and global randomness and the so-called "blind" randomness. Asymptotically, we observe consistent improvements in the amount of DI certifiable randomness (of all kinds) as we increase the number zero constraints for a wide range of given CHSH Bell violations. However, if we further optimize over the allowed CHSH values, then benefits of these additional constraints over the standard CHSH-based protocol are only found in the case of global and blind randomness. In contrast, in the regimes of finite data, these zero constraints only give a slight improvement in the local randomness rate when compared with all existing protocols.
Semi-device-independent random number expansion (SDI-RNE) protocols require some truly random numbers to generate fresh ones, with making no assumptions on the internal working of quantum devices except for the dimension of the Hilbert space. The generated randomness is certified by non-classical correlation in the prepare-and-measure test. Until now, the analytical relations between the amount of the generated randomness and the degree of non-classical correlation, which are crucial for evaluating the security of SDI-RNE protocols, are not clear under both the ideal condition and the practical one. In the paper, first, we give the analytical relation between the above two factors under the ideal condition. As well, we derive the analytical relation under the practical conditions, where devices' behavior is not independent and identical in each round and there exists deviation in estimating the non-classical behavior of devices. Furthermore, we choose a different randomness extractor (i.e., two-universal random function) and give the security proof.
Abstract The intrinsic random nature of quantum physics offers novel tools for the generation of random numbers, a central challenge for a plethora of fields. Bell non-local correlations obtained by measurements on entangled states allow for the generation of bit strings whose randomness is guaranteed in a device-independent manner, i.e. without assumptions on the measurement and state-generation devices. Here, we generate this strong form of certified randomness on a new platform: the so-called instrumental scenario, which is central to the field of causal inference. First, we theoretically show that certified random bits, private against general quantum adversaries, can be extracted exploiting device-independent quantum instrumental-inequality violations. Then, we experimentally implement the corresponding randomness-generation protocol using entangled photons and active feed-forward of information. Moreover, we show that, for low levels of noise, our protocol offers an advantage over the simplest Bell-nonlocality protocol based on the Clauser-Horn-Shimony-Holt inequality.
Bell nonlocality provides a device-independent (DI) way to certify quantum randomness, based on which true random numbers can be extracted from the observed correlations without detail characterizations on devices for quantum state preparation and measurement. However, the efficiency of current strategies for DI randomness certification is still heavily constrained when it comes to non-maximal Bell values, especially for multiple parties. Here, we present a family of multipartite Bell inequalities that allows to certify optimal quantum randomness and self-test GHZ (Greenberger-Horne-Zeilinger) states, which are inspired from the stabilizer group of the GHZ state. Due to the simple representation of stabilizer group for GHZ states, this family of Bell inequalities is of simple structure and can be easily expanded to more parties. Compared with the Mermin-type inequalities, this family of Bell inequality is more efficient in certifying quantum randomness when non-maximal Bell values achieved. Meanwhile, the general analytical upper bound for the Holevo quantity is presented, and achieves better performance compared with the MABK (Mermin-Ardehali-Belinskii-Klyshko) inequality, Parity-CHSH (Clauser-Horne-Shimony-Holt) inequality and Holz inequality at N=3, which is of particular interests for experimental researches on DI quantum cryptography in quantum networks.