Uniqueness of Complementary Recovery in Holographic Error-Correcting Codes
Abstract
Holographic codes are a type of error-correcting code with extra geometric structure ensured by a ``complementary recovery'' property: given a division of the physical Hilbert space into and , and an algebra of physical operators , the logical operators in which can be created by acting in are identical to the logical operators whose expectation values cannot be altered by acting in the commutant , and vice versa. In arXiv:2110.14691, a uniqueness theorem was stated: the only possible tuple of (code, bipartition, algebra) which can exhibit complementary recovery is the maximal one . We point out a counterexample to this result, using a ``non-adjacent'' bipartition of a four-qubit code proposed in arXiv:2110.14691. We show that the failure of uniqueness is due to a failure to enforce error correction against erasure of , which requires enforcing the algebraic Knill-Laflamme condition for each pair of error operators. When we add the additional requirement that be correctable with respect to this channel, uniqueness is restored, and we re-prove the theorem of arXiv:2110.14691 with this added assumption. We present the list of bipartitions of the ``atomic'' holographic codes in arXiv:2110.14691 in which the correctability assumption can be violated.
Cite
@article{arxiv.2509.19299,
title = {Uniqueness of Complementary Recovery in Holographic Error-Correcting Codes},
author = {Julia Jones and Jason Pollack},
journal= {arXiv preprint arXiv:2509.19299},
year = {2025}
}
Comments
19 pages, 4 figures, 1 table: submitted to QIP 2026, comments welcome