arXiv (All)
open access
Transversal gates for quantum CSS codes
In this paper, we focus on the problem of computing the set of diagonal transversal gates fixing a CSS code. We determine the logical actions of these gates and characterize the subgroups that induce tensor products of single-qubit logical gates and logical identities. We describe these groups throu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning Logical Operations for Arbitrary Quantum Error Correction Codes#987686
- Identifying Logical Operations from Syndrome Histories for qLDPC Codes#1491660
- Multiscale Space-Time Ansatz for Correlation Functions of Quantum Systems Based on Quantics Tensor Trains#1312403
- Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms#670276
- Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms#668211
Record · ID 1537157
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive