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

在突破临界点之外利用大量编码逻辑量子比特进行计算

Computing with many encoded logical qubits beyond break-even

Quantinuum
Shival Dasu, Matthew DeCross, Andrew Y. Guo, Ali Lavasani, Jan Behrends, Asmae Benhemou, Yi-Hsiang Chen, Karl Mayer, Chris N. Self, Selwyn Simsek, Basudha Sriva… 展开作者

Shival Dasu, Matthew DeCross, Andrew Y. Guo, Ali Lavasani, Jan Behrends, Asmae Benhemou, Yi-Hsiang Chen, Karl Mayer, Chris N. Self, Selwyn Simsek, Basudha Srivastava, M. S. Allman, Jake Arkinstall, Justin G. Bohnet, Nathaniel Q. Burdick, J. P. Campora, Alex Chernoguzov, Samuel F. Cooper, Robert D. Delaney, Joan M. Dreiling, Brian Estey, Caroline Figgatt, Cameron Foltz, John P. Gaebler, Alex Hall, Craig A. Holliman, Ali A. Husain, Akhil Isanaka, Colin J. Kennedy, Yuga Kodama, Nikhil Kotibhaskar, Nathan K. Lysne, Ivaylo S. Madjarov, Michael Mills, Alistair R. Milne, Brian Neyenhuis, Annie J. Park, Anthony Ransford, Adam P. Reed, Steven J. Sanders, Charles H. Baldwin, David Hayes, Ben Criger, Andrew C. Potter, David Amaro

AI总结:

利用高率QED/QEC码在囚禁离子量子处理器上实现超越临界点的逻辑量子比特计算性能

摘要:

高率量子纠错(QEC)码能够在给定的物理量子比特数量中编码许多逻辑量子比特,使其成为量子计算的有前途的候选者。实现高率码在规模上既使经典计算感到困扰又通过编码提高性能需要高保真度的门和长程量子比特连接——这些都由囚禁离子量子计算机提供。在这里,我们展示了在高率[[k+2, k, 2]]冰层量子纠错(QED)和[[(k₂+2)(k₁+2),k₂k₁,4]]两级拼接冰层QEC码中,使用98量子比特的Quantinuum Helios囚禁离子量子处理器进行的计算,其性能优于未编码的对应物。利用新的编码操作装置,我们实现了这种“超越临界点”的性能,合理地在一系列容错(FT)和部分容错(pFT)组件和应用基准测试中实现了从48到94个逻辑量子比特的合理后选择率。这些基准测试包括FT状态准备和测量、QEC周期基准测试、逻辑门基准测试、GHZ状态准备以及pFT量子磁性三维XY模型的量子模拟。此外,我们还表明通过增加码距可以抑制后选择率。我们的结果代表了最先进的逻辑组件和状态保真度,并提供了证据表明高率QED/QEC码在当前量子计算机上可用于近期超越经典规模的计算。

英文摘要:

High-rate quantum error correcting (QEC) codes encode many logical qubits in a given number of physical qubits, making them promising candidates for quantum computation. Implementing high-rate codes at a scale that both frustrates classical computing and improves performance by encoding requires both high fidelity gates and long-range qubit connectivity -- both of which are offered by trapped-ion quantum computers. Here, we demonstrate computations that outperform their unencoded counterparts in the high-rate $[[ k+2,\, k,\, 2 ]]$ iceberg quantum error detecting (QED) and $[[ (k_2 + 2)(k_1 + 2),\, k_2k_1,\, 4 ]]$ two-level concatenated iceberg QEC codes, using the 98-qubit Quantinuum Helios trapped-ion quantum processor. Utilizing new gadgets for encoded operations, we realize this "beyond break-even" performance with reasonable postselection rates across a range of fault-tolerant (FT) and partially-fault-tolerant (pFT) component and application benchmarks with between $48$ and $94$ logical qubits. These benchmarks include FT state preparation and measurement, QEC cycle benchmarking, logical gate benchmarking, GHZ state preparation, and a pFT quantum simulation of the three-dimensional $XY$ model of quantum magnetism. Additionally, we illustrate that postselection rates can be suppressed by increasing the code distance via concatenation. Our results represent state-of-the-art logical component and state fidelities and provide evidence that high-rate QED/QEC codes are viable on contemporary quantum computers for near-term beyond-classical-scale computation.

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

↑