Randomness Certification and Trade-offs in the Prepare-and-Broadcast Scenario

• URL: http://arxiv.org/abs/2608.08329v1
• Date: Sat, 08 Aug 2026 20:40:47 GMT
• Title: Randomness Certification and Trade-offs in the Prepare-and-Broadcast Scenario
• Abstract summary: 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.
• Score: 0.11726720776908518
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate the prepare-and-broadcast scenario, a multipartite extension of dimension-constrained prepare-and-measure experiments in which a quantum system is distributed to multiple receivers. We derive fundamental trade-offs between prepare-and-measure witnesses, Bell nonlocality, and quantum random access code performance. We further develop a semi-device-independent randomness certification framework based on prepare-and-broadcast witnesses, showing that the maximal quantum violation certifies two bits of joint randomness, exceeding the limit achievable from the CHSH inequality while remaining robust to noise. Finally, we show that the prepare-and-broadcast scenario naturally accommodates stronger adversarial models in which the eavesdropper retains a quantum system correlated with the measurement device, providing a natural framework for semi-device-independent randomness certification against quantum side information.

Related papers

• 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)
• 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)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• 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)
• Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement [45.386403865847235]
  Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs.<n>Quantum PUFs (QPUFs) extend this concept by using quantum states as input-output pairs.<n>We show that random unitary QPUFs cannot achieve existential unforgeability against Quantum Polynomial Time adversaries.<n>We introduce a second model where the QPUF functions as a nonunitary quantum channel, which guarantees existential unforgeability.
  arXiv  Detail & Related papers  (2024-04-17T12:16:41Z)
• Secure and robust randomness with sequential quantum measurements [0.0]
  We prove a Tsirelson-like boundary for sequential quantum correlations, which represents a trade-off in nonlocality shared by sequential users.<n>Our simple qubit protocol reaches this boundary, and numerical analysis shows improved robustness under realistic noise.<n>This study advances understanding of sequential quantum correlations and offers insights for efficient device-independent protocols.
  arXiv  Detail & Related papers  (2023-09-21T17:50:29Z)
• 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 Robustness of Quantum Classifiers against Adversarial Examples through Quantum Noise [68.1992787416233]
  We show that adding quantum random rotation noise can improve robustness in quantum classifiers against adversarial attacks. We derive a certified robustness bound to enable quantum classifiers to defend against adversarial examples.
  arXiv  Detail & Related papers  (2022-11-02T05:17:04Z)
• Sample-efficient device-independent quantum state verification and certification [68.8204255655161]
  Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing. We develop a systematic approach to device-independent verification of quantum states free of IID assumptions in the finite copy regime. We show that device-independent verification can be performed with optimal sample efficiency.
  arXiv  Detail & Related papers  (2021-05-12T17:48:04Z)
• Semi-device-independent framework based on restricted distrust in prepare-and-measure experiments [0.0]
  A semi-device-independent framework for prepare-and-measure experiments is introduced. An experimenter can tune the degree of distrust in the performance of the quantum devices.
  arXiv  Detail & Related papers  (2021-01-19T19:23:16Z)
• 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)
• Semi-Device-Independent Random Number Generation with Flexible Assumptions [0.0]
  We propose a new framework for semi-device-independent randomness certification using a source of trusted vacuum in the form of a signal shutter. We experimentally demonstrate our protocol with a photonic setup and generate secure random bits under three different assumptions with varying degrees of security and resulting data rates.
  arXiv  Detail & Related papers  (2020-02-27T18:05:17Z)

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.