Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.21579

Global Entanglement Quantification via Classical Shadows

João P. Engster, Eduardo I. Duzzioni

quant-phSubmitted Sep 18, 2026• Announced Sep 21, 2026• 0 citations
arXivHTMLPDF

Abstract

Detecting and characterizing quantum correlations are tasks of great relevance in quantum information. More specifically, quantifying the amount of multipartite entanglement is a known difficult task, even for pure states. To this end, several entanglement measures have been proposed, although there is currently no universal manner to do so. In this work, we propose the classical shadows technique to measure the generalized global entanglement introduced in Phys. Rev. A 74, 022314. This particular multipartite entanglement quantifier $E_G^{(n)}$ relies on the linear entropies of all $n$-qubit partitions of a state. As the linear entropy can be written in terms of a complete set of observables of the subsystem, we employ classical shadows to estimate many observables with fewer measurements. We simulate the quantification of $E_G^{(n)}$ for well-known entangled states and for random states, comparing shadow estimations and grouping techniques. Our results show a clear advantage of classical shadows over direct estimation approaches, indicating that it can be a useful tool to quantify entanglement without the need to reconstruct the density operator of the whole system.

AI Summary

The paper studies whether classical shadows can reduce the measurement cost of estimating generalized global entanglement, $E_G^{(n)}$, for pure multiqubit states. This quantity averages the normalized linear entropies of all $n$-qubit reduced states; each purity is evaluated through squared Pauli expectation values rather than full-system tomography. The approach applies existing randomized and derandomized local-Pauli shadow protocols and compares them with qubit-wise-commuting and fully commuting observable groupings under equal shot budgets. Simulations cover GHZ, W, products of EPR pairs, and Haar-random states, primarily on 10 qubits, estimating $E_G^{(2)}$ and $E_G^{(3)}$. These calculations involve 675 and 7,560 partition-associated Pauli terms, respectively. For the 10-qubit GHZ state, shadows achieve below 1% relative error with approximately 6,000 shots for $E_G^{(2)}$ and 30,000 for $E_G^{(3)}$; the grouping comparisons give approximately 7% and 8–10% errors at those budgets. Results are averaged over ten independent runs. Randomized and derandomized shadows perform similarly in these tests. Repeating shots within each randomly chosen basis also gives similar accuracy across the tested allocations. A separate system-size comparison uses 2,000 shots and reports smaller, more stable errors for shadows than for grouping methods. The discussion invokes the existing observable-estimation bound $O(3^n\log L/\epsilon^2)$: subsystem locality remains an exponential cost. The study is simulation-based and restricted to second- and third-class measures; higher classes may be needed for other entanglement structures. It also notes that measurement allocation affects accuracy and hardware noise can invalidate permutation-symmetry shortcuts.

Little sign of AI-generated textIncrementalSmall numerics onlyOverclaimsPossible error

Error found: The stated linear-entropy normalization uses the larger bipartition dimension, giving a maximum of 64/85 rather than one for a ten-qubit 2|8 split. The hit-normalized observable estimator differs at finite sample size from the fixed-normalization shadow estimator whose variance is subsequently quoted, and the numerical implementation is not identified unambiguously. The reported counts of 675 and 7560 include repeated lower-weight observables across partitions; the distinct counts are 435 and 3675, and duplicate handling in the grouping benchmarks is unspecified. The stated maximum measurement budget of 15000 conflicts with Table 1's third-class results at 30000 measurements. Directly squaring unbiased observable estimates introduces a positive purity bias and negative entanglement bias, but the paper specifies neither a correction nor an analysis of this contribution to its comparisons.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
8 pages, 3 figures, 1 table

Related papers

Sample Complexity for Embedded Multipartite Entanglement Witness via Pauli and Clifford Classical Shadows

Ziran Zhang

Detecting multipartite entanglement in many qubit systems is measurement-intensive, motivating protocols that estimate only selected observables with provable efficiency. In this work we use the classical shadow protocol to study the sample complexity required to estimate a family of subsystem $n$-partite entanglement witness embedded in an larger $N$-qubit system. We derive ensemble dependent variance bounds that lead to qualitatively distinct scaling for the snapshots cost at fixed additive error $ε$ with numerical simulations confirm these trends, exhibiting a clear crossover from Pauli favorable performance for local witness to Clifford favorable performance as the witness becomes more global.

quant-pharXiv:2601.00859•Dec 31, 2025•0 citations

Methods For Measuring Quantum Entanglement: Entanglement Entropy Measures and their Implications

Rajendra Kumar

The paper is an elaborate comparative assessment of the most relevant entropy-based quantities to be applied in quantifying quantum entanglement in pure, mixed, bipartite, and multipartite quantum systems. The study fills the existing gap in the literature in which most of the previous literature examines individual measures, but a lot of knowledge is lacking on what these measures are regarding their strengths, weaknesses, and the operational usefulness against each other. The study can prove the behaviour of each measure under noise, decoherence, dimensional scaling, and variation of state-type by analysing von Neumann entropy, the Tsallis entropy, entropy of entanglement of formation, concurrence and logarithmic negativity. Numerical studies with pure two-qubit states, Werner states, GHZ states, W states and mixed random states demonstrate specific sensitivity properties and computational limitations which ensure that no single measure can be a universal quantifier. The paper goes on to say that entropy-only measures do not work in mixed regimes because of a dominance in classical correlations. The results have several important implications to quantum communication, quantum simulation, and quantum computing in the NISQ-era, where the choice of measurement has a direct impact on benchmarking, error-correction scheme, and protocol performance based on entanglement. The paper ends with a recommendation of contextual, purpose-based scheme of selecting entanglement measures and suggests a further study on scalable benchmarking, hybrid quantifiers, and operational performance-based entanglement measurements. These observations reinforce the theoretical premise of entanglement studies and enable the advancement of more effective quantum technologies in the field of practice.

Journal for Research in Applied Sciences and Biotechnology•Dec 9, 2025•0 citations

Many-Body Entropies and Entanglement from Polynomially Many Local Measurements

Benoît Vermersch, Marko Ljubotina, J. I. Cirac +3 more

Estimating global properties of many-body quantum systems such as entropy or bipartite entanglement is a notoriously difficult task, typically requiring a number of measurements or classical postprocessing resources growing exponentially in the system size. In this work, we address the problem of estimating global entropies and mixed-state entanglement via partial-transposed (PT) moments and show that efficient estimation strategies exist under the assumption that all the spatial correlation lengths are finite. Focusing on one-dimensional systems, we identify a set of approximate factorization conditions (AFCs) on the system density matrix, which allow us to reconstruct entropies and PT moments from information on local subsystems. This identification yields a simple and efficient strategy for entropy and entanglement estimation. Our method could be implemented in different ways, depending on how information on local subsystems is extracted. Focusing on randomized measurements providing a practical and common measurement scheme, we prove that our protocol requires only polynomially many measurements and postprocessing operations, assuming that the state to be measured satisfies the AFCs. We prove that the AFCs hold for finite-depth quantum-circuit states and translation-invariant matrix-product density operators and provide numerical evidence that they are satisfied in more general, physically interesting cases, including thermal states of local Hamiltonians. We argue that our method could be practically useful to detect bipartite mixed-state entanglement for large numbers of qubits available in today’s quantum platforms. Published by the American Physical Society 2024

arXiv:2311.08108•Physical Review X•Aug 26, 2024•23 citations

Observable measures of multipartite entanglement

Francois Payn, Davide Girolami

Multipartite entanglement is the premier resource for quantum technologies. Yet, its exact quantification in the laboratory is notoriously challenging, typically requiring the full knowledge of high dimensional quantum states. Here, we construct observable bounds to multipartite entanglement for systems of arbitrary size, which are functions of the local and global state purities, and correlation functions. First, we derive experimentally accessible upper and lower limits to both the bipartite entanglement of formation and the squashed entanglement of bipartite systems, by leveraging cornerstone results of quantum information theory: the entropy strong subadditivity inequality and the Koashi-Winter monogamy relation. Then, we convert them into bounds to the entanglement up to degree k for arbitrary states, and to the genuine k-partite entanglement, by employing a recently proposed method. Finally, we analytically and numerically test these results, by bounding the multipartite entanglement of several relevant states and mixtures, including the important classes of GHZ, Dicke, W states, and random pure states.

quant-pharXiv:2605.01375•May 5, 2026•0 citations

Entanglement, Purity, and Information Entropies in Continuous Variable Systems

Gerardo Adesso, Alessio Serafini, Fabrizio Illuminati

Quantum entanglement of pure states of a bipartite system is defined as the amount of local or marginal (i.e. referring to the subsystems) entropy. For mixed states this identification vanishes, since the global loss of information about the state makes it impossible to distinguish between quantum and classical correlations. Here we show how the joint knowledge of the global and marginal degrees of information of a quantum state, quantified by the purities or, in general, by information entropies, provides an accurate characterization of its entanglement. In particular, for Gaussian states of continuous variable systems, we classify the entanglement of two-mode states according to their degree of total and partial mixedness, comparing the different roles played by the purity and the generalized p-entropies in quantifying the mixedness and bounding the entanglement. We prove the existence of strict upper and lower bounds on the entanglement and the existence of extremally (maximally and minimally) entangled states at fixed global and marginal degrees of information. This results allow for a powerful, operative method to measure mixed-state entanglement without the full tomographic reconstruction of the state. Finally, we briefly discuss the ongoing extension of our analysis to the quantification of multipartite entanglement in highly symmetric Gaussian states of arbitrary 1 × N-mode partitions.

arXiv:quant-ph/0506049•Open Systems & Information Dynamics•May 31, 2005•37 citations

Operational classification and quantification of multipartite entangled states

Gustavo Rigolin, Thiago Rodrigues de Oliveira, M. C. de Oliveira

We formalize and extend an operational multipartite entanglement measure introduced by T. R. Oliveira, G. Rigolin, and M. C. de Oliveira, Phys. Rev. A 73, 010305(R) (2006), through the generalization of global entanglement (GE) [D. A. Meyer and N. R. Wallach, J. Math. Phys. 43, 4273 (2002)]. Contrarily to GE the main feature of this measure lies in the fact that we study the mean linear entropy of all possible partitions of a multipartite system. This allows the construction of an operational multipartite entanglement measure which is able to distinguish among different multipartite entangled states that GE failed to discriminate. Furthermore, it is also maximum at the critical point of the Ising chain in a transverse magnetic field, being thus able to detect a quantum phase transition.

arXiv:quant-ph/0603215•Physical Review A•Aug 18, 2006•61 citations
Detecting and characterizing quantum correlations are tasks of great relevance in quantum information. More specifically, quantifying the amount of multipartite entanglement is a known difficult task, even for pure states. To this end, several entanglement measures have been proposed, although there is currently no universal manner to do so. In this work, we propose the classical shadows technique to measure the generalized global entanglement introduced in Phys. Rev. A 74, 022314. This particular multipartite entanglement quantifier EG(n)E_G^{(n)}EG(n)​ relies on the linear entropies of all nnn-qubit partitions of a state. As the linear entropy can be written in terms of a complete set of observables of the subsystem, we employ classical shadows to estimate many observables with fewer measurements. We simulate the quantification of EG(n)E_G^{(n)}EG(n)​ for well-known entangled states and for random states, comparing shadow estimations and grouping techniques. Our results show a clear advantage of classical shadows over direct estimation approaches, indicating that it can be a useful tool to quantify entanglement without the need to reconstruct the density operator of the whole system.
The paper studies whether classical shadows can reduce the measurement cost of estimating generalized global entanglement, EG(n)E_G^{(n)}EG(n)​, for pure multiqubit states. This quantity averages the normalized linear entropies of all nnn-qubit reduced states; each purity is evaluated through squared Pauli expectation values rather than full-system tomography.
The approach applies existing randomized and derandomized local-Pauli shadow protocols and compares them with qubit-wise-commuting and fully commuting observable groupings under equal shot budgets. Simulations cover GHZ, W, products of EPR pairs, and Haar-random states, primarily on 10 qubits, estimating EG(2)E_G^{(2)}EG(2)​ and EG(3)E_G^{(3)}EG(3)​. These calculations involve 675 and 7,560 partition-associated Pauli terms, respectively. For the 10-qubit GHZ state, shadows achieve below 1% relative error with approximately 6,000 shots for EG(2)E_G^{(2)}EG(2)​ and 30,000 for EG(3)E_G^{(3)}EG(3)​; the grouping comparisons give approximately 7% and 8–10% errors at those budgets. Results are averaged over ten independent runs.
Randomized and derandomized shadows perform similarly in these tests. Repeating shots within each randomly chosen basis also gives similar accuracy across the tested allocations. A separate system-size comparison uses 2,000 shots and reports smaller, more stable errors for shadows than for grouping methods.
The discussion invokes the existing observable-estimation bound O(3nlog⁡L/ϵ2)O(3^n\log L/\epsilon^2)O(3nlogL/ϵ2): subsystem locality remains an exponential cost. The study is simulation-based and restricted to second- and third-class measures; higher classes may be needed for other entanglement structures. It also notes that measurement allocation affects accuracy and hardware noise can invalidate permutation-symmetry shortcuts.
Detecting multipartite entanglement in many qubit systems is measurement-intensive, motivating protocols that estimate only selected observables with provable efficiency. In this work we use the classical shadow protocol to study the sample complexity required to estimate a family of subsystem nnn-partite entanglement witness embedded in an larger NNN-qubit system. We derive ensemble dependent variance bounds that lead to qualitatively distinct scaling for the snapshots cost at fixed additive error εεε with numerical simulations confirm these trends, exhibiting a clear crossover from Pauli favorable performance for local witness to Clifford favorable performance as the witness becomes more global.
The paper is an elaborate comparative assessment of the most relevant entropy-based quantities to be applied in quantifying quantum entanglement in pure, mixed, bipartite, and multipartite quantum systems. The study fills the existing gap in the literature in which most of the previous literature examines individual measures, but a lot of knowledge is lacking on what these measures are regarding their strengths, weaknesses, and the operational usefulness against each other. The study can prove the behaviour of each measure under noise, decoherence, dimensional scaling, and variation of state-type by analysing von Neumann entropy, the Tsallis entropy, entropy of entanglement of formation, concurrence and logarithmic negativity. Numerical studies with pure two-qubit states, Werner states, GHZ states, W states and mixed random states demonstrate specific sensitivity properties and computational limitations which ensure that no single measure can be a universal quantifier. The paper goes on to say that entropy-only measures do not work in mixed regimes because of a dominance in classical correlations. The results have several important implications to quantum communication, quantum simulation, and quantum computing in the NISQ-era, where the choice of measurement has a direct impact on benchmarking, error-correction scheme, and protocol performance based on entanglement. The paper ends with a recommendation of contextual, purpose-based scheme of selecting entanglement measures and suggests a further study on scalable benchmarking, hybrid quantifiers, and operational performance-based entanglement measurements. These observations reinforce the theoretical premise of entanglement studies and enable the advancement of more effective quantum technologies in the field of practice.
Estimating global properties of many-body quantum systems such as entropy or bipartite entanglement is a notoriously difficult task, typically requiring a number of measurements or classical postprocessing resources growing exponentially in the system size. In this work, we address the problem of estimating global entropies and mixed-state entanglement via partial-transposed (PT) moments and show that efficient estimation strategies exist under the assumption that all the spatial correlation lengths are finite. Focusing on one-dimensional systems, we identify a set of approximate factorization conditions (AFCs) on the system density matrix, which allow us to reconstruct entropies and PT moments from information on local subsystems. This identification yields a simple and efficient strategy for entropy and entanglement estimation. Our method could be implemented in different ways, depending on how information on local subsystems is extracted. Focusing on randomized measurements providing a practical and common measurement scheme, we prove that our protocol requires only polynomially many measurements and postprocessing operations, assuming that the state to be measured satisfies the AFCs. We prove that the AFCs hold for finite-depth quantum-circuit states and translation-invariant matrix-product density operators and provide numerical evidence that they are satisfied in more general, physically interesting cases, including thermal states of local Hamiltonians. We argue that our method could be practically useful to detect bipartite mixed-state entanglement for large numbers of qubits available in today’s quantum platforms. Published by the American Physical Society 2024
Multipartite entanglement is the premier resource for quantum technologies. Yet, its exact quantification in the laboratory is notoriously challenging, typically requiring the full knowledge of high dimensional quantum states. Here, we construct observable bounds to multipartite entanglement for systems of arbitrary size, which are functions of the local and global state purities, and correlation functions. First, we derive experimentally accessible upper and lower limits to both the bipartite entanglement of formation and the squashed entanglement of bipartite systems, by leveraging cornerstone results of quantum information theory: the entropy strong subadditivity inequality and the Koashi-Winter monogamy relation. Then, we convert them into bounds to the entanglement up to degree k for arbitrary states, and to the genuine k-partite entanglement, by employing a recently proposed method. Finally, we analytically and numerically test these results, by bounding the multipartite entanglement of several relevant states and mixtures, including the important classes of GHZ, Dicke, W states, and random pure states.
Quantum entanglement of pure states of a bipartite system is defined as the amount of local or marginal (i.e. referring to the subsystems) entropy. For mixed states this identification vanishes, since the global loss of information about the state makes it impossible to distinguish between quantum and classical correlations. Here we show how the joint knowledge of the global and marginal degrees of information of a quantum state, quantified by the purities or, in general, by information entropies, provides an accurate characterization of its entanglement. In particular, for Gaussian states of continuous variable systems, we classify the entanglement of two-mode states according to their degree of total and partial mixedness, comparing the different roles played by the purity and the generalized p-entropies in quantifying the mixedness and bounding the entanglement. We prove the existence of strict upper and lower bounds on the entanglement and the existence of extremally (maximally and minimally) entangled states at fixed global and marginal degrees of information. This results allow for a powerful, operative method to measure mixed-state entanglement without the full tomographic reconstruction of the state. Finally, we briefly discuss the ongoing extension of our analysis to the quantification of multipartite entanglement in highly symmetric Gaussian states of arbitrary 1 × N-mode partitions.
We formalize and extend an operational multipartite entanglement measure introduced by T. R. Oliveira, G. Rigolin, and M. C. de Oliveira, Phys. Rev. A 73, 010305(R) (2006), through the generalization of global entanglement (GE) [D. A. Meyer and N. R. Wallach, J. Math. Phys. 43, 4273 (2002)]. Contrarily to GE the main feature of this measure lies in the fact that we study the mean linear entropy of all possible partitions of a multipartite system. This allows the construction of an operational multipartite entanglement measure which is able to distinguish among different multipartite entangled states that GE failed to discriminate. Furthermore, it is also maximum at the critical point of the Ising chain in a transverse magnetic field, being thus able to detect a quantum phase transition.