Entangled Quantum States Quantified, Revealing the Cost of Building Powerful Computers

Scientists are increasingly focused on understanding multipartite entanglement, a crucial resource determining the power and scope of quantum interactions. Francois Payn from DISAT, Politecnico di Torino, Michele Minervini from the School of Electrical and Computer Engineering, Cornell University, and Davide Girolami, also of DISAT, Politecnico di Torino, and their colleagues demonstrate a novel method for quantifying entanglement across multiple particles. Their research establishes a link between the complexity of multipartite states and their experimental cost, revealing that creating a k-partite entangled state necessitates a minimum of k-1 two-particle entangling gates. This work significantly advances the field by providing a practical measure of multipartite entanglement and analytically calculating its formation for important quantum states, such as W states of any dimension.

Quantifying multipartite entanglement via maximised bipartite contributions and experimental cost remains a challenging task

Multipartite entanglement determines the strength and range of interactions in many-body quantum systems. Evaluating this entanglement is notoriously difficult due to the complex structures of quantum states. Researchers have now introduced a generic method to quantify the k ≤N-partite entanglement of an N-particle system by maximizing an arbitrary bipartite entanglement measure within subsystems of size up to k.
This resulting classification of multipartite states directly reflects their experimental cost, revealing that creating a k-partite entangled state requires at least k-1 two-particle entangling gates. The work establishes a novel definition of multipartite entanglement that addresses a fundamental question: how difficult is it to create a specific entangled state.

Specifically, the researchers build measures of k ≤N-partite entanglement by maximizing the sum of bipartite entanglement terms in subsystems containing at most k particles. This “total” entanglement, representing the sum of k-partite entanglement for any degree k, adheres to the established properties of entanglement monotones.
Crucially, this approach links directly to the experimental resources needed to generate these states. This research demonstrates that the newly defined k-partite entanglement values require a minimum of k-1 entangling gates between particle pairs. This finding generalizes the understanding of bipartite entanglement, framing it as information inaccessible through local operations and classical communication.

The induced classification of multipartite entangled states differs significantly from those based on separability or producibility, highlighting that states within the same separability/producibility class can demand vastly different experimental resources. Furthermore, the researchers analytically calculate the newly defined k-partite entanglement of formation, a generalization of a key bipartite entanglement measure for quantifying entanglement resources.

Quantifying multipartite entanglement via maximised bipartite entanglement and entangling gate cost offers a promising approach to characterising complex quantum states

A generic method for quantifying k ≤N-partite entanglement within an N-particle system forms the basis of this work. Researchers maximized an arbitrary bipartite entanglement measure within subsystems of size up to k to achieve this quantification. This approach allows for the classification of multipartite states based on their experimental cost, specifically requiring at least k-1 two-particle entangling gates to create a k-partite entangled state.

The study began by considering a finite dimensional N-partite quantum system, denoted as XN, where X[i] represents the single particle i and Xk represents a cluster of k ≤N particles. Bipartite entanglement was initially defined as the difference between a two-particle state, ρ2, and separable states created through local operations and classical communication.

Researchers then extended this concept to multipartite entanglement by evaluating the cost of creating entangled states of clusters up to size k from a set of fully separable states. To quantify entanglement, the research team first selected a cluster, Xk, of k particles. They then calculated the bipartite entanglement, E, between a single particle and the remaining particles within the cluster, using the reduced state ρk obtained by tracing out the remaining N-k particles from the global state, ρN.

A non-zero value for E indicates that the cluster state, ρk, cannot be created via local operations and classical communication. This process was repeated for additional k-particle clusters, ensuring no overlap with previously selected clusters, to comprehensively assess the entanglement structure. The resulting “total” entanglement, summing k-partite entanglement for all degrees k, adheres to the properties of entanglement monotones.

Notably, the k-partite entanglement of formation was analytically calculated for several classes of states, including W states of any dimension, providing insight into their complex entanglement structure. This analytical computation represents a significant advancement, as entanglement quantification typically requires tailored strategies for each specific system.

The work introduces a method to quantify k-partite entanglement in N-particle systems by maximizing bipartite entanglement measures within subsystems of size up to k. This approach establishes a direct link between multipartite entanglement and experimental cost, demonstrating that creating a k-partite entangled state necessitates at least k-1 two-particle entangling gates. The researchers analytically calculate the newly defined k-partite entanglement of formation, a generalization of a key bipartite entanglement measure called concurrence.

Entanglement quantification via maximised bipartite correlations and gate complexity offers a robust measure of multipartite entanglement

Researchers have developed a new method for quantifying multipartite entanglement, a crucial resource in quantum information processing. This approach assesses the entanglement of up to N particles by maximizing bipartite entanglement, entanglement between two particles, within smaller subsystems. The resulting measure directly relates to the experimental cost of creating entangled states, specifically requiring a minimum of k-1 two-particle entangling gates to generate a k-partite entangled state.

This quantification technique was analytically applied to several classes of quantum states, including W states of any dimension, demonstrating its versatility. W states are particularly significant as they exhibit multipartite entanglement of any degree, representing a fundamental and robust form of quantum correlation.

The method offers a pathway to move beyond merely detecting multipartite entanglement to actually estimating its quantity, which is essential for verifying the successful preparation of quantum states. The authors acknowledge a limitation in that the current method focuses on quantifying entanglement based on bipartite entanglement measures.

Future research should explore extending this approach to quantify other quantum correlations, such as multipartite non-locality, steering, and discord. Further investigation into the connection between multipartite entanglement and circuit complexity, alongside its potential as a signature of critical properties in many-body quantum dynamics, is also warranted. This work was supported by the Italian Ministry of Research.

👉 More information
🗞 Quantifying the Operational Cost of Multipartite Entanglement
🧠 ArXiv: https://arxiv.org/abs/2602.04760

Rohail T.

Rohail T.

As a quantum scientist exploring the frontiers of physics and technology. My work focuses on uncovering how quantum mechanics, computing, and emerging technologies are transforming our understanding of reality. I share research-driven insights that make complex ideas in quantum science clear, engaging, and relevant to the modern world.

Latest Posts by Rohail T.:

Protected: Models Achieve Reliable Accuracy and Exploit Atomic Interactions Efficiently

March 3, 2026

Protected: Quantum Computing Tackles Fluid Dynamics with a New, Flexible Algorithm

March 3, 2026

Protected: Silicon Unlocks Potential for Long-Distance Quantum Communication Networks

March 3, 2026