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:2604.09766

Sector length distributions of recursively definable graph states through analytic combinatorics

Eloïc Vallée, Kenneth Goodenough, Paul E. Gunnells, Tim Coopmans, Jordi Tura

quant-phSubmitted Apr 10, 2026• Announced Apr 14, 2026• 2 citations
arXivHTMLPDF

Abstract

The sector length distribution or Shor-Laflamme distribution (SLD) of quantum states is governed by the $k$-body correlations amongst the different systems, and has been used to study entanglement and error correction. A succinct description of a quantum state's SLD can be obtained by representing it through the coefficients of an appropriate weight enumerator polynomial, yielding bounds on fidelity under depolarizing noise and on multipartite entanglement. However, such expressions quickly grow out of hand and are generally difficult to achieve analytically, reflecting the computational hardness of the SLD. We sidestep this problem and, instead of a single state's SLDs, encode a family of quantum state's SLD as a generating function. We then find closed-form expressions for a large class of graph states which we call `recursively definable' and which include many common graphs such as path graphs, cycle graphs, star graphs, grid graphs, and more. As direct corollary, we obtain analytical expressions for such graph states' concentratable entanglement, bounds on their depolarizing fidelity, and a multipartite entanglement criterion. Our work opens up the use of generating functions and more generally analytic combinatorics to solve problems in quantum information theory.

Comments
17 pages, 7 figures

Related papers

Shor–Laflamme distributions of graph states and noise robustness of entanglement

Daniel Miller, Daniel Loss, Ivano Tavernelli +3 more

Abstract The Shor–Laflamme distribution (SLD) of a quantum state is a collection of local unitary invariants that quantify k-body correlations. We show that the SLD of graph states can be derived by solving a graph-theoretical problem. In this way, the mean and variance of the SLD are obtained as simple functions of efficiently computable graph properties. Furthermore, this formulation enables us to derive closed expressions of SLDs for some graph state families. For cluster states, we observe that the SLD is very similar to a binomial distribution, and we argue that this property is typical for graph states in general. Finally, we derive an SLD-based entanglement criterion from the purity criterion and apply it to derive meaningful noise thresholds for entanglement. Our new entanglement criterion is easy to use and also applies to the case of higher-dimensional qudits. In the bigger picture, our results foster the understanding both of quantum error-correcting codes, where a closely related notion of SLDs plays an important role, and of the geometry of quantum states, where SLDs are known as sector length distributions.

arXiv:2207.07665•Journal of Physics A Mathematical and Theoretical•Jul 19, 2023•10 citations

χ-colorable graph states: closed-form expressions and quantum orthogonal arrays

Konstantinos-Rafail Revis, Hrachya Zakaryan, Zahra Raissi

Abstract Graph states are a fundamental class of multipartite entangled quantum states with wide-ranging applications in quantum information and computation. In this work, we develop a systematic approach for constructing and analyzing χ-colorable graph states, deriving explicit closed-form expressions for arbitrary χ. For a broad family of two- and three-colorable graph states, the representations obtained using only local operations require a minimal number of terms in the Z-eigenbasis. We prove that every two-colorable graph state is local Clifford (LC) equivalent to a state expressible as a summation of rows of an orthogonal array (OA). For graph states with χ > 2, we show that they are LC-equivalent to quantum OAs, establishing a direct combinatorial connection between multipartite entanglement and structured quantum states. Furthermore, the upper and lower bounds of the Schmidt measure for graph states with arbitrary χ colorability are discussed, extending the results for an arbitrary local dimension. Our results offer an efficient and practical method for systematically constructing graph states, optimizing their representation in quantum circuits, and identifying structured forms of multipartite entanglement. This approach also connects graph states to k-uniform and absolutely maximally entangled states, motivating further exploration of the structure of entangled states and their applications in quantum networks, quantum error correction, and measurement based quantum computing.

arXiv:2408.09515•Journal of Physics A Mathematical and Theoretical•Aug 21, 2025•1 citation

Small quantum networks in the qudit stabilizer formalism

Miller, Daniel

How much noise can a given quantum state tolerate without losing its entanglement? For qudits of arbitrary dimension, I investigate this question for two noise models: Global white noise, where a depolarizing channel is applied to all qudits simultaneously, and local white noise, where a single qudit depolarizing channel is applied to every qudit individually. Using a unitary generalization of the Pauli group, I derive noise thresholds for stabilizer states, with an emphasis on graph states, and compare different entanglement criteria. The PPT and reduction criteria generally provide high noise thresholds, however, it is difficult to apply them in the case of local white noise. Entanglement criteria based on so-called sector lengths, on the other hand, provide coarse noise thresholds for both noise models. The only thing one has to know about a state to compute this threshold is the number of its full-weight stabilizers. In the special case of qubit graph states, I relate this question to a graph-theoretical puzzle and solve it for four important families of states. For Greenberger-Horne-Zeilinger states under local white noise, I obtain for the first time a noise threshold below which so-called semiseparability is ruled out.

arXiv:1910.09551•Oct 21, 2019•8 citations

Optimized Distribution of Entanglement Graph States in Quantum Networks

Xiaojie Fan, Caitao Zhan, Himanshu Gupta +1 more

Building large-scale quantum computers, essential to demonstrating quantum advantage, is a key challenge. Quantum networks can help address this challenge by enabling the construction of large, robust, and more capable quantum computing platforms by connecting smaller quantum computers. Moreover, unlike classical systems, quantum networks can enable fully secured long-distance communication. Thus, quantum networks lie at the heart of the success of future quantum information technologies. In quantum networks, multipartite entangled states distributed over the network help implement and support many quantum network applications for communications, sensing, and computing. Our work focuses on developing optimal techniques to generate and distribute multipartite entanglement states efficiently. Prior works on generating general multipartite entanglement states have focused on the objective of minimizing the number of maximally entangled pairs while ignoring the heterogeneity of the network nodes and links as well as the stochastic nature of underlying processes. In this work, we develop a hypergraph-based linear programming framework that delivers optimal (under certain assumptions) generation schemes for general multipartite entanglement represented by graph states, under the network resources, decoherence, and fidelity constraints, while considering the stochasticity of the underlying processes. We illustrate our technique by developing generation schemes for the special cases of path and tree graph states and discuss optimized generation schemes for more general classes of graph states. Using extensive simulations over a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform prior known schemes by up to orders of magnitude.

arXiv:2405.00222•IEEE Transactions on Quantum Engineering•Jan 1, 2025•32 citations

Quantum Lego Expansion Pack: Enumerators from Tensor Networks

ChunJun Cao, Michael J. Gullans, Brad Lackey +1 more

We provide the first tensor-network method for computing quantum weight enumerator polynomials in the most general form. If a quantum code has a known tensor-network construction of its encoding map, our method is far more efficient, and in some cases exponentially faster than the existing approach. As a corollary, it produces decoders and an algorithm that computes the code distance. For non-(Pauli)-stabilizer codes, this constitutes the current best algorithm for computing the code distance. For degenerate stabilizer codes, it can be substantially faster compared to the current methods. We also introduce novel weight enumerators and their applications. In particular, we show that these enumerators can be used to compute logical error rates exactly and thus construct (optimal) decoders for any independent and identically distributed single qubit or qudit error channels. The enumerators also provide a more efficient method for computing nonstabilizerness in quantum many-body states. As the power for these speedups rely on a quantum Lego decomposition of quantum codes, we further provide systematic methods for decomposing quantum codes and graph states into a modular construction for which our technique applies. As a proof of principle, we perform exact analyses of the deformed surface codes, the holographic pentagon code, and the two-dimensional Bacon-Shor code under (biased) Pauli noise and limited instances of coherent error at sizes that are inaccessible by brute force. Published by the American Physical Society 2024

arXiv:2308.05152•PRX Quantum•Jul 22, 2024•25 citations

Quantum states and their marginals : from multipartite entanglement to quantum error-correcting codes

Felix Huber

At the heart of the curious phenomenon of quantum entanglement lies the relation between the whole and its parts. In my thesis, I explore different aspects of this theme in the multipartite setting by drawing connections to concepts from statistics, graph theory, and quantum error-correcting codes: first, I address the case when joint quantum states are determined by their few-body parts and by Jaynes’ maximum entropy principle. This can be seen as an extension of the notion of entanglement, with less complex states already being determined by their few-body marginals. Second, I address the conditions for certain highly entangled multipartite states to exist. In particular, I present the solution of a long-standing open problem concerning the existence of an absolutely maximally entangled state on seven qubits. This sheds light on the algebraic properties of pure quantum states, and on the conditions that constrain the sharing of entanglement amongst multiple particles. Third, I investigate Ulam’s graph reconstruction problems in the quantum setting, and obtain legitimacy conditions of a set of states to be the reductions of a joint graph state. Lastly, I apply and extend the weight enumerator machinery from quantum error correction to investigate the existence of codes and highly entangled states in higher dimensions. This clarifies the physical interpretation of the weight enumerators and of the quantum MacWilliams identity, leading to novel applications in multipartite entanglement.

•Feb 14, 2018•8 citations
The sector length distribution or Shor-Laflamme distribution (SLD) of quantum states is governed by the kkk-body correlations amongst the different systems, and has been used to study entanglement and error correction. A succinct description of a quantum state's SLD can be obtained by representing it through the coefficients of an appropriate weight enumerator polynomial, yielding bounds on fidelity under depolarizing noise and on multipartite entanglement. However, such expressions quickly grow out of hand and are generally difficult to achieve analytically, reflecting the computational hardness of the SLD. We sidestep this problem and, instead of a single state's SLDs, encode a family of quantum state's SLD as a generating function. We then find closed-form expressions for a large class of graph states which we call `recursively definable' and which include many common graphs such as path graphs, cycle graphs, star graphs, grid graphs, and more. As direct corollary, we obtain analytical expressions for such graph states' concentratable entanglement, bounds on their depolarizing fidelity, and a multipartite entanglement criterion. Our work opens up the use of generating functions and more generally analytic combinatorics to solve problems in quantum information theory.
Abstract The Shor–Laflamme distribution (SLD) of a quantum state is a collection of local unitary invariants that quantify k-body correlations. We show that the SLD of graph states can be derived by solving a graph-theoretical problem. In this way, the mean and variance of the SLD are obtained as simple functions of efficiently computable graph properties. Furthermore, this formulation enables us to derive closed expressions of SLDs for some graph state families. For cluster states, we observe that the SLD is very similar to a binomial distribution, and we argue that this property is typical for graph states in general. Finally, we derive an SLD-based entanglement criterion from the purity criterion and apply it to derive meaningful noise thresholds for entanglement. Our new entanglement criterion is easy to use and also applies to the case of higher-dimensional qudits. In the bigger picture, our results foster the understanding both of quantum error-correcting codes, where a closely related notion of SLDs plays an important role, and of the geometry of quantum states, where SLDs are known as sector length distributions.
Abstract Graph states are a fundamental class of multipartite entangled quantum states with wide-ranging applications in quantum information and computation. In this work, we develop a systematic approach for constructing and analyzing χ-colorable graph states, deriving explicit closed-form expressions for arbitrary χ. For a broad family of two- and three-colorable graph states, the representations obtained using only local operations require a minimal number of terms in the Z-eigenbasis. We prove that every two-colorable graph state is local Clifford (LC) equivalent to a state expressible as a summation of rows of an orthogonal array (OA). For graph states with χ > 2, we show that they are LC-equivalent to quantum OAs, establishing a direct combinatorial connection between multipartite entanglement and structured quantum states. Furthermore, the upper and lower bounds of the Schmidt measure for graph states with arbitrary χ colorability are discussed, extending the results for an arbitrary local dimension. Our results offer an efficient and practical method for systematically constructing graph states, optimizing their representation in quantum circuits, and identifying structured forms of multipartite entanglement. This approach also connects graph states to k-uniform and absolutely maximally entangled states, motivating further exploration of the structure of entangled states and their applications in quantum networks, quantum error correction, and measurement based quantum computing.
How much noise can a given quantum state tolerate without losing its entanglement? For qudits of arbitrary dimension, I investigate this question for two noise models: Global white noise, where a depolarizing channel is applied to all qudits simultaneously, and local white noise, where a single qudit depolarizing channel is applied to every qudit individually. Using a unitary generalization of the Pauli group, I derive noise thresholds for stabilizer states, with an emphasis on graph states, and compare different entanglement criteria. The PPT and reduction criteria generally provide high noise thresholds, however, it is difficult to apply them in the case of local white noise. Entanglement criteria based on so-called sector lengths, on the other hand, provide coarse noise thresholds for both noise models. The only thing one has to know about a state to compute this threshold is the number of its full-weight stabilizers. In the special case of qubit graph states, I relate this question to a graph-theoretical puzzle and solve it for four important families of states. For Greenberger-Horne-Zeilinger states under local white noise, I obtain for the first time a noise threshold below which so-called semiseparability is ruled out.
Building large-scale quantum computers, essential to demonstrating quantum advantage, is a key challenge. Quantum networks can help address this challenge by enabling the construction of large, robust, and more capable quantum computing platforms by connecting smaller quantum computers. Moreover, unlike classical systems, quantum networks can enable fully secured long-distance communication. Thus, quantum networks lie at the heart of the success of future quantum information technologies. In quantum networks, multipartite entangled states distributed over the network help implement and support many quantum network applications for communications, sensing, and computing. Our work focuses on developing optimal techniques to generate and distribute multipartite entanglement states efficiently. Prior works on generating general multipartite entanglement states have focused on the objective of minimizing the number of maximally entangled pairs while ignoring the heterogeneity of the network nodes and links as well as the stochastic nature of underlying processes. In this work, we develop a hypergraph-based linear programming framework that delivers optimal (under certain assumptions) generation schemes for general multipartite entanglement represented by graph states, under the network resources, decoherence, and fidelity constraints, while considering the stochasticity of the underlying processes. We illustrate our technique by developing generation schemes for the special cases of path and tree graph states and discuss optimized generation schemes for more general classes of graph states. Using extensive simulations over a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform prior known schemes by up to orders of magnitude.
We provide the first tensor-network method for computing quantum weight enumerator polynomials in the most general form. If a quantum code has a known tensor-network construction of its encoding map, our method is far more efficient, and in some cases exponentially faster than the existing approach. As a corollary, it produces decoders and an algorithm that computes the code distance. For non-(Pauli)-stabilizer codes, this constitutes the current best algorithm for computing the code distance. For degenerate stabilizer codes, it can be substantially faster compared to the current methods. We also introduce novel weight enumerators and their applications. In particular, we show that these enumerators can be used to compute logical error rates exactly and thus construct (optimal) decoders for any independent and identically distributed single qubit or qudit error channels. The enumerators also provide a more efficient method for computing nonstabilizerness in quantum many-body states. As the power for these speedups rely on a quantum Lego decomposition of quantum codes, we further provide systematic methods for decomposing quantum codes and graph states into a modular construction for which our technique applies. As a proof of principle, we perform exact analyses of the deformed surface codes, the holographic pentagon code, and the two-dimensional Bacon-Shor code under (biased) Pauli noise and limited instances of coherent error at sizes that are inaccessible by brute force. Published by the American Physical Society 2024
At the heart of the curious phenomenon of quantum entanglement lies the relation between the whole and its parts. In my thesis, I explore different aspects of this theme in the multipartite setting by drawing connections to concepts from statistics, graph theory, and quantum error-correcting codes: first, I address the case when joint quantum states are determined by their few-body parts and by Jaynes’ maximum entropy principle. This can be seen as an extension of the notion of entanglement, with less complex states already being determined by their few-body marginals. Second, I address the conditions for certain highly entangled multipartite states to exist. In particular, I present the solution of a long-standing open problem concerning the existence of an absolutely maximally entangled state on seven qubits. This sheds light on the algebraic properties of pure quantum states, and on the conditions that constrain the sharing of entanglement amongst multiple particles. Third, I investigate Ulam’s graph reconstruction problems in the quantum setting, and obtain legitimacy conditions of a set of states to be the reductions of a joint graph state. Lastly, I apply and extend the weight enumerator machinery from quantum error correction to investigate the existence of codes and highly entangled states in higher dimensions. This clarifies the physical interpretation of the weight enumerators and of the quantum MacWilliams identity, leading to novel applications in multipartite entanglement.