Pith. sign in

REVIEW 4 cited by

Clifford gates with logical transversality for self-dual CSS codes

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 2503.19790 v1 pith:R3APCJXR submitted 2025-03-25 quant-ph

classification quant-ph
keywords logicalgatescodestransversalbigotimesphysicalself-dualcode
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical gate of a high-rate code can be fault-tolerantly implemented using transversal physical gates, but its logical operation may depend on the choice of a symplectic basis that defines logical Pauli operators of the code. In this work, we focus on $[\![n,k,d]\!]$ self-dual Calderbank-Shor-Steane (CSS) codes with $k \geq 1$ and prove necessary and sufficient conditions for the code to have a symplectic basis such that (1) transversal logical Hadamard gates $\bigotimes_{j=1}^{k} \bar{H}_j$ can be implemented by transversal physical Hadamard gates $\bigotimes_{i=1}^{n} H_i$, and (2) for any $(a_1,\dots,a_k)\in\{-1,1\}^k$, transversal logical phase gates $\bigotimes_{j=1}^{k} \bar{S}_j^{a_j}$ can be implemented by transversal physical phase gates $\bigotimes_{i=1}^{n} S_i^{b_i}$ for some $(b_1,\dots,b_n)\in\{-1,1\}^n$. Self-dual CSS codes satisfying the conditions include any codes with odd $n$. We also generalize the idea to concatenated self-dual CSS codes and show that certain logical Clifford gates have multiple transversal implementations, each by logical gates at a different level of concatenation. Several applications of our results for fault-tolerant quantum computation with low overhead are also provided.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Beyond transversality: structure of Clifford circuits for CSS codes

    quant-ph 2026-08 conditional novelty 8.0 of 10

    Every code-preserving Clifford circuit for a CSS code is a product of Z-diagonal and X-diagonal circuits, and two-fold transversal circuits realize the full logical Clifford group for 78 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. Quantum codes from classical annealing

    quant-ph 2026-07 conditional novelty 6.0 of 10

    A simulated-annealing search over CSS and SWEL stabilizer codes finds moderate-length codes (n≤50) with distances at or above the quantum Gilbert-Varshamov bound, and publishes the resulting stabilizers.

  4. VideoEraser: Concept Erasure in Text-to-Video Diffusion Models

    cs.CV 2025-08 unverdicted novelty 5.0 of 10

    A training-free, two-stage erasure method (prompt embedding adjustment plus adversarial noise guidance) is claimed to cut unwanted text-to-video output by 46%, but the submitted full text is an unrelated quantum-coding paper.

Pith tools