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

• URL: http://arxiv.org/abs/2608.27357v1
• Date: Thu, 27 Aug 2026 16:55:04 GMT
• Title: Randomness can be certified in energy-constrained semi-device-independent scenarios
• Abstract summary: A prepare-and-measure framework based on energy constraints offers a practical middle ground between device-dependent and device-independent quantum cryptography.<n>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.<n>We show that certified randomness generation is theoretically possible in the energy-constrained SDI framework even in the presence of a fully quantum adversary.
• Score: 6.393096585356369
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Randomness Certification and Trade-offs in the Prepare-and-Broadcast Scenario [0.11726720776908518]
  We develop a semi-device-independent randomness certification framework based on prepare-and-broadcast witnesses.<n>We show that the maximal quantum violation certifies two bits of joint randomness, exceeding the limit achievable from the CHSH inequality.
  arXiv  Detail & Related papers  (2026-08-08T20:40:47Z)
• Operational interpretation of the reverse sandwiched Renyi divergences in composite quantum hypothesis testing [40.82628972269358]
  We study the Hoeffding regime of composite quantum hypothesis testing, in which each hypothesis is specified by a sequence of sets of quantum states.<n>We find that passing from simple to composite hypotheses can fundamentally change which quantum divergence determines the operational limits of discrimination.
  arXiv  Detail & Related papers  (2026-05-04T04:02:55Z)
• Entanglement in the energy-constrained prepare-and-measure scenario: applications to randomness certification and channel discrimination [0.0]
  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.<n>We show that allowing entanglement strictly enlarges the set of achievable correlations.
  arXiv  Detail & Related papers  (2025-10-31T15:42:45Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Certified randomness from quantum speed limits [0.0]
  We show that speed limits enable the secure generation of randomness.<n>We show how to determine the amount of certified randomness given the observed correlations.<n>Remarkably, even single-mode coherent states admit this kind of certification of non-zero randomness.
  arXiv  Detail & Related papers  (2025-06-17T13:52:22Z)
• 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)
• Certifying classes of $d$-outcome measurements with quantum steering [49.1574468325115]
  We provide a construction of a family of steering inequalities tailored to large classes of $d$-outcomes projective measurements. We prove that the maximal quantum violation of those inequalities can be used for certification of those measurements and the maximally entangled state of two qudits.
  arXiv  Detail & Related papers  (2024-10-27T15:32:53Z)
• Improving semi-device-independent randomness certification by entropy accumulation [5.264789505615773]
  We show that the amount of certifiable randomness can be greatly improved using the so-called Entropy Accumulation Theorem.<n>We demonstrate this improvement in semi-device-independent randomness certification from untrusted measurements.
  arXiv  Detail & Related papers  (2024-05-07T12:00:22Z)
• 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)
• Certified randomness in tight space [28.7482666629286]
  We provide a method for certified randomness generation on a small-scale application-ready device. We demonstrate a 2-qubit photonic device that achieves the highest standard in randomness yet is cut out for real-world applications.
  arXiv  Detail & Related papers  (2023-01-09T17:34:48Z)
• 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)
• Efficient Conformal Prediction via Cascaded Inference with Expanded Admission [43.596058175459746]
  We present a novel approach for conformal prediction (CP) We aim to identify a set of promising prediction candidates -- in place of a single prediction. This set is guaranteed to contain a correct answer with high probability.
  arXiv  Detail & Related papers  (2020-07-06T23:13:07Z)

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.