Graph algorithms with neutral atom quantum processors

Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the ability to reconfigure the geometry of the qubit register, from s...

Full description

Saved in:
Bibliographic Details
Published inThe European physical journal. A, Hadrons and nuclei Vol. 60; no. 9; p. 177
Main Authors Dalyac, Constantin, Leclerc, Lucas, Vignoli, Louis, Djellabi, Mehdi, Coelho, Wesley da Silva, Ximenez, Bruno, Dareau, Alexandre, Dreon, Davide, Elfving, Vincent E., Signoles, Adrien, Henry, Louis-Paul, Henriet, Loïc
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 06.09.2024
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1434-601X
1434-6001
1434-601X
DOI10.1140/epja/s10050-024-01385-5

Cover

More Information
Summary:Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the ability to reconfigure the geometry of the qubit register, from shot to shot. This unique feature makes possible the native embedding of graph-structured problems at the hardware level, with profound consequences for the resolution of complex optimization and machine learning tasks. By driving qubits, one can generate processed quantum states which retain graph complex properties. These states can then be leveraged to offer direct solutions to problems or as resources in hybrid quantum-classical schemes. In this paper, we review the advancements in quantum algorithms for graph problems running on neutral atom Quantum Processing Units (QPUs), and discuss recently introduced embedding and problem-solving techniques. In addition, we clarify ongoing advancements in hardware, with an emphasis on enhancing the scalability, controllability and computation repetition rate of neutral atom QPUs.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1434-601X
1434-6001
1434-601X
DOI:10.1140/epja/s10050-024-01385-5