9
$\begingroup$

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.

$\endgroup$
3
  • $\begingroup$ Since this is way out of my field of expertise I will not presume to answer, but the link provided in another question qip2010.ethz.ch/tutorialprogram/JiannisPachosLecture 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." $\endgroup$
    – anna v
    Jun 3, 2012 at 11:36
  • $\begingroup$ Thanks for the link. The code distance suppose to be a distance between two objects. But what are these two objects? $\endgroup$ Jun 3, 2012 at 11:53
  • $\begingroup$ 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. $\endgroup$
    – anna v
    Jun 3, 2012 at 13:28

1 Answer 1

5
$\begingroup$

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.

$\endgroup$
2
  • 1
    $\begingroup$ 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? $\endgroup$ Jun 6, 2012 at 2:29
  • 1
    $\begingroup$ The code distance can be defined in terms of the weight of the correctible Kraus operators using the Knill-Laflamme quantum error correction criterion. For example, a rigorous definition in this framework can be found in Page 2 of the reference: sciencedirect.com/science/article/pii/… or arxiv.org/abs/1604.07925 $\endgroup$ Oct 30, 2017 at 4:30

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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