具有横向广义相位门的排列不变量子码

IF 2.2 3区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

IEEE Transactions on Information Theory Pub Date : 2024-10-30 DOI:10.1109/TIT.2024.3487964

Eric Kubischta;Ian Teixeira

{"title":"具有横向广义相位门的排列不变量子码","authors":"Eric Kubischta;Ian Teixeira","doi":"10.1109/TIT.2024.3487964","DOIUrl":null,"url":null,"abstract":"With respect to the transversal gate group (an invariant of quantum codes), we demonstrate that non-additive codes can outperform stabilizer codes. We do this by constructing spin codes that correspond to permutation-invariant multiqubit codes that can implement generalized phase gates transversally. Of particular note, we construct permutation-invariant quantum codes that implement a transversal T gate using fewer qubits and with a better minimum distance than is possible with the best known stabilizer codes.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 1","pages":"485-498"},"PeriodicalIF":2.2000,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Permutation-Invariant Quantum Codes With Transversal Generalized Phase Gates\",\"authors\":\"Eric Kubischta;Ian Teixeira\",\"doi\":\"10.1109/TIT.2024.3487964\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With respect to the transversal gate group (an invariant of quantum codes), we demonstrate that non-additive codes can outperform stabilizer codes. We do this by constructing spin codes that correspond to permutation-invariant multiqubit codes that can implement generalized phase gates transversally. Of particular note, we construct permutation-invariant quantum codes that implement a transversal T gate using fewer qubits and with a better minimum distance than is possible with the best known stabilizer codes.\",\"PeriodicalId\":13494,\"journal\":{\"name\":\"IEEE Transactions on Information Theory\",\"volume\":\"71 1\",\"pages\":\"485-498\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-10-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Information Theory\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10739355/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10739355/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

对于横向门群（量子码的不变量），我们证明了非加性码可以优于稳定码。我们通过构建自旋码来实现这一点，该自旋码对应于可以横向实现广义相位门的排列不变多量子位码。特别值得注意的是，我们构建了置换不变量子码，该量子码使用更少的量子比特实现横向T门，并且比最知名的稳定码具有更好的最小距离。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Permutation-Invariant Quantum Codes With Transversal Generalized Phase Gates

With respect to the transversal gate group (an invariant of quantum codes), we demonstrate that non-additive codes can outperform stabilizer codes. We do this by constructing spin codes that correspond to permutation-invariant multiqubit codes that can implement generalized phase gates transversally. Of particular note, we construct permutation-invariant quantum codes that implement a transversal T gate using fewer qubits and with a better minimum distance than is possible with the best known stabilizer codes.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE Transactions on Information Theory 工程技术-工程：电子与电气

CiteScore

5.70

自引率

20.00%

发文量

514

审稿时长

12 months

期刊介绍： The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.