Entanglement certification by measuring nonlocality

• URL: http://arxiv.org/abs/2507.18066v1
• Date: Thu, 24 Jul 2025 03:40:25 GMT
• Title: Entanglement certification by measuring nonlocality
• Abstract summary: This paper presents a practical approach to entanglement verification based on Clauser-Horne-Shimony-Holt inequality violation.<n>We develop statistical methods that optimize resource usage while maintaining verification reliability.
• Score: 13.128419799503641
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Reliable entanglement manipulation is key to quantum networks. This paper presents a practical approach to entanglement verification based on Clauser-Horne-Shimony-Holt (CHSH) inequality violation. We establish mathematical bounds relating the CHSH measure to entanglement fidelity and develop statistical methods that optimize resource usage while maintaining verification reliability. Our main contributions include tight bounds on entanglement fidelity using the CHSH measure, a statistical framework for estimating sample complexity, and practical verification protocols with quantifiable confidence. Using NetSquid simulations, we comprehensively evaluated our protocols under various network conditions, demonstrating the key trade-offs between verification accuracy, resource efficiency, and operational parameters. Our results provide concrete guidance for implementing efficient entanglement verification in resource-constrained quantum networks, balancing security requirements with practical limitations.

Related papers

• Conformal Changepoint Localization and Root Cause Analysis with Corrupted Observations [55.76952683833966]
  This paper proposes weighted CONCH (W-CONCH) and weighted CROC (W-CROC) to reduce confidence set size when data may be corrupted.<n>Experiments on image-based and real-world changepoint and root-cause benchmarks show that uncertainty-based weighting substantially reduces confidence set size.
  arXiv  Detail & Related papers  (2026-07-29T05:16:59Z)
• Semi-device-independent certification of high-dimensional quantum channels [3.9794752987799527]
  Existing certification schemes often rely on fully trusted internal devices.<n>We propose a semi-device-independent framework for certifying channel properties directly from observed statistics.<n>Lower bounds on the entanglement fidelity are obtained that are compatible with either the full set of observed statistics or a single witness value.
  arXiv  Detail & Related papers  (2026-02-08T05:05:04Z)
• TARA Test-by-Adaptive-Ranks for Quantum Anomaly Detection with Conformal Prediction Guarantees [0.0]
  Quantum key distribution (QKD) security relies on the ability to distinguish genuine quantum correlations from classical eavesdropper simulations.<n>We introduce TARA, a novel framework combining conformal prediction with sequential martingale testing for quantum anomaly detection.
  arXiv  Detail & Related papers  (2025-12-03T17:53:38Z)
• Enhancing Trustworthiness with Mixed Precision: Benchmarks, Opportunities, and Challenges [12.438306093697]
  Large language models (LLMs) have shown promising performance across various tasks.<n>LLMs' autoregressive decoding process poses significant challenges for efficient deployment on existing AI hardware.
  arXiv  Detail & Related papers  (2025-11-27T14:17:43Z)
• FaithCoT-Bench: Benchmarking Instance-Level Faithfulness of Chain-of-Thought Reasoning [62.452350134196934]
  FaithCoT-Bench is a unified benchmark for instance-level CoT unfaithfulness detection.<n>Our framework formulates unfaithfulness detection as a discriminative decision problem.<n>FaithCoT-Bench sets a solid basis for future research toward more interpretable and trustworthy reasoning in LLMs.
  arXiv  Detail & Related papers  (2025-10-05T05:16:54Z)
• CCE: Confidence-Consistency Evaluation for Time Series Anomaly Detection [56.302586730134806]
  We introduce Confidence-Consistency Evaluation (CCE), a novel evaluation metric.<n>CCE simultaneously measures prediction confidence and uncertainty consistency.<n>We also establish RankEval, a benchmark for comparing the ranking capabilities of various metrics.
  arXiv  Detail & Related papers  (2025-09-01T03:38:38Z)
• Verification Cost Asymmetry in Cognitive Warfare: A Complexity-Theoretic Framework [0.0]
  We introduce the Verification Cost Asymmetry coefficient, formalizing it as the ratio of expected verification work between populations under identical claim distributions.<n>We construct dissemination protocols that reduce verification for trusted audiences to constant human effort while imposing superlinear costs on adversarial populations lacking cryptographic infrastructure.<n>The results establish complexity-theoretic foundations for engineering democratic advantage in cognitive warfare, with immediate applications to content authentication, platform governance, and information operations doctrine.
  arXiv  Detail & Related papers  (2025-07-28T18:23:44Z)
• Evaluation of Distimation's Real-world Performance on a Superconducting Quantum Computer [0.3958317527488534]
  Distimation is a novel distillation-based protocol designed for efficient Bell-diagonal state estimation.<n>Our results establish Distimation as a viable method for scalable, real-time entanglement monitoring in practical quantum networks.
  arXiv  Detail & Related papers  (2025-04-25T07:50:17Z)
• Rectifying Conformity Scores for Better Conditional Coverage [75.73184036344908]
  We present a new method for generating confidence sets within the split conformal prediction framework.<n>Our method performs a trainable transformation of any given conformity score to improve conditional coverage while ensuring exact marginal coverage.
  arXiv  Detail & Related papers  (2025-02-22T19:54:14Z)
• I-trustworthy Models. A framework for trustworthiness evaluation of probabilistic classifiers [0.18416014644193066]
  This work formalizes I-trustworthy framework -- a novel framework for assessing the trustworthiness of probabilistics for inference tasks.<n>To assess I-trustworthiness, we use the local calibration error (LCE) and develop a method of hypothesis-testing.<n>We present a diagnostic tool designed to identify and measure biases in cases of miscalibration.
  arXiv  Detail & Related papers  (2025-01-26T17:54:43Z)
• Risk-Averse Certification of Bayesian Neural Networks [70.44969603471903]
  We propose a Risk-Averse Certification framework for Bayesian neural networks called RAC-BNN.<n>Our method leverages sampling and optimisation to compute a sound approximation of the output set of a BNN.<n>We validate RAC-BNN on a range of regression and classification benchmarks and compare its performance with a state-of-the-art method.
  arXiv  Detail & Related papers  (2024-11-29T14:22:51Z)
• Quantifying Calibration Error in Neural Networks Through Evidence-Based Theory [1.9832598896178517]
  This paper introduces a novel framework for quantifying the trustworthiness of neural networks by incorporating subjective logic into the evaluation of Expected Error (ECE)<n>We demonstrate the effectiveness of this approach through experiments on MNIST and CIFAR-10 datasets where post-calibration results indicate improved trustworthiness.<n>The proposed framework offers a more interpretable and nuanced assessment of AI models, with potential applications in sensitive domains such as healthcare and autonomous systems.
  arXiv  Detail & Related papers  (2024-10-31T23:54:21Z)
• Deterministic entanglement swapping of W states [0.3277163122167434]
  We propose a deterministic entanglement swapping protocol for generating a shared three-qubit W state between two remote parties. We present a detailed quantum circuit design, implemented using the Qiskit simulator, that outlines the preparation of W states and the execution of joint measurements. We demonstrate the effectiveness of our proposed protocol, offering a practical solution for high-fidelity W state generation in real-world quantum communication scenarios.
  arXiv  Detail & Related papers  (2024-07-04T03:27:12Z)
• Conformal Prediction for Federated Uncertainty Quantification Under Label Shift [57.54977668978613]
  Federated Learning (FL) is a machine learning framework where many clients collaboratively train models. We develop a new conformal prediction method based on quantile regression and take into account privacy constraints.
  arXiv  Detail & Related papers  (2023-06-08T11:54:58Z)
• Value Functions are Control Barrier Functions: Verification of Safe Policies using Control Theory [46.85103495283037]
  We propose a new approach to apply verification methods from control theory to learned value functions. We formalize original theorems that establish links between value functions and control barrier functions. Our work marks a significant step towards a formal framework for the general, scalable, and verifiable design of RL-based control systems.
  arXiv  Detail & Related papers  (2023-06-06T21:41:31Z)
• 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)
• Experimentally Certified Transmission of a Quantum Message through an Untrusted and Lossy Quantum Channel via Bell's Theorem [1.0470286407954037]
  In adversarial scenarios, a certification method can be vulnerable to attacks if too much trust is placed on the underlying system. Here, we propose a protocol in a device independent framework, which allows for the certification of practical quantum transmission links. In view of the use of the certified transmitted states for follow-up applications, our protocol moves beyond certification of the channel to allow us to estimate the quality of the transmitted quantum message itself.
  arXiv  Detail & Related papers  (2023-04-19T12:22:49Z)
• Quantization-aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks [58.195261590442406]
  We study the problem of training and certifying adversarially robust quantized neural networks (QNNs) Recent work has shown that floating-point neural networks that have been verified to be robust can become vulnerable to adversarial attacks after quantization. We present quantization-aware interval bound propagation (QA-IBP), a novel method for training robust QNNs.
  arXiv  Detail & Related papers  (2022-11-29T13:32:38Z)
• GenDICE: Generalized Offline Estimation of Stationary Values [108.17309783125398]
  We show that effective estimation can still be achieved in important applications. Our approach is based on estimating a ratio that corrects for the discrepancy between the stationary and empirical distributions. The resulting algorithm, GenDICE, is straightforward and effective.
  arXiv  Detail & Related papers  (2020-02-21T00:27:52Z)

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.