Time optimal quantum state transfer in a fully-connected quantum computer

IF 5.6 2区 物理与天体物理 Q1 PHYSICS, MULTIDISCIPLINARY Quantum Science and Technology Pub Date : 2023-10-26 DOI:10.1088/2058-9565/ad0770
Casey Jameson, Bora Basyildiz, Daniel Moore, Kyle Clark, Zhexuan Gong
{"title":"Time optimal quantum state transfer in a fully-connected quantum computer","authors":"Casey Jameson, Bora Basyildiz, Daniel Moore, Kyle Clark, Zhexuan Gong","doi":"10.1088/2058-9565/ad0770","DOIUrl":null,"url":null,"abstract":"Abstract The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb-Robinson-type bounds that are crucial for understanding various aspects of quantum many-body physics. For strongly long-range interacting systems such as a fully-connected quantum computer, such a speed limit is still unknown. Here we develop a new Quantum Brachistochrone method that can incorporate inequality constraints on the Hamiltonian. This method allows us to prove an exactly tight bound on the speed of QST on a subclass of Hamiltonians experimentally realizable by a fully-connected quantum computer.","PeriodicalId":20821,"journal":{"name":"Quantum Science and Technology","volume":"64 10","pages":"0"},"PeriodicalIF":5.6000,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/2058-9565/ad0770","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb-Robinson-type bounds that are crucial for understanding various aspects of quantum many-body physics. For strongly long-range interacting systems such as a fully-connected quantum computer, such a speed limit is still unknown. Here we develop a new Quantum Brachistochrone method that can incorporate inequality constraints on the Hamiltonian. This method allows us to prove an exactly tight bound on the speed of QST on a subclass of Hamiltonians experimentally realizable by a fully-connected quantum computer.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
全连接量子计算机中时间最优量子态传输
粒子相互作用系统中量子态转移(QST)的速度限制不仅对量子信息处理很重要,而且与理解量子多体物理的各个方面至关重要的lieb - robinson型边界直接相关。对于强远程相互作用系统,如全连接量子计算机,这样的速度限制仍然是未知的。本文提出了一种新的量子Brachistochrone方法,该方法可以在哈密顿算子上加入不等式约束。这种方法使我们能够证明在哈密顿子类上QST速度的精确紧界,该速度可以在全连接量子计算机上实验实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Quantum Science and Technology
Quantum Science and Technology Materials Science-Materials Science (miscellaneous)
CiteScore
11.20
自引率
3.00%
发文量
133
期刊介绍: Driven by advances in technology and experimental capability, the last decade has seen the emergence of quantum technology: a new praxis for controlling the quantum world. It is now possible to engineer complex, multi-component systems that merge the once distinct fields of quantum optics and condensed matter physics. Quantum Science and Technology is a new multidisciplinary, electronic-only journal, devoted to publishing research of the highest quality and impact covering theoretical and experimental advances in the fundamental science and application of all quantum-enabled technologies.
期刊最新文献
Quantum state tomography based on infidelity estimation Near-optimal quantum kernel principal component analysis Bayesian optimization for state engineering of quantum gases Ramsey interferometry of nuclear spins in diamond using stimulated Raman adiabatic passage Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms
×
引用
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