Piecemaker Protocol in Quantum Networks

• Piecemaker protocol is a multipartite entanglement scheme that fuses Bell pairs as soon as they arrive, reducing memory storage and decoherence.
• It employs early measurement scheduling and fusion operations to build GHZ and graph states, outperforming traditional Factory protocols.
• Analytical treatments under dephasing noise yield closed-form fidelity expressions, demonstrating improved scalability and noise tolerance.

Searching arXiv for the cited papers and closely related work. First, locating the main Piecemaker papers on arXiv. The Piecemaker protocol is a family of multipartite entanglement-distribution schemes for a star-topology quantum network with a central switch or processing node and multiple remote end users. In contrast to baseline schemes that wait until all elementary Bell pairs have been established before performing the final multipartite-state distribution step, Piecemaker processes newly arrived links as soon as possible and stores only a minimal subset of Bell pairs at any time. In the GHZ setting analyzed exactly in later work, this reduces the dominant memory-decoherence contribution from many stored central-node qubits to a single long-lived “seed” qubit, yielding analytically tractable noise expressions and substantially improved fidelity scaling with the number of users (Prielinger et al., 20 Aug 2025, Goodenough et al., 5 Jun 2026).

1. Origin and problem setting

Piecemaker was introduced as a resource-efficient entanglement-distribution protocol for a quantum network with a central switch and multiple remote end nodes (Prielinger et al., 20 Aug 2025). The motivating setting is a star network in which each end user first attempts to generate a Bell pair with the switch. The target is then to distribute a multipartite stabilizer state, including GHZ states and more general graph states, among the end users.

The baseline comparison class is the Factory protocol. In that approach, Bell-pair generation is attempted for all users in parallel, but the switch waits until all links have succeeded before locally preparing or projecting the target multipartite state and teleporting or measuring it onto the remote qubits. The principal drawback is that early Bell pairs must remain in memory while the protocol waits for the last successful link. Because link generation is stochastic, this induces random storage times and hence cumulative memory noise (Prielinger et al., 20 Aug 2025, Goodenough et al., 5 Jun 2026).

Piecemaker was formulated to minimize the average time Bell pairs spend in memory at the switch, store only a minimal subset of Bell pairs at any time, and keep fidelity high by reducing cumulative memory decoherence (Prielinger et al., 20 Aug 2025). In the later analytical treatment of GHZ distribution in homogeneous star networks, the same core design principle is cast as a scheduling distinction: the key difference between Factory and Piecemaker is when central-node measurements are performed (Goodenough et al., 5 Jun 2026).

A plausible implication is that Piecemaker is best understood not as a single circuit, but as a protocol family whose defining feature is early measurement or fusion conditioned on partial link availability, with the exact realization depending on the target stabilizer state (Prielinger et al., 20 Aug 2025).

2. Network model and operational assumptions

In the exact analytical treatment, Piecemaker is studied in a homogeneous star network with one central node and $n$ end users, each connected to the center by an independent elementary link (Goodenough et al., 5 Jun 2026). The target state is the $n$-party GHZ state,

$$\ket{\mathrm{GHZ}_n} = \frac{\ket{0}^{\otimes n} + \ket{1}^{\otimes n}}{\sqrt{2}}.$$

Each end user can generate a Bell pair with the central node via a heralded probabilistic process. In each discrete round, link generation succeeds with probability $p$ and fails with probability $q=1-p$. The link-success rounds

$\overline{t} = (t_1,t_2,\ldots,t_n)$

are independent geometric random variables (Goodenough et al., 5 Jun 2026).

The broader Piecemaker formulation in the original protocol paper also assumes a star topology with one central switch and $n$ end nodes, one memory qubit per end node, and $n$ switch memories $\{m_1,\dots,m_n\}$, with an additional conceptual “Piecemaker” qubit used in the GHZ presentation (Prielinger et al., 20 Aug 2025). Time is discretized in rounds of duration $\Delta t$, and each entanglement-generation attempt fits in one round, including heralding.

The analytical assumptions differ across the two papers. The original protocol work models depolarizing noise on each memory qubit at both the switch and end nodes, while assuming noiseless and instantaneous local gates and measurements (Prielinger et al., 20 Aug 2025). The exact GHZ analysis specializes instead to memory decoherence only on the central node, with end users assumed to measure immediately after link success; no gate or measurement noise is included in the main treatment (Goodenough et al., 5 Jun 2026). For Piecemaker itself, only dephasing is treated analytically in that later paper.

This suggests that two levels of description coexist in the literature: a general protocol-level formulation evaluated numerically under depolarizing memory noise (Prielinger et al., 20 Aug 2025), and a narrower but exact analytic treatment for GHZ under central-memory dephasing (Goodenough et al., 5 Jun 2026).

3. GHZ Piecemaker protocol

Piecemaker is first introduced for GHZ-state distribution (Prielinger et al., 20 Aug 2025). In the gate-based presentation, a central primitive is gate-based fusion: if one qubit is already part of a GHZ state and another two qubits form a Bell pair, then a $n$0, a $n$1-basis measurement, and a conditional $n$2 correction effectively add the remote Bell-pair qubit to the GHZ state (Prielinger et al., 20 Aug 2025).

For the GHZ case, the protocol proceeds incrementally. All end nodes attempt Bell-pair generation in parallel. When the first link succeeds, the switch initializes the conceptual Piecemaker qubit in $n$3. The new link is fused into the current GHZ using the fusion operation on the Piecemaker qubit, the switch-half of the arriving Bell pair, and the remote qubit. After fusion, the switch-half is measured and freed immediately. Each subsequent arriving Bell pair is processed in the same way. Once all $n$4 links have been fused, the switch measures the Piecemaker qubit in the $n$5-basis and sends one classical correction bit to one end node, completing the GHZ distribution (Prielinger et al., 20 Aug 2025).

The exact-noise paper reformulates the same GHZ logic in terms of arrival times $n$6 and $n$7. The first successful Bell pair supplies a persistent central memory qubit—the “seed”—which remains stored until the end. Every subsequent Bell pair is fused immediately into the growing GHZ-like structure using a type-1 fusion measurement on central qubits, after which the newly arrived central qubit no longer needs to be stored. When the last link arrives, the final measurement is performed on the seed qubit, and local Pauli corrections recover a standard GHZ state at the end users (Goodenough et al., 5 Jun 2026).

A central operational property follows directly: in the GHZ Piecemaker protocol as analyzed exactly, only one central qubit is stored over a nontrivial time interval, namely the qubit associated with the earliest successful link (Goodenough et al., 5 Jun 2026). The original protocol paper notes that the conceptual Piecemaker qubit is not strictly necessary; after the first fusion, the first linked qubit itself can carry the GHZ and be used for subsequent fusions (Prielinger et al., 20 Aug 2025).

The essential contrast with Factory is therefore not merely circuit decomposition, but memory scheduling. Factory stores everything until the end; Piecemaker measures or fuses as soon as possible and stores only one qubit for long times in the GHZ case (Goodenough et al., 5 Jun 2026).

4. Graph-state generalization and graph-theoretic foundation

Beyond GHZ, Piecemaker is generalized to arbitrary stabilizer states through their graph-state representation (Prielinger et al., 20 Aug 2025). If $n$8 is a simple undirected graph, the corresponding graph state is

$n$9

with stabilizer generators

$$\ket{\mathrm{GHZ}_n} = \frac{\ket{0}^{\otimes n} + \ket{1}^{\otimes n}}{\sqrt{2}}.$$0

Because any stabilizer state is locally Clifford equivalent to some graph state, it suffices to design protocols for graph states and then use local Clifford corrections at the end nodes to recover the desired stabilizer state (Prielinger et al., 20 Aug 2025).

The protocol’s remote-state-preparation viewpoint is based on the Bell-pair tensor product

$$\ket{\mathrm{GHZ}_n} = \frac{\ket{0}^{\otimes n} + \ket{1}^{\otimes n}}{\sqrt{2}}.$$1

together with the transpose trick,

$$\ket{\mathrm{GHZ}_n} = \frac{\ket{0}^{\otimes n} + \ket{1}^{\otimes n}}{\sqrt{2}}.$$2

This means that measuring appropriate stabilizers on the switch halves of Bell pairs effectively projects the end-node qubits into the desired graph state, up to Pauli corrections (Prielinger et al., 20 Aug 2025).

The nontrivial design problem is ordering stabilizer measurements so that qubits can be measured out and freed as soon as possible without losing the ability to measure the remaining stabilizers. This is expressed using vertex covers. If the currently available links at the switch form a vertex cover $$\ket{\mathrm{GHZ}_n} = \frac{\ket{0}^{\otimes n} + \ket{1}^{\otimes n}}{\sqrt{2}}.$$3 of the target graph, then its complement $$\ket{\mathrm{GHZ}_n} = \frac{\ket{0}^{\otimes n} + \ket{1}^{\otimes n}}{\sqrt{2}}.$$4 is an independent set, and stabilizers for qubits in $$\ket{\mathrm{GHZ}_n} = \frac{\ket{0}^{\otimes n} + \ket{1}^{\otimes n}}{\sqrt{2}}.$$5 can be measured as those qubits arrive, freeing memory early (Prielinger et al., 20 Aug 2025).

To widen applicability, Piecemaker uses local complementation and hence local covers. A subset $$\ket{\mathrm{GHZ}_n} = \frac{\ket{0}^{\otimes n} + \ket{1}^{\otimes n}}{\sqrt{2}}.$$6 is a local cover of $$\ket{\mathrm{GHZ}_n} = \frac{\ket{0}^{\otimes n} + \ket{1}^{\otimes n}}{\sqrt{2}}.$$7 if it is a vertex cover of some graph $$\ket{\mathrm{GHZ}_n} = \frac{\ket{0}^{\otimes n} + \ket{1}^{\otimes n}}{\sqrt{2}}.$$8 that is LC equivalent to $$\ket{\mathrm{GHZ}_n} = \frac{\ket{0}^{\otimes n} + \ket{1}^{\otimes n}}{\sqrt{2}}.$$9; a minimal such set is a minimal local cover (MLC), and the set of all MLCs is denoted $p$0 (Prielinger et al., 20 Aug 2025). During execution, as the set $p$1 of successful links grows, the switch checks whether $p$2 contains some $p$3. If so, the protocol fixes an LC-equivalent graph $p$4 for which $p$5 is a vertex cover, measures stabilizers $p$6 for vertices in $p$7 as they arrive, and later completes the remaining measurements for vertices in $p$8. End nodes then apply local Clifford operations to transform $p$9 into the target $q=1-p$0 (Prielinger et al., 20 Aug 2025).

A related intermediate construction is the MVC protocol, which uses minimal vertex covers of the fixed target graph without exploiting LC equivalence. It illustrates the same mechanism: once the current successful-link set contains a vertex cover, qubits outside that cover can be processed and freed early (Prielinger et al., 20 Aug 2025).

5. Noise model and exact characterization for GHZ under dephasing

The exact analysis of Piecemaker focuses on GHZ distribution under central-memory dephasing (Goodenough et al., 5 Jun 2026). A single dephasing step on a stored qubit is modeled as

$q=1-p$1

with $q=1-p$2. If a qubit is stored for $q=1-p$3 rounds, the effective parameter becomes $q=1-p$4 (Goodenough et al., 5 Jun 2026).

In the GHZ setting, dephasing preserves the state within the two-dimensional GHZ basis sector: $q=1-p$5 After $q=1-p$6 dephasing applications, the state becomes

$q=1-p$7

so the effective noise enters only through the scalar

$q=1-p$8

where $q=1-p$9 is the total number of dephasing steps (Goodenough et al., 5 Jun 2026). The fidelity with the ideal GHZ$\overline{t} = (t_1,t_2,\ldots,t_n)$0 is then

$\overline{t} = (t_1,t_2,\ldots,t_n)$1

For Piecemaker, the full decoherence reduces to the storage time of the single seed qubit. If $\overline{t} = (t_1,t_2,\ldots,t_n)$2 and $\overline{t} = (t_1,t_2,\ldots,t_n)$3 denote the first and last successful link rounds, then

$\overline{t} = (t_1,t_2,\ldots,t_n)$4

Thus, the noise problem becomes the statistics of the minimum and maximum of $\overline{t} = (t_1,t_2,\ldots,t_n)$5 independent geometric random variables (Goodenough et al., 5 Jun 2026).

The expected effective noise parameter is written as

$\overline{t} = (t_1,t_2,\ldots,t_n)$6

and the paper derives the closed form

$\overline{t} = (t_1,t_2,\ldots,t_n)$7

for i.i.d. geometric arrival times with success probability $\overline{t} = (t_1,t_2,\ldots,t_n)$8 and $\overline{t} = (t_1,t_2,\ldots,t_n)$9 (Goodenough et al., 5 Jun 2026). The corresponding average fidelity is

$n$0

The same work shows how to recover the full distribution of the storage-time variable $n$1, and hence of $n$2, by treating $n$3 as a probability generating function: $n$4 This distribution-level view is used to compare Factory and Piecemaker fidelity distributions and to support later rate calculations (Goodenough et al., 5 Jun 2026).

6. Comparison with Factory and quantitative performance

The structural contrast between Factory and Piecemaker has a direct noise-theoretic expression. In Factory, each central qubit generated at time $n$5 must wait until the last success $n$6, so its storage time is $n$7. The total dephasing exponent is

$n$8

In Piecemaker, by contrast,

$n$9

The absence of an extra multiplicative factor of $n$0 in the exponent is the central scaling distinction (Goodenough et al., 5 Jun 2026).

The exact GHZ analysis reports that Piecemaker already outperforms Factory for $n$1, with the gap widening as $n$2 increases (Goodenough et al., 5 Jun 2026). For fixed $n$3 and a target fidelity approximately $n$4, Piecemaker can support $n$5 end users, whereas Factory can support only $n$6 (Goodenough et al., 5 Jun 2026). The same paper states that the relative advantage grows with $n$7.

The original protocol paper evaluates broader graph-state families numerically under depolarizing memory noise and reports that Piecemaker never performs worse than Factory in fidelity across the tested graphs and parameters (Prielinger et al., 20 Aug 2025). For GHZ or complete-graph families up to $n$8, the maximal observed fidelity improvement is $n$9 for $\{m_1,\dots,m_n\}$0, and the maximal relative reduction in infidelity is $\{m_1,\dots,m_n\}$1, corresponding to up to 45% reduction in the probability of being in the wrong state (Prielinger et al., 20 Aug 2025). In moderate parameter regimes, average fidelity improvements remain sizable, with $\{m_1,\dots,m_n\}$2 up to approximately $\{m_1,\dots,m_n\}$3 for some sizes (Prielinger et al., 20 Aug 2025).

For GHZ states, fidelity $\{m_1,\dots,m_n\}$4 is used as a benchmark because it guarantees genuine multipartite entanglement. Simulations show that Piecemaker reaches $\{m_1,\dots,m_n\}$5 in a larger region of the $\{m_1,\dots,m_n\}$6 parameter space than Factory for all system sizes studied (Prielinger et al., 20 Aug 2025). The original study also reports that, for some network sizes and around $\{m_1,\dots,m_n\}$7, the minimal required $\{m_1,\dots,m_n\}$8 to reach $\{m_1,\dots,m_n\}$9 can drop from approximately $\Delta t$0 for Factory to approximately $\Delta t$1 for Piecemaker (Prielinger et al., 20 Aug 2025).

For other graph families, the gains are more moderate and track the size of minimal local covers. Path and grid graphs improve over Factory but less dramatically than GHZ or complete-graph cases; for $\Delta t$2, maximal improvement reaches $\Delta t$3 up to approximately $\Delta t$4 and $\Delta t$5 up to approximately 19% (Prielinger et al., 20 Aug 2025). For 2D cube and 8-cycle graphs with minimal local covers of size $\Delta t$6, Piecemaker achieves $\Delta t$7, while for a 6-wheel graph with larger minimal local covers, improvements remain below $\Delta t$8 (Prielinger et al., 20 Aug 2025).

7. Cut-offs, scope, and limitations

A global cut-off $\Delta t$9 is introduced in the exact star-network analysis to bound decoherence (Goodenough et al., 5 Jun 2026). Link generation is allowed to continue only up to $n$00 rounds; if not all links have succeeded by that point, all previously created entanglement is discarded and the protocol restarts. This lowers rate but bounds storage time and can improve fidelity. For Piecemaker as well as Factory, the paper derives closed-form expressions for $n$01 under a cut-off, enabling fast deterministic optimization of $n$02 without Monte Carlo simulation (Goodenough et al., 5 Jun 2026).

The expected number of rounds until a successful GHZ distribution under a global cut-off is

$n$03

and, together with the analytic $n$04, this supports optimization of conference-key agreement rates as functions of $n$05, $n$06, $n$07, and $n$08 (Goodenough et al., 5 Jun 2026). The paper reports that an optimal $n$09 exists, that analytic optimization is much faster than simulation, and that Piecemaker generally achieves higher optimal rates and tolerates larger $n$10 (Goodenough et al., 5 Jun 2026).

The exact analytic scope of Piecemaker is deliberately limited. In the later paper, the protocol is treated analytically only for GHZ states under single-qubit dephasing on central-node memories (Goodenough et al., 5 Jun 2026). The authors explicitly note that extending the same treatment to depolarizing noise is not straightforward, because dephasing on GHZ states has a simple multiplicative behavior under fusion, whereas depolarizing noise does not commute with fusion in a way that leaves a simple scalar parameter on the GHZ sector (Goodenough et al., 5 Jun 2026). For more general stabilizer targets, Piecemaker may require two-qubit gates mid-distribution on intermediate GHZ-like states, which further complicates closed-form analysis even under dephasing (Goodenough et al., 5 Jun 2026).

The original protocol paper likewise notes several practical limitations: only depolarizing memory noise is considered; gate and measurement noise are ignored; the topology is restricted to a star network with a central switch; end nodes are assumed to have only one qubit and limited local capabilities; classical communication is assumed instantaneous and error-free; and precomputing the full set of minimal local covers can be combinatorially hard (Prielinger et al., 20 Aug 2025). The authors therefore identify more realistic hardware noise, rate analysis, more complex topologies, approximate algorithms for MLCs, and dynamic resource use as open directions (Prielinger et al., 20 Aug 2025).

Taken together, the literature presents Piecemaker as a graph-theoretically grounded, measurement-scheduling approach to multipartite entanglement distribution in noisy star networks. Its defining principle is to avoid letting Bell pairs remain in memory longer than necessary. In GHZ star networks, that principle becomes exact and exceptionally transparent: all but one central-node qubit can be measured out immediately, leaving a single stochastic waiting interval $n$11 as the sole long-lived decoherence mechanism (Goodenough et al., 5 Jun 2026).