東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Error channels and the threshold for...

Eastin, Bryan.

FindBook

Google Book

Amazon

博客來

Error channels and the threshold for fault-tolerant quantum computation.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Error channels and the threshold for fault-tolerant quantum computation./
作者:	Eastin, Bryan.
面頁冊數:	174 p.
附註:	Adviser: Carlton M. Caves.
Contained By:	Dissertation Abstracts International69-01B.
標題:	Physics, Theory. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3298197
ISBN:	9780549426363

Error channels and the threshold for fault-tolerant quantum computation.
Eastin, Bryan.

Error channels and the threshold for fault-tolerant quantum computation. - 174 p.

Adviser: Carlton M. Caves.

Thesis (Ph.D.)--The University of New Mexico, 2007.

The threshold for fault-tolerant quantum computation depends on the available resources, including knowledge about the error model. I investigate the utility of such knowledge by designing a fault-tolerant procedure tailored to a restricted stochastic Pauli channel and studying the corresponding threshold for quantum computation. Surprisingly, I find that tailoring yields, at best, modest gains in the threshold, while substantial losses occur for error models only marginally different from the assumed channel. This result is shown to derive from the fact that the ancillae used in threshold estimation are of exceedingly high quality and, thus, difficult to improve upon. Motivated by this discovery, I propose a tractable algebraic algorithm for predicting the outcome of threshold estimates, one which approximates ancillae as having independent and identically distributed errors on their constituent qubits. In the limit of an infinitely large code, the algorithm simplifies tremendously, yielding a rigorous threshold bound given the availability of ancillae with i.i.d. errors. I use this bound as a metric to judge the relative performance of various fault-tolerant procedures in combination with different error models. Modest gains in the threshold are observed for certain restricted error models, and, for the assumed ancillae, Knill's fault-tolerant method is found to be superior to that of Steane. My algorithm generally yields high threshold bounds, reflecting the computational value of large, low-error ancillae. In an effort to render these bounds achievable, I develop a novel procedure for directly constructing large ancillae. Numerically, the scaling and average error properties of this procedure are found to be encouraging, and, though it is not fault-tolerant, I prove that each error can spread to only one additional location. Promising means of improving the ancillae are proposed, and I discuss briefly the challenges associated with preparing the cat states necessary for my procedure.

ISBN: 9780549426363Subjects--Topical Terms:

1019422
Physics, Theory.

Error channels and the threshold for fault-tolerant quantum computation.
LDR:02885nam 2200265 a 45 001 942193
005 20110519
008 110519s2007 ||||||||||||||||| ||eng d
020 $a 9780549426363
035 $a (UMI)AAI3298197
035 $a AAI3298197
040 $a UMI $c UMI
100 1 $a Eastin, Bryan. $3 1266289
245 1 0 $a Error channels and the threshold for fault-tolerant quantum computation.
300 $a 174 p.
500 $a Adviser: Carlton M. Caves.
500 $a Source: Dissertation Abstracts International, Volume: 69-01, Section: B, page: 0393.
502 $a Thesis (Ph.D.)--The University of New Mexico, 2007.
520 $a The threshold for fault-tolerant quantum computation depends on the available resources, including knowledge about the error model. I investigate the utility of such knowledge by designing a fault-tolerant procedure tailored to a restricted stochastic Pauli channel and studying the corresponding threshold for quantum computation. Surprisingly, I find that tailoring yields, at best, modest gains in the threshold, while substantial losses occur for error models only marginally different from the assumed channel. This result is shown to derive from the fact that the ancillae used in threshold estimation are of exceedingly high quality and, thus, difficult to improve upon. Motivated by this discovery, I propose a tractable algebraic algorithm for predicting the outcome of threshold estimates, one which approximates ancillae as having independent and identically distributed errors on their constituent qubits. In the limit of an infinitely large code, the algorithm simplifies tremendously, yielding a rigorous threshold bound given the availability of ancillae with i.i.d. errors. I use this bound as a metric to judge the relative performance of various fault-tolerant procedures in combination with different error models. Modest gains in the threshold are observed for certain restricted error models, and, for the assumed ancillae, Knill's fault-tolerant method is found to be superior to that of Steane. My algorithm generally yields high threshold bounds, reflecting the computational value of large, low-error ancillae. In an effort to render these bounds achievable, I develop a novel procedure for directly constructing large ancillae. Numerically, the scaling and average error properties of this procedure are found to be encouraging, and, though it is not fault-tolerant, I prove that each error can spread to only one additional location. Promising means of improving the ancillae are proposed, and I discuss briefly the challenges associated with preparing the cat states necessary for my procedure.
590 $a School code: 0142.
650 4 $a Physics, Theory. $3 1019422
690 $a 0753
710 2 $a The University of New Mexico. $3 1018024
773 0 $t Dissertation Abstracts International $g 69-01B.
790 $a 0142
790 1 0 $a Caves, Carlton M., $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3298197