Sector length distributions of recursively definable graph states through analytic combinatorics

• URL: http://arxiv.org/abs/2604.09766v1
• Date: Fri, 10 Apr 2026 18:00:01 GMT
• Title: Sector length distributions of recursively definable graph states through analytic combinatorics
• Abstract summary: We encode a family of quantum state's SLD as a generating function.<n>We find expressions for graph states' concentratable entanglement, bounds on their depolarizing fidelity, and a multipartite entanglement.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Directed Graph Topology Inference via Graph Filter Identification [54.541275287889164]
  We address the problem of inferring a directed network from nodal measurements generated by a graph convolutional filter.<n>A joint graph filter and topology identification algorithm is also proposed, which alternates between the aforementioned steps to offer improved sample complexity.
  arXiv  Detail & Related papers  (2026-06-25T18:25:57Z)
• A Theory of Random Graph Shift in Truncated-Spectrum vRKHS [26.195791008324495]
  This paper develops a theory of graph classification under domain shift through a random-graph generative lens.<n>We consider intra-class graphs sharing the same random graph model (RGM) and the domain shift induced by changes in RGM components.
  arXiv  Detail & Related papers  (2026-02-27T10:19:57Z)
• A graph-theoretic approach to chaos and complexity in quantum systems [1.0119341444443795]
  We explore, via the commutator graph, average notions of scrambling, chaos and complexity over ensembles of systems with Lie algebras.<n>We link graph-theoretic properties of the commutator graph to the out-of-time-orderor (OTOC), the frame potential, the frustration graph of the Hamiltonian of the system, and the Krylov complexity of operators evolving under the dynamics.
  arXiv  Detail & Related papers  (2025-02-23T02:03:03Z)
• Causal Discovery with Fewer Conditional Independence Tests [15.876392307650248]
  Our work focuses on characterizing what can be learned about the underlying causal graph with a reduced number of conditional independence tests. We show that it is possible to learn a coarser representation of the hidden causal graph with a number of tests. As a consequence, our results offer the first efficient algorithm for recovering the true causal graph with a number of tests.
  arXiv  Detail & Related papers  (2024-06-03T22:27:09Z)
• Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations [8.194910516215462]
  We propose a novel approach for distributing graph states across a quantum network.<n>We classify common classes of graph states, along with their optimal distribution time using subgraph complementations.
  arXiv  Detail & Related papers  (2023-08-25T23:03:25Z)
• One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering [56.81492360414741]
  We show how to enforce a one-step normalized cut for bipartite graphs, especially with linear-time complexity. In this paper, we first characterize a novel one-step bipartite graph cut criterion with normalized constraints, and theoretically prove its equivalence to a trace problem. We extend this cut criterion to a scalable subspace clustering approach, where adaptive anchor learning, bipartite graph learning, and one-step normalized bipartite graph partitioning are simultaneously modeled.
  arXiv  Detail & Related papers  (2023-05-12T11:27:20Z)
• Shor-Laflamme distributions of graph states and noise robustness of entanglement [0.8563354084119061]
  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. 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.
  arXiv  Detail & Related papers  (2022-07-15T18:00:02Z)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• Partial Counterfactual Identification from Observational and Experimental Data [83.798237968683]
  We develop effective Monte Carlo algorithms to approximate the optimal bounds from an arbitrary combination of observational and experimental data. Our algorithms are validated extensively on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2021-10-12T02:21:30Z)
• Explicit Pairwise Factorized Graph Neural Network for Semi-Supervised Node Classification [59.06717774425588]
  We propose the Explicit Pairwise Factorized Graph Neural Network (EPFGNN), which models the whole graph as a partially observed Markov Random Field. It contains explicit pairwise factors to model output-output relations and uses a GNN backbone to model input-output relations. We conduct experiments on various datasets, which shows that our model can effectively improve the performance for semi-supervised node classification on graphs.
  arXiv  Detail & Related papers  (2021-07-27T19:47:53Z)
• Multipole Graph Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  One of the main challenges in using deep learning-based methods for simulating physical systems is formulating physics-based data. We propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity. Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.
  arXiv  Detail & Related papers  (2020-06-16T21:56:22Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)

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.