arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0411111quant-ph
收藏

最近邻通信容错计算的门限错误惩罚

Threshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication

T. Szkopek, P. O. Boykin, H. Fan, V. Roychowdhury, E. Yablonovitch, G. Simms, M. Gyure, B. Fong

摘要:

容错量子计算的错误阈值与量子比特的级联编码是由内部通信开销惩罚。许多量子计算方案依赖于最近邻通信,这需要额外的门操作。对于一个宽度为L+1个物理量子比特的量子比特条带,实现L级级联,我们发现,当门错误是主要的错误来源时,在没有任何通信负担的情况下,错误阈值从2.1x10^-5降低到1.2x10^-7。误差阈值的这一~ 175倍损失转化为门操作控制脉冲的幅度和定时的~ 13倍损失。

英文摘要:

The error threshold for fault tolerant quantum computation with concatenated encoding of qubits is penalized by internal communication overhead. Many quantum computation proposals rely on nearest-neighbour communication, which requires excess gate operations. For a qubit stripe with a width of L+1 physical qubits implementing L levels of concatenation, we find that the error threshold of 2.1x10^-5 without any communication burden is reduced to 1.2x10^-7 when gate errors are the dominant source of error. This ~175X penalty in error threshold translates to an ~13X penalty in the amplitude and timing of gate operation control pulses.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑