Type-I and Type-II Fusion Protocols for Weighted Graph States

• URL: http://arxiv.org/abs/2601.13381v1
• Date: Mon, 19 Jan 2026 20:32:24 GMT
• Title: Type-I and Type-II Fusion Protocols for Weighted Graph States
• Authors: N. Rimock, Y. Oz,
• Abstract summary: weighted graph states extend standard graph states by associating phases with entangling edges.<n>We analyze how the two main fusion operations, Type-I and Type-II, act on weighted graph states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Weighted graph states extend standard graph states by associating phases with entangling edges, and may serve as resources for measurement-based quantum computation (MBQC). We analyze how the two main fusion operations, Type-I and Type-II, act on weighted graph states. Type-I fusion operates identically to the unweighted case, merging two one-dimensional weighted graphs, while preserving edge weights and success probabilities. In addition, the pool of 2-qubit weighted graph states can be generated easily by GHZ states or Bell pairs. In contrast, Type-II fusion requires a logical qubit, which can be formed only for specific weight configurations, and with success probability below one-half, which is an obstacle one can avoid. When successful, it fuses the states correctly, but its failure outcomes destroy the structure of the graphs, removing the good-failure feature, known from ordinary graph states. We compute the entanglement reduction of the resulting link due to the fused states being weighted graph states (for generalized fusion), and classify the resulting states of a general non-Bell projection. These results define the practical limits of the fusion-based construction of weighted graph states for MBQC.

Related papers

• VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention [61.96837866507746]
  VecFormer is an efficient and highly generalizable model for node classification.<n>VecFormer outperforms the existing Graph Transformer in both performance and speed.
  arXiv  Detail & Related papers  (2026-02-23T09:10:39Z)
• Adaptive Framework for Failure-Aware Protocols in Fusion-Based Graph-State Generation [1.7205106391379026]
  We develop a framework to optimize the building process using graph theoretic characterizations of fusion networks.<n>We present graph state generation protocols for linear cluster resource states and Type-I/Type-II fusions which are adaptive to fusion failure.<n>Our strategies can reduce the fusion overhead by several orders of magnitude when compared to simple repeat until success protocols.
  arXiv  Detail & Related papers  (2026-01-05T13:13:39Z)
• Generating graph states with a single quantum emitter and the minimum number of fusions [0.24739484546803336]
  Graph states are key resources for measurement- and fusion-based quantum computing with photons.<n>We optimize a hybrid graph-state generation scheme using a single quantum emitter and linear optics Bell-state measurements called fusions.
  arXiv  Detail & Related papers  (2024-12-05T20:03:21Z)
• Transforming graph states via Bell state measurements [0.0]
  Graph states are key resources for measurement-based quantum computing.<n>We derive graph transformations for all types of rotated type-II fusion, showing that there are five different fusion success cases.<n>We give application examples of the derived graph transformation rules and show that they can be used to construct graph codes or simulate fusion networks.
  arXiv  Detail & Related papers  (2024-05-03T18:16:25Z)
• Graph-level Representation Learning with Joint-Embedding Predictive Architectures [43.89120279424267]
  Joint-Embedding Predictive Architectures (JEPAs) have emerged as a novel and powerful technique for self-supervised representation learning.<n>We show that graph-level representations can be effectively modeled using this paradigm by proposing a Graph Joint-Embedding Predictive Architecture (Graph-JEPA)<n>In particular, we employ masked modeling and focus on predicting the latent representations of masked subgraphs starting from the latent representation of a context subgraph.
  arXiv  Detail & Related papers  (2023-09-27T20:42:02Z)
• Boson subtraction as an alternative to fusion gates for generating graph states [0.0]
  We propose an alternative approach to generate graph states based on the graph picture of linear quantum networks (LQG picture) These subtraction schemes correspond to efficient heralded optical setups with single-photon sources and more flexible measurement elements than fusion gates.
  arXiv  Detail & Related papers  (2023-06-27T02:14:17Z)
• 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)
• Graph-theoretical optimization of fusion-based graph state generation [0.0]
  We present a graph-theoretical strategy to effectively optimize fusion-based generation of any given graph state, along with a Python package OptGraphState. Our strategy comprises three stages: simplifying the target graph state, building a fusion network, and determining the order of fusions.
  arXiv  Detail & Related papers  (2023-04-24T10:46:54Z)
• You Only Transfer What You Share: Intersection-Induced Graph Transfer Learning for Link Prediction [79.15394378571132]
  We investigate a previously overlooked phenomenon: in many cases, a densely connected, complementary graph can be found for the original graph. The denser graph may share nodes with the original graph, which offers a natural bridge for transferring selective, meaningful knowledge. We identify this setting as Graph Intersection-induced Transfer Learning (GITL), which is motivated by practical applications in e-commerce or academic co-authorship predictions.
  arXiv  Detail & Related papers  (2023-02-27T22:56:06Z)
• 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)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• 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)
• Generating the Graph Gestalt: Kernel-Regularized Graph Representation Learning [47.506013386710954]
  A complete scientific understanding of graph data should address both global and local structure. We propose a joint model for both as complementary objectives in a graph VAE framework. Our experiments demonstrate a significant improvement in the realism of the generated graph structures, typically by 1-2 orders of magnitude of graph structure metrics.
  arXiv  Detail & Related papers  (2021-06-29T10:48:28Z)

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.