非Clifford和可平行化的容错逻辑门在常数和近常数率的同调量子低密度奇偶校验码上的应用通过更高对称性
Non-Clifford and parallelizable fault-tolerant logical gates on constant and almost-constant rate homological quantum LDPC codes via higher symmetries
AI总结:
本文提出了一种基于更高对称性的方法,在常数和近常数率的同调量子LDPC码上实现非Clifford和可平行化的容错逻辑门。
摘要:
我们研究了在具有常数或近常数编码率的3流形上定义的同调量子低密度奇偶校验(LDPC)码家族中的并行容错量子计算。我们推导出一般公式,用于色码在一般3流形上的横向T门,其作用为任何三逻辑量子比特的集体非Clifford逻辑CCZ门,其中每个逻辑量子比特的逻辑-X膜在单一点处具有Z2三交点。三交点数是一个拓扑不变量,它也出现在拓扑量子场论中涌现的更高对称性算符的路径积分中:Z2^3规范理论。此外,色码的横向S门对应于在codimension-1子流形上支持的更高形式对称性,从而产生指数级可寻址和可并行化的逻辑CZ门。我们还为任意3流形上的三个相同扭码的构造展示了通过杯积上同调操作实现上述逻辑门的常深度电路的构造。我们开发了一个通用的框架来计算3流形的三交点不变量。我们进一步开发了三种类型的LDPC码,支持此类逻辑门:(1)一个准双曲码,由2D双曲面和圆的乘积构成,具有近常数率k/n=O(1/log(n))和O(log(n))距离;(2)一个同调纤维束码,具有O(1/log^(1/2)(n))的速率和O(log^(1/2)(n))的距离;(3)一个特定的3D双曲码家族:Torelli映射筒码,由Torelli子群中的伪Anosov元素的映射筒构造而成,具有常数速率,而距离的标度目前未知。然后,我们展示了一个通用的常开销方案,用于应用带有逻辑-X测量辅助的并行化通用门集。
英文摘要:
We study parallel fault-tolerant quantum computing for families of homological quantum low-density parity-check (LDPC) codes defined on 3-manifolds with constant or almost-constant encoding rate. We derive generic formula for a transversal $T$ gate of color codes on general 3-manifolds, which acts as collective non-Clifford logical CCZ gates on any triplet of logical qubits with their logical-$X$ membranes having a $\mathbb{Z}_2$ triple intersection at a single point. The triple intersection number is a topological invariant, which also arises in the path integral of the emergent higher symmetry operator in a topological quantum field theory: the $\mathbb{Z}_2^3$ gauge theory. Moreover, the transversal $S$ gate of the color code corresponds to a higher-form symmetry supported on a codimension-1 submanifold, giving rise to exponentially many addressable and parallelizable logical CZ gates. A construction of constant-depth circuits of the above logical gates via cup product cohomology operation is also presented for three copies of identical toric codes on arbitrary 3-manifolds. We have developed a generic formalism to compute the triple intersection invariants for 3-manifolds. We further develop three types of LDPC codes supporting such logical gates: (1) A quasi-hyperbolic code from the product of 2D hyperbolic surface and a circle, with almost-constant rate $k/n=O(1/\log(n))$ and $O(\log(n))$ distance; (2) A homological fibre bundle code with $O(1/\log^{\frac{1}{2}}(n))$ rate and $O(\log^{\frac{1}{2}}(n))$ distance; (3) A specific family of 3D hyperbolic codes: the Torelli mapping torus code, constructed from mapping tori of a pseudo-Anosov element in the Torelli subgroup, which has constant rate while the distance scaling is currently unknown. We then show a generic constant-overhead scheme for applying a parallelizable universal gate set with the aid of logical-$X$ measurements.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。