Pith. sign in

REVIEW 6 cited by

Asymptotically Good Quantum Codes with Addressable and Transversal Non-Clifford Gates

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2507.05392 v1 pith:BYOCOFEH submitted 2025-07-07 quant-ph

Zhiyang He , Vinod Vaikuntanathan , Adam Wills , Rachel Yun Zhang This is my paper
classification quant-ph
keywords gatescodesquantumaddressablegoodlogicalmathsfqubits
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Constructing quantum codes with good parameters and useful transversal gates is a central problem in quantum error correction. In this paper, we continue our work in arXiv:2502.01864 and construct the first family of asymptotically good quantum codes (over qubits) supporting transversally addressable non-Clifford gates. More precisely, given any three logical qubits across one, two, or three codeblocks, the logical $\mathsf{CCZ}$ gate can be executed on those three logical qubits via a depth-one physical circuit of $\mathsf{CCZ}$ gates. This construction is based on the transitive, iso-orthogonal algebraic geometry codes constructed by Stichtenoth (IEEE Trans. Inf. Theory, 2006). This improves upon our construction from arXiv:2502.01864, which also supports transversally addressable $\mathsf{CCZ}$ gates and has inverse-polylogarithmic rate and relative distance.

Discussion (0). Sign in to comment.

Forward citations

Cited by 6 Pith papers

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

  1. Restrictions on non-Clifford fault tolerance and ruling out beyond-SQL quantum metrology

    quant-ph 2026-07 conditional novelty 7.0 of 10

    Constant signal-aligned noise makes asymptotic beyond-SQL quantum sensing impossible for any protocol, including encoded, biased, adaptive, and nonstabilizer schemes.

  2. Construction of the full logical Clifford group for high-rate quantum Reed-Muller codes using only transversal and fold-transversal gates

    quant-ph 2026-02 accept novelty 7.0 of 10

    High-rate self-dual quantum Reed–Muller codes admit ancilla-free addressable Clifford gates generated by transversal H and fold-transversal phase gates.

  3. Rigorous no-go theorems for heralded linear-optical state generation tasks

    quant-ph 2026-02 conditional novelty 6.0 of 10

    Applying the NulLA algorithm proves no-go theorems for heralded linear-optical state generation, showing e.g. that Bell states need ≥4 input photons and a heralded CNOT gate needs ≥2 ancilla photons.

  4. Sequences of Bivariate Bicycle Codes from Covering Graphs

    quant-ph 2025-11 conditional novelty 6.0 of 10

    Bivariate bicycle quantum codes form infinite families via graph covers: the [[144,12,12]] gross code is a double cover of [[72,12,6]], with logical-operator lifting and parameter bounds.

  5. Native Non-Clifford Gates in Quantum LDPC Codes: Conditions, Synthesis, and Scaling Limits

    quant-ph 2026-01 reject novelty 4.0 of 10

    The main theorem claiming constant-depth logical CCZ gates exist from many 'magic-friendly triples' has mutually inconsistent hypotheses, and its key local-implementation step is unproved.

  6. A Review of Galois Qudits

    quant-ph 2026-05 unverdicted novelty 2.0 of 10

    A review that defines Galois qudits over binary extension fields, their Clifford hierarchies, Pauli measurements, stabilizer tableaux, qubit mappings, and quantum Reed-Solomon codes.

Pith tools