Distributed synthesis of arbitrary graph states in quantum networks via rank-two GF(2) reduction

• URL: http://arxiv.org/abs/2608.21166v2
• Date: Mon, 24 Aug 2026 14:08:56 GMT
• Title: Distributed synthesis of arbitrary graph states in quantum networks via rank-two GF(2) reduction
• Abstract summary: Existing schemes for synthesizing graph states in quantum networks are essentially edge-by-edge constructions.<n>This paper proposes a new method for synthesizing arbitrary N-node graph states in quantum networks.
• Score: 10.444672877393124
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Existing schemes for synthesizing graph states in quantum networks are essentially edge-by-edge constructions, so quantities such as the time-slot depth and the resource overhead grow significantly with the edge density of the target graph. This paper proposes a new method. Exploiting the mathematical equivalence between joint Pauli-X measurements and graph pivot operations, we formulate graph state synthesis as a rank-2 reduction process of a difference matrix over GF(2), and give an upper bound floor(N/2) on the number of steps for synthesizing an arbitrary N-node graph state, independent of the edge density of the target graph state. At the physical level, the joint Pauli-X measurement of each step is mapped to a dual-star concurrent distribution. We model the protocol on Waxman physical topologies with fiber attenuation and give a heuristic algorithm, and evaluate it against a strengthened Steiner baseline through Monte Carlo experiments. The experimental results show that our protocol is superior in time-slot depth almost everywhere. The entanglement resource overhead, the total number of CZ gates, and the number of Pauli measurements drop below the baseline near edge density p approximately 0.3, and are superior across the board thereafter. The denser the target graph state, the more significant the advantage.

Related papers

• Scalable Graph Coreset Selection via Greedy Sampling [48.91894218306487]
  We propose a simple and effective column-selective graph sampling algorithm based on a minimum inner product greedy selection rule.<n>We analyze the algorithm under the block model and show that, when the degree distribution is balanced across nodes, the algorithm achieves proportional sampling to cluster size.
  arXiv  Detail & Related papers  (2026-07-30T02:45:31Z)
• Towards Efficient Synthesis of Quantum Graph States by Fusing Graph Motifs [2.4285767320597764]
  Photonic graph states can enable measurement-based quantum computing, distributed quantum sensing, and quantum interconnects.<n>We study photonic graph state synthesis as a cost-aware decomposition problem, exploiting local Clifford (LC) equivalence to identify more synthesis-friendly representations of the target graph state before decomposition.<n>Specifically, we propose Cost-aware Fusion-based Decomposition (CFD), a three-stage framework that decomposes a target graph state into ring, star, and linear motifs, and assembles them via Type-I fusion operations to minimize fusion overhead and physical-qubit consumption.
  arXiv  Detail & Related papers  (2026-06-01T20:51:29Z)
• Sparse Graph Learning from Sparse Data via Fiedler Number Maximization [16.83442282933831]
  We aim to learn a sparse and connected graph from sparse data, where the number of observations K can be substantially smaller than the signal dimension N for signals x in RN, and the underlying distribution is unknown.<n>We incorporate Fiedler number (the second eigenvalue of the graph Laplacian matrix that quantifies connectedness) as a robust regularization term in the sparse graph learning objective.<n> Simulation experiments show that Fiedler number robustifies sparse graph estimates, outperforming previous sparse graph learning algorithms.
  arXiv  Detail & Related papers  (2026-04-28T21:40:39Z)
• Efficient graph-diagonal characterization of noisy states distributed over quantum networks via Bell sampling [0.10486135378491267]
  Graph states are an important class of entangled states that serve as a key resource for distributed information processing and communication in quantum networks.<n>We propose a protocol that utilizes a Bell sampling subroutine to characterize the diagonal elements in the graph basis of noisy graph states distributed across a network.
  arXiv  Detail & Related papers  (2025-12-07T04:19:09Z)
• Graph state extraction from two-dimensional cluster states [37.19059223604783]
  We introduce graph state manipulation tools that allow one to increase the local degree and to merge subgraphs.<n>We show how to minimize overheads by avoiding multiple edges, and compare with a local manipulation strategy based on measurement-based quantum computation together with transport.<n>These schemes have direct applications in entanglement-based quantum networks, sensor networks, and distributed quantum computing in general.
  arXiv  Detail & Related papers  (2025-05-13T09:49:54Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• 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)
• Efficient Graph Field Integrators Meet Point Clouds [59.27295475120132]
  We present two new classes of algorithms for efficient field integration on graphs encoding point clouds. The first class, SeparatorFactorization(SF), leverages the bounded genus of point cloud mesh graphs, while the second class, RFDiffusion(RFD), uses popular epsilon-nearest-neighbor graph representations for point clouds.
  arXiv  Detail & Related papers  (2023-02-02T08:33:36Z)
• Graphon Pooling for Reducing Dimensionality of Signals and Convolutional Operators on Graphs [131.53471236405628]
  We present three methods that exploit the induced graphon representation of graphs and graph signals on partitions of [0, 1]2 in the graphon space. We prove that those low dimensional representations constitute a convergent sequence of graphs and graph signals. We observe that graphon pooling performs significantly better than other approaches proposed in the literature when dimensionality reduction ratios between layers are large.
  arXiv  Detail & Related papers  (2022-12-15T22:11:34Z)
• Graph Spectral Embedding using the Geodesic Betweeness Centrality [76.27138343125985]
  We introduce the Graph Sylvester Embedding (GSE), an unsupervised graph representation of local similarity, connectivity, and global structure. GSE uses the solution of the Sylvester equation to capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2022-05-07T04:11:23Z)
• Spectral Embedding of Graph Networks [76.27138343125985]
  We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure and neighborhood proximity in a single representation.
  arXiv  Detail & Related papers  (2020-09-30T04:59:10Z)

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.