Quantifying randomness with measurement incompatibility
- URL: http://arxiv.org/abs/2607.08697v1
- Date: Thu, 09 Jul 2026 16:54:26 GMT
- Title: Quantifying randomness with measurement incompatibility
- Abstract summary: We present a trade-off between the amount of observed measurement incompatibility and the capabilities of a classical Eavesdropper.<n>We find a tight connection between steerability and randomness generation in a setting using any finite number of measurement inputs.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We present a trade-off between the amount of observed measurement incompatibility and the capabilities of a classical Eavesdropper in a prepare-and-measure scenario. The result is based on a qualitative connection between measurement incompatibility and randomness generation together with the utilization of incompatibility witnesses as randomness certificates. This allows one to use a geometric measure of incompatibility, the generalised robustness, to bound Eve's strategies through a semi-definite program, while providing an explicit protocol for generating randomness from any set of incompatible measurements. By translating the result to quantum steering, we find a tight connection between steerability and randomness generation in a setting using any finite number of measurement inputs. We further show how our techniques can be generalised to scenarios where Eve has a quantum memory by using a dimensional generalisation of joint measurability.
Related papers
- Generalized measurement incompatibility [0.0]
A weaker notion of joint-measurability, called partial joint-measurability, was proposed by Masini et al.<n>We show that, like full joint-measurability, partial joint-measurability can be decided by solving a single program.<n>Our results highlight the importance of a careful treatment of postselection in security analyses.
arXiv Detail & Related papers (2026-05-15T16:32:34Z) - Temporal Framework for Causality-Preserving Scheduling of Measurements in Quantum Networks [37.29183352005633]
quantum protocols rely on classical feedforward information to process measurement outcomes.<n> heterogeneous hardware and uncertain local timing can make causal order of measurements ambiguous.<n>We propose a time-division architecture for quantum networks in which nodes perform measurements in pre-assigned slots.
arXiv Detail & Related papers (2026-02-12T22:36:30Z) - Random measurements are almost maximally incompatible [1.024113475677323]
We show that for an appropriate choice of parameters, both random dichotomic projective measurements and random basis measurements are close to being maximally incompatible.<n>We use the technique of incompatibility witnesses to certify incompatibility and combine it with tools from random matrices and free probability.
arXiv Detail & Related papers (2025-07-28T08:11:17Z) - On Equivariant Model Selection through the Lens of Uncertainty [49.137341292207]
Equivariant models leverage prior knowledge on symmetries to improve predictive performance, but misspecified architectural constraints can harm it instead.<n>We compare frequentist (via Conformal Prediction), Bayesian (via the marginal likelihood), and calibration-based measures to naive error-based evaluation.<n>We find that uncertainty metrics generally align with predictive performance, but Bayesian model evidence does so inconsistently.
arXiv Detail & Related papers (2025-06-23T13:35:06Z) - Measurement incompatibility and quantum steering via linear programming [18.995314010885533]
We develop a hierarchy of linear programs that compute upper and lower bounds on the robustness of quantum measurements.<n>We show how our methods can be used to construct local hidden state models for states, or conversely to certify that a given state exhibits steering.
arXiv Detail & Related papers (2025-06-03T16:28:25Z) - Measurement-Incompatibility Constraints for Maximal Randomness [5.560127372386599]
Certifying maximal quantum randomness without assumptions about system dimension remains a pivotal challenge for secure communication and foundational studies.<n>Here, we introduce a generalized framework to directly certify maximal randomness from observed probability distributions across systems with arbitrary user numbers.<n>Our results establish a versatile and experimentally accessible route to scalable randomness certification, with implications for quantum cryptography and the physics of nonlocal correlations.
arXiv Detail & Related papers (2025-05-23T07:45:11Z) - Device-independent secure correlations in sequential quantum scenarios [44.99833362998488]
Device-independent quantum information is attracting significant attention, particularly for its applications in information security.<n>We propose a systematic approach to designing sequential quantum protocols for device-independent security.<n>We analytically prove that, with this systematic construction, the resulting ideal correlations are secure in the sense that they cannot be reproduced as a statistical mixture of other correlations.
arXiv Detail & Related papers (2025-03-18T16:45:20Z) - Classification of joint quantum measurements based on entanglement cost of localization [42.72938925647165]
We propose a systematic classification of joint measurements based on entanglement cost.
We show how to numerically explore higher levels and construct generalizations to higher dimensions and multipartite settings.
arXiv Detail & Related papers (2024-08-01T18:00:01Z) - Cost of Simulating Entanglement in Steering Scenario [26.293013514282134]
We show that the simulation cost is unbounded even for certain unsteerable two-qubit states.<n>A significant portion of our results rests on the relationship between the simulation cost of two-qubit Werner states and that of noisy spin measurements.
arXiv Detail & Related papers (2023-02-17T18:52:33Z) - Measurement incompatibility and quantum advantage in communication [0.0]
Measurement incompatibility stipulates the existence of quantum measurements that cannot be carried out simultaneously on single systems.
We show that the set of input-output probabilities obtained from d-dimensional classical systems assisted with shared randomness is the same as the set obtained from d-dimensional quantum strategies restricted to compatible measurements with shared randomness in any communication scenario.
arXiv Detail & Related papers (2022-09-29T06:45:01Z) - Experimentally determining the incompatibility of two qubit measurements [55.41644538483948]
We describe and realize an experimental procedure for assessing the incompatibility of two qubit measurements.
We demonstrate this fact in an optical setup, where the qubit states are encoded into the photons' polarization degrees of freedom.
arXiv Detail & Related papers (2021-12-15T19:01:44Z) - Verification of joint measurability using phase-space quasiprobability
distributions [0.0]
We introduce an approach to verify the joint measurability of measurements based on phase-space quasiprobability distributions.
Our results establish a connection between two notions of non-classicality, namely the negativity of quasiprobability distributions and measurement incompatibility.
arXiv Detail & Related papers (2020-12-12T16:21:36Z) - Generalized Sliced Distances for Probability Distributions [47.543990188697734]
We introduce a broad family of probability metrics, coined as Generalized Sliced Probability Metrics (GSPMs)
GSPMs are rooted in the generalized Radon transform and come with a unique geometric interpretation.
We consider GSPM-based gradient flows for generative modeling applications and show that under mild assumptions, the gradient flow converges to the global optimum.
arXiv Detail & Related papers (2020-02-28T04:18:00Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.