Encodings and Node Architecture: Lessons from the Fault-Tolerant Distributed Transversal Fanout

Seng W. Loke

Home/Archive/arXiv

arXiv · 2610.22966

Encodings and Node Architecture: Lessons from the Fault-Tolerant Distributed Transversal Fanout

Seng W. Loke

View original source ↗Read source document ↗Export metadata ↓

Abstract

An encoding choice specifies the quantum error-correcting code used to encode logical qubits at a given node. Different encoding choices may differ in the number of physical qubits, the number of encoded logical qubits, the code distance, and the available fault-tolerant operations. We study different encodings for a distributed transversal fanout operation and look at its implications on node architecture. Our experiments suggest that an encoding with higher distance, even if requiring more ebits, can yield a lower logical error rate for distributed operations, and that ``upgrading'' an encoding prior to distributed operations and having a cache, as part of node architecture, for qubits can be useful for distributed operations.

Explore related subjects

quant-ph cs.DC

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Seng W. Loke. 2026-10-16. Encodings and Node Architecture: Lessons from the Fault-Tolerant Distributed Transversal Fanout. https://arxiv.org/abs/2610.22966

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MIP*=RE

We show that the class MIP* of languages that can be decided by a classical verifier interacting with multiple all-powerful quantum provers sharing entanglement is equal to the class RE of recursively enumerable languages. Our proof builds upon the quantum low-degree test of (Natarajan and Vidick, FOCS 2018) and the classical low-individual degree test of (Ji, et al., 2020) by integrating recent developments from (Natarajan and Wright, FOCS 2019) and combining them with the recursive compression framework of (Fitzsimons et al., STOC 2019). An immediate byproduct of our result is that there is an efficient reduction from the Halting Problem to the problem of deciding whether a two-player nonlocal game has entangled value $1$ or at most $1/2$. Using a known connection, undecidability of the entangled value implies a negative answer to Tsirelson's problem: we show, by providing an explicit example, that the closure $C_{qa}$ of the set of quantum tensor product correlations is strictly included in the set $C_{qc}$ of quantum commuting correlations. Following work of (Fritz, Rev. Math. Phys. 2012) and (Junge et al., J. Math. Phys. 2011) our results provide a refutation of Connes' embedding conjecture from the theory of von Neumann algebras.

quant-ph↗

arXiv2026

Predicting Dynamics from Flows of the Eigenstate Thermalization Hypothesis

Analytical treatments of far-from-equilibrium quantum dynamics are few, even in well-thermalizing systems. The celebrated eigenstate thermalization hypothesis (ETH) provides a post hoc ansatz for the matrix elements of observables in the eigenbasis of a thermalizing Hamiltonian, given various response functions of those observables as input. However, the ETH cannot predict these response functions. We introduce a procedure, dubbed the statistical Jacobi approximation (SJA), to update the ETH ansatz after a perturbation to the Hamiltonian and predict perturbed response functions. The Jacobi algorithm diagonalizes the perturbation through a sequence of two-level rotations. The SJA implements these rotations statistically assuming the ETH throughout the diagonalization procedure, and generates integrodifferential flow equations for various form factors in the ETH ansatz. We approximately solve these flow equations using statistical information about Jacobi rotations as input, and predict both quench dynamics and autocorrelators in the thermal state of the perturbed Hamiltonian. The predicted dynamics agree with exact numerics in both random matrix models and spin chains, outperforming second-order time-dependent perturbation theory.

quant-ph↗

arXiv2026

Low-Resource Quantum Energy Gap Estimation via Randomization

Estimating the energy spectra of quantum many-body systems is a fundamental task in quantum physics, with applications ranging from chemistry to condensed matter. Algorithmic shadow spectroscopy is a recent method that leverages randomized measurements on time-evolved quantum states to extract spectral information. However, implementing accurate time evolution with low-depth circuits remains a key challenge for near-term quantum hardware. In this work, we propose a hybrid quantum-classical protocol that integrates Time Evolution via Probabilistic Angle Interpolation (TE-PAI) into the shadow spectroscopy framework. TE-PAI enables the simulation of time evolution using shallow stochastic circuits while preserving unbiased estimates through quasiprobability sampling. We construct the combined estimator and derive its theoretical properties. Through numerical simulations, we demonstrate that our method accurately resolves energy gaps and exhibits enhanced robustness to gate noise compared to first-order Trotter-based shadow spectroscopy. We further validate the protocol experimentally on up to 20 qubits using IBM quantum hardware. This makes TE-PAI shadow spectroscopy a promising tool for spectral analysis on noisy intermediate-scale quantum (NISQ) devices.

quant-ph↗