Extending Construction X for Quantum Error-Correcting Codes
Akshay Degwekar, Kenza Guenda, T. Aaron Gulliver
TL;DR
This paper extends a construction method for quantum error-correcting codes to larger finite fields and applies it to Hermitian cyclic codes, resulting in new quantum codes with potentially improved properties.
Contribution
The paper introduces an extension of Construction X to finite fields of order p^2 and applies it to dual Hermitian cyclic codes for new quantum code generation.
Findings
Extended Construction X to p^2 finite fields
Generated new quantum codes from Hermitian cyclic codes
Demonstrated applicability to dual codes
Abstract
In this paper we extend the work of Lisonek and Singh on construction X for quantum error-correcting codes to finite fields of order $p^2^ where p is prime. The results obtained are applied to the dual of Hermitian repeated root cyclic codes to generate new quantum error-correcting codes.
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 · Coding theory and cryptography · Quantum-Dot Cellular Automata