{"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.
期刊介绍:
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.