Questions: Surface Codes

Question 1

Why are surface codes favored for practical quantum computing implementations over other stabilizer codes?

• A. They require the fewest physical qubits per logical qubit
• B. They have the highest known error threshold and require only local 2D interactions, matching the geometry of superconducting qubit chips
• C. They can correct errors without any classical processing
• D. They do not require syndrome measurement

Answer: (B)

Surface codes have two practical advantages: (1) stabilizer measurements involve only nearest-neighbor qubits on a 2D grid, matching the physical layout of leading hardware platforms like superconducting circuits, and (2) they have high error thresholds (~1%), meaning they tolerate relatively noisy gates. They are NOT the most qubit-efficient — they use O(d^2) qubits for distance d, which is worse than some other codes. But practical implementability outweighs qubit count.

Question 2

In a surface code, logical errors correspond to chains of physical errors that span the entire lattice from one boundary to the opposite boundary.

• T. True
• F. False

Answer: True

A logical X error on the surface code is a chain of X operators connecting the left and right boundaries; a logical Z error connects top and bottom boundaries. Such chains commute with all stabilizers (they are undetectable) and implement nontrivial logical operations. This is why increasing the code distance d (lattice size) exponentially suppresses logical error rates: a chain spanning the lattice requires O(d) physical errors, and the probability of d correlated errors scales as p^d for independent noise at rate p.

Question 3

What is the error threshold of a surface code, and what does it mean practically?

Model answer: The error threshold is the physical error rate below which increasing the code distance d decreases the logical error rate exponentially. For the surface code, this threshold is approximately 1% per gate. If physical error rates are below this threshold, arbitrarily reliable quantum computation is possible by using larger surface codes. Above the threshold, increasing the code size actually makes things worse because errors accumulate faster than the code can correct them.

The threshold is a phase transition in the code's error-correcting ability. Below threshold, the logical error rate scales as (p/p_threshold)^(d/2), so doubling d squares the suppression factor. The ~1% threshold is achievable by current superconducting qubit technology (which has reached physical error rates of ~0.1-0.5%), making surface codes the most practical path to fault-tolerant quantum computing, though the qubit overhead (millions of physical qubits for cryptographically relevant computations) remains a major engineering challenge.