A class of quantum synchronizable codes of length $2^n$ over ${\rm F}_q$
Shiwen Sun, Tongjiang Yan, Yuhua Sun, Tao Wang, Xueting Wang

TL;DR
This paper introduces a new class of quantum synchronizable codes of length 2^n that utilize cyclotomic cosets, achieving optimal synchronization correction capabilities up to the theoretical maximum.
Contribution
The paper constructs a novel class of quantum synchronizable codes of length 2^n using cyclotomic cosets, with synchronization capabilities reaching the upper bound.
Findings
Codes achieve maximum synchronization correction of 2^n
Construction method based on cyclotomic cosets
Enhances quantum error correction and synchronization
Abstract
Quantum synchronizable codes (QSCs) are special quantum error-correcting codes which can be used to correct the effects of quantum noise on qubits and misalignment in block synchronization. In this paper, a new class of quantum synchronizable codes of length are constructed by using the cyclotomic cosets, whose synchronization capabilities always reach the upper bound .
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-Dot Cellular Automata · Coding theory and cryptography
