Practical and Efficient Verification of Entanglement with Incomplete Measurement Settings

• URL: http://arxiv.org/abs/2512.09856v1
• Date: Wed, 10 Dec 2025 17:39:39 GMT
• Title: Practical and Efficient Verification of Entanglement with Incomplete Measurement Settings
• Authors: Jiheon Seong, Jin-Woo Kim, Seungchan Seo, Seung-Hyun Nam, Anindita Bera, Dariusz Chruściński, June-Koo Kevin Rhee, Heonoh Kim, Joonwoo Bae,
• Abstract summary: We show how the experimental estimation of a small number of observables can be directly exploited to construct a large family of entanglement witnesses.<n>We introduce an optimization approach, formulated as a semidefinite program, that systematically searches for those witnesses best suited to reveal entanglement under the given measurement constraints.
• Score: 8.215348490887509
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we present a practical and efficient framework for verifying entangled states when only a tomographically incomplete measurement setting is available-specifically, when access to observables is severely limited. We show how the experimental estimation of a small number of observables can be directly exploited to construct a large family of entanglement witnesses, enabling the efficient identification of entangled states. Moreover, we introduce an optimization approach, formulated as a semidefinite program, that systematically searches for those witnesses best suited to reveal entanglement under the given measurement constraints. We demonstrate the practicality of the approach in a proof-of-principle experiment with photon-polarization qubits, where entanglement is certified using only a fraction of the full measurement data. These results reveal the maximal usefulness of incomplete measurement settings for entanglement verification in realistic scenarios.

Related papers

• Quantitative Verification of Fairness in Tree Ensembles [0.0]
  This work focuses on quantitative verification of fairness in tree ensembles.<n>Unlike traditional verification approaches that merely return a single counterexample when the fairness is violated, quantitative verification estimates the ratio of all counterexamples.
  arXiv  Detail & Related papers  (2025-12-18T10:31:15Z)
• Protecting entanglement witnesses with randomized measurements [1.506644317595531]
  Entanglement is crucial for quantum information science.<n>Recent research shows that even tiny errors in measurements may significantly undermine the effectiveness of a witness.<n>We propose a randomized-measurement-based method to solve this problem.
  arXiv  Detail & Related papers  (2024-07-26T02:10:51Z)
• 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)
• Exploring validation metrics for offline model-based optimisation with diffusion models [50.404829846182764]
  In model-based optimisation (MBO) we are interested in using machine learning to design candidates that maximise some measure of reward with respect to a black box function called the (ground truth) oracle. While an approximation to the ground oracle can be trained and used in place of it during model validation to measure the mean reward over generated candidates, the evaluation is approximate and vulnerable to adversarial examples. This is encapsulated under our proposed evaluation framework which is also designed to measure extrapolation.
  arXiv  Detail & Related papers  (2022-11-19T16:57:37Z)
• Valid and efficient entanglement verification with finite copies of a quantum state [0.4523163728236145]
  We show how to optimize the validity and the efficiency of entanglement detection schemes in small data sets. The method is based on an analytical model of finite statistics effects on correlation functions.
  arXiv  Detail & Related papers  (2022-08-03T11:27:45Z)
• Entanglement detection with imprecise measurements [2.867517731896504]
  We investigate entanglement detection when the local measurements only nearly correspond to those intended. We formalise this through an operational notion of inaccuracy that can be estimated directly in the lab. We show that small magnitudes of inaccuracy can significantly compromise several renowned entanglement witnesses.
  arXiv  Detail & Related papers  (2022-02-26T12:42:33Z)
• Experimentally determining the incompatibility of two qubit measurements [55.41644538483948]
  We describe and realize an experimental procedure for assessing the incompatibility of two qubit measurements. We demonstrate this fact in an optical setup, where the qubit states are encoded into the photons' polarization degrees of freedom.
  arXiv  Detail & Related papers  (2021-12-15T19:01:44Z)
• On the Practicality of Deterministic Epistemic Uncertainty [106.06571981780591]
  deterministic uncertainty methods (DUMs) achieve strong performance on detecting out-of-distribution data. It remains unclear whether DUMs are well calibrated and can seamlessly scale to real-world applications.
  arXiv  Detail & Related papers  (2021-07-01T17:59:07Z)
• WSSOD: A New Pipeline for Weakly- and Semi-Supervised Object Detection [75.80075054706079]
  We propose a weakly- and semi-supervised object detection framework (WSSOD) An agent detector is first trained on a joint dataset and then used to predict pseudo bounding boxes on weakly-annotated images. The proposed framework demonstrates remarkable performance on PASCAL-VOC and MSCOCO benchmark, achieving a high performance comparable to those obtained in fully-supervised settings.
  arXiv  Detail & Related papers  (2021-05-21T11:58:50Z)
• ReMP: Rectified Metric Propagation for Few-Shot Learning [67.96021109377809]
  A rectified metric space is learned to maintain the metric consistency from training to testing. Numerous analyses indicate that a simple modification of the objective can yield substantial performance gains. The proposed ReMP is effective and efficient, and outperforms the state of the arts on various standard few-shot learning datasets.
  arXiv  Detail & Related papers  (2020-12-02T00:07:53Z)
• A universal scheme for robust self-testing in the prepare-and-measure scenario [0.0]
  We consider the problem of certification of arbitrary ensembles of pure states and projective measurements. We propose a universal and intuitive scheme based on establishing perfect correlations between target states and suitably-chosen projective measurements.
  arXiv  Detail & Related papers  (2020-03-02T17:06:06Z)
• Almost-Matching-Exactly for Treatment Effect Estimation under Network Interference [73.23326654892963]
  We propose a matching method that recovers direct treatment effects from randomized experiments where units are connected in an observed network. Our method matches units almost exactly on counts of unique subgraphs within their neighborhood graphs.
  arXiv  Detail & Related papers  (2020-03-02T15:21:20Z)

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.