Valid and efficient entanglement verification with finite copies of a quantum state

• URL: http://arxiv.org/abs/2208.01983v3
• Date: Tue, 9 Jan 2024 13:37:20 GMT
• Title: Valid and efficient entanglement verification with finite copies of a quantum state
• Authors: Pawel Cieslinski, Jan Dziewior, Lukas Knips, Waldemar Klobus, Jasmin Meinecke, Tomasz Paterek, Harald Weinfurter, Wieslaw Laskowski
• Abstract summary: 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.
• Score: 0.4523163728236145
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Detecting entanglement in multipartite quantum states is an inherently probabilistic process, typically with a few measured samples. The level of confidence in entanglement detection quantifies the scheme's validity via the probability that the signal comes from a separable state, offering a meaningful figure of merit for big datasets. Yet, with limited samples, avoiding experimental data misinterpretations requires considering not only the probabilities concerning separable states but also the probability that the signal came from an entangled state, i.e. the detection scheme's efficiency. We demonstrate this explicitly and apply a general method to optimize both the validity and the efficiency in small data sets providing examples using at most 20 state copies. The method is based on an analytical model of finite statistics effects on correlation functions which takes into account both a Frequentist as well as a Bayesian approach and is applicable to arbitrary entanglement witnesses.

Related papers

• Bisimulation Learning [55.859538562698496]
  We compute finite bisimulations of state transition systems with large, possibly infinite state space. Our technique yields faster verification results than alternative state-of-the-art tools in practice.
  arXiv  Detail & Related papers  (2024-05-24T17:11:27Z)
• Efficient semi-supervised inference for logistic regression under case-control studies [3.5485531932219243]
  We consider an inference problem in semi-supervised settings where the outcome in the labeled data is binary. Case-control sampling is an effective sampling scheme for alleviating imbalance structure in binary data. We find out that with the availability of the unlabeled data, the intercept parameter can be identified in semi-supervised learning setting.
  arXiv  Detail & Related papers  (2024-02-23T14:55:58Z)
• Efficient Conformal Prediction under Data Heterogeneity [79.35418041861327]
  Conformal Prediction (CP) stands out as a robust framework for uncertainty quantification. Existing approaches for tackling non-exchangeability lead to methods that are not computable beyond the simplest examples. This work introduces a new efficient approach to CP that produces provably valid confidence sets for fairly general non-exchangeable data distributions.
  arXiv  Detail & Related papers  (2023-12-25T20:02:51Z)
• Gaussian boson sampling validation via detector binning [0.0]
  We propose binned-detector probability distributions as a suitable quantity to statistically validate GBS experiments. We show how to compute such distributions by leveraging their connection with their respective characteristic function. We also illustrate how binned-detector probability distributions behave when Haar-averaged over all possible interferometric networks.
  arXiv  Detail & Related papers  (2023-10-27T12:55:52Z)
• User-defined Event Sampling and Uncertainty Quantification in Diffusion Models for Physical Dynamical Systems [49.75149094527068]
  We show that diffusion models can be adapted to make predictions and provide uncertainty quantification for chaotic dynamical systems. We develop a probabilistic approximation scheme for the conditional score function which converges to the true distribution as the noise level decreases. We are able to sample conditionally on nonlinear userdefined events at inference time, and matches data statistics even when sampling from the tails of the distribution.
  arXiv  Detail & Related papers  (2023-06-13T03:42:03Z)
• Derandomized Novelty Detection with FDR Control via Conformal E-values [20.864605211132663]
  We propose to make conformal inferences more stable by leveraging suitable conformal e-values instead of p-values. We show that the proposed method can reduce randomness without much loss of power compared to standard conformal inference.
  arXiv  Detail & Related papers  (2023-02-14T19:21:44Z)
• Towards efficient and generic entanglement detection by machine learning [20.392440676633573]
  We propose a flexible, machine learning assisted entanglement detection protocol. The protocol is robust to different types of noises and sample efficient. In a numerical simulation, our classifier can detect the entanglement of 4-qubit GHZ states with coherent noise.
  arXiv  Detail & Related papers  (2022-11-10T14:06: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)
• Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
  Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions. For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
  arXiv  Detail & Related papers  (2020-08-19T16:04:34Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)

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.