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

• URL: http://arxiv.org/abs/2606.12079v1
• Date: Wed, 10 Jun 2026 13:44:03 GMT
• Title: A semi-definite programming formulation of the device-dependent guessing probability
• Abstract summary: In quantum mechanics, a measurement applied to a state in general produces some amount of intrinsic randomness.<n>No general method to estimate the intrinsic randomness produced in such setups is known.<n>We show that the presence of entanglement between the device preparing the state and the measurement strictly increases Eve's predictive power.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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

• Continuous-Variable Source-Independent Quantum Random Number Generation with General POVMs [9.797328475012575]
  Continuous-variable source-independent quantum random number generators offer the highest generation rates among semi-device-independent protocols.<n>We propose a rigorous security proof framework that accommodates general, infinite-dimensional positive-operator-valued measures.<n>We experimentally validate our protocol on an optical platform using vacuum and weak coherent states, achieving a maximum secure randomness extraction of 1.11 bits per sample.
  arXiv  Detail & Related papers  (2026-06-30T01:48:49Z)
• Sequential Semi-Device-Independent Quantum Randomness Certification [0.7480063019124682]
  Quantum measurements under realistic conditions reveal only partial information about a system.<n>By performing sequential measurements on the same system, additional information can be accessed.<n>We develop a general framework and versatile numerical methods to bound the amount of certifiable randomness.
  arXiv  Detail & Related papers  (2025-10-22T10:17:32Z)
• Maximal intrinsic randomness of noisy quantum measurements [1.4913052010438639]
  Given a quantum measurement, how much randomness can be generated from it?<n>In this work, we consider the following question: Given a quantum measurement, how much randomness can be generated from it?
  arXiv  Detail & Related papers  (2025-06-27T15:05:15Z)
• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states.<n>It is executable on current (hybrid) quantum hardware and does not depend on quantum memory.<n>We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Quantifying the intrinsic randomness in sequential measurements [6.606799868136239]
  In this paper, we define quantum intrinsic randomness in sequential measurements. We quantify randomness in the Collins-Gisin-Linden-Massar-Popescu (CGLMP) inequality sequential scenario.
  arXiv  Detail & Related papers  (2024-01-12T09:44:17Z)
• A universal scheme to self-test any quantum state and extremal measurement [41.94295877935867]
  quantum network considered in this work is the simple star network, which is implementable using current technologies. For our purposes, we also construct a scheme that can be used to self-test the two-dimensional tomographically complete set of measurements with an arbitrary number of parties.
  arXiv  Detail & Related papers  (2023-12-07T16:20:28Z)
• Postselection-free learning of measurement-induced quantum dynamics [0.0]
  We introduce a general-purpose scheme that can be used to infer any property of the post-measurement ensemble of states. As an immediate application, we show that our method can be used to verify the emergence of quantum state designs in experiments.
  arXiv  Detail & Related papers  (2023-10-06T11:06:06Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Testing randomness of series generated in Bell's experiment [62.997667081978825]
  We use a toy fiber optic based setup to generate binary series, and evaluate their level of randomness according to Ville principle. Series are tested with a battery of standard statistical indicators, Hurst, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent. The level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.
  arXiv  Detail & Related papers  (2022-08-31T17:39:29Z)
• Certified Randomness From Steering Using Sequential Measurements [0.0]
  A single entangled two-qubit pure state can be used to produce arbitrary amounts of certified randomness. Motivated by these difficulties in the device-independent setting, we consider the scenario of one-sided device independence. We show how certain aspects of previous work can be adapted to this scenario and provide theoretical bounds on the amount of randomness which can be certified.
  arXiv  Detail & Related papers  (2020-08-03T08:18:29Z)
• 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.