1. Multi-qubit entanglement and algorithms on a neutral-atom quantum computer
- Author
-
Graham, T. M., Song, Y., Scott, J., Poole, C., Phuttitarn, L., Jooya, K., Eichler, P., Jiang, X., Marra, A., Grinkemeyer, B., Kwon, M., Ebert, M., Cherek, J., Lichtman, M. T., Gillette, M., Gilbert, J., Bowman, D., Ballance, T., Campbell, C., Dahl, E. D., Crawford, O., Blunt, N. S., Rogers, B., Noel, T., and Saffman, M.
- Abstract
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 arrays1. Combined with the strong entangling interactions provided by Rydberg states2–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) states5with up to six qubits, quantum phase estimation for a chemistry problem6and the quantum approximate optimization algorithm (QAOA)7for 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.
- Published
- 2022
- Full Text
- View/download PDF