An Online Approach for Entanglement Verification Using Classical Shadows

• URL: http://arxiv.org/abs/2603.26602v1
• Date: Fri, 27 Mar 2026 16:59:14 GMT
• Title: An Online Approach for Entanglement Verification Using Classical Shadows
• Abstract summary: We propose an alternative formulation of classical estimators as online algorithms that are updated incrementally upon obtaining a new sample.<n>Online estimator certifies entanglement reliably and, by exploiting all $binomTm$ combinations of snapshots, requires fewer samples than state-of-the-art baselines.
• Score: 1.7003745126517356
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum measurements are slow, while classical processors are fast, yet existing hybrid protocols never exploit this asymmetry. In this work, we propose an alternative formulation of classical estimators as online algorithms that are updated incrementally upon obtaining a new sample. Classical shadows are the natural fit for this approach: designed around the principle of measuring first and asking questions later, each snapshot is a self-contained classical description that can be processed immediately and independently. As a first demonstration, we focus on mixed state entanglement verification via PT-moments, moments of the partially transposed density matrix that provide experimentally accessible sufficient conditions for entanglement. We construct two unbiased online estimators that together characterize the fundamental challenge between memory footprint and per-shot computational cost: one scales to large systems at low moment order, the other handles high moment orders at the expense of memory exponential in system size. The online estimator certifies entanglement reliably and, by exploiting all $\binom{T}{m}$ combinations of snapshots, requires fewer samples than state-of-the-art baselines, turning entanglement detection from a purely offline diagnostic into a protocol that runs concurrently with the experiment.

Related papers

• Quantum Advantage for Sensing Properties of Classical Fields [0.0]
  We propose a quantum-enhanced protocol that simultaneously estimates many properties of a classical signal with shot noise suppressed below the vacuum level.<n>Our scheme requires only two-mode squeezing, passive optics, and static homodyne measurements.<n>We prove that our protocol enables a quantum speedup for common classical sensing tasks.
  arXiv  Detail & Related papers  (2026-02-19T18:15:24Z)
• Nearly query-optimal classical shadow estimation of unitary channels [6.715668514390893]
  Classical shadow estimation is a powerful tool for learning properties of quantum states and quantum processes. By querying an unknown unitary channel in quantum experiments, the goal is to learn a classical description of $mathcalU$. Our protocol can also be applied to simultaneously predict many non-linear properties such as out-of-time-ordered correlators.
  arXiv  Detail & Related papers  (2024-10-18T15:25:40Z)
• Improved classical shadows from local symmetries in the Schur basis [4.462208715451194]
  We study the sample complexity of the classical shadows task. We present the first joint measurement protocol for classical shadows whose sample complexity scales with the rank of the unknown state.
  arXiv  Detail & Related papers  (2024-05-15T17:33:10Z)
• Efficient Local Classical Shadow Tomography with Number Conservation [0.0]
  Shadow tomography aims to build a classical description of a quantum state from a sequence of simple random measurements. We propose and analyze a new local shadow protocol adapted to systems with fundamental number conservation laws, such as ultracold atoms.
  arXiv  Detail & Related papers  (2023-11-15T19:00:01Z)
• One-Dimensional Deep Image Prior for Curve Fitting of S-Parameters from Electromagnetic Solvers [57.441926088870325]
  Deep Image Prior (DIP) is a technique that optimized the weights of a randomly-d convolutional neural network to fit a signal from noisy or under-determined measurements. Relative to publicly available implementations of Vector Fitting (VF), our method shows superior performance on nearly all test examples.
  arXiv  Detail & Related papers  (2023-06-06T20:28:37Z)
• Hard-normal Example-aware Template Mutual Matching for Industrial Anomaly Detection [78.734927709231]
  Anomaly detectors are widely used in industrial manufacturing to detect and localize unknown defects in query images.<n>These detectors are trained on anomaly-free samples and have successfully distinguished anomalies from most normal samples.<n>However, hard-normal examples are scattered and far apart from most normal samples, and thus they are often mistaken for anomalies by existing methods.
  arXiv  Detail & Related papers  (2023-03-28T17:54:56Z)
• Real-time adaptive estimation of decoherence timescales for a single qubit [2.6938732235832044]
  Characterising the time over which quantum coherence survives is critical for any implementation of quantum bits, memories and sensors. We present an adaptive multi- parameter approach, based on a simple analytical update rule, to estimate the key decoherence in real time. A further speed-up of a factor $sim 2$ can be realised by performing our optimisation with respect to sensitivity as opposed to variance.
  arXiv  Detail & Related papers  (2022-10-12T11:28:23Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Certifying Temporal Correlations [0.5735035463793009]
  We build upon previous works which used semi-definite programming (SDP) based methods to bound sequential measurement inequalities. We consider a generalised scenario in presence of quantum channels and draw analogies in the structure of Bell and sequential inequalities. These analogies allow us to show a practical use of maximal violations of sequential inequalities in the form of certification of quantum channels up to isometries.
  arXiv  Detail & Related papers  (2022-06-13T12:27:05Z)
• Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
  In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions. For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions. The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
  arXiv  Detail & Related papers  (2022-05-13T21:09:41Z)
• E-detectors: a nonparametric framework for sequential change detection [86.15115654324488]
  We develop a fundamentally new and general framework for sequential change detection. Our procedures come with clean, nonasymptotic bounds on the average run length. We show how to design their mixtures in order to achieve both statistical and computational efficiency.
  arXiv  Detail & Related papers  (2022-03-07T17:25:02Z)
• Identifying nonclassicality from experimental data using artificial neural networks [52.77024349608834]
  We train an artificial neural network to classify classical and nonclassical states from their quadrature-measurement distributions. We show that the network is able to correctly identify classical and nonclassical features from real experimental quadrature data for different states of light.
  arXiv  Detail & Related papers  (2021-01-18T15:12:47Z)

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.