Upper bounds on the noise threshold for fault-tolerant quantum computing

IF 0.7 4区 物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS Quantum Information & Computation Pub Date : 2008-02-11 DOI:10.26421/QIC10.5-6-1
J. Kempe, O. Regev, Falk Unger, R. D. Wolf
{"title":"Upper bounds on the noise threshold for fault-tolerant quantum computing","authors":"J. Kempe, O. Regev, Falk Unger, R. D. Wolf","doi":"10.26421/QIC10.5-6-1","DOIUrl":null,"url":null,"abstract":"We prove new upper bounds on the tolerable level of noise in a quantum circuit. Weconsider circuits consisting of unitary k-qubit gates each of whose input wires is subject todepolarizing noise of strength p, as well as arbitrary one-qubit gates that are essentiallynoise-free. We assume that the output of the circuit is the result of measuring somedesignated qubit in the final state. Our main result is that for p > 1 - Θ(1/√k), theoutput of any such circuit of large enough depth is essentially independent of its input,thereby making the circuit useless. For the important special case of k = 2, our bound isp > 35.7%. Moreover, if the only allowed gate on more than one qubit is the two-qubitCNOT gate, then our bound becomes 29.3%. These bounds on p are numerically betterthan previous bounds, yet are incomparable because of the somewhat different circuitmodel that we are using. Our main technique is the use of a Pauli basis decomposition,in which the effects of depolarizing noise are very easy to describe.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"45 1","pages":"845-856"},"PeriodicalIF":0.7000,"publicationDate":"2008-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information & Computation","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.26421/QIC10.5-6-1","RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 26

Abstract

We prove new upper bounds on the tolerable level of noise in a quantum circuit. Weconsider circuits consisting of unitary k-qubit gates each of whose input wires is subject todepolarizing noise of strength p, as well as arbitrary one-qubit gates that are essentiallynoise-free. We assume that the output of the circuit is the result of measuring somedesignated qubit in the final state. Our main result is that for p > 1 - Θ(1/√k), theoutput of any such circuit of large enough depth is essentially independent of its input,thereby making the circuit useless. For the important special case of k = 2, our bound isp > 35.7%. Moreover, if the only allowed gate on more than one qubit is the two-qubitCNOT gate, then our bound becomes 29.3%. These bounds on p are numerically betterthan previous bounds, yet are incomparable because of the somewhat different circuitmodel that we are using. Our main technique is the use of a Pauli basis decomposition,in which the effects of depolarizing noise are very easy to describe.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
容错量子计算噪声阈值的上界
我们证明了量子电路中可容忍噪声水平的新上界。我们考虑由统一的k-量子比特门组成的电路,其每个输入线都受到强度为p的去极化噪声的影响,以及基本上无噪声的任意单量子比特门。我们假设电路的输出是在最终状态下测量某个指定量子位的结果。我们的主要结果是,对于p > 1 - Θ(1/√k),任何这种深度足够大的电路的输出基本上与它的输入无关,从而使电路无用。对于k = 2的重要特例,我们的定界isp > 35.7%。此外,如果一个以上量子位上唯一允许的门是两个量子位的cnot门,那么我们的边界变为29.3%。这些p上的边界在数值上比以前的边界更好,但由于我们使用的电路模型有些不同,因此无法比较。我们的主要技术是使用泡利基分解,其中去极化噪声的影响很容易描述。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Quantum Information & Computation
Quantum Information & Computation 物理-计算机:理论方法
CiteScore
1.70
自引率
0.00%
发文量
42
审稿时长
3.3 months
期刊介绍: Quantum Information & Computation provides a forum for distribution of information in all areas of quantum information processing. Original articles, survey articles, reviews, tutorials, perspectives, and correspondences are all welcome. Computer science, physics and mathematics are covered. Both theory and experiments are included. Illustrative subjects include quantum algorithms, quantum information theory, quantum complexity theory, quantum cryptology, quantum communication and measurements, proposals and experiments on the implementation of quantum computation, communications, and entanglement in all areas of science including ion traps, cavity QED, photons, nuclear magnetic resonance, and solid-state proposals.
期刊最新文献
Closed-form analytic expressions for shadow estimation with brickwork circuits Dynamics of one two-level-atom interacting with a multiple cavity modes Fast naviation with icosahedral golden gates Many-body quantum state control in the presence of environmental noise A simpler security proof for 6-state quantum key distribution
×
引用
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