---
格式版本: 2
标题: "Quantum Codes with Arbitrary Z-Rotation logical Gates and Applications to Fault-Tolerant Code Switching"
原文链接: "https://arxiv.org/abs/2608.11160"
发布日期: "2026-08-11"
发布时间校准状态: "found"
发布时间需复核: "否"
发布时间来源: "rule:local:strict_original_body"
发布时间证据: "**\\[v1\\]** Tue, 11 Aug 2026 17:17:51 UTC (5,113 KB)"
发布时间校准原因: "规则确认唯一严格发布时间，来源 local:strict_original_body"
发布时间校准置信度: "high"
发布时间候选数量: 18
发布时间严格候选数量: 6
发布时间原页读取状态: "source template page reused from URL open"
发布时间未找到原因: ""
发布时间校准时间: "2026-08-12T10:57:33+08:00"
发布时间仲裁状态: "skipped"
发布时间仲裁尝试次数: 0
发布时间仲裁耗时毫秒: 0
发现时间: "2026-08-12T10:56:49+08:00"
入库时间: "2026-08-12T02:57:34.002Z"
来源平台: "arXiv 学术论文搜索"
搜索渠道: "source_template"
搜索词: "https://arxiv.org/search/?query=Meta&searchtype=all"
匹配关键词:
  - "performance"
相关厂家:
  - "Meta"
相关专家:
  []
内容类型: "网页"
抓取工具: "Free Fetch + Defuddle"
清洗工具: "Defuddle Markdown + Defuddle/Readability 正文提取"
原始附件:
  []
AI优质: "否"
AI打分: 5
AI分档: "非优质"
AI质检状态: "不通过"
AI打分理由: "资料为量子物理论文，与超节点/AI Rack/机柜级AI基础设施完全无关。"
AI质检模型: "ali-deepseek-v4-flash"
AI质检时间: "2026-08-12T10:57:38+08:00"
AI主题相关性: 0
AI来源权威性: 5
AI新颖性: 0
AI技术细节: 0
AI商业部署信号: 0
AI完整性: 0
采集批次: "2026年8月12日2点04分20秒"
采集批次ID: "20260812-020420-289"
去重键: "https://arxiv.org/abs/2608.11160"
---

## Quantum Physics

## Title:Quantum Codes with Arbitrary Z-Rotation logical Gates and Applications to Fault-Tolerant Code Switching

[View PDF](https://arxiv.org/pdf/2608.11160) [HTML (experimental)](https://arxiv.org/html/2608.11160v1)

> Abstract:A technique for realizing a universal set of fault-tolerant quantum operations is the code switching method, which leverages two quantum codes with complementary sets of transversal gates. To date, the application of this technique has been largely limited to families of color codes supporting a logical $T$ gate. No analogous code switching protocols exist for many other prominent families, such as rotated surface codes, or for finer $Z$-rotation gates. In this work, we first utilize the doubling technique as a unified framework to construct a class of quantum color codes encoding a single logical qubit with an arbitrarily large minimum distance, enabling the transversal realization of arbitrary small logical $Z$-rotation gates. We investigate the structural properties of this code family, demonstrating that they improve upon the parameters of state-of-the-art triorthogonal codes, achieve lower qubit overhead compared to certain known color codes, and admit single-shot decoding of $Z$-syndromes via meta-checks. Furthermore, we show that this framework extends beyond color codes; specifically, it enables the generation of $r$-orthogonal quantum codes, $r \ge 2$, that inherit the local geometry of rotated surface codes. We then provide an overhead optimization protocol alongside several candidate codes tailored for realizing logical $Z$-rotation gates within rotated surface codes. Finally, we extend the fault-tolerant code switching protocol based on transversal CNOT gates to incorporate fault-tolerant realization of $Z$-rotation gates at any level of the Clifford hierarchy for geometries compatible with rotated surface codes. We present the first demonstration of fault-tolerant magic state preparation by means of code switching within a distance-three rotated surface code using a total footprint of only 45 physical qubits, and evaluate its performance through a simulation.

| Subjects: | Quantum Physics (quant-ph); Information Theory (cs.IT) |
| --- | --- |
| MSC classes: | 94B05, 94B15, 81P70 |
| Cite as: | [arXiv:2608.11160](https://arxiv.org/abs/2608.11160) \[quant-ph\] |
|  | (or [arXiv:2608.11160v1](https://arxiv.org/abs/2608.11160v1) \[quant-ph\] for this version) |
|  | [https://doi.org/10.48550/arXiv.2608.11160](https://doi.org/10.48550/arXiv.2608.11160) |

## Submission history

From: Reza Dastbasteh \[[view email](https://arxiv.org/show-email/295a70eb/2608.11160)\]  
**\[v1\]** Tue, 11 Aug 2026 17:17:51 UTC (5,113 KB)

[Which authors of this paper are endorsers?](https://arxiv.org/auth/show-endorsers/2608.11160) | Disable MathJax ([What is MathJax?](https://info.arxiv.org/help/mathjax.html))
