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

The gist The analysis examines how Type-I and Type-II fusion operations act on weighted graph states, defining their practical limits for measurement-based quantum computation (MBQC)

Weighted Graph States and Fusion Protocols

Weighted graph states extend standard graph states by associating continuous phase factors with entangling edges, serving as resources for MBQC. Type-I fusion operates identically to the unweighted case, merging two one-dimensional weighted graphs while preserving edge weights and success probabilities. In contrast, Type-II fusion requires a logical qubit formed only for specific weight configurations and has a success probability below one-half. When Type-II fusion is successful, it fuses the states correctly, but its failure outcomes destroy the structure of the graphs by removing the goodfailure feature known from ordinary graph states.

Type-I Fusion for Weighted Graph States

Type-I fusion acts identically to the unweighted case, maintaining both success probability and edge-weight inheritance. The wave function of two original graph states can be written as (6), and when the fusion succeeds, the resulting state is the desired fused graph state by replacing a, b with c that inherits neighbors and weights of a, b. In the case of failure, Type-I fusion results in Z measurements on both qubits a, b, which eliminates them and their connections without affecting other qubits in the original graph states that remain separated. The computation of probabilities for success and failure remains the same (one-half without using ancilla qubits).

Creating Logical Qubits for Weighted Graph States

To perform Type-II fusion, one needs to create a logical qubit in a one-dimensional graph state, which is achieved by measuring the operator Xa resulting in b1, b2 becoming one logical qubit as in (12). This requires specific weight configurations for the creation of a logical qubit. The only apparent way to make a logical qubit in a one-dimensional weighted graph state with certainty is by creating two consecutive edges with π weight and applying an X measurement on the qubit between those edges.

Type-II Fusion for Weighted Graph States

Type-II fusion exhibits modifications where the creation of a logical qubit becomes conditional on specific weight configurations. While in the case of success, Type-II fusion works well for weighted graph states given that a logical qubit was created, its failure outcomes do not preserve the desired graph structure. The probability of failure can be reduced by using ancilla qubits to lower it below one-half. The failure probabilities read as p(⟨0a±⟨1a)(⟨0b∓⟨1b) = 1/4 (1 − Re(z)).

Generalized Type-II Fusion and Entanglement Entropy

For generalized fusion, the resulting state is classified by computing the entanglement entropy, which can be computed by evaluating the reduced density matrix after tracing out Span for the state (22). The entanglement entropy is given by Sij = −λij log2 λij − (1 − λij) log2 (1 − λij). If the two-qubit state on which we project is maximally entangled, then the determinant associated with the two-qubit state on which we project is just multiplied by 1−z2.

Projecting onto a Non-Bell State

The resulting state (22) from the described fusion process is a special case of acting on the initial wave function (15) with a general projection onto a two-qubit state of a, b. If n(b) = 1, then if the previous conditions hold, the resulting state is again the required fused graph state up to Z rotation on the qubit e. The only way to achieve certainty for a logical qubit in a one-dimensional weighted graph state is by creating in this one-dimensional weighted graph two consecutive edges with π weight and applying X measurement on the qubit between those edges.

Conclusion

The results clarify the operational limits of fusion-based growth of weighted graph states, showing that Type-I fusion is robust, while Type-II fusion faces obstacles related to logical qubit creation and failure outcomes. Any fusion protocol that retains a nonzero success probability necessarily produces failure outcomes that are not uniform. The paper also shows that any fusion process resulting in a projecting onto a 2-qubit maximally entangled state in the case of success will retain the success probability when performed on weighted graph states instead of graph states.

--- Page 1 ---

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

Noam Rimock∗ and Yaron Oz†

School of Physics and Astronomy, Tel Aviv University, Ramat Aviv 69978, Israel

(Dated: April 2, 2026)

--- Page 2 ---

I. INTRODUCTION

Graph states constitute a central class of entangled quantum states that form the basis of measurement-based quantum computation (MBQC) [1]. In this framework, computation is performed through single-qubit measurements on a highly entangled resource, typically a cluster state. The efficient generation and manipulation of such resource states are therefore key ingredients for scalable quantum computing, particularly in photonic architectures, where entanglement is created probabilistically. A promising approach to constructing large graph states is the use of fusion operations, probabilistic entangling measurements that connect smaller cluster fragments. Two main types of fusion gates, Type-I and Type-II, have been introduced for standard (unweighted) graph states [2]. Type-I fusion probabilistically merges two graph states by removing the measured qubits, while preserving the connectivity of their neighbors, whereas Type-II fusion enables the creation of logical qubits, and supports fault-tolerant graph growth through its favorable failure behavior. Weighted graph states [3] generalize standard graph states by assigning continuous phase factors to their edges. These states appear naturally in various physical implementations and areas of research [4–7], and extend the resource space available for MBQC. However, the behavior of fusion operations in the weighted setting has not yet been systematically analyzed. In this work, we study how Type-I and Type-II fusions translate to the case of weighted graph states. We show that Type-I fusion acts identically to the unweighted case, maintaining both the success probability and edge-weight inheritance. In contrast, Type-II fusion exhibits significant modifications: the creation of a logical qubit becomes conditional on specific weight configurations (a limitation that can be bypassed as explained later), and its non-successful outcomes do not preserve the desired graph structure. We also derive conditions under which measurements on GHZ-states can deterministically generate 2-qubit weighted graph states with a target weight that does not depend on the outcome of the measurement, hence creating a pool of 2-qubit states that one needs in order to create larger weighted graph states. Finally, we study the behavior of weighted graph states under generalized fusion, classify the resulting states, and compute the new probabilities and entanglement entropies that changes due to non-maximal edge weights. We prove that any 2 type-II fusion processes of graph states involving projection onto maximally entangled states will retain their success probability when applied to weighted graph states instead. Together, these results clarify the limitations and applicability of fusion-based schemes for constructing weighted graph states for MBQC, and provide guidance for designing measurement-based architectures beyond standard cluster-state models.

--- Page 3 ---

II. PRELIMINARIES: WEIGHTED GRAPH STATES AND FUSION PROTOCOLS

In this section, we review the theoretical background necessary for the analysis presented in the following sections. We begin by defining optical qubits, and recalling the construction of weighted graph states, which generalize standard graph states by introducing phasedependent entangling edges. We then summarize the known fusion mechanisms, Type-I and Type-II, that probabilistically connect graph-state fragments, and explain their realization in linear-optical systems. Finally, we describe how logical qubits can be created within onedimensional graph states, and outline the generalized Type-II fusion and non-Bell projection schemes. This overview establishes the notation and mathematical tools used throughout the remainder of the paper.

--- Page 4 ---

A. Optical qubits

Given a photonic frequency/position channel a, with two polarizations H,V, we use it to represent a qubit ϕ⟩ = α 0⟩ a + β 1⟩ a, where:

0⟩ a = a†H vac⟩, 1⟩ a = a†Vvac>. (1)

--- Page 5 ---

B. Weighted graph states

Weighted graph states are quantum states associated with weighted graphs [3, 4].

1. A new measurement-based quantum computation (MBQC) architecture can be designed that deterministically generates a 2-qubit weighted graph state with a target weight without relying on probabilistic outcomes, as shown by we show that Type-I fusion acts identically to the unweighted case, maintaining both the success probability and edge-weight inheritance.

2. AI systems can utilize the derived conditions for creating logical qubits in one-dimensional weighted graph states (we arrive in this subsection at the same conclusion) to engineer specific weight configurations necessary for fault-tolerant graph growth.

3. The system can implement a generalized fusion protocol that retains its success probability when applied to weighted graph states instead even when projecting onto maximally entangled states, which ensures the output state is the desired fused weighted graph state up to single-qubit rotations.

4. AI systems can perform advanced entanglement entropy calculations on resulting states using the derived formula for the determinant of the reduced density matrix, specifically det(ρij) = 1 − z2 / 4, to classify fusion outcomes based on their entanglement properties.

5. The system can implement adaptive error-resilient protocols by leveraging failure probability ratios, as shown in equation (52), which allows for the suppression of problematic failure probabilities when not in the case χ = π.

Weighted graph states extend standard graph states by associating phases with entangling edges, and may serve as resources for measurement-based quantum computation. 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 two-qubit weighted graph states can be generated easily from Greenberger-Horne-Zeilinger states or Bell pairs. In contrast, type-II fusion requires a logical qubit, which can be formed only for specific weight configurations, and with a success probability below one-half. 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. These two obstacles can be overcome by using extra qubits and π weights in the one-dimensional weighted graph states that are being fused, which enables scalability. We compute the change in the entanglement entropy 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. To our knowledge, this is the first time that fusion processes have been used to construct weighted graph states.