Quantum Gilbert-Varshamov Bound Through Symplectic Self-Orthogonal Codes
Lingfei Jin, Chaoping Xing

TL;DR
This paper establishes a Gilbert-Varshamov bound for symplectic self-orthogonal codes, leading to a new bound for quantum codes, using counting arguments to advance quantum coding theory.
Contribution
It introduces a Gilbert-Varshamov bound for symplectic self-orthogonal codes and derives a new bound for quantum codes, expanding theoretical limits in quantum error correction.
Findings
Derived Gilbert-Varshamov bound for symplectic self-orthogonal codes
Established Gilbert-Varshamov bound for quantum codes
Used counting arguments to achieve bounds
Abstract
It is well known that quantum codes can be constructed through classical symplectic self-orthogonal codes. In this paper, we give a kind of Gilbert-Varshamov bound for symplectic self-orthogonal codes first and then obtain the Gilbert-Varshamov bound for quantum codes. The idea of obtaining the Gilbert-Varshamov bound for symplectic self-orthogonal codes follows from counting arguments.
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
