Faciens Technologies · simulation study · 3D topological memory

A bit that repairs itself in three dimensions

Store one bit across a 3D lattice of qubits and let every qubit fix itself by asking only its four neighbouring checks. In 3D the errors form closed loops that shrink away. In 2D they form points that wander off and erase the bit. Try both below, then see what that predicts for a real 384-atom machine.

flipped qubit check that sees an error 3D: 6×6×6 lattice, 648 qubits
Bit intact
0
rounds survived
0
times the bit was lost
0
checks reporting an error now
0
longest survival

Tap or click the lattice to drop errors at that spot, and drag sideways to turn it. Same rule in both: flip a qubit when most of its checks report an error. Checks are read once per round and can be wrong. The bit is tested every 10 rounds by a full readout and decode. Both lattices hold a similar number of qubits (648 in 3D, 512 in 2D).

Demonstrator 1a · Simulators · gate-level digital twin

Design the first 3D membrane-memory run and see if it holds

This is the digital twin from Result 3, running live in this page. Every check is measured with real gates on a fixed schedule, with gate errors, readout errors and atom loss. Pick the hardware, press run, then try the larger lattice. Below the threshold, the larger lattice should fail less often.

Ready. Press run.
–
shots where the bit was lost
–
logical error per round
–
better than one bare qubit
–
real lab time for this run
RunLatticeGateReadoutLossLostError / round
Your runs will appear here so you can compare them.

Lost atoms are replaced by fresh atoms in a random state, and the decoder is not told which ones were lost. Lab time assumes about 1 ms per round. Atom moves between zones are not modelled. Nothing here has run on a quantum computer: no group has yet built a 3D membrane memory.

Demonstrator 1b · Simulators · thermal memory

Heat the lattice and time how long the bit survives

A thermal Monte Carlo of the lattice: every check costs energy when it reports an error, and the lattice is held at a temperature. Choose 2D strings or 3D membranes, a temperature and a size, then run. The simulator times how many sweeps each run lasts before the stored bit is lost. 3D below its transition near T = 1.31 should outlast 2D by a wide margin, and grow with size.

Each run is capped at 4,000 sweeps. The bit is checked every 25 sweeps by decoding a copy of the lattice. 3D transition: T ≈ 1.31.

–
median sweeps until the bit is lost
–
runs that survived all 4,000 sweeps
RunLatticeTMedian lifeSurvived
Runs appear here. Try 3D at 4 and then 6 at the same temperature.
Demonstrator 2 · The local decoder

Break the lattice yourself and watch the decoder repair it

A 4×4×4 lattice of 192 qubits. Tap near an edge to flip that qubit. The checks around it light up. Each decoder step lets every qubit read its four checks and flip itself if most of them report an error. That is the entire decoder: four bits read and one vote per qubit, so a step costs the same at any size. Then try the one error no local check can see.

Bit intact. No checks lit.
0
checks reporting an error
0
qubits currently flipped
0
decoder steps taken
4 + 1
reads and votes per qubit per step

The hidden membrane flips a whole plane of qubits. Every check sees two flips and stays dark, yet the stored bit is now wrong. A local decoder cannot see it, which is why the code makes such membranes cost a whole plane: noise almost never builds one.

Demonstrator 3 · Experiment design

Plan the first 3D membrane-memory run on a neutral-atom machine

Set the lattice and the machine's figures. The builder counts atoms, times each round, checks your settings against the tolerances measured in the stress tests, and animates the gate schedule every check uses. Timings are your assumptions; the tolerances come from the simulations on this page.

–
atoms needed
–
fits on
–
time per round
–
total run time
RequirementYour settingVerdict

Gate schedule for one cell

Layer 1 of 4.

Result 1 · thermal noise

Bigger lattices keep the 3D bit longer. They make the 2D bit worse.

Thermal Monte Carlo of the lattice gauge model, 60 to 100 runs per point. Lifetime is the number of sweeps until the bit is lost half the time. The 3D bit's lifetime fits τ ≈ τ₀·ebL with b = 0.51 at T = 1.30 (R² = 0.993) and b = 0.73 at T = 1.28 (R² = 0.999). The 2D bit loses lifetime as it grows, even at a much lower temperature.

Result 2 · full gate-level noise

The threshold sits near 0.95% gate error. Today's best neutral-atom gates are about 6× below it.

Every check is measured with real gates: ancilla preparation, four CNOTs on a collision-free schedule, then a readout. Noise follows every gate, preparation, measurement and idle period. Correction uses the same one-round local rule. Below the threshold, failure falls as the lattice grows; above it, failure rises.

Where real hardware sits

CZ fidelity of 99.5% on up to 60 atoms in parallel (Harvard, 2023) and 99.854% (Harvard, 2026). At 0.5% gate error, an 8×8×8 memory had zero failures in 1,000 rounds across 200 runs.

Result 3 · digital twin of the experiment

A 384-atom membrane memory is predicted to reach about 10⁻⁶ error per round

The proposed first experiment, simulated with each operation at a published error rate: 99.854% CZ gates, 0.1% atom loss per gate and per image, and an assumed 1% readout error (scanned from 0.5% to 3%). Every lost atom is replaced by a fresh one in a random state, and the decoder is not told which atoms were lost. Both choices are deliberately pessimistic.

LatticeAtomsFailures after 10,000 roundsLogical error per roundFits on
4×4×43843 of 300≈ 1×10⁻⁶ (3 events: about 0.2–3×10⁻⁶)today's 448-atom processor
6×6×61,2960 of 300< 5×10⁻⁷3,000-atom arrays
8×8×83,0720 of 200 (1,000 rounds)not resolved3,000+ atom continuous arrays

Each data qubit picks up about a 0.6% chance of a bit flip per round, so the memory suppresses errors by thousands of times. At 2–3% readout error, the 6×6×6 lattice still beats 4×4×4 after 1,000 rounds (0–0.3% failure against 1.0%). That larger-is-better signature is what a real experiment would look for.

The design

What the first experiment needs

LatticeData qubitsCheck helpersTotalStatus
L = 4192192384fits current hardware
L = 66486481,296fits 3,000-atom arrays
L = 81,5361,5363,072just fits
L = 103,0003,0006,0006,100-atom arrays
L = 125,1845,18410,368beyond operational arrays

Each round

  • Only the 4-body Z checks are needed to hold the classical membrane bit: 4 entangling-gate layers and one readout.
  • Neutral atoms supply the 3D connectivity by moving helper atoms to the data, as in today's zoned processors.
  • The correction rule reads four bits per qubit and needs nothing from far away or from earlier rounds, so its work per round never grows with size. On an FPGA or GPU it runs fully in parallel.

Stress tests (simulated, 1,000 rounds, 200 shots)

  • Moving atoms: at the published 0.9998 fidelity per transfer, 4 transfers per gate, the 6×6×6 memory never failed. It still held at 3× worse transport (0.5% failure). At 10× worse, both sizes failed. Transport is the tightest margin.
  • Readout: the larger lattice kept winning up to 8% readout error (6×6×6: 37% failure against 72%). Published mid-circuit imaging exceeds 99.9%, so readout has a wide margin.
  • Reloading: a 10 s trap lifetime adds little. What matters is how fast a lost atom is replaced: within 5 rounds the memory holds; after 10 rounds it fails (26% at 6×6×6).
  • Quantum storage: adding 6-body vertex checks protects phase too. For L = 4 that is 192 + 192 + 64 = 448 atoms. That sector has point-like defects, needs repeated rounds and a global matcher, and showed a threshold near 1.5% in a simple noise model, half the membrane sector's. Its circuit-level threshold is still to be simulated.
Stress-test explorer · simulated

Push one weakness at a time and watch which lattice wins

Each bar is the share of 200 simulated runs that lost the bit over 1,000 rounds (the quantum sector uses 80 to 150 runs over L rounds). While the larger lattice fails less, the memory is below threshold and scaling up helps. When the bars meet, the hardware has crossed the line.

Prior work and what is new here

What is known, and what this study adds

Established before this study

  • Finite-temperature protection of the 3D toric code's membrane sector: Castelnovo and Chamon, Phys. Rev. B 78, 155120 (2008).
  • Single-shot error correction: Bombín (2015); the 3D subsystem toric code, Kubica and Vasmer (2022), with a 1.05% threshold for a full quantum bit.
  • Local cellular-automaton decoders for the 3D toric code with proven thresholds: Kubica and Preskill (2019); Vasmer, Browne and Kubica (2021), about 2.1% with noisy measurements.
  • A 2D toric code with repeated correction on neutral atoms: Atom Computing (2026).

Measured in this study

  • Exponential lifetime scaling of the membrane bit against a matched 2D string bit, with validated code.
  • A simple local majority rule: about 3.1% threshold with noisy measurements (periodic cubic lattice) and about 0.95% at full gate level.
  • A digital twin of a 384-atom experiment with published error rates and atom loss.
  • A resource plan for the first 3D topological-memory demonstration, which no group has yet run on hardware.

Two comparisons to keep in view. A 2D surface code protects a full quantum bit at a similar threshold on a flat chip. A repetition code stores one classical bit with fewer qubits and more noise tolerance, but needs a global decoder across many rounds. The membrane memory's edge is local, constant-time correction and passive thermal stability.