The authors combine noise symmetries (iid, isotropic, Choi) with the extension symmetry of a known AQEC bounding hierarchy, add a measurement-based rounding that converts outer bounds into certified codes, and demonstrate the framework on three-qubit codes under symmetric noise.
Semidefinite programming hierarchies for constrained bilinear optimization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
On approximate quantum error correction for symmetric noise
The authors combine noise symmetries (iid, isotropic, Choi) with the extension symmetry of a known AQEC bounding hierarchy, add a measurement-based rounding that converts outer bounds into certified codes, and demonstrate the framework on three-qubit codes under symmetric noise.