Homomorphic Quantum Error Correction
Abstract
We study the algebraic compatibility between quantum homomorphic encryption and stabilizer quantum error correction in an honest-but-curious model, restricting the encryption to the transversal block-Pauli mask (XaZb)⊗ n controlled by two secret key bits a and b. We prove a necessary and sufficient criterion for an $[[n,1,d]]$ stabilizer code to remain compatible with this mask, namely that the transversal X and Z operators commute with every stabilizer generator, and we specialize it to a classical-code criterion for Calderbank--Shor--Steane codes. Combining code-space preservation with the logical action of the mask, every stabilizer code falls, with respect to each of the two transversal mask operators, into exactly one of three classes: incompatible, compatible but trivially acting, or compatible with a nontrivial logical Pauli action; the two operators need not fall into the same class. We verify this classification by exact symplectic computation for rotated and planar surface codes, toric codes, triangular and toric color codes, the $[[15,1,3]]$ code and several small codes, and find that the class is fixed by the lattice size and the boundary presentation rather than by the topological phase: the surface-code family realizes all three classes, whereas color codes realize only the two compatible ones. For encrypted computation we show that the Shor code does not implement the logical T gate by a transversal T⊗ 9, whereas suitable triorthogonal codes do so up to a Clifford correction. We formulate logical-Pauli masking as a code-independent algebraic template. Syndrome extraction and recovery are key-independent whenever the mask preserves the code space, so that the client only needs the block size and the class of the code to decrypt.
Related
- High-Rank Encoding Can Improve Approximate Quantum Error Correction
- Hybrid Clifford Codes via Operator Algebra Quantum Error Correction and Projective Representation Theory
- Quantum thermalization achieves optimal approximate quantum error correction
- Theory of approximate quantum error correction and the error-set model
- Classification of bipartite observables III: simplicity, mixtures and quantum error correction
BibTeX
@misc{sen2026homomorphic,
title = {{Homomorphic Quantum Error Correction}},
author = {Kornikar Sen and Miguel A. Martin-Delgado},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2605.25692},
eprint = {2605.25692},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2605.25692},
}
RIS
TY - UNPB
TI - Homomorphic Quantum Error Correction
AU - Kornikar Sen
AU - Miguel A. Martin-Delgado
PY - 2026
DA - 2026/10/26
PB - arXiv
DO - 10.48550/arxiv.2605.25692
UR - https://arxiv.org/abs/2605.25692
AB - We study the algebraic compatibility between quantum homomorphic encryption and stabilizer quantum error correction in an honest-but-curious model, restricting the encryption to the transversal block-Pauli mask (X^aZ^b)^⊗ n controlled by two secret key bits a and b. We prove a necessary and sufficient criterion for an $[[n,1,d]]$ stabilizer code to remain compatible with this mask, namely that the transversal X and Z operators commute with every stabilizer generator, and we specialize it to a classical-code criterion for Calderbank--Shor--Steane codes. Combining code-space preservation with the logical action of the mask, every stabilizer code falls, with respect to each of the two transversal mask operators, into exactly one of three classes: incompatible, compatible but trivially acting, or compatible with a nontrivial logical Pauli action; the two operators need not fall into the same class. We verify this classification by exact symplectic computation for rotated and planar surface codes, toric codes, triangular and toric color codes, the $[[15,1,3]]$ code and several small codes, and find that the class is fixed by the lattice size and the boundary presentation rather than by the topological phase: the surface-code family realizes all three classes, whereas color codes realize only the two compatible ones. For encrypted computation we show that the Shor code does not implement the logical T gate by a transversal T^⊗ 9, whereas suitable triorthogonal codes do so up to a Clifford correction. We formulate logical-Pauli masking as a code-independent algebraic template. Syndrome extraction and recovery are key-independent whenever the mask preserves the code space, so that the client only needs the block size and the class of the code to decrypt.
ER -