In the search for scalable, fault-tolerant quantum computing, distributed quantum computers are promising candidates. These systems can be realized in large-scale quantum networks or condensed onto a single chip with closely situated nodes. We present a framework for numerical simulations of a memory channel using the distributed toric surface code, where each data qubit of the code is part of a separate node, and the error-detection performance depends on the quality of four-qubit Greenberger–Horne–Zeilinger (GHZ) states generated between the nodes. We quantitatively investigate the effect of memory decoherence and evaluate the advantage of GHZ creation protocols tailored to the level of decoherence. We do this by applying our framework for the particular case of color centers in diamond, employing models developed from experimental characterization of nitrogen-vacancy centers. For diamond color centers, coherence times during entanglement generation are orders of magnitude lower than coherence times of idling qubits. These coherence times represent a limiting factor for applications, but previous surface code simulations did not treat them as such. Introducing limiting coherence times as a prominent noise factor makes it imperative to integrate realistic operation times into simulations and incorporate strategies for operation scheduling. Our model predicts error probability thresholds for gate and measurement reduced by at least a factor of three compared to prior work with more idealized noise models. We also find a threshold of 4×102 in the ratio between the entanglement generation and the decoherence rates, setting a benchmark for experimental progress.
In the search for scalable, fault-tolerant quantum computing, distributed quantum computers are promising candidates. These systems can be realized in large-scale quantum networks or condensed onto a single chip with closely situated nodes. We present a framework for numerical simulations of a memory channel using the distributed toric surface code, where each data qubit of the code is part of a separate node, and the error-detection performance depends on the quality of four-qubit Greenberger–Horne–Zeilinger (GHZ) states generated between the nodes. We quantitatively investigate the effect of memory decoherence and evaluate the advantage of GHZ creation protocols tailored to the level of decoherence. We do this by applying our framework for the particular case of color centers in diamond, employing models developed from experimental characterization of nitrogen-vacancy centers. For diamond color centers, coherence times during entanglement generation are orders of magnitude lower than coherence times of idling qubits. These coherence times represent a limiting factor for applications, but previous surface code simulations did not treat them as such. Introducing limiting coherence times as a prominent noise factor makes it imperative to integrate realistic operation times into simulations and incorporate strategies for operation scheduling. Our model predicts error probability thresholds for gate and measurement reduced by at least a factor of three compared to prior work with more idealized noise models. We also find a threshold of 4×102 in the ratio between the entanglement generation and the decoherence rates, setting a benchmark for experimental progress.
Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds. As quantum hardware advances toward modular and networked architectures, various fault tolerant DQC schemes have been proposed, which can be broadly categorized into three architectural types. Type 1 architectures consist of small quantum nodes connected via Greenberger-Horne-Zeilinger (GHZ) states, enabling nonlocal stabilizer measurements. Type 2 architectures distribute a large error correcting code block across multiple modules, with most stabilizer measurements remaining local, except for a small subset at patch boundaries that are performed using nonlocal CNOT gates. Type 3 architectures assign code blocks to distinct modules and can perform fault tolerant operations such as transversal gates, lattice surgery, and teleportation to implement logical operations between code blocks. Using the planar surface code and toric code as representative examples, we analyze how the resource requirements, particularly the number of Bell pairs and the average number of generation attempts, scale with increasing code distance across different architectural designs. This analysis provides valuable insights for identifying architectures well suited to fault tolerant distributed quantum computation under near term hardware and resource constraints.
The nitrogen-vacancy (NV) centre in diamond is the only solid-state qubit that operates at room temperature, yet its viability for fault-tolerant quantum computing has been dismissed on the grounds that decoherence times are too short. Here we show, through a calibrated twelve-channel decoherence model spanning 1.3 K to 600 K (60+ experimental anchors, R² = 0.953), that single- and two-qubit gate error rates fall below the surface code threshold of 1% at 295 K for bulk ultra-pure diamond under dynamical decoupling with N ≥ 2048 pi-pulses. The key enabler is the recently demonstrated T₂ = 2T₁ limit (4.34 ms at room temperature), achieved by filtering the spin-lattice Han noise channel above 1 MHz via high-order CPMG. The model now includes ¹³C nuclear spectral diffusion (dominant in ultra-pure bulk at high B-field, validated against Wrachtrup QV=8 at -5.4%) and a magnetic-field-dependent T₁ correction. For standard-grade bulk diamond, we identify a Peltier-cooled sweet spot at 200–270 K that brings all gates below threshold at a cooling cost of ~200 EUR. We further show that the XZZX surface code, exploiting the strongly Z-biased noise of NV circuits (effective bias η_eff ≈ 834 from idle-dominated architecture), reduces the physical qubit overhead by more than 95% compared to the standard surface code. Combined with soft-information decoding using analog photoluminescence counts, this establishes a concrete path from the current QV=8 (Wrachtrup 2026) to QV > 1000. Decoherence is no longer the bottleneck for NV-based quantum computing at room temperature. UK Patent Applications GB2606382.6 and GB2606639.9 cover methods described herein.
Abstract Quantum error correction (QEC) is essential for scalable quantum computing, but its realistic evaluation is hindered by the difficulty of simulating coherent noise in large codes. We propose a unified framework for the rotated surface code that integrates a qubit-reduction strategy preserving error dynamics, a coherent noise model with spatial and temporal correlations, and an effective error model validated through simulations up to d=7. GPU-accelerated simulations using QULACS show that coherent errors in the d=5 code predominantly interfere destructively, reducing their effective impact by about 13%. Based on these results, we establish conditions for break-even QEC, requiring a gate-time-to-coherence-time ratio below 0.005–0.007. Our findings indicate that current superconducting platforms operate close to this regime, with residual coupling-induced coherent errors as the main limitation, and provide a practical tool for optimizing surface-code QEC.
Fault-tolerant modular quantum computing requires stabilizer measurements across the modules in a quantum network. For this, entangled states of high quality and rate must be distributed. Currently, two main types of entanglement distribution protocols exist, namely emission-based and scattering-based, each with its own advantages and drawbacks. On the one hand, scattering-based protocols with cavities or waveguides are fast but demand stringent hardware such as high-efficiency integrated circulators or strong waveguide coupling. On the other hand, emission-based platforms are experimentally feasible but so far rely on Bell-pair fusion with extensive use of slow two-qubit memory gates, limiting thresholds to ≈0.16%. Here, we consider a fully distributed surface code using emission-based entanglement schemes that generate GHZ states in a single shot, i.e., without the need for Bell-pair fusions. We show that our optical setup produces Bell pairs, W states, and GHZ states, enabling both memory-based and optical protocols for distilling high-fidelity GHZ states with significantly improved success rates. Furthermore, we introduce protocols that completely eliminate the need for memory-based two-qubit gates, achieving thresholds of ≈0.19% with modest hardware enhancements, increasing to above ≈0.24% with photon-number-resolving detectors. These results show the feasibility of emission-based architectures for scalable fault-tolerant operation.
Modular quantum computing is a leading paradigm for scaling quantum computation beyond the resource limitations of monolithic devices. In this architecture, multiple quantum processing units (QPUs), employing identical or distinct qubit modalities, are interconnected via shared entanglement. Here, we investigate how errors at module interfaces and within individual QPUs affect fault-tolerant computation when qubits are encoded using the rotated surface code. Going beyond the logical-memory benchmark, we perform circuit-level simulations of fault-tolerant nonlocal CNOT gates implemented via lattice surgery between QPUs connected by noisy Bell pairs, and analyze the resulting logical error rates. Our results show that interfaces can tolerate noise up to an order of magnitude higher than intra-QPU noise, with only a minor reduction in the fault-tolerance threshold. We further develop an efficient protocol for preparing distributed fault-tolerant logical GHZ states, reducing ancilla overhead, time, and nonlocal Bell-pair consumption. We show that ancilla minimization in this setting is equivalent to a vertex-cover problem on an associated graph, and introduce a polynomial-time heuristic algorithm for finding low-overhead solutions. Our results provide quantitative evidence that distributed quantum error correction can enable scalable, fault-tolerant quantum computation in modular architectures.
Abstract A design for a large-scale surface code quantum processor based on a node/network approach is introduced for semiconductor quantum dot spin qubits. The minimal node contains only seven quantum dots, and nodes are separated on the micron scale, creating useful space for wiring interconnects and integration of conventional transistor circuits. Entanglement is distributed between neighbouring nodes by loading spin singlets locally and then shuttling one member of the pair through a linear array of empty dots. A node contains one data qubit, two ancilla qubits, and additional dots to facilitate electron shuttling and measurement of the ancillas. A four-node GHZ state is realized by sharing three internode singlets followed by local gate operations and ancilla measurements. Further local operations produce an X or Z stabilizer on the four data qubits, which is the fundamental operation of the surface code. Electron shuttling is simulated in the single-valley case using a simple gate electrode geometry without explicit barrier gates, and demonstrates that adiabatic transport is possible on timescales that do not present a speed bottleneck to the processor. An important shuttling error in a clean system is uncontrolled phase rotation of the spin due to modulation of the electronic g -factor during transport, owing to the Stark effect. This error can be reduced by appropriate electrostatic tuning of the stationary electron’s g -factor. While these simulations are unrealistic in neglecting spin–orbit, valley and decoherence effects, they are realistic with respect to the gate-induced potential landscape and are a first step towards more realistic modelling. Using reasonable noise models, we estimate error thresholds with respect to single and two-qubit gate fidelities as well as singlet dephasing errors during shuttling. A twirling protocol transforms the non-Pauli noise associated with exchange gate operations into Pauli noise, making it possible to use the Gottesman–Knill theorem to efficiently simulate large codes.