Skip to content
Quantum.world

Research

Deterministic and Programmable Fusion for Scalable Generation of Photonic Graph States

Overview Research area: Experimental quantum photonics and superconducting circuit QED — specifically the generation of multiphoton entangled graph states using deterministic, programmable fusion of f

Deterministic and Programmable Fusion for Scalable Generation of Photonic Graph States
arXiv
2610.19927
Published
2026-10-14
Authors
Yan Li, Yunfan Yang, Zenghui Bao, Jize Yang, Luyan Sun, Yipu Song, Yukai Wu, Hongyi Zhang, Luming Duan

AI summary

Overview

Research area: Experimental quantum photonics and superconducting circuit QED — specifically the generation of multiphoton entangled graph states using deterministic, programmable fusion of flying microwave photons.

Technical level: Advanced. The paper assumes familiarity with graph states, stabilizer formalism, circuit QED, time-bin encoding, and quantum state tomography.

Scope (one sentence): The paper reports the first experimental demonstration of a deterministic, programmable fusion operation for flying microwave photonic qubits, using a superconducting single-photon emitter and a quantum-non-demolition parity detector to merge small cluster states into larger, reconfigurable graph states, including a genuinely multipartite entangled 11-vertex cluster state encoded in 13 photonic qubits.

What This Paper Is About

Large photonic graph states are a key resource for measurement-based quantum computing and quantum repeaters, but building them at scale is hard: linear-optics fusion is probabilistic (success probability capped at 50%) and atom-based sequential generation accumulates emitter errors as the state grows. The authors build a superconducting-circuit fusion module that links small, on-demand cluster states into larger graphs deterministically — the transmon measurement outcome changes only the encoding basis of the fused vertex, not the graph topology — and they show it can be reprogrammed in situ to create new topologies and reused repeatedly to reach larger entangled states.

Key Contributions

  1. First deterministic fusion of flying microwave photonic qubits. Two initially uncorrelated time-bin qubits are projected into Bell states via a quantum non-demolition (QND) parity measurement using a transmon qubit dispersively coupled to a microwave cavity, with no heralding required.

  2. Built-in programmability through frequency tuning. Because the emitter's photon frequency can be tuned in situ via a SQUID embedded in the resonator and the QND detector has finite bandwidth, the authors can select which photonic modes are fused — enabling selective, programmable fusion between arbitrary qubit pairs within a pulse train.

  3. Error localization via matter-qubit reset and reuse. Both the emitter transmon and the detector transmon are reset between successive operations, confining matter-qubit errors to small subgraph segments and circumventing the coherence limits that would otherwise cap the achievable graph size.

  4. Demonstration of topologies beyond single-emitter capability. A five-vertex ring graph is produced by fusing the ends of a six-qubit linear cluster, and a five-vertex caterpillar state is shown in Extended Data Fig. 1 — structures a single-photon emitter alone cannot generate.

Main Findings

  • Bell-state fusion fidelities: Fusing two initially uncorrelated time-bin qubits yields Bell-state fidelities of 89.94% (conditioned on the detector transmon in |g_c⟩) and 88.16% (conditioned on |e_c⟩). The fusion operation itself is estimated to introduce an infidelity of approximately 7.8% to 9%.

  • Fusion preserves existing graph bonds: Fusing qubit 1 of a cluster state with an isolated qubit 3 produces a three-qubit state with fidelities of 82.53% (|g_c⟩) and 84.72% (|e_c⟩) against the ideal states; projecting onto the encoding subspace gives reduced two-qubit cluster states with fidelities of 88.23% and 87.86%, confirming the redundant-encoding mechanism and the deterministic character of the operation.

  • Programmable ring graph: A six-qubit linear cluster was generated and its first and last qubits fused into a five-vertex ring. Reconstructed process maps give fidelities of 0.70 (|g_c⟩) and 0.67 (|e_c⟩), and stabilizer-based witnesses are 𝒲 = −0.107 ± 0.017 and −0.114 ± 0.012, both negative, certifying genuine multipartite entanglement.

  • Repetitive fusion to 13 photons: Three linear resource states with n₁ = n₃ = 4 and n₂ = 5 were merged by two successive fusions into an 11-vertex linear cluster encoded in 13 photonic qubits. Process-map fidelities for the four post-selected branches were 0.53, 0.51, 0.51, and 0.49.

  • Entanglement certified at the largest scale: Genuine multipartite entanglement was certified for the 13-photon state in the branch where the detector transmon was projected to the ground state twice, with 𝒲 = −0.059 ± 0.009 < 0. Other branches did not cross threshold, attributed primarily to the limited readout fidelity of |e_c⟩.

  • Theory predicts an optimal segment length: A model in the Supplementary Information balances fusion-induced error against accumulated emitter error, giving an optimum of about 5 qubits per segment for the present experimental parameters — matching the segment sizes actually used.

  • Error localization confirmed: No noticeable drop in stabilizer values was observed from the first to the last vertex of the fused graph, supporting the claim that resetting the emitter decouples matter-qubit errors from the growing photonic state.

  • Current rate limitation: The average single-photon rate incident on the QND detector is approximately 0.35, which the authors identify as the main obstacle to probing larger graph states within practical measurement times; they stress this is not intrinsic to the protocol.

Methodology in Plain English

The hardware is two superconducting transmon qubits, each inside a microwave resonator, connected in series by a circulator. The first transmon is the source: by shuffling population through its second excited state, it emits single microwave photons into the transmission line, and by doing this conditionally on its own state it emits chains of time-bin qubits — a photon in an early or late time slot encodes the qubit. The second transmon is the detector: a photon reflecting off its cavity imprints a conditional π phase on the transmon, so that after two photons have reflected, measuring the transmon collapses the photon pair into a Bell state. Which Bell state you get depends on the measurement outcome, but that only relabels the encoding basis, so the fusion succeeds every time. Photons whose frequency falls outside the detector bandwidth do not pick up the phase and are simply not fused, which is how fusion is made selective: the resonator frequency is tuned with a SQUID to choose which pulses participate. Emitted states are read out with a homodyne setup and reconstructed by maximum likelihood. For graphs larger than four qubits, full tomography is computationally prohibitive, so the authors instead do process tomography on the elementary operations (emission and fusion), simulate the full preparation with a matrix-product-operator representation, and cross-check with direct stabilizer measurements and a stabilizer-based entanglement witness.

Why This Matters

Fusion-based graph-state construction has been stuck between two bad options: linear-optics fusion, which is probabilistic and demands ancillas and repeat-until-success overhead, and long single-emitter chains, which lose fidelity as matter-qubit errors accumulate. This work removes both constraints at once — the fusion is deterministic by construction, and the reset-and-reuse strategy caps how far any single emitter error can propagate — while the QND character keeps the fused vertices live and reconfigurable rather than frozen by destructive measurement.

Real-world applications:

  • Measurement-based (cluster-state) quantum computing, where large, topologically tailored graph states are the computational substrate.
  • Memory-less quantum repeaters and distributed quantum networks, where graph states are consumed to establish long-range entanglement.
  • Quantum error correction, where in-situ tunable graph topology allows code-specific connectivity to be programmed on demand.
  • Hybrid quantum interconnects and transduction, since fusion preserves coherent coupling of photonic qubits to matter qubits, relevant to quantum memory and modular processors.
  • Quantum metrology, which the paper lists among the applications of multipartite graph states.

Industry relevance: The platform is superconducting microwave circuitry — transmon qubits, tunable SQUID resonators, circulators — the same fabrication and control stack used in superconducting quantum computing hardware. The authors argue the protocol transfers directly to optical platforms such as single-atom cavity QED combined with frequency-tunable single-photon sources, so the approach is not locked to one modality.

Future Directions

  • Cascading multiple QND detectors. A single detector restricts each round of fusion to non-crossing qubit pairs, which the authors describe as a topological constraint on graph expressivity; additional detectors would relax it and simultaneously enable repeated parity measurements for error mitigation.
  • Exploiting the QND property for dynamic rewiring. Because fusion is non-destructive, graph states could be reconfigured on demand for specific algorithms or custom error-correction protocols, and photonic qubits could remain coherently linked to matter qubits for memory and transduction.
  • Raising the single-photon rate. The measured incident rate of approximately 0.35 caps the observable graph size; the paper points to improved emission efficiency, reduced optical loss, optimized pulse shaping, and architectural refinement as routes forward, without claiming a specific target.
  • Improving certification at scale. Limited |e_c⟩ readout fidelity prevented entanglement certification in three of the four two-fusion branches; better witnesses or full quantum state tomography are proposed to certify larger states.

Target Audience

Quantum information experimentalists working on photonic or superconducting platforms; theorists interested in fusion-based graph-state synthesis and fault-tolerant measurement-based computing; and graduate students or advanced researchers who already know the stabilizer formalism and circuit QED and want a concrete architectural blueprint for scaling photonic entanglement. Readers without that background will find the conceptual thrust accessible but the fidelity analysis and witness construction demanding.

Authors’ abstract

Entanglement in multiphoton graph states is an important resource with various applications, such as measurement-based quantum computing and memory-less quantum repeaters. While some primitive instances have been successfully prepared, scalable generation of large-scale graph states with programmable connections remains an outstanding challenge. Fusion provides a promising "divide-and-conquer" approach by linking smaller resource states into larger, more complex graphs. However, its practical scalability has been limited by the probabilistic nature of conventional fusion protocols, which necessitates extensive hardware overhead and feed-forward resources to achieve deterministic outcomes. Here, we introduce and experimentally demonstrate a deterministic fusion operation with built-in error mitigation, capable of connecting small time-bin-encoded cluster states--originally generated on-demand from a quantum emitter--into larger, reconfigurable photonic graph states of increased sizes. The fusion operation is realized by nondestructively projecting pairs of flying microwave photonic qubits into Bell states using superconducting circuits with in-situ programmability. Crucially, the protocol features active reset and reuse of matter qubits during graph state generation, thereby circumventing the coherence constraints of the quantum emitter and enabling the generation of genuine multipartite entanglement across 13 photonic qubits. Our results establish a scalable framework for photonic graph-state synthesis, paving the way for fault-tolerant measurement-based quantum computation and distributed quantum networks.

Read the original paper