---
title: TeleGate Operation in Fault-Tolerant Teleportation
url: https://www.emergentmind.com/topics/telegate-operation
type: topic
---

# TeleGate Operation in Fault-Tolerant Teleportation

TeleGate operation, in the sense developed for fault-tolerant multi-gate teleportation, is a **1-ebit multi-gate teleportation primitive** that replaces a sequence of \(n\) remote same-control gates by a single non-local crossing plus a local fan-out circuit. In the formulation of "Design rules for fault-tolerant multi-gate teleportation" [2607.01342], it packages \(n\) remote gates “behind” one network use, reducing entanglement cost from \(n\) ebits to \(1\) ebit while introducing a distinctive correlated failure mode: a single network fault can generate a weight-\(n\) Pauli error aligned with a logical operator.

## 1. Operational structure

TeleGate operation targets a run of remote gates sharing the same control qubit. Instead of teleporting each remote CNOT separately, one first performs a single non-local CNOT from the source control qubit \(q\) to a designated bridge or first target qubit \(t_1\), and then locally fans that action out from \(t_1\) to the remaining targets \(t_2,\dots,t_n\) using only local CNOTs. The paper describes the resulting object as a same-control MGT packet: “a single non-local CNOT\((q \to t_1)\), preceded and followed by local fan-out CNOTs for \(i=2,\ldots,n\)” [2607.01342].

In the EJPP implementation used for the quantitative claims, the non-local CNOT consumes **one ebit** and **two rounds of classical communication**. The full packet of \(n\) remote gates is therefore implemented using one entangled pair, independent of \(n\). This differs from sequential gate teleportation, where each of the \(n\) remote CNOTs is teleported independently, consuming \(n\) separate ebits and incurring \(n\) independent network uses. The explicit tradeoff is central: TeleGate saves \(n-1\) ebits, but it introduces \(n-1\) extra local fan-out CNOTs and a qualitatively different error model [2607.01342].

The paper emphasizes that this behavior is not EJPP-specific. The correlated fault mechanism is “forced by the 1-ebit fan-out bottleneck,” so any scheme that compresses \(n\) remote gates into one non-local crossing inherits the same structural behavior. A plausible implication is that TeleGate is best understood not as a protocol detail of one remote-gate construction, but as a packetisation pattern for distributed controlled operations.

## 2. Correlated error propagation

The defining hazard of TeleGate operation is Pauli propagation through the fan-out circuit. For the same-control packet, the dangerous event is an \(X\)-type fault entering at the network crossing or on the bridge qubit before fan-out. Through the non-local CNOT\((q \to t_1)\), the paper states
\[
X_q \to X_q X_{t_1},
\]
and each subsequent local fan-out CNOT\((t_1 \to t_k)\) copies \(X_{t_1}\) onto \(t_k\). A single \(X\) fault before the crossing therefore becomes
\[
X_q X_{t_1}\cdots X_{t_n},
\]
which, restricted to the target register, is a contiguous weight-\(n\) \(X\) string [2607.01342].

The same target-only weight-\(n\) string also arises from an \(X\) fault on \(t_1\) between the non-local step and the fan-out. By contrast, faults on downstream targets \(t_k\) with \(k>1\) remain localized. TeleGate therefore does not transform one network failure into \(n\) independent single-qubit errors; it produces an all-or-nothing correlated event.

Under depolarizing network noise, both \(X_q\) and \(Y_q=iX_qZ_q\) are dangerous because the \(X\) component of \(Y\) propagates in the same way. The effective rate for producing the weight-\(n\) target \(X\)-string is
\[
\frac{2p_{\mathrm{net}}}{3},
\]
rather than \(p_{\mathrm{net}}/3\). \(Z\)-type faults are asymmetric and much less dangerous in this same-control configuration: a \(Z\) on \(q\) stays localized, while a \(Z\) on a downstream target propagates only to a localized weight-2 error \(Z_{t_1}Z_{t_k}\). No \(Z\) fault produces a weight-\(n\) string in the same-control case. The dual same-target configuration swaps the roles, so the dangerous correlated object becomes a weight-\(n\) \(Z\) string on the controls [2607.01342].

In the worst-case placement, all \(n\) targets lie contiguously along a minimum-weight logical operator of the code. The packet fault is then exactly the kind of structured correlated error that can mimic “a logical error chain on the logical \(\bar X\) operator.”

## 3. Correctability bounds and decoder behavior

For rotated surface codes of odd distance \(d\), the paper derives two packet-size bounds. The decoder-independent correctability condition is the standard one:
\[
\left\lfloor \frac{d-1}{2}\right\rfloor = \left\lfloor \frac d2 \right\rfloor.
\]
Hence any packet with
\[
n \le \left\lfloor \frac d2 \right\rfloor
\]
is safe regardless of decoder details or geometry. The algebraic argument is that if two packet errors \(E_a,E_b\) both have weight \(n\le \lfloor d/2\rfloor\), then \(E_a^\dagger E_b\) has weight at most \(d-1<d\), so it cannot be a nontrivial logical operator [2607.01342].

The sharper design rule depends on whether the decoder represents the packet fault as one correlated event or as \(n\) independent elementary edges:
\[
n_{\max}^{\text{naive}}(d)=\left\lfloor \frac d2 \right\rfloor,\qquad
n_{\max}^{\text{corr}}(d)=\left\lceil \frac d2 \right\rceil.
\]
With a naive decoder built from a base detector error model (DEM), the packet fault is misinterpreted as independent local edges. At
\[
n=\left\lceil \frac d2 \right\rceil,
\]
a contiguous packet error \(E\) on a minimum-weight logical string has the same syndrome as its lower-weight complement \(E'\), and minimum-weight decoding chooses the complement, leaving the logical operator as residual error. This yields the naive bound [2607.01342].

A correlation-aware decoder changes the matching weights. In the packet DEM, the packet fault appears as a single `CORRELATED_ERROR` edge with matching weight
\[
-\ln p
\]
rather than \(n\) separate edges of total weight \(n(-\ln p)\). At \(n=\lceil d/2\rceil\), the complement path has weight \(\lfloor d/2\rfloor(-\ln p)\). The paper argues that whenever \(\gamma\ge 1\), the single packet edge is cheaper, so MWPM selects the true correlated packet event rather than its complement. This is the sole reason the correlation-aware rule extends by one qubit. For
\[
n>\left\lceil \frac d2 \right\rceil,
\]
both decoders fail in the worst case, because the error weight itself exceeds what can be disambiguated by the code [2607.01342].

A recurrent misconception is that correlation awareness requires a bespoke decoding algorithm. The paper rejects that reading explicitly: standard MWPM in PyMatching is already sufficient if it is built from the **packet circuit’s own detector error model**. The correlation is carried by the circuit-level DEM; no custom decoder is required.

## 4. Performance regimes and resource tradeoffs

The simulations use a simplified circuit-level depolarizing model with gate noise only,
\[
p_{\mathrm{gate}}=10^{-3},
\]
and define the network-to-local noise ratio as
\[
\gamma=\frac{p_{\mathrm{net}}}{p_{\mathrm{gate}}}.
\]
The comparison baseline is physically honest sequential teleportation with \(n\) independent network faults, each at the same per-link rate. The principal conclusion is regime-dependent: packetisation is most useful when the network is the bottleneck, i.e. \(\gamma\gg 1\) [2607.01342].

With a naive DEM/decoder, packet logical error rate worsens significantly as \(\gamma\) increases, because the decoder misreads the correlated packet fault. With the packet DEM, standard MWPM becomes correlation-aware through the model and packet LER drops to the gate-noise floor, becoming almost \(\gamma\)-independent over the tested range. Relative to sequential teleportation, packetisation is slightly worse around \(\gamma\approx 1\), because the \(n-1\) extra local fan-out CNOTs add gate noise while the one-network-use advantage is not yet decisive. At moderate-to-high \(\gamma\), packetisation becomes favorable, and the advantage grows with both \(\gamma\) and \(d\) [2607.01342].

The reported numerical examples are consistent with that pattern. At \(d=5,n=2\), packet/sequential is slightly worse at \(\gamma=1\) and \(10\) with ratios \(1.03\) and \(1.06\), but better by \(\gamma=30\) and clearly better by \(\gamma=100\) with ratio \(0.41\). At \(d=7,n=3\), the packet is very slightly worse at \(\gamma=1\) with ratio \(1.13\), approximately equal by \(\gamma=10\), and clearly better for \(\gamma=30,100\) with ratios \(0.65,0.17\). At \(d=9,n=4\), packetisation already wins at \(\gamma=1\) with ratio \(0.22\). The paper summarizes the trend as packetisation “matches or surpasses the per-link sequential baseline at moderate-to-high \(\gamma\), with the advantage growing with both \(\gamma\) and \(d\)” [2607.01342].

The operational point is narrow but important: entanglement savings alone do not make TeleGate uniformly preferable. When local and network noise are comparable, the extra local fan-out can offset the one-ebit advantage.

## 5. Design rules for compilers and architecture

The compiler-facing guidance is explicit. When entanglement generation is expensive or noisy, TeleGate should be preferred, but only within a packet size that preserves fault tolerance:
\[
n \le n_{\max}^{\mathrm{corr}}(d)=\left\lceil \frac d2 \right\rceil
\]
provided the decoder is built from the packet circuit DEM. If one cannot model the correlation correctly, the stricter rule is
\[
n \le n_{\max}^{\mathrm{naive}}(d)=\left\lfloor \frac d2 \right\rfloor.
\]
At \(\gamma\approx 1\), packetisation may not help; at \(\gamma\gtrsim 10\), and especially for larger \(d\), it is typically advantageous. The paper further notes that recent distributed architectures often lie in \(\gamma\in[50,100]\), “squarely in the regime where packetisation outperforms sequential teleportation” [2607.01342].

Practically, TeleGate operation means identifying a run of same-control remote controlled-Clifford gates between modules, performing one non-local gate using one shared Bell pair, and then applying local fan-out CNOTs to distribute the effect to all \(n\) targets. Teleportation byproducts are tracked in the usual Pauli frame, while the packet-specific risk remains the correlated weight-\(n\) fault. This suggests a concrete compiler heuristic: package aggressively only when the packet size remains within the code-distance bound and the DEM supplied to decoding preserves the packet correlation.

If a larger packet is required, the paper proposes a hybrid \(k\)-ary fan-out tree using \(k\) ebits, which reduces the worst-case correlated error weight from \(n\) to approximately \(n/k\), with
\[
k_{\min}=\left\lceil \frac{n}{\lceil d/2\rceil} \right\rceil.
\]
This interpolates between fully packetised 1-ebit TeleGate \((k=1)\) and fully sequential teleportation \((k=n)\) [2607.01342].

## 6. Position within the gate-teleportation literature

In related distributed-quantum-computing literature, *telegate* often denotes a remote two-qubit gate executed by consuming shared entanglement and using only local operations, measurements, and classical feedforward. One line of work uses one Bell pair to implement a remote CNOT between modules or separated qubits [2510.08894]; a trapped-ion realization demonstrated a deterministic teleported CNOT between spatially separated ions using one shared entangled pair, local mixed-species gates, measurements, and real-time conditional operations [1902.02891]. More general network simulations have extended gate teleportation to arbitrary two-qubit Clifford gates and the Toffoli gate in multi-node settings, again using Bell pairs, Bell measurements, and conditional corrections [2406.13405].

Other work has treated telegate as a systems primitive rather than only a circuit identity. Asynchronous telegate reorganizes measurement and classical communication so that some remote-gate latency is hidden behind local unitary work, while preserving the same Bell-pair and classical-bit requirements [2407.14987]. Routing-oriented work uses teleported gates as virtual long-range edges on limited-connectivity hardware, selectively replacing SWAP-heavy realizations of CNOT or controlled-\(U\) gates to reduce temporal depth [2502.04138].

Against that background, the distinctive feature of TeleGate operation in fault-tolerant multi-gate teleportation is not merely that it teleports a remote gate. It packages **multiple** same-control remote gates into a single non-local crossing plus a local fan-out tree, reducing entanglement cost from \(n\) ebits to \(1\) ebit while introducing a specific correlated weight-\(n\) failure mode and code-distance-dependent packet-size rules [2607.01342]. This places TeleGate at the intersection of remote-gate execution, decoder modeling, and distributed circuit compilation rather than at the level of a single remote CNOT primitive alone.

Source: https://www.emergentmind.com/topics/telegate-operation