Experimental Verification of Entangled States in the Adversarial Scenario

• URL: http://arxiv.org/abs/2506.10655v1
• Date: Thu, 12 Jun 2025 12:45:21 GMT
• Title: Experimental Verification of Entangled States in the Adversarial Scenario
• Authors: Wen-Hao Zhang, Zihao Li, Gong-Chu Li, Xu-Song Hong, Huangjun Zhu, Geng Chen, Chuan-Feng Li, Guang-Can Guo,
• Abstract summary: We build a high-speed preparation-and-measurement apparatus controlled by quantum random-number generators.<n>Our experiments show that standard QSV protocols often provide unreliable fidelity certificates in non-IID scenarios.<n>In sharp contrast, the defensive QSV protocol based on a homogeneous strategy can provide reliable and nearly tight fidelity certificates.
• Score: 8.814956738359813
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficient verification of entangled states is crucial to many applications in quantum information processing. However, the effectiveness of standard quantum state verification (QSV) is based on the condition of independent and identical distribution (IID), which impedes its applications in many practical scenarios. Here we demonstrate a defensive QSV protocol, which is effective in all kinds of non-IID scenarios, including the extremely challenging adversarial scenario. To this end, we build a high-speed preparation-and-measurement apparatus controlled by quantum random-number generators. Our experiments clearly show that standard QSV protocols often provide unreliable fidelity certificates in non-IID scenarios. In sharp contrast, the defensive QSV protocol based on a homogeneous strategy can provide reliable and nearly tight fidelity certificates at comparable high efficiency, even under malicious attacks. Moreover, our scheme is robust against the imperfections in a realistic experiment, which is very appealing to practical applications.

Related papers

• 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)
• SConU: Selective Conformal Uncertainty in Large Language Models [59.25881667640868]
  We propose a novel approach termed Selective Conformal Uncertainty (SConU)<n>We develop two conformal p-values that are instrumental in determining whether a given sample deviates from the uncertainty distribution of the calibration set at a specific manageable risk level.<n>Our approach not only facilitates rigorous management of miscoverage rates across both single-domain and interdisciplinary contexts, but also enhances the efficiency of predictions.
  arXiv  Detail & Related papers  (2025-04-19T03:01:45Z)
• 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)
• Imperfect detectors for adversarial tasks with applications to quantum key distribution [0.0]
  We develop a general framework for analysing imperfect threshold detectors.<n>We treat uncharacterised device parameters such as dark counts and detection efficiencies as adversarially controlled within some ranges.<n>Our results strengthen the connection between theoretical security and practical implementations.
  arXiv  Detail & Related papers  (2025-03-08T19:53:18Z)
• 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)
• Experimental Sample-Efficient and Device-Independent GHZ State Certification [1.1650821883155187]
  certification of quantum resources is a critical tool in the development of quantum information processing. We show the efficient and device-independent certification of a single copy of a four-qubit GHZ state.
  arXiv  Detail & Related papers  (2024-07-18T14:01:42Z)
• Probabilistic Conformal Prediction with Approximate Conditional Validity [81.30551968980143]
  We develop a new method for generating prediction sets that combines the flexibility of conformal methods with an estimate of the conditional distribution. Our method consistently outperforms existing approaches in terms of conditional coverage.
  arXiv  Detail & Related papers  (2024-07-01T20:44:48Z)
• Device-independent certification of desirable properties with a confidence interval [0.0]
  We provide a versatile solution for rigorous device-independent certification. We show how the PBR protocol and the martingale-based protocol often offer similar performance. Our findings also show that the performance of the martingale-based protocol may be severely affected by one's choice of the witness.
  arXiv  Detail & Related papers  (2024-01-12T15:21:21Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Efficient verification of arbitrary entangled states with homogeneous local measurements [0.874274295147112]
  Quantum state verification (QSV) is the task of relying on local measurements to verify that a given quantum device produces the desired target state. We present a systematic strategy to tackle this problem by considering the locality of what we initiate as the choice-independent measurement protocols. We show the explicit procedures of the protocol design using standard Pauli projections, demonstrating the superiority of our method for attaining better QSV strategies.
  arXiv  Detail & Related papers  (2022-08-01T18:32:56Z)
• Dynamical learning of a photonics quantum-state engineering process [48.7576911714538]
  Experimentally engineering high-dimensional quantum states is a crucial task for several quantum information protocols. We implement an automated adaptive optimization protocol to engineer photonic Orbital Angular Momentum (OAM) states. This approach represents a powerful tool for automated optimizations of noisy experimental tasks for quantum information protocols and technologies.
  arXiv  Detail & Related papers  (2022-01-14T19:24:31Z)
• 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)

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.