dr.David
Rhodus
The bookREFERENCE COLLECTION Contents
Chapter 3537 / 232

Logical-Qubit Operations and Decoder Engineering

Operating Quantum Computers · 5 min read

A logical qubit is an operational service. It is maintained by physical qubits, stabilizer extraction circuits, a syndrome stream, a decoder, a Pauli-frame tracker, calibration policy, and a scheduler that prevents the logical resource from being oversubscribed.

The operating unit changes from a circuit on a noisy device to a time-bounded logical resource with an explicit target failure probability. Google's Willow work made the production lesson clear: the decoder, syndrome stream, and real-time control loop are part of the computer, not post-processing accessories [R50].

35.1 Logical operations are an always-on pipeline

DIAGRAM
Diagram loads as you read
35.1 Logical operations are an always-on pipeline · Figure 1
View diagram source
flowchart LR
    Phys[Physical qubits] --> Cycle[QEC cycle]
    Cycle --> Synd[Syndrome stream]
    Synd --> Decode[Decoder]
    Decode --> Frame[Pauli frame]
    Frame --> Logical[Logical qubit service]
    Logical --> Gate[Logical operation]
    Gate --> Cycle

An actively corrected logical-qubit service meets its stated guarantees only while error protection and result interpretation remain within their validated operating limits. A decoder backlog or stream fault can exhaust those limits; an incorrect frame update can corrupt interpretation. Such faults put the logical result at risk, but they do not mean that an encoded qubit immediately ceases to exist.

Logical-operation contract:

Field Meaning
code family surface code, color code, bosonic code, or another specified code; ordinary repetition codes protect against a restricted error class, not arbitrary quantum errors
code distance for a stabilizer code, the minimum weight of a Pauli operator that changes logical information without a detectable syndrome; this is distinct from the physical-qubit count
cycle time cadence of stabilizer extraction or equivalent protection cycle
decoder class matching, tensor-network, neural, lookup, or hybrid decoder
frame policy whether corrections are tracked virtually, physically applied, or deferred
target failure probability allowed probability of logical failure for the workload
escape policy what happens when the logical resource violates its budget

35.2 The decoder is latency-critical infrastructure

The decoder converts syndrome history into correction decisions or frame updates. In a fault-tolerant runtime, it is closer to a network switch or storage controller than an analytics job. PyMatching and Stim illustrate the software shape of this problem: the production runtime needs fast syndrome processing, repeatable detector-error modeling, and clear interfaces between the circuit model and decoding layer [R63, R64].

DIAGRAM
Diagram loads as you read
35.2 The decoder is latency-critical infrastructure · Figure 2
View diagram source
sequenceDiagram
    participant QPU as QPU cycle engine
    participant Stream as Syndrome stream
    participant Dec as Decoder
    participant Frame as Pauli-frame service
    participant Sched as Scheduler
    QPU->>Stream: emit syndrome bits
    Stream->>Dec: append detection events
    Dec->>Frame: correction or frame update
    Frame->>Sched: logical resource health
    Sched->>QPU: continue, pause, or abort policy

Decoder SLOs should be explicit:

SLO Why it matters
p99 decode latency must fit the deadline for operations that depend on decoded outcomes
sustained decoder throughput must keep pace with syndrome production to prevent growing backlog
dropped syndrome events identifies stream loss and buffer pressure
correction confidence exposes ambiguity before logical failure
frame-update consistency prevents silent logical-basis mistakes
replay determinism enables incident reconstruction

35.3 Treat the Pauli frame as a stateful service

Physical corrections are not always applied immediately. Many systems track corrections virtually in a Pauli frame and reinterpret later measurements. This makes the frame tracker a stateful, safety-critical service.

DIAGRAM
Diagram loads as you read
35.3 Treat the Pauli frame as a stateful service · Figure 3
View diagram source
stateDiagram-v2
    [*] --> Clean
    Clean --> PendingUpdate: syndrome indicates correction
    PendingUpdate --> Updated: decoder accepted
    Updated --> Propagated: compiler/runtime adjusts future bases
    PendingUpdate --> Ambiguous: competing corrections
    Ambiguous --> Escalated: budget violation
    Propagated --> Clean: cycle committed

Frame-tracking failure is dangerous because it can look like a successful run with the wrong interpretation. The incident model should include frame divergence, stale frame reads, non-deterministic replay, and compiler/runtime disagreement about basis changes.

35.4 Dynamic circuits become runtime policy

OpenQASM 3 includes classical control and feed-forward concepts, and IBM documents the current OpenQASM 3 feature support surface separately from the language specification [R26, R27, R62]. Logical-qubit operations push this further: dynamic behavior becomes a runtime policy mechanism for correction, routing, teleportation, qubit reuse, and escape handling.

DIAGRAM
Diagram loads as you read
35.4 Dynamic circuits become runtime policy · Figure 4
View diagram source
flowchart TB
    Meas[Measurement result] --> Low[Low-latency branch]
    Low --> Basis[Choose basis]
    Low --> Reset[Reset or reuse qubit]
    Low --> Frame[Update frame]
    Low --> Route[Change route]
    Frame --> Audit[Record branch decision]
    Route --> Audit
    Reset --> Audit

Operational guidance:

  1. Separate language support from backend support.
  2. Record every branch that affects interpretation.
  3. Reject workloads that depend on unsupported real-time features.
  4. Prefer explicit latency budgets over vague dynamic-circuit claims.

35.5 Decoder placement is an architecture decision

A remote decoder can be useful for offline experiments. It is not enough for low-latency logical operations. NVIDIA describes NVQLink as a low-latency bridge connecting accelerated compute with quantum processors for control and error-correction workflows [R48]. The broader architectural pattern is vendor-neutral: the decoder path belongs close to the machine when feedback latency matters.

DIAGRAM
Diagram loads as you read
35.5 Decoder placement is an architecture decision · Figure 5
View diagram source
flowchart LR
    QPU[QPU] --> FPGA[Fast control and capture]
    FPGA --> LocalGPU[Local accelerator decoder]
    LocalGPU --> Frame[Frame tracker]
    Frame --> Runtime[Runtime scheduler]
    Runtime --> QPU
    LocalGPU -. sampled traces .-> Offline[Offline analytics cluster]

Placement tradeoff:

Placement Strength Risk
embedded controller lowest latency limited flexibility
local accelerator high throughput and flexible algorithms integration complexity
nearby server easier operations tighter latency ceiling
remote cloud cheap analytics unsuitable for real-time correction

35.6 Logical resources need admission control

Logical qubits are scarce. A request for logical execution should be admitted only if the platform can satisfy distance, lifetime, decoder throughput, and correlation-risk requirements.

DIAGRAM
Diagram loads as you read
35.6 Logical resources need admission control · Figure 6
View diagram source
flowchart TD
    Request[Logical workload request] --> Features[Required logical features]
    Features --> Distance{Distance available?}
    Distance -- no --> Reject[Reject or rescope]
    Distance -- yes --> Lifetime{Lifetime budget ok?}
    Lifetime -- no --> Reject
    Lifetime -- yes --> Decoder{Decoder capacity ok?}
    Decoder -- no --> Queue[Queue or reserve]
    Decoder -- yes --> Run[Run with live health gates]

Admission record:

Illustrative listing · yaml
logical_admission_record:
  workload_id: string
  requested_code_distance: int
  requested_logical_qubits: int
  expected_logical_cycles: int
  target_logical_failure_probability: float
  decoder_latency_budget_us: float
  syndrome_bandwidth_budget_mbps: float
  accepted: bool
  rejection_reason: string | null

35.7 Incident classes

Logical-qubit incidents are not the same as NISQ job failures. They can occur while the logical computation appears to continue.

DIAGRAM
Diagram loads as you read
35.7 Incident classes · Figure 7
View diagram source
flowchart TB
    Incident[Logical incident] --> Stream[Syndrome stream incident]
    Incident --> Decoder[Decoder incident]
    Incident --> Frame[Frame-tracking incident]
    Incident --> Calibration[Calibration drift incident]
    Incident --> Correlation[Correlated-error incident]
    Incident --> Scheduler[Oversubscription incident]

Runbook triggers:

Trigger Default action
decoder backlog above threshold pause admission; preserve syndrome buffers
frame replay mismatch quarantine affected results
logical error spike compare against physical telemetry and recent calibration changes
rare correlated event capture high-resolution trace window; widen exclusion rules
syndrome data loss abort logical service; do not silently continue

35.8 Checklist

Before claiming logical-qubit service quality, require:

  • a declared code family and distance,
  • measured logical error per cycle,
  • decoder latency distribution,
  • syndrome stream loss metrics,
  • frame replay tests,
  • calibration compatibility tests,
  • admission-control policy,
  • incident quarantine rules,
  • archived replay artifacts.
DIAGRAM
Diagram loads as you read
35.8 Checklist · Figure 8
View diagram source
flowchart LR
    Metrics[Metrics] --> Evidence[Evidence package]
    Replay[Replay] --> Evidence
    Admission[Admission policy] --> Evidence
    Incident[Incident rules] --> Evidence
    Evidence --> Claim[Logical-service claim]

Additional technical sources: [R5], [R259], [R260].