Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes

中文速览 本文介绍了一类名为“三变量三轮车”(Trivariate Tricycle, TT)码的新型量子低密度奇偶校验码(qLDPC)。该构造方法推广了现有的双变量双轮车码,通过使用基于三个三变量多项式的长度为3的链复形来定义CSS码。这种代数结构天然地赋予了TT码一系列优越特性:首先,它们存在“元校验”(meta-check),使得在Z基下能够实现单次解码(single-shot decoding),从而显著降低解码的时间开销。其次,数值搜索发现了参数远超三维环面码(3D Toric Code)的实例,在同等逻辑比特数和码距下,数据比特开销最多可减少48倍。此外,所有TT码都拥有一组丰富的容错逻辑门,包括码块内部的移位自同构和码块之间的横向CZ门。最重要的是,通过选择特定的多项式(如权重为2的多项式),该构造可以实现常数深度的逻辑CCZ门,这是实现通用容错量子计算的关键。总而言之,TT码提供了一个统一的框架,将高编码率、高效解码和丰富的逻辑门操作等多种理想特性结合在一起,为构建实用化的容错量子计算机提供了有力的候选方案。 English Research Briefing Research Briefing: Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes 1. The Core Contribution This paper introduces Trivariate Tricycle (TT) codes, a new family of quantum Low-Density Parity Check (qLDPC) codes that systematically combine multiple highly desirable features for fault-tolerant quantum computing. The central thesis is that by generalizing the algebraic construction of previous qLDPC codes into a three-dimensional framework based on trivariate polynomials, it is possible to create codes that simultaneously possess high thresholds, partial single-shot decodability, a rich set of transversal Clifford gates, and, for certain sub-constructions, constant-depth non-Clifford CCZ gates. The primary conclusion is that this unified construction yields codes with significantly lower qubit overheads than established benchmarks like the 3D Toric Code, presenting a powerful new avenue for designing efficient and practical quantum computer architectures. ...

August 17, 2025 · 9 min · 1895 words · ArXiv Intelligence Bot

Magic tricycles: efficient magic state generation with finite block-length quantum LDPC codes

中文速览 本文提出了一类名为“三轮车编码”(tricycle codes)的新型有限码长量子低密度奇偶校验码(qLDPC)。其核心贡献在于将高编码率、高纠错距离、横向CCZ非克利福德门以及“单次”(single-shot)纠错特性独特地结合在一起。这种组合实现了一种高效、确定性且无需后选择的魔法态蒸馏方案。该方案仅需一轮纠错即可完成逻辑初态的制备,并在恒定电路深度内生成高保真度的魔法态,从而显著降低了实现通用容错量子计算所需的核心资源开销,为解决当前魔法态制备的巨大时空成本问题提供了切实可行的路径。 English Research Briefing Research Briefing: Magic tricycles: efficient magic state generation with finite block-length quantum LDPC codes 1. The Core Contribution This paper introduces “tricycle codes,” a novel class of finite block-length quantum low-density parity-check (qLDPC) codes designed for efficient magic state generation. The central thesis is that by systematically constructing codes that simultaneously possess good distance and rate, admit a transversal logical Controlled-Controlled-Z (CCZ) gate, and feature an intrinsic “single-shot” error correction capability, it is possible to create a highly efficient magic state factory. The primary conclusion is that this synergy enables a deterministic, constant-depth distillation protocol that prepares high-fidelity magic states with only a single round of error correction, thereby providing a practical solution to the substantial space-time overhead that currently plagues universal fault-tolerant quantum computation. ...

August 15, 2025 · 9 min · 1721 words · ArXiv Intelligence Bot