Towers of generalized divisible quantum codes
Jeongwan Haah

TL;DR
This paper introduces a generalized method for constructing quantum error-correcting codes with transversal gates at higher levels of the Clifford hierarchy, expanding the capabilities of fault-tolerant quantum computation.
Contribution
It generalizes divisibility conditions for CSS codes, enabling the construction of codes with transversal gates at higher Clifford hierarchy levels and improved parameters.
Findings
Constructed CSS codes with divisor $2^{ u+1}$ from codes with divisor $2^ u$.
Achieved codes with parameters $[[O(d^{ u-1}), \, ext{Omega}(d),d]]$ for large $d$ and $ u \, \ge 2$.
Introduced a conversion method from Clifford measurement-based to transversal $T$-gate-based magic state distillation.
Abstract
A divisible binary classical code is one in which every code word has weight divisible by a fixed integer. If the divisor is for a positive integer , then one can construct a Calderbank-Shor-Steane (CSS) code, where -stabilizer space is the divisible classical code, that admits a transversal gate in the -th level of Clifford hierarchy. We consider a generalization of the divisibility by allowing a coefficient vector of odd integers with which every code word has zero dot product modulo the divisor. In this generalized sense, we construct a CSS code with divisor and code distance from any CSS code of code distance and divisor where the transversal is a nontrivial logical operator. The encoding rate of the new code is approximately times smaller than that of the old code. In particular, for large and , our…
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.
