Transversal Clifford and T-Gate Codes of Short Length and High Distance

Shubham P. Jain;Victor V. Albert
{"title":"Transversal Clifford and T-Gate Codes of Short Length and High Distance","authors":"Shubham P. Jain;Victor V. Albert","doi":"10.1109/JSAIT.2025.3570832","DOIUrl":null,"url":null,"abstract":"The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will soon be realizable, it is important to construct stabilizer codes that, for a given code distance, admit fault-tolerant implementations of logical gates with the fewest number of physical qubits. To this aim, we construct three kinds of codes encoding a single logical qubit for distances up to 31. First, we construct the smallest known doubly even codes, all of which admit a transversal implementation of the Clifford group. Applying a doubling procedure [<uri>https://arxiv.org/abs/1509.03239</uri>] to such codes yields the smallest known weak triply even codes for the same distances and number of encoded qubits. This second family of codes admit a transversal implementation of the logical T-gate. Relaxing the triply even property, we obtain our third family of triorthogonal codes with an even lower overhead at the cost of requiring additional Clifford gates to achieve the same logical operation. To our knowledge, these are the smallest known triorthogonal codes for their respective distances. While not qLDPC, the stabilizer generator weights of the code families with transversal <monospace>T</monospace>-gates scale roughly as the square root of their lengths.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"6 ","pages":"127-137"},"PeriodicalIF":0.0000,"publicationDate":"2025-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE journal on selected areas in information theory","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/11006024/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will soon be realizable, it is important to construct stabilizer codes that, for a given code distance, admit fault-tolerant implementations of logical gates with the fewest number of physical qubits. To this aim, we construct three kinds of codes encoding a single logical qubit for distances up to 31. First, we construct the smallest known doubly even codes, all of which admit a transversal implementation of the Clifford group. Applying a doubling procedure [https://arxiv.org/abs/1509.03239] to such codes yields the smallest known weak triply even codes for the same distances and number of encoded qubits. This second family of codes admit a transversal implementation of the logical T-gate. Relaxing the triply even property, we obtain our third family of triorthogonal codes with an even lower overhead at the cost of requiring additional Clifford gates to achieve the same logical operation. To our knowledge, these are the smallest known triorthogonal codes for their respective distances. While not qLDPC, the stabilizer generator weights of the code families with transversal T-gates scale roughly as the square root of their lengths.
短长高距离的横向Clifford和T-Gate码
几种量子器件体系结构中的非局部相互作用允许实现更紧凑的量子编码,同时保留相同程度的防噪声保护。预计短至中等长度的码将很快实现,因此构建稳定码是很重要的,对于给定的码距,稳定码允许使用最少物理量子位的逻辑门的容错实现。为了达到这个目的,我们构造了三种编码,编码一个逻辑量子位,距离最多为31。首先,我们构造了已知最小的双偶码,它们都允许Clifford群的横向实现。对这样的代码应用加倍程序[https://arxiv.org/abs/1509.03239]],可以得到已知最小的弱三偶代码,具有相同的距离和编码量子位的数量。这第二组代码允许逻辑t门的横向实现。放松三重偶性质,我们以更低的开销获得第三类三正交码,代价是需要额外的Clifford门来实现相同的逻辑操作。据我们所知,这是它们各自距离的已知最小的三正交码。虽然不是qLDPC,但具有横向t门的代码族的稳定器生成器权重大致为其长度的平方根。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
8.20
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信