A hardware-efficient, shuttling-free architecture that achieves all-to-all connectivity and develops a hardware-aware scheduling scheme that exploits the native cat--atom $\mathrm{CZ}^{n}$ gate to construct a syndrome-extraction circuit with minimum depth.
Abstract
The scalability of fault-tolerant neutral-atom quantum computers is constrained by the latency of shuttling with optical tweezers, imposing a stringent trade-off between qubit overhead and circuit depth in quantum algorithm compilation. Here we propose a hardware-efficient, shuttling-free architecture that achieves all-to-all connectivity. Remote Rydberg atoms are resonantly entangled through a microwave ``Cat Bus''---a cavity mode autonomously stabilized in a bosonic cat state. The Cat Bus natively supports the highly parallelized execution of one-to-many $\mathrm{CZ}^n$ gates with exponentially suppressed crosstalk. We derive the resulting cat--atom error channel from the underlying interactions and physical constraints. For fault-tolerant operation, we develop a hardware-aware scheduling scheme that exploits the native cat--atom $\mathrm{CZ}^{n}$ gate to construct a syndrome-extraction circuit with minimum depth. We benchmark the architecture using hypergraph-product (HGP) codes and estimate a 180-fold reduction in syndrome-extraction cycle time at $N=10^5$ data qubits compared with an atom-rearrangement-based architecture. Under matched two-qubit depolarizing noise, the corresponding error threshold increases from $0.55\%$ to $0.72\%$. Under the hardware-derived error model, we obtain a threshold of $0.80\%$, corresponding to a threshold cooperativity of $C_{\mathrm{th}}=7.8 \times 10^4$, compatible with experimentally accessible parameters for Rydberg-coupled microwave-cavity systems. By avoiding atom transport, the Cat Bus provides a route towards high-speed, fault-tolerant neutral-atom quantum computation.
Quantum error correction (QEC) is beginning to enable logical operations that outperform their unencoded physical counterparts, but useful fault-tolerant computation will require more than low-error quantum memory. An effective architecture must orchestrate efficient logical encoding, low-overhead logical operations, a...
Noah F. Berthusen, Ali Lavasani, Asmae Benhemou et al.· 0 citations
Fault-tolerant preparation of non-Clifford resource states is a major contributor to the overhead of quantum computation, motivating protocols that achieve high output fidelity with minimal qubit and circuit costs. We introduce a low-cost magic-state preparation protocol in which the choice of stabilizer generators is...
This work investigates how errors at module interfaces and within individual QPUs affect fault-tolerant computation when qubits are encoded using the rotated surface code, and develops an efficient protocol for preparing distributed fault-tolerant logical GHZ states.
S. Chelluri, R. Mengoni, Tom Darras et al.· 0 citations
Modularization promises to break down the design and implementation complexity of large scale quantum processors into smaller manageable subtasks. In this approach, quantum channels, realized for instance through physical rerouting of qubits or quantum teleportation, connect multiple modules. Each of those modules host...
R. Freund, F. Butt, Cesar Benito et al.· 0 citations
The first experimental demonstration of distributed quantum error detection and correction is reported, providing an experimental foundation for quantum error correction (QEC) across modular quantum architectures.
E. M. Ainley, A. Agrawal, T. Araki et al.· 2 citations
The Generalized Superfast Encoding (GSE) is a fermion-to-qubit mapping that has error-correcting/detecting properties. To this point, all demonstrations have been relegated to error-detection only, as no fault-tolerance under circuit-level noise has been observed. Here, we introduce an even-distance $d$ constant stabil...
James Brown, Kenneth Heitritter· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.