Logical Operators
A logical operator is an operation on the encoded qubit: it must transform the codewords the way and transform a bare qubit, while leaving the codespace as a whole invariant. The stabilizer formalism pins down exactly which physical Pauli strings qualify.
The defining requirements
For a stabilizer code with group encoding logical qubits, the logical Pauli operators are elements of the normalizer that are not in , chosen to satisfy the qubit commutation relations:
Two conditions, two physical meanings:
- Commute with all stabilizers. This guarantees map the codespace to itself — they act within the code, not out of it, and produce no syndrome.
- Anticommute with each other (). This is what makes them a real qubit's operators: a logical and logical must satisfy just like the Pauli matrices do.
Defined only up to stabilizers
A logical operator is not unique. Multiplying by any stabilizer gives another valid representative , since acts as identity on codewords. We exploit this freedom to find a low-weight representative; the minimum weight over all representatives of any nontrivial logical operator is the code distance .
Example: the bit-flip code
For the three-qubit bit-flip code with :
Check: commutes with both -type stabilizers (all 's commute) and commutes with and because each overlap is on an even number of qubits. But and overlap on qubit 1 alone, so they anticommute — exactly the qubit algebra we need.
Try it
Verify, in the symplectic formalism, that for the bit-flip code and each commute with both stabilizer generators and anticommute with each other. The grader checks your computed commutation counts.
Sign in on the full site to ask questions and join the discussion.