Towards Efficient Synthesis of Quantum Graph States by Fusing Graph Motifs

• URL: http://arxiv.org/abs/2606.02880v1
• Date: Mon, 01 Jun 2026 20:51:29 GMT
• Title: Towards Efficient Synthesis of Quantum Graph States by Fusing Graph Motifs
• Abstract summary: 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.
• Score: 2.4285767320597764
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Photonic graph states with advanced topologies can enable measurement-based quantum computing, distributed quantum sensing, and quantum interconnects. However, the efficient generation of photonic graph states is limited by the probabilistic nature of photonic entangling operations and the exponential dependence of generation rate on resource cost. In this work, 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. Specifically, we propose Cost-aware Fusion-based Decomposition (CFD), a three-stage heuristic 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. We further show that selecting the LC-equivalent graph state with the minimum number of edges provides a highly effective proxy for near-optimal synthesis: in many cases it matches the best generation rate observed within the LC equivalence class under CFD, and in most remaining cases it remains close to it. Numerical evaluations on graph state orbit data and 2D and 3D lattice graph states demonstrate that CFD achieves up to 84.6\% reduction in resource overhead compared to baseline constructions, and yields improvements in photonic generation rate spanning multiple orders of magnitude. These results suggest that combining structure-aware motif decomposition with LC equivalence is a practical and scalable strategy for photonic graph state synthesis.

Related papers

• Distributed synthesis of arbitrary graph states in quantum networks via rank-two GF(2) reduction [10.444672877393124]
  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.
  arXiv  Detail & Related papers  (2026-08-21T14:37:08Z)
• Efficient Graph State Purification with Factorized Graph-Preserving Operations across Local Clifford Orbits [1.6005318974883016]
  Graph states form a broad class of multipartite entangled states underlying measurement quantum computation, quantum networks, and stabilizer codes.<n>We introduce a group of Clifford operations that we call "ized graph-preserving"<n>These operations map products of graph-basis states to products of graph-basis states, so their action can be represented as permutations of graph-basis labels.
  arXiv  Detail & Related papers  (2026-06-22T18:00:18Z)
• Rethinking Efficient Graph Coarsening via a Non-Selfishness Principle [56.92868481531399]
  We propose a non-selfishness principle that prioritizes the collective interference of neighborhood in coarsening.<n>We derive a faster variant NOPE*, which reduces O(dot d) interference evaluation to O(d) based on the local isotropy assumption.<n>Learning on coarsened graphs yields comparable performance to original graphs, and can even show superior performance over LLM-based graph reasoning.
  arXiv  Detail & Related papers  (2026-05-13T05:24:35Z)
• Efficient Preparation of Graph States using the Quotient-Augmented Strong Split Tree [1.5006258585503878]
  Graph states are a key resource for measurement-based quantum computation and quantum networking.<n>We introduce a split-fuse construction for arbitrary DH graph states, achieving linear scaling with respect to entangling gates, time steps, and auxiliary qubits.<n>We also discuss a generalized divide-and-conquer split-fuse strategy and a simple greedy for generic graphs based on triangle enumeration.
  arXiv  Detail & Related papers  (2026-03-25T03:30:57Z)
• Cost-aware Photonic Graph State Generation: A Graphical Framework [0.0]
  Photonic graph states are essential resources for quantum computation and communication.<n>We introduce a cost-aware framework for the generation of photonic graph states of arbitrary size and shape.<n>Within this framework, we develop Graph Builder, a deterministic generation algorithm that achieves substantial reductions in two-qubit gate usage.
  arXiv  Detail & Related papers  (2025-09-26T18:00:01Z)
• A Scalable and Robust Compilation Framework for Emitter-Photonic Graph State [1.3624495460189865]
  We study the GraphState-to-Circuit compilation problem in the context of the deterministic scheme.<n>We propose a novel compilation framework that partitions the target graph state into subgraphs, compiles them individually, and subsequently combines and schedules the circuits to maximize emitter resource utilization.
  arXiv  Detail & Related papers  (2025-03-20T17:01:33Z)
• Heralded photonic graph states with inefficient quantum emitters [2.612403257963011]
  Quantum emitter-based schemes for the generation of photonic graph states offer a promising, resource efficient methodology.<n>We present a heralded scheme for making photonic graph states that is compatible with the typically poor photon collection from state-of-the-art quantum emitters.
  arXiv  Detail & Related papers  (2024-05-22T00:24:01Z)
• Graph Condensation for Inductive Node Representation Learning [59.76374128436873]
  We propose mapping-aware graph condensation (MCond) MCond integrates new nodes into the synthetic graph for inductive representation learning. On the Reddit dataset, MCond achieves up to 121.5x inference speedup and 55.9x reduction in storage requirements.
  arXiv  Detail & Related papers  (2023-07-29T12:11:14Z)
• Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data [91.27527985415007]
  Existing graph condensation methods rely on the joint optimization of nodes and structures in the condensed graph. We advocate a new Structure-Free Graph Condensation paradigm, named SFGC, to distill a large-scale graph into a small-scale graph node set.
  arXiv  Detail & Related papers  (2023-06-05T07:53:52Z)
• 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)
• 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)
• 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.