Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings
Tania Sidana, Navin Kashyap

TL;DR
This paper introduces a new framework for constructing entanglement-assisted quantum error-correcting codes from classical additive codes over local Frobenius rings, extending existing results and providing explicit formulas for code parameters.
Contribution
It develops a standard form construction for additive codes over Frobenius rings and derives exact formulas for entanglement requirements, advancing quantum coding theory over rings.
Findings
Provides a standard form for additive codes over Frobenius rings.
Derives exact entanglement requirements for Galois ring-based codes.
Shows how adding coordinates influences code parameters.
Abstract
In this paper, we provide a framework for constructing entanglement-assisted quantum error-correcting codes (EAQECCs) from classical additive codes over a finite commutative local Frobenius ring . At the heart of the framework, and this is one of the main technical contributions of our paper, is a procedure to construct, for an additive code over , a generating set for that is in standard form, meaning that it consists purely of isotropic generators and hyperbolic pairs. Moreover, when is a Galois ring, we give an exact expression for the minimum number of pairs of maximally entangled qudits required to construct an EAQECC from an additive code over , which significantly extends known results for EAQECCs over finite fields. We also demonstrate how adding extra coordinates to an additive code can give us a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
