Physics Stack Exchange is a question and answer site for active researchers, academics and students of physics. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What is the code distance in quantum information theory? Code distance seems to be a very important concept in fault tolerant quantum computation and topological quantum computation.

share|cite|improve this question
Since this is way out of my field of expertise I will not presume to answer, but the link provided in another question defines also the code distance as "The distance k of the code C is the minimal length among the elements of Z(S)\S up to a sign. Such elements serve as encoded logical operations. For an efficient encoding we thus assume that the errors are less than [k/2]-local." – anna v Jun 3 '12 at 11:36
Thanks for the link. The code distance suppose to be a distance between two objects. But what are these two objects? – Xiao-Gang Wen Jun 3 '12 at 11:53
still wading: at 2.1.1 "A general k-local operator O is an operator that acts non-trivially to at most k subsystems of H (also known as operator of length k)." seems to define length for a local operator. So one has to count the subsystems of H on which the operator acts non trivially to get its length, I guess. – anna v Jun 3 '12 at 13:28

Rather than give a more mathematical answer, to which I'll refer you to another answer, let me give you slightly less precise explanation. Basically, the distance is the shortest path in a certain "space of errors" which maps between two orthogonal quantum states that are in the code. The natural space of errors is that of single qubit errors of the form $\sigma_X$, $\sigma_Y$ or $\sigma_z$, in the case where the Hilbert space is that of $n$ qubits. So you can think of distance as the shortest path to get from one state to another by operations on single qubits, applied one at a time sequentially.

share|cite|improve this answer
If two states can be connected by a sequence of $\sigma_X$, $\sigma_Y$, and $\sigma_Z$ operations, then the code distance is the minimal number of the single qubit operations that transform one state into the other. But if two states can NOT be connected by a sequence of $\sigma_X$, $\sigma_Y$, and $\sigma_Z$ operations, can we still define the code distance? – Xiao-Gang Wen Jun 6 '12 at 2:29

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.