Benchmarking a neutral-atom quantum computer

IF 0.7 4区 物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS International Journal of Quantum Information Pub Date : 2024-02-17 DOI:10.1142/s0219749924500011
N. Wagner, C. Poole, T. M. Graham, M. Saffman
{"title":"Benchmarking a neutral-atom quantum computer","authors":"N. Wagner, C. Poole, T. M. Graham, M. Saffman","doi":"10.1142/s0219749924500011","DOIUrl":null,"url":null,"abstract":"<p>In this study, we simulated the algorithmic performance of a small neutral atom quantum computer and compared its performance when operating with all-to-all versus nearest-neighbor connectivity. This comparison was made using a suite of algorithmic benchmarks developed by the Quantum Economic Development Consortium. Circuits were simulated with a noise model consistent with experimental data from [<i>Nature</i><b>604</b>, 457 (2022)]. We find that all-to-all connectivity improves simulated circuit fidelity by <span><math altimg=\"eq-00001.gif\" display=\"inline\" overflow=\"scroll\"><mn>1</mn><mn>0</mn><mo>%</mo></math></span><span></span>–<span><math altimg=\"eq-00002.gif\" display=\"inline\" overflow=\"scroll\"><mn>1</mn><mn>5</mn><mo>%</mo></math></span><span></span>, compared to nearest-neighbor connectivity.</p>","PeriodicalId":51058,"journal":{"name":"International Journal of Quantum Information","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2024-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Quantum Information","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1142/s0219749924500011","RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

In this study, we simulated the algorithmic performance of a small neutral atom quantum computer and compared its performance when operating with all-to-all versus nearest-neighbor connectivity. This comparison was made using a suite of algorithmic benchmarks developed by the Quantum Economic Development Consortium. Circuits were simulated with a noise model consistent with experimental data from [Nature604, 457 (2022)]. We find that all-to-all connectivity improves simulated circuit fidelity by 10%15%, compared to nearest-neighbor connectivity.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
中性原子量子计算机的基准测试
在这项研究中,我们模拟了小型中性原子量子计算机的算法性能,并比较了它在全对全连接和最近邻连接条件下的性能。这种比较是利用量子经济发展联盟开发的一套算法基准进行的。电路模拟采用的噪声模型与[Nature604, 457 (2022)]的实验数据一致。我们发现,与近邻连接相比,全对全连接可将模拟电路的保真度提高 10%-15%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Quantum Information
International Journal of Quantum Information 物理-计算机:理论方法
CiteScore
2.20
自引率
8.30%
发文量
36
审稿时长
10 months
期刊介绍: The International Journal of Quantum Information (IJQI) provides a forum for the interdisciplinary field of Quantum Information Science. In particular, we welcome contributions in these areas of experimental and theoretical research: Quantum Cryptography Quantum Computation Quantum Communication Fundamentals of Quantum Mechanics Authors are welcome to submit quality research and review papers as well as short correspondences in both theoretical and experimental areas. Submitted articles will be refereed prior to acceptance for publication in the Journal.
期刊最新文献
Low-ground/High-ground capacity regions analysis for bosonic gaussian channels Interpreting symplectic linear transformations in a two-qubit phase space Continuity of the relative entropy of resource Alexander S. Holevo’s researches in quantum information theory in 20th century Pretty good measurement for bosonic Gaussian ensembles
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1