This paper presents a semi-device independent protocol for randomness generation built on the prepare-and-measure scenario with multiple input and outputs. Additionally, we introduce practical implementations (theory and experiment) in both continuous and discrete variable domains.
It is a well-known fact in classical information theory that no deterministic procedure can extract close-to-ideal randomness from an arbitrary entropy source. On the other hand, if additional knowledge about the source is available -- e.g., that it is a sequence of independent Bernoulli trials -- then deterministic extractors do exist. For quantum entropy sources, where in addition to classical random variables we consider quantum side information, the use of extra knowledge about their structure was pioneered in a recent publication [C. Foreman and L. Masanes, Quantum 9, 1654 (2025)]. In that work, the authors provide deterministic extractors for device-independent randomness generation with memoryless devices achieving a sufficiently high CHSH score. In this work, we port their construction to the prepare-and-measure scenario. Specifically, we prove that the considered functions are also extractors for memoryless devices in settings with partial trust, either in the state preparation or in the measurement, as well as in a semi-device-independent setting under an overlap assumption on the prepared quantum states. Within this last setting, we simulate the resulting randomness generation protocol on a novel and experimentally relevant family of behaviors, observing positive key rates already for 7×103 rounds.
How to generate genuine quantum randomness from untrusted devices is an important problem in quantum information processing. Inspired by previous work on a self-testing quantum random number generator [T. Lunghi et al., Phys. Rev. Lett. 114, 150501 (2015)], we present a method to generate quantum randomness from a prepare-and-measure scenario with independent devices. In existing protocols, the quantum randomness depends only on a witness value (e.g., Clauser-Horne-Shimony-Holt value), which is calculated with the observed probabilities. Differently, here all the observed probabilities are directly used to calculate the min-entropy in our method. Through numerical simulation, we find that the min-entropy of our proposed scheme is higher than that in the previous work when a typical untrusted Bennett-Brassard 1984 (BB84) setup is used. Consequently, thanks to the proposed method, more genuine quantum random numbers may be obtained than before.
A key aspect in quantum information is to understand the advantage offered by quantum systems over classical ones in communication tasks. In recent years, a fundamental approach to this problem has been developed, focusing on quantum correlations in prepare-and-measure scenarios. Inspired by the developments in Bell nonlocality and device-independent information processing, this line of research aims to characterize the possibilities and limits of quantum systems for communication, in particular to precisely capture the advantage they offer over classical systems. In addition to fundamental insights, these ideas also underpin the concept of semi-device-independent quantum information processing. Exploring trade-offs between security, performance and ease-of-implementation, this approach opens promising directions for novel quantum information processing technologies and devices. A number of protocols and proof-of-principle demonstrations have been reported in recent years, in particular for quantum randomness certification and key distribution. Here, we provide a comprehensive introduction to quantum prepare-and-measure correlations and semi-device independent applications.
We consider quantum steering certification in multipartite networks, with a focus on minimal trust scenarios: all-except-one parties are untrusted and treated device-independently. We show that it is always possible to lift steering certification to the measurement-device-independent regime, in which even the (last) trusted party can treat their local hardware as a black-box, except for a set of fiduciary quantum states used as the inputs to the experiment. This holds both for finite-dimensional systems as well as for bosonic continuous-variable systems, which we characterize in terms of semi-quantum games in the bipartite case. Additionally, we introduce measurement-device-independent network steering protocols based entirely on Gaussian operations -- which cannot be used for fully device-independent protocols, and thus become instead a viable option for minimal trust certification as soon as a single trusted input is inserted in the network. Our results present a basis for steering-based applications (such as randomness generation) with minimal trust beyond full nonlocality and with feasible experimental requirements.
This paper examines a semi-self-testing quantum random number generator operating under untrusted measurements supported by a partially characterized source. Utilizing a prepare-and-measure approach, we ensure inherent uncertainty in measurement strategies, especially after verifying the transmission of non-orthogonal states from the partially trusted source. Through conditional min-entropy, we gauge randomness and showcase the entropy of diverse input distributions for both homodyne and heterodyne detectors