Benchmarking the algorithmic performance of near-term neutral atom processors
McInroy, K., Pearson, N., Pritchard, J. D. · 2024
| 编号 NA182 | 主题 基准与评测 |
摘要
摘要保留原文（英文）
摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。
2024 · 预印本；未核实后续正式发表 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 Bernstein-Vazirani algorithm with >0.95 success probability for 9 data qubits and 1 ancilla qubit without loss correction, and Grover’s search algorithm with a loss-corrected success probability of 0.97 for an implementation of the algorithm using 6 data qubits and 3 ancilla qubits using native multi-qubit gates. Our results indicate Rydberg atom processors are a highly competitive near-term platform which, bolstered by the potential for further scalability, can pave the way toward useful quantum computation.
全文共 14 页；文本提取件位于 .extracted/papers/NA182.txt（不随站点发布）。
本站词条在引用该文献时，会以 wikilink（sources/NA182）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。