Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2606.12079

A semi-definite programming formulation of the device-dependent guessing probability

Raffaele D'Avino, Aurora Mugnai, Miguel Navascués, Antonio Acín, Gabriel Senno

quant-phSubmitted Jun 10, 2026• Announced Jun 11, 2026• 0 citations
arXivHTMLPDF

Abstract

In quantum mechanics, a measurement applied to a state in general produces some amount of intrinsic randomness. This is not only a fundamental feature of the theory, but is also at the basis of any quantum process to generate random numbers. The simplest of such processes consists of a single, fully charaterized, measurement acting on a single, fully characterized, state. Unfortunately, no general method to estimate the intrinsic randomness produced in such setups is known. In this work, we address this issue by presenting a semidefinite programming formulation of the maximum probability with which an adversary, Eve, can guess the outcomes of characterized but untrusted prepare-and-measure setups. We then present several applications of this construction. First, we apply our method to a variety of specific setups, allowing us both to benchmark the approach and, more importantly, to determine the exact amount of certifiable randomness in scenarios where only upper bounds were previously available. Then, we show that the presence of entanglement between the device preparing the state and the measurement strictly increases Eve's predictive power, already in the most elementary setup of a binary measurement acting on a qubit state.

Related papers

Quantifying the Intrinsic Randomness of Quantum Measurements

Gabriel Senno, Thomas Strohm, Antonio Acín

Intrinsic quantum randomness is produced when a projective measurement on a given basis is implemented on a pure state that is not an element of the basis. The prepared state and implemented measurement are perfectly known, yet the measured result cannot be deterministically predicted. In realistic situations, however, measurements and state preparation are always noisy, which introduces a component of stochasticity in the outputs that is not a consequence of the intrinsic randomness of quantum theory. Operationally, this stochasticity is modeled through classical or quantum correlations with an eavesdropper, Eve, whose goal is to make the best guess about the outcomes produced in the experiment. In this Letter, we study Eve's maximum guessing probability when she is allowed to have correlations with both the state and the measurement. We show that, unlike the case of projective measurements (as it was already known) or pure states (as we prove), in the setting of generalized measurements and mixed states, Eve's guessing probability differs depending on whether she can prepare classically or quantumly correlated strategies.

arXiv:2211.03581•Physical Review Letters•Sep 28, 2023•9 citations

Randomness can be certified in energy-constrained semi-device-independent scenarios

Shashank Kumar Ranu, Lewis Wooltorton, Alastair A. Abbott +1 more

The prepare-and-measure framework based on energy constraints offers a practical middle ground between fully device-dependent and device-independent quantum cryptography. The only assumption on an otherwise uncharacterized prepare-and-measure device is that the energy of the prepared states is bounded. Existing security analyses of this framework assume that the preparation and measurement devices share at most classical correlations, and under this assumption certified lower bounds on the extractable randomness have been established. Recent work has shown that an adversary who pre-distributes entanglement between the devices can mount attacks that are strictly more powerful than those available when the devices share only classical correlations, reducing the extractable randomness below the previously certified rates. This leaves open the fundamental question of whether randomness can be certified at all in this scenario. We address this open question by constructing semidefinite programming relaxations of the guessing probability by adapting the Navascués-Pironio-Acín hierarchy to the energy-constrained setting where shared entanglement between the devices is permitted. Our relaxations yield certified lower bounds on the extractable randomness without enforcing any restrictions on the dimensions of the quantum state shared between the preparation and measurement devices. We show that these certified lower bounds are strictly positive for a range of energy values, thereby answering the open question affirmatively: certified randomness generation is theoretically possible in the energy-constrained SDI framework even in the presence of a fully quantum adversary.

quant-pharXiv:2608.27357•Aug 28, 2026•0 citations

Entanglement in the energy-constrained prepare-and-measure scenario: applications to randomness certification and channel discrimination

Raffaele D'Avino, Gabriel Senno, Mir Alimuddin +1 more

Quantum information tasks are often analyzed under varying trust assumptions about the devices involved. The semi-device-independent (SDI) framework offers a balance between needed assumptions and experimental feasibility. In this work, we study the energy-constrained SDI scenario, where the only assumption in a prepare-and-measure setup is an upper bound on the energy of the prepared quantum states. In contrast to previous studies that restricted the preparation and measurement devices to be classically correlated, we show that allowing entanglement strictly enlarges the set of achievable correlations. We identify two operational consequences of this result. The first concerns randomness certification, where we show that allowing the adversary to employ entangled strategies may significantly reduce the amount of certifiable randomness. This includes situations where the amount of randomness drops to zero in the presence of entanglement, while it remains positive when entanglement is excluded. Second, for the task of distinguishing an arbitrary quantum channel from the identity, we show that the known dimension-independent bound on the advantage conferred by entanglement is violated under an energy constraint.

arXiv:2510.27559•Oct 31, 2025•0 citations

Quantum randomness beyond projective measurements

Fionnuala Curran

The unpredictability of quantum physics gives rise to intrinsic randomness. In an adversarial scenario, any additional degrees of freedom must be attributed to an eavesdropper with correlations to the measurement set-up. The true randomness is then quantified by the probability that she correctly guesses the measurement outcomes, optimised over all possible strategies. Extremal measurements are appealing here, since they do not allow information to leak to such an eavesdropper. Beyond projective measurements, however, a simple question remains open: how much intrinsic randomness can be generated by a given extremal measurement? In a step towards solving it, we characterise the randomness generated by any unbiased extremal rank-one measurement acting on any state, solving the problem explicitly in dimension two. Four-outcome qubit measurements of this type are tomographic, so these results hold for fully source-device-dependent randomness too. The tetrahedral symmetric informationally complete (SIC) measurement, we find, has the least intrinsic randomness within this class. We also present the skewed SIC family of measurements, and use them to partially solve an open problem: we prove that $2 \log d$ bits of randomness, the maximal amount, can be generated device-dependently (or source-device-independently) in any dimension in which there exists a SIC measurement.

quant-pharXiv:2605.18291•Quantum Science and Technology•May 19, 2026•0 citations

All star-incompatible measurements can certify steering-based randomness

Shintaro Minagawa, Ravi Kunjwal

Certifying that quantum randomness generated by untrusted devices is unpredictable to an attacker (say, Eve) is crucial for device-independent security. Bipartite protocols where only one of the parties is trusted are termed one-sided device-independent (1SDI) or steering-based protocols, where the untrusted party (say, Alice) performs measurements on her part of a bipartite entangled state to steer the subsystem of the trusted party (say, Bob) into different ensembles (collectively, an assemblage) of quantum states. Recent work has shown that an assemblage has certified randomness if and only if its realization requires a set of measurements that are star-incompatible, i.e., the measurement setting of interest for the guessing probability of Eve is incompatible with at least one of the remaining measurement settings of Alice. However, can one always extract randomness from star-incompatible measurements? And if so, how much randomness can one extract from them? Here we demonstrate that one can extract steering-based randomness from any set of star-incompatible measurements, thereby establishing an equivalence between star-incompatibility and steering-based randomness. We then provide a lower bound on the minimum guessing probability for a given set of measurements that is computable via semidefinite programming. This bound is tight when the Hilbert space dimension of Bob's system is at least that of Alice's. Finally, to provide a quantitative handle on star-incompatibility and the randomness extractable from it, we introduce a weight-based measure of star-incompatibility and lower bound the amount of star-incompatibility required to certify a given amount of randomness.

quant-pharXiv:2603.12024•Mar 13, 2026•0 citations

Certifying the inherent randomness in quantum state discrimination

Oliver Karlsson

Quantum mechanics forbids perfect discrimination of non-orthogonal states, a limitation that can be exploited to certify intrinsic randomness. Building on this principle, this thesis investigates how limits on state discrimination can be used to generate certified randomness in prepare-and-measure protocols. In particular, we study how the performance of minimum-error quantum state discrimination constrains an adversary’s ability to predict measurement outcomes, under the sole assumption of an average energy constraint on the prepared states. We show how observed discrimination performance bounds an adversary’s optimal guessing probability and yields certified min-entropy. Exact results are obtained for fixed-dimension qubit ensembles, including closed-form expressions for two-qubit preparations and extensions to general qubit ensembles. We then introduce dimension-unbounded semidefinite programming relaxations based on Gram-matrix techniques, providing device-independent bounds that rely only on the energy constraint. A central result is the identification of critical discrimination thresholds beyond which deterministic strategies are excluded and genuine quantum randomness is certified. These results establish quantum state discrimination as an operational witness for randomness generation under natural physical assumptions.

•Jan 1, 2026•0 citations
In quantum mechanics, a measurement applied to a state in general produces some amount of intrinsic randomness. This is not only a fundamental feature of the theory, but is also at the basis of any quantum process to generate random numbers. The simplest of such processes consists of a single, fully charaterized, measurement acting on a single, fully characterized, state. Unfortunately, no general method to estimate the intrinsic randomness produced in such setups is known. In this work, we address this issue by presenting a semidefinite programming formulation of the maximum probability with which an adversary, Eve, can guess the outcomes of characterized but untrusted prepare-and-measure setups. We then present several applications of this construction. First, we apply our method to a variety of specific setups, allowing us both to benchmark the approach and, more importantly, to determine the exact amount of certifiable randomness in scenarios where only upper bounds were previously available. Then, we show that the presence of entanglement between the device preparing the state and the measurement strictly increases Eve's predictive power, already in the most elementary setup of a binary measurement acting on a qubit state.
Intrinsic quantum randomness is produced when a projective measurement on a given basis is implemented on a pure state that is not an element of the basis. The prepared state and implemented measurement are perfectly known, yet the measured result cannot be deterministically predicted. In realistic situations, however, measurements and state preparation are always noisy, which introduces a component of stochasticity in the outputs that is not a consequence of the intrinsic randomness of quantum theory. Operationally, this stochasticity is modeled through classical or quantum correlations with an eavesdropper, Eve, whose goal is to make the best guess about the outcomes produced in the experiment. In this Letter, we study Eve's maximum guessing probability when she is allowed to have correlations with both the state and the measurement. We show that, unlike the case of projective measurements (as it was already known) or pure states (as we prove), in the setting of generalized measurements and mixed states, Eve's guessing probability differs depending on whether she can prepare classically or quantumly correlated strategies.
The prepare-and-measure framework based on energy constraints offers a practical middle ground between fully device-dependent and device-independent quantum cryptography. The only assumption on an otherwise uncharacterized prepare-and-measure device is that the energy of the prepared states is bounded. Existing security analyses of this framework assume that the preparation and measurement devices share at most classical correlations, and under this assumption certified lower bounds on the extractable randomness have been established. Recent work has shown that an adversary who pre-distributes entanglement between the devices can mount attacks that are strictly more powerful than those available when the devices share only classical correlations, reducing the extractable randomness below the previously certified rates. This leaves open the fundamental question of whether randomness can be certified at all in this scenario. We address this open question by constructing semidefinite programming relaxations of the guessing probability by adapting the Navascués-Pironio-Acín hierarchy to the energy-constrained setting where shared entanglement between the devices is permitted. Our relaxations yield certified lower bounds on the extractable randomness without enforcing any restrictions on the dimensions of the quantum state shared between the preparation and measurement devices. We show that these certified lower bounds are strictly positive for a range of energy values, thereby answering the open question affirmatively: certified randomness generation is theoretically possible in the energy-constrained SDI framework even in the presence of a fully quantum adversary.
Quantum information tasks are often analyzed under varying trust assumptions about the devices involved. The semi-device-independent (SDI) framework offers a balance between needed assumptions and experimental feasibility. In this work, we study the energy-constrained SDI scenario, where the only assumption in a prepare-and-measure setup is an upper bound on the energy of the prepared quantum states. In contrast to previous studies that restricted the preparation and measurement devices to be classically correlated, we show that allowing entanglement strictly enlarges the set of achievable correlations. We identify two operational consequences of this result. The first concerns randomness certification, where we show that allowing the adversary to employ entangled strategies may significantly reduce the amount of certifiable randomness. This includes situations where the amount of randomness drops to zero in the presence of entanglement, while it remains positive when entanglement is excluded. Second, for the task of distinguishing an arbitrary quantum channel from the identity, we show that the known dimension-independent bound on the advantage conferred by entanglement is violated under an energy constraint.
The unpredictability of quantum physics gives rise to intrinsic randomness. In an adversarial scenario, any additional degrees of freedom must be attributed to an eavesdropper with correlations to the measurement set-up. The true randomness is then quantified by the probability that she correctly guesses the measurement outcomes, optimised over all possible strategies. Extremal measurements are appealing here, since they do not allow information to leak to such an eavesdropper. Beyond projective measurements, however, a simple question remains open: how much intrinsic randomness can be generated by a given extremal measurement? In a step towards solving it, we characterise the randomness generated by any unbiased extremal rank-one measurement acting on any state, solving the problem explicitly in dimension two. Four-outcome qubit measurements of this type are tomographic, so these results hold for fully source-device-dependent randomness too. The tetrahedral symmetric informationally complete (SIC) measurement, we find, has the least intrinsic randomness within this class. We also present the skewed SIC family of measurements, and use them to partially solve an open problem: we prove that 2log⁡d2 \log d2logd bits of randomness, the maximal amount, can be generated device-dependently (or source-device-independently) in any dimension in which there exists a SIC measurement.
Certifying that quantum randomness generated by untrusted devices is unpredictable to an attacker (say, Eve) is crucial for device-independent security. Bipartite protocols where only one of the parties is trusted are termed one-sided device-independent (1SDI) or steering-based protocols, where the untrusted party (say, Alice) performs measurements on her part of a bipartite entangled state to steer the subsystem of the trusted party (say, Bob) into different ensembles (collectively, an assemblage) of quantum states. Recent work has shown that an assemblage has certified randomness if and only if its realization requires a set of measurements that are star-incompatible, i.e., the measurement setting of interest for the guessing probability of Eve is incompatible with at least one of the remaining measurement settings of Alice. However, can one always extract randomness from star-incompatible measurements? And if so, how much randomness can one extract from them? Here we demonstrate that one can extract steering-based randomness from any set of star-incompatible measurements, thereby establishing an equivalence between star-incompatibility and steering-based randomness. We then provide a lower bound on the minimum guessing probability for a given set of measurements that is computable via semidefinite programming. This bound is tight when the Hilbert space dimension of Bob's system is at least that of Alice's. Finally, to provide a quantitative handle on star-incompatibility and the randomness extractable from it, we introduce a weight-based measure of star-incompatibility and lower bound the amount of star-incompatibility required to certify a given amount of randomness.
Quantum mechanics forbids perfect discrimination of non-orthogonal states, a limitation that can be exploited to certify intrinsic randomness. Building on this principle, this thesis investigates how limits on state discrimination can be used to generate certified randomness in prepare-and-measure protocols. In particular, we study how the performance of minimum-error quantum state discrimination constrains an adversary’s ability to predict measurement outcomes, under the sole assumption of an average energy constraint on the prepared states. We show how observed discrimination performance bounds an adversary’s optimal guessing probability and yields certified min-entropy. Exact results are obtained for fixed-dimension qubit ensembles, including closed-form expressions for two-qubit preparations and extensions to general qubit ensembles. We then introduce dimension-unbounded semidefinite programming relaxations based on Gram-matrix techniques, providing device-independent bounds that rely only on the energy constraint. A central result is the identification of critical discrimination thresholds beyond which deterministic strategies are excluded and genuine quantum randomness is certified. These results establish quantum state discrimination as an operational witness for randomness generation under natural physical assumptions.