Pith. sign in

REVIEW 5 cited by

The Smallest Code with Transversal T

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2210.14066 v1 pith:4FH672M4 submitted 2022-10-25 quant-ph

The Smallest Code with Transversal T

classification quant-ph
keywords codetransversalcliffordgateresultsmallestassumptionscorrecting
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We prove that the smallest distance 3 Quantum Error Correcting Code with a transversal gate outside the Clifford group is the well-known 15-qubit Reed-Muller code, also known as a tri-orthogonal code. Our result relies on fewer assumptions than previous works. We further extend this result by finding the minimal code that also possesses any other non Clifford transversal single-qubit gate.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Exploring the landscape of compact magic-state distillation factories

    quant-ph 2026-06 unverdicted novelty 8.0

    Classical codes plus SAT search yield no-go theorems limiting error detection in sub-8-qubit distillation and new minimal-qubit protocols for T-to-T (distances 4-5 on 10-11 qubits) and T-to-CCZ (distances 3-4 on 9-10 qubits).

  2. Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks

    quant-ph 2026-07 accept novelty 7.0

    High-rate CSS codes compile nonlocal Clifford and non-Clifford logical circuits into onsite phases and classical permutations, so MPS bond dimension stays fixed by the encoder while logical entanglement, magic, and no...

  3. Exploring the landscape of compact magic-state distillation factories

    quant-ph 2026-06 accept novelty 7.0

    Classical repetition-code framing plus SAT search yields no-go theorems (no d>3 T-to-T on <8 qubits) and the smallest known unitary factories for d=4,5 T-states (10–11 qubits) and d=3,4 CCZ-states (9–10 qubits).

  4. Learning Logical Operations for Arbitrary Quantum Error Correction Codes

    quant-ph 2026-05 unverdicted novelty 7.0

    A learning-based framework constructs logical operations for arbitrary quantum codes and co-designs non-additive encodings with noise models and desired gate sets via VarEFTQC.

  5. Local distillation from Reed Muller codes unfolding

    quant-ph 2026-05 unverdicted novelty 6.0

    Local 2D and 3D Reed-Muller distillation factories achieve output infidelities down to 8.256e-9 for CCZ states and 1.1811e-17 for T states from 10^{-3} input infidelity.