Papers
Topics
Authors
Recent
Search
2000 character limit reached

Invariant Theory and Magic State Distillation

Published 17 Jan 2025 in quant-ph, cs.IT, hep-th, and math.IT | (2501.10163v2)

Abstract: We show that the performance of a linear self-orthogonal $GF(4)$ code for magic state distillation of Bravyi and Kitaev's $|T\rangle$-state is characterized by its simple weight enumerator. We compute weight enumerators of all such codes with fewer than 20 qubits and find none whose threshold exceeds that of the 5-qubit code. Using constraints on weight enumerators from invariant theory and linear programming, we establish bounds on the exponent characterizing noise suppression of a $|T\rangle$-state distillation protocol. We also obtain new non-negativity constraints on such weight enumerators by demanding consistency of the associated magic state distillation routine. These constraints yield new bounds on the distances of classical Hermitian self-dual and maximal self-orthogonal linear $GF(4)$ codes, notably proving the nonexistence of such codes with parameters $[12m, 6m, 4m+2]_{GF(4)}$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.