Quantum Locally Testable Code with Constant Soundness

IF 5.1 2区 物理与天体物理 Q1 PHYSICS, MULTIDISCIPLINARY Quantum Pub Date : 2024-10-18 DOI:10.22331/q-2024-10-18-1501
Andrew Cross, Zhiyang He, Anand Natarajan, Mario Szegedy, Guanyu Zhu
{"title":"Quantum Locally Testable Code with Constant Soundness","authors":"Andrew Cross, Zhiyang He, Anand Natarajan, Mario Szegedy, Guanyu Zhu","doi":"10.22331/q-2024-10-18-1501","DOIUrl":null,"url":null,"abstract":"In this paper, we present two constructions of quantum locally testable codes (QLTC) with constant soundness. In the first approach, we introduce an operation called check product, and show how this operation gives rise to QLTCs of constant soundness, constant rate, and distance scaling with locality. In the second approach, we consider hypergraph product of a quantum code and a classical repetition code, and observe a special case in which the soundness of component codes is preserved. This insight leads us to construct QLTCs of constant soundness, scalable rate and distance, and constant average locality. Our work marks a step towards constructing QLTCs of high soundness and distance, which would give a different construction to the No Low-Energy Trivial States (NLTS) theorem.","PeriodicalId":20807,"journal":{"name":"Quantum","volume":"29 1","pages":""},"PeriodicalIF":5.1000,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.22331/q-2024-10-18-1501","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we present two constructions of quantum locally testable codes (QLTC) with constant soundness. In the first approach, we introduce an operation called check product, and show how this operation gives rise to QLTCs of constant soundness, constant rate, and distance scaling with locality. In the second approach, we consider hypergraph product of a quantum code and a classical repetition code, and observe a special case in which the soundness of component codes is preserved. This insight leads us to construct QLTCs of constant soundness, scalable rate and distance, and constant average locality. Our work marks a step towards constructing QLTCs of high soundness and distance, which would give a different construction to the No Low-Energy Trivial States (NLTS) theorem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有恒健性的量子局部可测试代码
在本文中,我们提出了两种具有恒定健全性的量子局部可检验码(QLTC)的构造。在第一种方法中,我们引入了一种称为校验积的操作,并展示了这种操作如何产生具有恒定健全性、恒定速率和随局部性缩放的距离的 QLTC。在第二种方法中,我们考虑了量子密码和经典重复密码的超图积,并观察到了一种特殊情况,即分量密码的健全性得以保留。这一洞察力引导我们构建了具有恒定健全性、可扩展速率和距离以及恒定平均位置性的 QLTC。我们的工作标志着向构造高健全性和高距离的 QLTC 迈出了一步,这将为无低能三维状态(NLTS)定理提供一种不同的构造。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Quantum
Quantum Physics and Astronomy-Physics and Astronomy (miscellaneous)
CiteScore
9.20
自引率
10.90%
发文量
241
审稿时长
16 weeks
期刊介绍: Quantum is an open-access peer-reviewed journal for quantum science and related fields. Quantum is non-profit and community-run: an effort by researchers and for researchers to make science more open and publishing more transparent and efficient.
期刊最新文献
Flying Spin Qubits in Quantum Dot Arrays Driven by Spin-Orbit Interaction Time dependent Markovian master equation beyond the adiabatic limit Construction of perfect tensors using biunimodular vectors Inevitability of knowing less than nothing Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1