{"id":"palomar/PALOMAR-2026-11-15-000005","url":"https://github.com/zblore/knill-laflamme-lean/tree/f680e2d5f616bb423fb814f1471b07387729fffd","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-15-000005-v1.json","repo":"https://github.com/zblore/knill-laflamme-lean","tags":["quant-ph","msc:81P73","msc:81P47"],"score":1,"title":"The Knill-Laflamme theorem: a set of errors is correctable on a quantum code exactly when P E_i^† E_j P = c_ij P","trust":"high","domain":"quant-ph","source":"palomar","authors":["Zayn Blore"],"reviews":0,"subject":"quant-ph","summary":"A machine-checked proof of the Knill-Laflamme theorem for finite-dimensional quantum codes, in two forms. For a nonzero code given by an orthogonal projector P and a finite family of arbitrary error matrices E_i, the condition P E_i^† E_j P = c_ij P for some matrix c holds if and only if some quantum channel, with any finite number of Kraus operators, undoes each error on every code state up to its own scalar (knill_laflamme), and also if and only if some channel undoes the combined noise rho -> sum_i E_i rho E_i^† up to a scalar (knill_laflamme_sum). The errors need not form a channel. The…","category":"research","comments":0,"disputed":false,"division":"physics","mentions":0,"verified":true,"discussed":0,"published":"2026-11-15","reactions":{"up":1},"formalized":true,"formalizes":[{"title":"Quantum Computation and Quantum Information","identifier":"https://doi.org/10.1017/CBO9780511976667","relationship":"adapts"}]}