© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:2601.13381 · Physical Review A

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

N. Rimock, Y. Oz

quant-phSubmitted Jan 19, 2026• Announced Jan 21, 2026• 0 citations• Revised Oct 19, 2026 (v4)

v1 · Jan 19, 2026 v2 · Mar 14, 2026 v3 · Apr 1, 2026 v4 · Oct 19, 2026

Abstract

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.

Journal reference: Phys. Rev. A 114, 042439 (2026)
DOI: 10.1103/bf7h-2mk9
Comments: 45 pages

Related papers

Transforming graph states via Bell state measurements

Matthias C. Löbl, Love A. Pettersson, Stefano Paesani +1 more

Graph states are key resources for measurement-based quantum computing, which is particularly promising for photonic systems. Fusions are probabilistic Bell state measurements, measuring pairs of parity operators of two qubits. Fusions can be used to connect/entangle different graph states, making them a powerful resource for measurement-based and related fusion-based quantum computing. There are several different graph structures and types of Bell state measurements, yet the associated graph transformations have only been analyzed for specific cases. Here, we provide a full set of graph transformation rules and give an intuitive visualization based on Venn diagrams of local neighborhoods of graph nodes. We derive these graph transformations for all types of rotated type-II fusion, showing that there are five different fusion success cases. Finally, 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:2405.02414•Quantum•Jul 14, 2025•5 citations

Generalized type-II fusion of cluster states

Noam Rimock, Khen Cohen, Yaron Oz

Measurement based quantum computation is a quantum computing paradigm that employs single-qubit measurements performed on an entangled resource state in the form of a cluster state. A basic ingredient in the construction of the resource state is the type-II fusion procedure, which probabilistically merges two separate photonic cluster states by a quantum measurement. We generalize the type-II fusion procedure by generalizing the measurement setup, and classify the resulting final states, which also include cluster states up to single-qubit rotations. We prove that the probability for the success of the generalized type-II fusion is bounded by fifty percent, and classify all the possibilities to saturate the bound. We analyze the enhancement of the fusion success probability above the fifty percent bound, by the reduction of the entanglement entropy of the resulting state. We prove that the only states that can be obtained with a hundred percent probability of success, are product states.

arXiv:2406.15666•Physical Review A•Dec 5, 2025•2 citations

Properties of multi-qubit variational quantum states representing weighted graphs and their computing with quantum programming

Kh. P. Gnatenko, A. Kaczmarek

We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to graphs of arbitrary structure. In general case of quantum graph states of arbitrary structure we derive the geometric measure of entanglement and evaluate quantum correlators. It is shown that these quantities are related to the edge-weight structure around the corresponding vertices in the graph (i.e., edge weights incident to the vertices and vertex weights associated with their closed neighborhoods). In the special case of quantum states representing unweighted graphs, these quantities are related to the degrees of the corresponding vertices in the graph. As an example, we analyze the state associated with the star graph $K_{1,4}$ using noisy quantum computing on the AerSimulator. The results are in good agreement with theoretical predictions. These findings demonstrate a connection between graph structure and quantum properties, enabling the study of properties of classical graphs via quantum computing.

quant-pharXiv:2604.00958•Apr 2, 2026•0 citations

Generalized Fusion of Qudit Graph States

Noam Rimock, Yaron Oz

We formalize a generalized type-II fusion operation for qudit cluster states within linear optics. Two designated qudits, one from each input cluster, interfere with optional ancilla qudits via a passive linear-optical network, followed by number-resolving detection; conditioned on measurement outcome, the remaining qudits form the post-selected fused state. We prove a general rank bound: for any such interferometer and outcome, the reduced density matrix across the two parent clusters has Schmidt rank at most $M$, the total number of measured qudits including ancillae. Consequently, a correct qudit fusion which requires rank $d$ is impossible without ancillae and requires at least $d-2$ ancilla qudits. Our analysis extends previous no-go results for Bell-type qubit fusion to the qudit setting and to generalized, non-Bell projections. We analyze the probabilities and entanglement of the relevant measurement outcomes, and discuss how our lower bound aligns with existing constructive schemes. These results set a clear resource threshold for high-dimensional, fusion-based photonic MBQC.

arXiv:2510.16623•Oct 18, 2025•0 citations

Generating redundantly encoded resource states for photonic quantum computing

Samuel J. Sheldon, Pieter Kok

Measurement-based quantum computing relies on the generation of large entangled cluster states that act as a universal resource on which logical circuits can be imprinted and executed through local measurements. A number of strategies for constructing sufficiently large photonic cluster states propose fusing many smaller resource states generated by a series of quantum emitters. However, the fusion process is inherently probabilistic with a 50% success probability in standard guise. A recent proposal has shown that, in the limit of low loss, the probability of achieving successful fusion may be boosted to near unity by redundantly encoding the vertices of linear graph states using Greenberger-Horne-Zeilinger states [Quantum 7, 992 (2023)]. Here we present a protocol for deterministically generating redundantly encoded photonic resource states using single quantum emitters, and study the impact of protocol errors and photonic losses on the generated resource states and type-II photonic fusion. Our work provides a route for efficiently constructing complex entangled photonic qubit states for photonic quantum computing and quantum repeaters.

quant-pharXiv:2512.03131•Dec 4, 2025•0 citations

Fusion of deterministically generated photonic graph states

Philip Thomas, Leonardo Ruscio, Olivier Morin +1 more

Abstract Entanglement has evolved from an enigmatic concept of quantum physics to a key ingredient of quantum technology. It explains correlations between measurement outcomes that contradict classical physics and has been widely explored with small sets of individual qubits. Multi-partite entangled states build up in gate-based quantum-computing protocols and—from a broader perspective—were proposed as the main resource for measurement-based quantum-information processing1,2. The latter requires the ex-ante generation of a multi-qubit entangled state described by a graph3–6. Small graph states such as Bell or linear cluster states have been produced with photons7–16, but the proposed quantum-computing and quantum-networking applications require fusion of such states into larger and more powerful states in a programmable fashion17–21. Here we achieve this goal by using an optical resonator22containing two individually addressable atoms23,24. Ring25and tree26graph states with up to eight qubits, with the names reflecting the entanglement topology, are efficiently fused from the photonic states emitted by the individual atoms. The fusion process itself uses a cavity-assisted gate between the two atoms. Our technique is, in principle, scalable to even larger numbers of qubits and is the decisive step towards, for instance, a memory-less quantum repeater in a future quantum internet27–29.

arXiv:2403.11950•Nature•May 8, 2024•52 citations

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.

Graph states are key resources for measurement-based quantum computing, which is particularly promising for photonic systems. Fusions are probabilistic Bell state measurements, measuring pairs of parity operators of two qubits. Fusions can be used to connect/entangle different graph states, making them a powerful resource for measurement-based and related fusion-based quantum computing. There are several different graph structures and types of Bell state measurements, yet the associated graph transformations have only been analyzed for specific cases. Here, we provide a full set of graph transformation rules and give an intuitive visualization based on Venn diagrams of local neighborhoods of graph nodes. We derive these graph transformations for all types of rotated type-II fusion, showing that there are five different fusion success cases. Finally, 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.

Measurement based quantum computation is a quantum computing paradigm that employs single-qubit measurements performed on an entangled resource state in the form of a cluster state. A basic ingredient in the construction of the resource state is the type-II fusion procedure, which probabilistically merges two separate photonic cluster states by a quantum measurement. We generalize the type-II fusion procedure by generalizing the measurement setup, and classify the resulting final states, which also include cluster states up to single-qubit rotations. We prove that the probability for the success of the generalized type-II fusion is bounded by fifty percent, and classify all the possibilities to saturate the bound. We analyze the enhancement of the fusion success probability above the fifty percent bound, by the reduction of the entanglement entropy of the resulting state. We prove that the only states that can be obtained with a hundred percent probability of success, are product states.

We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with

RX

rotations and

RZZ

entangling gates, corresponding to graphs of arbitrary structure. In general case of quantum graph states of arbitrary structure we derive the geometric measure of entanglement and evaluate quantum correlators. It is shown that these quantities are related to the edge-weight structure around the corresponding vertices in the graph (i.e., edge weights incident to the vertices and vertex weights associated with their closed neighborhoods). In the special case of quantum states representing unweighted graphs, these quantities are related to the degrees of the corresponding vertices in the graph. As an example, we analyze the state associated with the star graph

K_{1,4}

using noisy quantum computing on the AerSimulator. The results are in good agreement with theoretical predictions. These findings demonstrate a connection between graph structure and quantum properties, enabling the study of properties of classical graphs via quantum computing.

We formalize a generalized type-II fusion operation for qudit cluster states within linear optics. Two designated qudits, one from each input cluster, interfere with optional ancilla qudits via a passive linear-optical network, followed by number-resolving detection; conditioned on measurement outcome, the remaining qudits form the post-selected fused state. We prove a general rank bound: for any such interferometer and outcome, the reduced density matrix across the two parent clusters has Schmidt rank at most

M

, the total number of measured qudits including ancillae. Consequently, a correct qudit fusion which requires rank

d

is impossible without ancillae and requires at least

d-2

ancilla qudits. Our analysis extends previous no-go results for Bell-type qubit fusion to the qudit setting and to generalized, non-Bell projections. We analyze the probabilities and entanglement of the relevant measurement outcomes, and discuss how our lower bound aligns with existing constructive schemes. These results set a clear resource threshold for high-dimensional, fusion-based photonic MBQC.

Measurement-based quantum computing relies on the generation of large entangled cluster states that act as a universal resource on which logical circuits can be imprinted and executed through local measurements. A number of strategies for constructing sufficiently large photonic cluster states propose fusing many smaller resource states generated by a series of quantum emitters. However, the fusion process is inherently probabilistic with a 50% success probability in standard guise. A recent proposal has shown that, in the limit of low loss, the probability of achieving successful fusion may be boosted to near unity by redundantly encoding the vertices of linear graph states using Greenberger-Horne-Zeilinger states [Quantum 7, 992 (2023)]. Here we present a protocol for deterministically generating redundantly encoded photonic resource states using single quantum emitters, and study the impact of protocol errors and photonic losses on the generated resource states and type-II photonic fusion. Our work provides a route for efficiently constructing complex entangled photonic qubit states for photonic quantum computing and quantum repeaters.

Abstract Entanglement has evolved from an enigmatic concept of quantum physics to a key ingredient of quantum technology. It explains correlations between measurement outcomes that contradict classical physics and has been widely explored with small sets of individual qubits. Multi-partite entangled states build up in gate-based quantum-computing protocols and—from a broader perspective—were proposed as the main resource for measurement-based quantum-information processing1,2. The latter requires the ex-ante generation of a multi-qubit entangled state described by a graph3–6. Small graph states such as Bell or linear cluster states have been produced with photons7–16, but the proposed quantum-computing and quantum-networking applications require fusion of such states into larger and more powerful states in a programmable fashion17–21. Here we achieve this goal by using an optical resonator22containing two individually addressable atoms23,24. Ring25and tree26graph states with up to eight qubits, with the names reflecting the entanglement topology, are efficiently fused from the photonic states emitted by the individual atoms. The fusion process itself uses a cavity-assisted gate between the two atoms. Our technique is, in principle, scalable to even larger numbers of qubits and is the decisive step towards, for instance, a memory-less quantum repeater in a future quantum internet27–29.