Physical and Logical Qubits¶

The quantum-computing layer boundary that realizes an algorithm-facing qubit as encoded states and operations in noisier physical degrees of freedom.

Version: v3 · 2026-09-06 · History
Domain-specific #: 2485
Origin domain: quantum information
Subdomain: quantum error correction
Aliases: Physical-logical qubit distinction, Physical versus logical qubits

Core Idea¶

Physical and logical qubits names a layer distinction in quantum computing. A physical qubit is a controllable physical degree of freedom used through a two-dimensional computational subspace: for example, selected levels of a superconducting circuit, an ion, a spin, or a photonic mode. A logical qubit is the two-dimensional information interface on which an algorithm's states, gates, and measurements are defined. In error-corrected computation that interface is encoded in a larger physical Hilbert space so that specified physical faults can be detected or corrected without learning the encoded amplitudes.

Scope of Application¶

The home domain is quantum information, especially quantum error correction, fault-tolerant quantum computation, and quantum-computer architecture. The distinction recurs in code theory, experimental demonstrations, hardware roadmaps, compiler and resource-estimation stacks, decoder design, benchmarking, and comparisons of protected memories and logical gates.

In coding theory, \([[n,k,d]]\) parameters state how many logical qubits are embedded in how many physical qubits and how distance constrains correctability. In stabilizer practice, check operators define the code space and repeated syndrome measurements supply evidence for a decoder.

Clarity¶

The distinction prevents three common denominator errors.

First, “qubit count” is ambiguous. A processor with \(N\) addressable physical qubits does not thereby provide \(N\) useful fault-tolerant logical qubits. The code, target logical error, check ancillas, connectivity, leakage handling, and logical operation set determine the conversion. Reports should say whether a count refers to data carriers, all physical devices used in a code cycle, encoded qubits, or algorithmic logical qubits.

Manages Complexity¶

The abstraction compresses a large quantum control system into an algorithm-facing unit. Without the layer boundary, an algorithm designer would need to reason about every microwave pulse, ion interaction, stabilizer measurement, decoder decision, and calibration drift. With it, a logical-qubit contract can state supported logical gates, measurements, latency, and effective failure probabilities while the lower layer remains replaceable within those guarantees.

Abstract Reasoning¶

The abstraction supports a standard sequence of inferences.

Given a code projector \(P\) and candidate errors \(\{E_a\}\), test the Knill–Laflamme condition. If it holds, a recovery channel exists for that error set; this does not yet show that a noisy fault-tolerant implementation realizes the recovery reliably. For a nondegenerate \([[n,k,d]]\) code, distance \(d\) permits correction of arbitrary errors on at most \(t=\lfloor(d-1)/2\rfloor\) physical qubits.

Knowledge Transfer¶

Within quantum computing, the same roles transfer across implementations:

transmons, trapped ions, spins, photons, neutral atoms, and oscillator modes occupy the physical carrier role;
stabilizer, subsystem, surface, color, concatenated, bosonic, and erasure codes occupy the encoding/protection scheme role;
parity checks, photon parity, gauge measurements, and flag circuits occupy the syndrome channel role;
minimum-weight matching, belief propagation, lookup, and learned decoders occupy the inference/recovery role;
transversal gates, code deformation, lattice surgery, braiding, teleportation, and calibrated oscillator controls occupy the logical operation role.

Relationships to Other Abstractions¶

Current abstraction Physical and Logical Qubits Domain-specific

Parents (1) — more general patterns this builds on

Physical and Logical Qubits is a kind of Fault Tolerance Prime

Fault Tolerance is the minimal prospective parent.

Children (1) — more specific cases that build on this

Charge Qubit Domain-specific is a kind of Physical and Logical Qubits

Charge Qubit specializes Physical and Logical Qubits at the physical-carrier layer.

Hierarchy paths (3) — routes to 3 parentless roots

Physical and Logical Qubits → Fault Tolerance → Robustness

Show alternative paths (2)

Neighborhood in Abstraction Space¶

Physical and Logical Qubits sits in a sparse region of the domain-specific corpus (85^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Quantum Communication & Benchmarking (6 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08