Knill-Laflamme bound

Knill-Laflamme bound

[kə¦nil lə¦fläm ¦bau̇nd]
(computer science)
In the theory of quantum computation, a necessary 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 ′ be equal to or larger than 4 M + N.