arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2303.17810quant-phcond-mat.mes-hall
收藏

量子重复码的盈亏平衡点

Break-even point of the quantum repetition code

Áron Rozgonyi, Gábor Széchenyi

AI总结:

本文通过基于电路的解析计算,证明相位翻转重复码在弛豫、退相位和门错误并存时仍可突破量子存储器盈亏平衡点,并给出当前平台所需门错误率与最佳纠错周期数。

摘要:

在不同量子硬件上利用基于量子码的存储器来延长量子比特寿命,是迈向容错量子计算的重要一步。我们从理论上表明,在受退相位时间限制的系统中,即使使用量子相位翻转重复码,也能够突破盈亏平衡点,也就是将任意量子信息保存得比单个空闲量子比特的寿命更久。通过基于电路的解析计算,我们在存在弛豫、退相位以及量子门故障的情况下,确定了相位翻转码作为量子存储器的效率。结合当前量子计算平台,我们识别出达到盈亏平衡点所需的门错误概率以及量子纠错周期的最佳重复次数。

英文摘要:

Enhancing the lifetime of qubits with quantum code-based memories on different quantum hardware is a significant step towards fault-tolerant quantum computing. We theoretically show that the break-even point, i.e., preserving arbitrary quantum information longer than the lifetime of a single idle qubit, can be beaten even with the quantum phase-flip repetition code in a dephasing-time-limited system. Applying circuit-based analytical calculation, we determine the efficiency of the phase-flip code as a quantum memory in the presence of relaxation, dephasing, and faulty quantum gates. Considering current platforms for quantum computing, we identify the gate error probabilities and optimal repetition number of quantum error correction cycles to reach the break-even point.

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

↑