This work synthesizes efficient circuits for an important primitive in distributed fault tolerance: distributed stabilizer measurements, and considers in particular the surface code and the color code, both as distributed memories and in the case of lattice surgery across separate modules.
Abstract
Distributed architectures have been proposed as a pathway to large-scale quantum computers. Combined with the need for fault-tolerance, such architectures require distributed quantum error correction (DQEC) and distributed logical gates. An important challenge is how to realize DQEC primitives in the setting where interaction between modules is restricted to shared Bell pairs that are significantly noisier than on-chip operations. We extend the framework known as fault tolerance by construction to this setting, deriving different strategies for handling the additional noise. Through fault-improvement we recover conventional entanglement distillation, and also find more dynamical protocols that enable space-time trade-offs. We show that integrated decoding halves the required distillation code distance compared to entanglement distillation implemented using separate decoding, thus requiring significantly fewer Bell pairs. As a main focus of the work, we synthesize efficient circuits for an important primitive in distributed fault tolerance: distributed stabilizer measurements. These circuits can be adapted to resource constraints, e.g. on the Bell pair generation rate or the space available for on-chip auxiliary qubits. Noting that full local fault-tolerance is not always needed to preserve the correct scaling of logical error rates, we further optimize the circuits depending on the surrounding context. We consider in particular the surface code and the color code, both as distributed memories and in the case of lattice surgery across separate modules. Here, robustness to certain hook and readout errors reduces the number of required Bell pairs even further, compared to the context-free setting. We numerically benchmark the resulting implementations under circuit level noise with additional interconnect noise.
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
This work introduces distributed heterogeneous-distance lattice surgery using an eight-data-patch ancilla-mediated (8-DAM) architecture, which will be useful for near-term quantum devices with less qubit overhead and supports selective ancilla enlargement as a resource-efficient approach to fault-tolerant distributed q...
D. Dilley, Anastashia Jebraeilli, Rayat Roy et al.· 0 citations
This work considers the case where both non-local and local connectivity may be arbitrarily restricted, and gives an asymptotically optimal synthesis method for distributed CNOT and Clifford circuits, based on block-matrix Gaussian elimination.
A hardware-grounded architectural co-design together with a comprehensive resource-estimation protocol for surface-code-based modular processors establishes a viable route to distributed fault-tolerant superconducting quantum computation that scales without prohibitive resource growth or heavy orchestration burden.
Routing-aware pruning is established as a practical and unified compilation strategy across the quantum computing stack and a feasibility analysis on FT hardware indicates that pruning is expected to remain relevant across a range of code distances and physical error rates.
Pau Escofet, C. G. Almudéver, S. Abadal et al.· IEEE Transactions on Circuit...· 0 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.