Gate-model quantum computers promise to solve computational problems by utilizing neutral-atom hyperfine qubits and strong entangling interactions provided by Rydberg states. Several quantum algorithms have been successfully demonstrated on a programmable neutral-atom quantum computer.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据