Design rules for fault-tolerant multi-gate teleportation

• URL: http://arxiv.org/abs/2607.01342v1
• Date: Wed, 01 Jul 2026 18:00:55 GMT
• Title: Design rules for fault-tolerant multi-gate teleportation
• Abstract summary: Multi-gate teleportation (MGT) packages $n$ remote gates into a single ebit via a 1-ebit fan-out quantum circuit.<n>We derive a design rule for fault-tolerant packet sizes, $nmaxtextcorr(d) = lceil d/2 rceil$ for rotated surface codes of distance.<n>We show that the standard MWPM decoder built from the packet circuit's noise model naturally corrects the correlated error.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multi-gate teleportation (MGT) packages $n$ remote gates into a single ebit via a 1-ebit fan-out quantum circuit, saving $n{-}1$ entangled pairs relative to sequential gate teleportation. The cost is a correlated failure mode: a single network fault propagates through the fan-out tree, injecting a weight-$n$ Pauli error. We derive a design rule for fault-tolerant packet sizes, $\nmax^{\text{corr}}(d) = \lceil d/2 \rceil$ for rotated surface codes of distance~$d$ with a correlation-aware decoder ($\nmax^{\text{naive}} = \lfloor d/2 \rfloor$ without), bounding how many gates can be packaged whilst preserving fault tolerance. Simulation with PyMatching shows that the standard MWPM decoder built from the packet circuit's noise model naturally corrects the correlated error: at network-to-local noise ratios $γ= \pnet/\pgate$ up to $100$, the packet matches or surpasses the per-link sequential LER at moderate-to-high $γ$, with the advantage growing with both $γ$ and $d$, whilst reducing the entanglement cost from $n$ ebits to~$1$. Packetisation wins when the network is the bottleneck ($γ\gg 1$); at $γ\approx 1$ the $n{-}1$ extra local fan-out gates offset the network savings. No custom decoder is required: the circuit-level noise model already encodes the correlation. These results enable noise-aware distributed circuit compilers to favour fan-out packetisation without sacrificing fault tolerance.

Related papers

• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Fault-tolerant quantum computing with a microwave Cat Bus [11.420387564717707]
  Rydberg atoms are resonantly entangled through a microwave Cat Bus''<n>Cat Bus supports parallelized execution of one-to-many $mathrmCZn$ gates with exponentially suppressed crosstalk.<n>For fault-tolerant operation, we develop a hardware-aware scheduling scheme that exploits the native cat--atom $mathrmCZn$ gate.
  arXiv  Detail & Related papers  (2026-08-02T09:16:10Z)
• Variance-Reduced Trajectory Unravelings for GPU Noisy Quantum-Circuit Simulation: Characterization and a Qiskit-Aer Integration Gap [0.0]
  We show that emphvariance-reduced unravelings -- projector and analog sampling -- sharply cut variance.<n>On a single consumer GPU, projector unraveling reaches a target standard error with $20.8times$ fewer trajectories than Qiskit-Aer's ttbatched_shots_gpu at $n=10$.<n>Because Aer's Born-rule collapse machinery already exists, we specify a minimal change that would unlock the technique in production.
  arXiv  Detail & Related papers  (2026-07-20T08:28:31Z)
• Efficient Fuzzy Private Set Intersection from Secret-shared OPRF [41.88845480337768]
  Fuzzy PSI (FPSI) is a PSI variant where the receiver learns the items $q in Q$ for which there exists some $w in W$ under a given distance metric.<n>We propose efficient FPSI protocols for $L_p in [1, infty]$ distance metrics.<n>Our protocols achieve linear communication and computation complexity in the set sizes $m,n$, the dimension $d$, and the distance threshold $$.
  arXiv  Detail & Related papers  (2026-04-16T11:51:25Z)
• Flagging the Clifford hierarchy:~Fault-tolerant logical $\fracπ{2^l}$ rotations via measuring circuit gauge operators of non-Cliffords [0.0]
  We provide a sequence of flag circuits which will detect logical errors induced by non-fault-tolerant $R_overlineZ(frac2l)$ gates on CSS codes with a fault distance of two.<n>As applications, we give a family of circuits with $O(l)$ gates and ancillae which implement fault-tolerant logical $R_Z(frac2l)$ gates on any $[[k + 2, k, 2]]$ iceberg code and fault-tolerant circuits of size $O(l)$.
  arXiv  Detail & Related papers  (2026-03-25T17:51:46Z)
• Measurement-Based Fault-Tolerant Quantum Computation on High-Connectivity Devices: A Resource-Efficient Approach toward Early FTQC [2.511618458985613]
  We propose a measurement-based FTQC architecture for high-connectivity platforms such as trapped ions and neutral atoms.<n>Key idea is to use verified logical ancillas combined with Knill's error-correcting teleportation.<n>We present two implementations benchmarked under circuit-level depolarizing noise.
  arXiv  Detail & Related papers  (2025-10-21T14:02:20Z)
• A distillation-teleportation protocol for fault-tolerant QRAM [95.99192129224721]
  We present a protocol for fault-tolerantly implementing the logical quantum random access memory (QRAM) operation.<n>For coherently accessing classical memories of size $2n$, our protocol consumes only $mathrmpoly(n)$ fault-tolerant quantum resources.
  arXiv  Detail & Related papers  (2025-05-26T17:42:56Z)
• Exact results on finite size corrections for surface codes tailored to biased noise [0.0]
  We study the XY and XZZX surface codes under phase-biased noise. We find exact solutions at a special disordered point. We show that calculating thresholds based not only on the total logical failure rate, but also independently on the phase- and bit-flip logical failure rates, gives a more confident estimate.
  arXiv  Detail & Related papers  (2024-01-08T16:38:56Z)
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates [40.56175933029223]
  We propose two types of constant-depth constructions for implementing Uniformly Controlled Gates. We obtain constant-depth circuits for the quantum counterparts of read-only and read-write memory devices.
  arXiv  Detail & Related papers  (2023-08-16T17:54:56Z)
• Long-range data transmission in a fault-tolerant quantum bus architecture [0.0]
  Scheme generates a maximally entangled state of two qubits using a depth-$6$ circuit consisting of nearest-neighbor Clifford gates and local measurements only. We prove a converse bound $Omega(log R)$ on the number of qubits per repeater among all low-latency schemes for fault-tolerant quantum communication over distance.
  arXiv  Detail & Related papers  (2022-09-20T14:57:27Z)
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
  amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits. We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
  arXiv  Detail & Related papers  (2022-08-10T17:39:21Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Exponential Error Suppression for Near-Term Quantum Devices [0.0]
  In NISQ era, complexity and scale required to adopt even the smallest QEC is prohibitive. We show that for the crucial case of estimating expectation values of observables one can indeed achieve an effective exponential suppression.
  arXiv  Detail & Related papers  (2020-11-11T18:00:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.