Multi-qubit entanglement and algorithms on a neutral-atom quantum computer
Multi-qubit entanglement and algorithms on a neutral-atom quantum computer
复制标题
DOI：
10.1038/s41586-022-04603-6
复制
发表时间：
2022-04-21
期刊：
影响因子：
64.8
通讯作者：
Saffman, M.
中科院分区：
文献类型：
--
作者：
Graham, T. M.;Song, Y.;Saffman, M.
如果门模型量子计算机能够以长相干时间和高保真逻辑大规模运行，那么它们有望解决目前棘手的计算问题。中性原子超精细量子位提供了固有的可扩展性，因为它们具有相同的特性，长的相干时间和被困在密集的多维阵列中的能力（1）。结合里德伯态（2-4）提供的强纠缠相互作用，量子计算的所有必要特征都是可用的。在这里，我们展示了几个量子算法上的可编程门模型中性原子量子计算机的体系结构的基础上单独寻址的单个原子与紧密聚焦的光束扫描整个二维阵列的量子位。演示了多达六个量子比特的纠缠Greenberger-Horne-Zeilinger（GHZ）态的制备（5）、化学问题的量子相位估计（6）和最大割（MaxCut）图问题的量子近似优化算法（QAOA）（7）。这些结果突出了中性原子量子比特阵列用于通用可编程量子计算的紧急能力，以及用于量子增强传感的非经典状态的准备。
Gate-model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high-fidelity logic. Neutral-atom hyperfine qubits provide inherent scalability owing to their identical characteristics, long coherence times and ability to be trapped in dense, multidimensional arrays(1). Combined with the strong entangling interactions provided by Rydberg states(2-4), all the necessary characteristics for quantum computation are available. Here we demonstrate several quantum algorithms on a programmable gate-model neutral-atom quantum computer in an architecture based on individual addressing of single atoms with tightly focused optical beams scanned across a two-dimensional array of qubits. Preparation of entangled Greenberger-Horne-Zeilinger (GHZ) states(5) with up to six qubits, quantum phase estimation for a chemistry problem(6) and the quantum approximate optimization algorithm (QAOA)(7) for the maximum cut (MaxCut) graph problem are demonstrated. These results highlight the emergent capability of neutral-atom qubit arrays for universal, programmable quantum computation, as well as preparation of non-classical states of use for quantum-enhanced sensing.