Quantifying and Probing Multipartite Entanglement via Minimum Entanglement Drop

• URL: http://arxiv.org/abs/2606.21950v1
• Date: Sat, 20 Jun 2026 08:38:37 GMT
• Title: Quantifying and Probing Multipartite Entanglement via Minimum Entanglement Drop
• Abstract summary: We propose a multipartite entanglement monotone defined by the minimum entanglement drop.<n>We rigorously prove it is a valid monotone under local operations and classical communication.<n>We derive exact analytical solutions for n-qubit W states under environmental noise.
• Score: 2.9273378452263876
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantifying genuine multipartite entanglement remains a significant challenge. We propose a multipartite entanglement monotone defined by the minimum entanglement drop -- the reduction in global one-to-group entanglement upon tracing out a single particle. We formulate a computationally efficient variant using tangle and negativity to ensure non-vanishing values for W-class states, and rigorously prove it is a valid monotone under local operations and classical communication. In the tripartite regime, the minimum tangle drop is physically equivalent to the minimum pairwise concurrence. We establish an operational framework where the entanglement drop acts as a structural probe: by assessing sensitivity to qubit loss, it identifies inseparable clusters, extracting connectivity fingerprints that uniquely differentiate graph topologies within the same local Clifford equivalence class. Integrating this mapping with classical shadows enables efficient experimental estimation and dynamic tracking of entanglement network evolution. We derive exact analytical solutions for n-qubit W states under environmental noise, revealing robust scaling behaviors. Finally, we acknowledge limitations, noting that diagnostic sensitivity strictly vanishes for highly robust states such as the 5-qubit error-correcting code.

Related papers

• Neural Networks as Local-to-Global Computations [0.0]
  We construct a sheaf from any ReLU neural network by encoding each computational step as a restriction map on an edge.<n>Unlike the forward pass, the heat equation propagates information bidirectionally across layers, enabling pinned neurons that impose constraints in both directions.<n>We validate the framework experimentally on small synthetic tasks, confirming the convergence theorems and demonstrating that sheaf-based training, while not yet competitive with gradient descent, obeys quantitative scaling laws predicted by the theory.
  arXiv  Detail & Related papers  (2026-03-16T05:23:31Z)
• MOSAIC: Minimax-Optimal Sparsity-Adaptive Inference for Change Points in Dynamic Networks [11.200971045515763]
  We propose a new inference framework, named MOSAIC, for change-point detection in dynamic networks.<n>We establish the minimax rate of detection boundary, which relies on the sparsity of changes.<n>We develop an eigen-decomposition-based test with screened signals that approaches the minimax rate in theory, with only a minor logarithmic loss.
  arXiv  Detail & Related papers  (2025-09-08T03:09:50Z)
• QGait: Toward Accurate Quantization for Gait Recognition with Binarized Input [17.017127559393398]
  We propose a differentiable soft quantizer, which better simulates the gradient of the round function during backpropagation. This enables the network to learn from subtle input perturbations. We further refine the training strategy to ensure convergence while simulating quantization errors.
  arXiv  Detail & Related papers  (2024-05-22T17:34:18Z)
• Benign Overfitting in Deep Neural Networks under Lazy Training [72.28294823115502]
  We show that when the data distribution is well-separated, DNNs can achieve Bayes-optimal test error for classification. Our results indicate that interpolating with smoother functions leads to better generalization.
  arXiv  Detail & Related papers  (2023-05-30T19:37:44Z)
• Toward Certified Robustness Against Real-World Distribution Shifts [65.66374339500025]
  We train a generative model to learn perturbations from data and define specifications with respect to the output of the learned model. A unique challenge arising from this setting is that existing verifiers cannot tightly approximate sigmoid activations. We propose a general meta-algorithm for handling sigmoid activations which leverages classical notions of counter-example-guided abstraction refinement.
  arXiv  Detail & Related papers  (2022-06-08T04:09:13Z)
• Generalization of Neural Combinatorial Solvers Through the Lens of Adversarial Robustness [68.97830259849086]
  Most datasets only capture a simpler subproblem and likely suffer from spurious features. We study adversarial robustness - a local generalization property - to reveal hard, model-specific instances and spurious features. Unlike in other applications, where perturbation models are designed around subjective notions of imperceptibility, our perturbation models are efficient and sound. Surprisingly, with such perturbations, a sufficiently expressive neural solver does not suffer from the limitations of the accuracy-robustness trade-off common in supervised learning.
  arXiv  Detail & Related papers  (2021-10-21T07:28:11Z)
• Fidelity measurement of a multiqubit cluster state with minimal effort [0.0]
  We propose a method for experimentally assessing the fidelity of an important class of entangled states known as cluster states. The proposed method always yields a lower bound of the fidelity with a number of measurement settings scaling only linearly with the system size. The scheme also performs very well for higher-dimensional cluster states, including correctly the majority of experimentally relevant errors.
  arXiv  Detail & Related papers  (2021-07-21T23:00:40Z)
• Instance-optimality in optimal value estimation: Adaptivity via variance-reduced Q-learning [99.34907092347733]
  We analyze the problem of estimating optimal $Q$-value functions for a discounted Markov decision process with discrete states and actions. Using a local minimax framework, we show that this functional arises in lower bounds on the accuracy on any estimation procedure. In the other direction, we establish the sharpness of our lower bounds, up to factors logarithmic in the state and action spaces, by analyzing a variance-reduced version of $Q$-learning.
  arXiv  Detail & Related papers  (2021-06-28T00:38:54Z)
• Neural Control Variates [71.42768823631918]
  We show that a set of neural networks can face the challenge of finding a good approximation of the integrand. We derive a theoretically optimal, variance-minimizing loss function, and propose an alternative, composite loss for stable online training in practice. Specifically, we show that the learned light-field approximation is of sufficient quality for high-order bounces, allowing us to omit the error correction and thereby dramatically reduce the noise at the cost of negligible visible bias.
  arXiv  Detail & Related papers  (2020-06-02T11:17:55Z)
• Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment [52.02794488304448]
  We propose a new distribution alignment method based on a log-likelihood ratio statistic and normalizing flows. We experimentally verify that minimizing the resulting objective results in domain alignment that preserves the local structure of input domains.
  arXiv  Detail & Related papers  (2020-03-26T22:10: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.