Pith. sign in

REVIEW 6 cited by

Quantum Codes with Addressable and Transversal Non-Clifford Gates

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 2502.01864 v3 pith:UJCAOOYT submitted 2025-02-03 quant-ph cs.ITmath.IT

classification quant-phcs.ITmath.IT
keywords gateslogicaladdressablemathsftransversalcodestextitframework
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

The development of quantum codes with good error correction parameters and useful sets of transversal gates is a problem of major interest in quantum error-correction. Abundant prior works have studied transversal gates which are restricted to acting on all logical qubits simultaneously. In this work, we study codes that support transversal gates which induce $\textit{addressable}$ logical gates, i.e., the logical gates act on logical qubits of our choice. As we consider scaling to high-rate codes, the study and design of low-overhead, addressable logical operations presents an important problem for both theoretical and practical purposes. Our primary result is the construction of an explicit qubit code for which $\textit{any}$ triple of logical qubits across one, two, or three codeblocks can be addressed with a logical $\mathsf{CCZ}$ gate via a depth-one circuit of physical $\mathsf{CCZ}$ gates, and whose parameters are asymptotically good, up to polylogarithmic factors. The result naturally generalizes to other gates including the $\mathsf{C}^{\ell} Z$ gates for $\ell \neq 2$. Going beyond this, we develop a formalism for constructing quantum codes with $\textit{addressable and transversal}$ gates. Our framework, called $\textit{addressable orthogonality}$, encompasses the original triorthogonality framework of Bravyi and Haah (Phys. Rev. A 2012), and extends this and other frameworks to study addressable gates. We demonstrate the power of this framework with the construction of an asymptotically good qubit code for which $\textit{pre-designed}$, pairwise disjoint triples of logical qubits within a single codeblock may be addressed with a logical $\mathsf{CCZ}$ gate via a physical depth-one circuit of $\mathsf{Z}$, $\mathsf{CZ}$ and $\mathsf{CCZ}$ gates. In an appendix, we show that our framework extends to addressable and transversal $T$ gates, up to Clifford corrections.

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. Transversal non-Clifford gates on almost-good quantum LDPC and quantum locally testable codes

    quant-ph 2026-04 conditional novelty 7.5 of 10

    Almost-good qLDPC and qLTC codes admit nontrivial transversal logical multi-controlled-Z gates via cohomological cup products and two-way product-expanding punctured Reed–Solomon local codes.

  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. Parallel Logical Measurements via Quantum Code Surgery

    quant-ph 2025-03 unverdicted novelty 7.0 of 10

    A new code surgery protocol measures t logically disjoint Pauli products on any LDPC code using O(t ω (log t + log³ω)) ancillas in O(d) time while preserving LDPC property and fault distance.

  4. Intrinsic locality dimension of quantum codes

    quant-ph 2026-05 unverdicted novelty 6.0 of 10

    Introduces intrinsic locality dimension for stabilizer codes and uses it to prove general bounds on code parameters and fault-tolerant logical gates, generalizing prior topological code results.

  5. No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits

    quant-ph 2026-02 reject novelty 6.0 of 10

    No stabilizer code can implement the full logical Clifford group on multiple logical qubits using transversal gates, fold-transversal gates beyond two qubits, or code automorphisms.

  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