← Quantum Technology AtlasTechnologies · Machines · Architectures · OrganisationsРусскийעברית

GPU decoding via NVQLink dec_gpu

RoCE link putting a GPU inside the QEC feedback loop at 3.84 µs mean round trip, so decoding runs as CUDA software on GH200-class hardware instead of a fixed FPGA bitstream.

GPU decoding via NVQLink

dec_gpu · layer 8 Decoder · demonstrated · since 2025

3.84 µs round trip; Helios+GH200 BP+OSD median 67 µs (5.4× LER gain); platform-agnostic layer.

Brief →

Key references

[531] NVIDIA, “NVIDIA Introduces NVQLink — Connecting Quantum and GPU Computing for 17 Quantum B… · 2025
[324] S. Caldwell et al., “NVIDIA NVQLink Architecture Integrates Accelerated Computing with Qua… · 2025
[239] M. Abdel-Kareem, “IQM and Zurich Instruments Develop Real-Time QEC via NVIDIA NVQLink,” Qu… · 2026

Design space — attributes

(a) carrier affinity
intermediate / carrier-agnostic
(b) time · entangling
—
(c) readout
—
(d) mobility
—
(e) control
—
(f) error structure
stochastic Pauli
(g) manufacturing
—

Evaluation space — dated attributes

NVQLink RoCE round trip → 3.84 µs mean
defines: clock (cycle time) · 2025-10 · source

NVQLink was announced on 2025-10-28.

Standard records

decode latency per round → 67 µs · typical
Quantinuum Helios + GH200 over NVQLink: BP+OSD 'ran with a 67 microsecond median decoding time'; link round trip 3.84 us mean · 2025-10 · source [C] ⓘ

Actors & goals — annotations

Transmon lattice with tunable couplers (alternate) — IBM (Heron, Nighthawk), Google (Willow), Rigetti, IQM, OQC, USTC/Zhejiang, Fujitsu/RIKEN, QuantWare · G2 G3 G4
Rydberg tweezer array — alkali (Rb/Cs) (alternate) — Harvard/MIT, QuEra (Gemini), Pasqal (Orion), Infleqtion, Google (2026; species not stated) · G1 G3 G7

Edges

alternatives: FPGA real-time decoders (LCD, Deltaflow)
conflicts with:
Transmon open — no mitigation shown at scale
GPU decoding over NVQLink adds a ~4 µs round trip to a ~1 µs surface-code cycle
price NVQLink's measured round trip is 3.84 µs mean / 3.96 µs max, i.e. 3–4 surface-code cycles of a Willow-class transmon (~1.1 µs): syndromes queue faster than any single-cycle reaction, so real-time feed-forward (non-Clifford, teleportation) must wait
mitigation windowed / streaming decoding with an FPGA predecoder at the fridge, deferring only the reaction-critical decisions; slower carriers (atoms, ions: ms cycles) do not see the conflict · 2025-11
° one of several that would do · the usual route, not a strict need

Used by 7 machines (3 primary · 4 alternate)

↗ its register card · paper / product / press: links that name the machine (attribution checked on 20 Sep 2026)

Pictures

Every picture carries the story of what it shows and its credit line.

Fig. 1 — (a)
A simple drawing: two boxes crowded with black cubes (detection events of X and Z type, in space and time) pass through a dark block and come out almost empty. It is Figure 1(a) of arXiv 2604.12841 by Chamberland, Olle, Li, Thornton and Baratta on AI-based pre-decoders for surface codes. It shows the idea of a neural pre-decoder that clears most local errors so a slower global decoder has little left to do; the drawing carries almost no labels. “Fig. 1 — (a)” by Christopher Chamberland, Jan Olle, Muyuan Li, Scott Thornton, Igor Baratta, arxiv.org/abs/2604.12841, CC BY 4.0 (creativecommons.org/licenses/by/4.0/)
Fig. 1 — Figure 1Quantum Error Correcting Codes. A very general class of QEC codes is the class stabilizer codes, defined by the stabilizer subgroup of the p…
A two-panel line drawing. Panel (a) shows a patch of the toric code: qubits on the edges of a square lattice, plaquette and star checks, the syndromes flagged around one error, and the same code drawn as two Tanner graphs; panel (b) shows a neural-network decoder whose input neurons take the measured syndrome, whose fully connected hidden layers are trained, and whose output neurons suggest the X and Z errors on each qubit. It is Figure 1 of a 2017 Scientific Reports paper by Stefan Krastanov and Liang Jiang. It illustrates learned decoding; no GPU or other hardware appears. “Fig. 1 — Figure 1Quantum Error Correcting Codes. A very general class of QEC codes is the class stabilizer codes, defined by the stabilizer subgroup of the physical…” by Krastanov, Stefan; Jiang, Liang, www.nature.com/articles/s41598-017-11266-1, CC BY 4.0 (creativecommons.org/licenses/by/4.0/)
dec_gpu · layer 8 Decoder · centrality 11.7 · demonstrated · since 2025 · updated 2026-09-30

GPU decoding via NVQLink

RoCE link putting a GPU inside the QEC feedback loop at 3.84 µs mean round trip, so decoding runs as CUDA software on GH200-class hardware instead of a fixed FPGA bitstream.

Verdict. The round trip is bounded (3.96 µs max over 1,000 samples) and the decoder is software, but the only published decode is BP+OSD on Quantinuum's Helios at 67 µs median; no head-to-head against an FPGA decoder on identical syndromes exists as of 2026-09-04.

Key references

Λ = error-suppression factor per code-distance step; QBI = DARPA Quantum Benchmarking Initiative (Stage A concept → B R&D plan → C government V&V); G1–G7 = the report's goal classes (see Actors & economics).

Identity & lineage

A low-latency RDMA-over-Converged-Ethernet (RoCE) path between a QPU's control electronics and a GPU, with an open-source FPGA core on the quantum side, so decoding and in-loop calibration run as CUDA software rather than a bitstream. NVIDIA announced it on 2025-10-28, naming 17 quantum-computer builders, five control-electronics vendors and nine US national laboratories C[531]; the numbers followed on 2025-11-17 C[324]. Attributes: d = platform-agnostic, reaching superconducting, trapped-ion QCCD and neutral-atom architectures; e/f/g = no control modality, corrects Pauli syndrome errors, no fabrication — commodity GPU and Ethernet hardware (graph record).

Physics & limits

Two budgets make up the round trip, and they must not be read the same way. Transport is bounded: 3.84 µs mean, 0.035 µs standard deviation, 3.96 µs maximum over 1,000 samples C[324] — the tightness matters more than the mean, because a feedback loop is sized by its tail. Decode is not: BP+OSD (belief propagation plus ordered-statistics decoding) on a GH200 against Quantinuum's Helios gives a 67 µs median for Bring's code, taking an 8-logical-qubit memory from 4.95 ± 0.67% to 0.925 ± 0.38% error, a 5.4× gain C[324]. Their sum, ~71 µs, is therefore a typical round trip, not a bound: only the transport term has a published maximum.

Whether 67 µs is slow depends on which clock it must meet. For memory the requirement is throughput, not per-cycle latency: Google sustained 10⁶ cycles at d=5 on a 1.1 µs cycle with a real-time decoder of 63 µs mean latency D[1] — the same order as the GPU figure — because a sliding window pipelines cycles instead of decoding each within one. Reaction time is the hard constraint, and it binds only where an operation is conditioned on a decode: magic-state injection, feed-forward, lattice surgery. That distinction, not the raw microseconds, decides where this layer is usable. GPU decoding is therefore comfortable on millisecond-cycle ion and atom platforms, adequate for superconducting memory, and unproven on the reaction-limited path. What moves the floor: kernels exploiting GPU parallelism rather than ports of serial algorithms.

Engineering state of the art

table
Year Figure Who Tag+key
2025-11 RoCE round trip 3.84 µs mean, 0.035 µs SD, 3.96 µs max over 1,000 samples NVIDIA C[324]fact
2025-11 BP+OSD on GH200, Bring's code on Helios: 67 µs median, 4.95%→0.925% logical error Quantinuum C[324]
2026-03 Real-time QEC demonstrator over NVQLink, under 4 µs end-to-end IQM P[239]fact

GPU decode time dominates at ~17× the network hop, so the interconnect is not what has to shrink. No published result runs GPU BP+OSD and an FPGA decoder on identical traces.

Manufacturing, materials & supply chain

No fabrication process. The GPU side is NVIDIA silicon — GH200 for Helios, RTX PRO 6000 Blackwell Max-Q for the networking demonstration C[324] — with no AMD or Intel equivalent as of 2026-09-04. The network side is deliberately unlocked: RoCE is a standard and NVIDIA published an open-source FPGA core for the QPU endpoint C[324], which let five control-electronics vendors integrate it C[531]. The asymmetry is the commercial design — give away the interface, sell the accelerator. Nothing is priced; it ships as a reference architecture with a sign-up page C[531]. Export exposure is inherited from US controls on advanced GPUs, not from a quantum ECCN.

Control, readout & I/O burden

The loop is control electronics → RoCE → GPU → back, at 3.84 µs plus decode. Helios is 98 physical qubits D[105], so nothing at 10³ has run end-to-end. At 10⁴–10⁶ the question is whether decode time grows with code size faster than throughput grows per GPU generation, and whether batching across logical blocks keeps the budget flat; no source states either. The offsetting argument, unquantified: one GPU cluster can serve several QPUs, which an FPGA bolted to one rack cannot.

Role in the stack

It requires nothing upstream and replaces FPGA-based real-time decoding, trading a fixed bitstream for software changeable between shots; the graph records it as the primary decoder on trapped-ion QCCD and as an alternate on the transmon lattice with tunable couplers and the alkali Rydberg tweezer array — one decoder across three families. Derived clock contribution: ~71 µs per decode round trip — transport plus median decode (2 s.f.) — 1–7% of a 1–5 ms ion or atom cycle but ~65 cycles of a 1.1 µs superconducting one D[1]. Switching cost is a rack and a software stack, not a code change — the opposite of the qLDPC decoders. Adjacent empty slot: an independent cross-vendor benchmark.

Evidence — how the numbers were measured

Both headline numbers come from NVIDIA's own blog, co-developed with Quantinuum, and are not peer-reviewed C[324]. The 5.4× carries uncertainties — better practice than most vendor claims — but it is one code on one machine, and the IQM demonstrator is trade press P[239]. No comparison exists against Relay-BP D[48] or Riverlane's decoder D[238] on the same syndromes, so "GPUs are slower than FPGAs" compares numbers from different codes and machines.

Not published: how GPU decoding time scales with code size or logical-block count at 10⁴–10⁶ qubits, and NVentures' separate investments in Quantinuum, QuEra and Alice & Bob, of which only the round totals are public. The launch release's headline counts of 17 builders and nine labs do not tally exactly with the names it lists.

Actors & economics

Who.
| Organisation | Role | Country | What exactly they do with this technology | Evidence |
|---|---|---|---|---|
| NVIDIA | Developer | USA | Built NVQLink and the nv-qldpc-decoder; supplies the GPUs | C[324], [531] |
| Quantinuum | User | USA/UK | Only published deployment: Helios plus GH200 running BP+OSD | C[324]fact |
| IQM | User | Finland | Real-time QEC demonstrator over NVQLink under 4 µs end-to-end | P[239]fact |
| Zurich Instruments | Supplier | Switzerland | Control electronics carrying the NVQLink endpoint | C[531] |
| DARPA | Funder | USA | QBI Stage B funds several of the named QPU builders | G[65]fact |

Money. 2025-10-28 · NVIDIA · launch, 17 builders / 5 control vendors / 9 labs · no financing disclosed · announced C[531]. 2025-09-04 · Quantinuum · $600 M at $10 B pre-money, NVentures participating · closed Cfact. 2026-05-22 · Alice & Bob · Series B extension with NVentures · closed Cfact. 2026-07-26 quarter · NVIDIA · revenue $96.2 B, Data Center $89.0 B, +106% y/y, quantum unmentioned · reported G[737] — the economics of this layer in one line.

Market & supply chain. No market yet — no price, SKU or licence terms disclosed C[531]. The chain splits: open interface, single-sourced accelerator, so concentration risk is the decoder host, not the link. Goal exposure is broader than any FPGA decoder — G3/G4 as a decoder, G2 because the same path serves mitigation and calibration, G7 because national-lab deployments are procurement-shaped.

IP & standards. No patent family specific to NVQLink was found in any named database. The standards posture is the interesting part: RoCE is an existing Ethernet standard and the QPU-side core is open source C[324], so NVIDIA standardises the boundary it does not sell. Third parties build against CUDA-Q QEC Pfact.

Roadmaps & track record. NVIDIA: (2025-10 · launch with 17 builders · delivered, one published deployment three weeks later) C[324], [531]; (2025-11 · partners to deploy on future processors · only Helios confirmed) C[324]. IQM: (2026-03 · demonstrator · delivered) P[239]. Launch-to-first-deployment was effectively zero; the gap between 17 announced builders and one published deployment is the number to watch.

Strategic reading. If GPU decoding wins, every fault-tolerant machine becomes a recurring GPU customer and decoding stops differentiating QPU vendors — good for builders without FPGA engineering, bad for Riverlane and IBM's in-house route. NVIDIA loses little if it fails: quantum does not appear in a $96.2 B quarter G[737], so this is a cheap option on the classical half of a future stack. The substitution threat is a decoder ASIC nobody sells. Bargaining power sits with NVIDIA on the accelerator and the control vendors on the endpoint.

Outlook & open questions

Falsifiable (12–24 months): confirm if a second QPU vendor publishes an NVQLink decode loop with numbers by end-2027; demote if published deployments still number one. Best case 2029: GPU decoding is the default on ion, atom and superconducting memory, reaction-limited operations handed to a small local FPGA. Worst case: 17 builders yield two deployments and dedicated hardware keeps the loop. Open questions: how decode time scales with code size and block count; whether anyone reports tail rather than median latency; whether AMD or Intel field a rival host. Watch: a second deployment and any independent benchmark.

References
  1. [1] Google Quantum AI and Collaborators, “Quantum error correction below the surface code threshold,” Nature, vol. 638, no. 8052, pp. 920–926, Dec. 2024, doi: 10.1038/s41586-024-08449-y. D
  2. [48] T. Maurer et al., “Real-time decoding of the gross code memory with FPGAs,” arXiv:2510.21600, Oct. 2025. D
  3. [65] DARPA, “Stage B selection,” Nov. 6, 2025. [Online]. Available: https://www.darpa.mil/research/programs/quantum-benchmarking-initiative/stage-b-selection G
  4. [105] S. Dasu et al., “Computing with many encoded logical qubits beyond break-even,” arXiv:2602.22211, Feb. 2026. D
  5. [238] A. B. Ziad et al., “Local clustering decoder as a fast and adaptive hardware decoder for the surface code,” Nat. Commun., vol. 16, no. 1, Art. no. 11048, Dec. 2025, doi: 10.1038/s41467-025-66773-x. D
  6. [239] M. Abdel-Kareem, “IQM and Zurich Instruments Develop Real-Time QEC via NVIDIA NVQLink,” Quantum Computing Report, Mar. 17, 2026. [Online]. Available: https://quantumcomputingreport.com/iqm-and-zurich-instruments-develop-real-time-qec-via-nvidia-nvqlink/ P
  7. [324] S. Caldwell et al., “NVIDIA NVQLink Architecture Integrates Accelerated Computing with Quantum Processors,” NVIDIA Technical Blog, Nov. 17, 2025. [Online]. Available: https://developer.nvidia.com/blog/nvidia-nvqlink-architecture-integrates-accelerated-computing-with-quantum-processors/ C
  8. [531] NVIDIA, “NVIDIA Introduces NVQLink — Connecting Quantum and GPU Computing for 17 Quantum Builders and Nine Scientific Labs,” Oct. 28, 2025. [Online]. Available: https://nvidianews.nvidia.com/news/nvidia-nvqlink-quantum-gpu-computing C
  9. [737] NVIDIA, “NVIDIA Announces Financial Results for Second Quarter Fiscal 2027,” Aug. 26, 2026. [Online]. Available: https://nvidianews.nvidia.com/news/nvidia-announces-financial-results-for-second-quarter-fiscal-2027 G