Gilbert-Varshamov bound


Gilbert-Varshamov bound

[¦gil·bərt‚vär¦sha·məv ¦bau̇nd] (computer science) In the theory of quantum computation, a sufficient condition for an algorithm that encodes N logical qubits into N ? carrier qubits (with N ? larger than N) to correct any error on any M carrier qubits; namely, that N / N ? be smaller than 1 - 2[-x log2 x - (1 -x) log2(1 - x)], where x = 2 M / N ?.