Approach

Measure first. Then design.

We are building superconducting quantum processors from experimentally measured constraints — not from theoretical performance targets alone.

Before designing our first processor, we studied where existing quantum hardware loses performance and used those findings to define the architectural requirements for our system.

Measure first.

We characterize before we design. Our experiments examine how connectivity, routing, gate overhead and error-correction requirements affect logical performance on superconducting quantum hardware.

Every reported result is labelled by its stage: designed, simulated, fabricated, or measured.

Design for the code.

Error correction is a primary architectural requirement. Our processor is being designed around the connectivity and routing requirements of quantum error correction, with the goal of reducing unnecessary operations and preserving the time available for computation. The architecture is designed to make error correction practical at the hardware level.

From experiment to architecture.

Measurements on existing hardware identified connectivity and routing as important limitations for larger error-correction circuits. Those observations informed the architecture of our first processor. Degree-4 connectivity is a core design requirement.

The implementation details of our processor architecture remain proprietary. The measurements themselves are on the ledger, with research papers in preparation.

Validate before hardware.

We use simulation to test architectures, circuits and error-correction strategies before committing experiments to quantum hardware — evaluating circuit behaviour, expected logical performance, routing overhead, error sensitivity and architecture-level trade-offs. Hardware experiments then test whether those predictions survive real device noise.

Simulated results are never presented as hardware measurements. Every figure below is tagged with what it is.

SIMULATION · STIM + MWPM5×10⁻³2×10⁻³10⁻³3579code distance · p = 0.005logical error / cycle (log)d=3 Z basis: 5.74e-03 per cycled=5 Z basis: 2.87e-03 per cycled=7 Z basis: 1.38e-03 per cycled=9 Z basis: 7.60e-04 per cycleZ basis · Λ = 1.97d=3 X basis: 6.51e-03 per cycled=5 X basis: 3.26e-03 per cycled=7 X basis: 1.76e-03 per cycled=9 X basis: 1.03e-03 per cycleX basis · Λ = 1.85
Figure 1. Simulated per-cycle logical error vs code distance at p = 0.005, both bases. Each added distance step cuts the error by Λ = 1.97 (Z) / 1.85 (X). 300,000 shots per point.
SIMULATION · STIM + MWPM10⁻²10⁻³10⁻⁴10⁻⁵0.0020.0030.0050.01physical error rate p (log) · Z basislogical error / cycle (log)p = 0.005 · Heron-classd=3, p=0.002: 1.03e-03 per cycled=3, p=0.003: 2.21e-03 per cycled=3, p=0.004: 3.81e-03 per cycled=3, p=0.005: 5.74e-03 per cycled=3, p=0.007: 1.08e-02 per cycled=3, p=0.01: 2.03e-02 per cycled = 3d=5, p=0.002: 2.20e-04 per cycled=5, p=0.003: 6.63e-04 per cycled=5, p=0.004: 1.54e-03 per cycled=5, p=0.005: 2.87e-03 per cycled=5, p=0.007: 6.99e-03 per cycled=5, p=0.01: 1.79e-02 per cycled = 5d=7, p=0.002: 4.10e-05 per cycled=7, p=0.003: 1.92e-04 per cycled=7, p=0.004: 6.14e-04 per cycled=7, p=0.005: 1.38e-03 per cycled=7, p=0.007: 4.92e-03 per cycled=7, p=0.01: 1.63e-02 per cycled = 7d=9, p=0.002: 8.52e-06 per cycled=9, p=0.003: 6.49e-05 per cycled=9, p=0.004: 2.69e-04 per cycled=9, p=0.005: 7.60e-04 per cycled=9, p=0.007: 3.63e-03 per cycled=9, p=0.01: 1.55e-02 per cycled = 9
Figure 2. Simulated per-cycle logical error vs physical error rate, Z basis, distances 3–9. Below the ~1% threshold, larger codes win — at p = 0.002, distance 9 sits over 100× below distance 3. 300,000 shots per point.
d = 3abstract circuit: 72 two-qubit gates (circuit)abstract circuit72degree-3, measured Z: 279 two-qubit gates (manifest)degree-3, measured Z279degree-3, measured X: 264 two-qubit gates (manifest)degree-3, measured X264d = 5abstract circuit: 400 two-qubit gates (circuit)abstract circuit400degree-4 + margin, computed: 400 two-qubit gates (transpiled: zero added SWAPs)degree-4 + margin, computed400degree-3, measured Z: 2095 two-qubit gates (manifest)degree-3, measured Z2,095degree-3, measured X: 2158 two-qubit gates (manifest)degree-3, measured X2,158two-qubit gates per syndrome cycle circuit (linear, from zero)
Figure 3. Routed two-qubit gates per syndrome-cycle circuit. Degree-3 values are per-basis from the hardware run manifest; the degree-4 value is a transpiled schedule with routing margin — zero added SWAPs.
idle error / qubit / roundsyndrome round duration (µs)CALIBRATED MODEL · DEVICE T1/T25%10%15%20%51015202530d=3 round · 8.08 µs: 5.75% per qubit per roundd=3 round · 8.08 µs → 5.75%d=5 round · 16.98 µs: 11.54% per qubit per roundd=5 round · 16.98 µs → 11.54%
Figure 4. The idle budget: error per data qubit per syndrome round, from a model calibrated to the device’s measured T1/T2. Markers: the distance-3 round at 8.08 µs → 5.75%, and the distance-5 round at 16.98 µs → 11.54% per data qubit per round.

Simulation: Stim + minimum-weight matching, circuit-level noise, 300,000 shots per point, per-cycle rates, both bases. Gate counts: archived hardware run manifest. Full conditions and job IDs: the ledger.

Future chip generations will be tested against predefined experimental criteria rather than retrospective benchmarks.

Hardware and control.

Quantum processors require tightly integrated quantum and classical control. We are developing the control architecture alongside the processor, so that measurement, decision-making and feedback are part of the system rather than an external layer. Implementation details remain proprietary until they are ready for disclosure.

Our publishing standard.

We publish experimentally supported results and the scientific conclusions that follow from them. Measured results are distinguished from simulations. Every claim travels with the conditions that make it true, and the data to check it.

The principle is simple: measure first, design second, and let the data decide what comes next.