Benchmarking the algorithmic performance of near-term neutral atom processors
K. McInroy, N. Pearson, J. D. Pritchard

TL;DR
This paper evaluates the performance of near-term Rydberg atom quantum processors through simulations, demonstrating their competitive capabilities for quantum algorithms and establishing benchmarks for future scalability.
Contribution
The study provides the first detailed benchmarking of Rydberg atom quantum processors using device simulation and quantum volume metrics, highlighting their potential for scalable quantum computing.
Findings
Quantum volume of 2^9 for 9 qubit devices
High success probability (>0.95) for Bernstein-Vazirani algorithm
High success probability (0.97) for Grover's search with native gates
Abstract
Neutral atom quantum processors provide a viable route to scalable quantum computing, with recent demonstrations of high-fidelity and parallel gate operations and initial implementation of quantum algorithms using both physical and logical qubit encodings. In this work we present a characterization of the algorithmic performance of near term Rydberg atom quantum computers through device simulation to enable comparison against competing architectures. We consider three different quantum algorithm related tests, exploiting the ability to dynamically update qubit connectivity and multi-qubit gates. We calculate a quantum volume of for 9 qubit devices with realistic parameters, which is the maximum achievable value for this device size and establishes a lower bound for larger systems. We also simulate highly efficient implementations of both the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsElectronic and Structural Properties of Oxides · Machine Learning in Materials Science
