Lightcone bounds for quantum circuit mapping via uncomplexity

IF 6.6 1区 物理与天体物理 Q1 PHYSICS, APPLIED npj Quantum Information Pub Date : 2024-11-09 DOI:10.1038/s41534-024-00909-7
Matthew Steinberg, Medina Bandić, Sacha Szkudlarek, Carmen G. Almudever, Aritra Sarkar, Sebastian Feld
{"title":"Lightcone bounds for quantum circuit mapping via uncomplexity","authors":"Matthew Steinberg, Medina Bandić, Sacha Szkudlarek, Carmen G. Almudever, Aritra Sarkar, Sebastian Feld","doi":"10.1038/s41534-024-00909-7","DOIUrl":null,"url":null,"abstract":"<p>Efficiently mapping quantum circuits onto hardware is integral for the quantum compilation process, wherein a circuit is modified in accordance with a quantum processor’s connectivity. Many techniques currently exist for solving this problem, wherein SWAP-gate overhead is usually prioritized as a cost metric. We reconstitute quantum circuit mapping using tools from quantum information theory, showing that a lower bound, which we dub the lightcone bound, emerges for a circuit executed on hardware. We also develop an initial placement algorithm based on graph similarity search, aiding us in optimally placing circuit qubits onto a device. 600 realistic benchmarks using the IBM Qiskit compiler and a brute-force method are then tested against the lightcone bound, with results unambiguously verifying the veracity of the bound, while permitting trustworthy estimations of minimal overhead in near-term realizations of quantum algorithms. This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing.</p>","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"80 1","pages":""},"PeriodicalIF":6.6000,"publicationDate":"2024-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"npj Quantum Information","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1038/s41534-024-00909-7","RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Efficiently mapping quantum circuits onto hardware is integral for the quantum compilation process, wherein a circuit is modified in accordance with a quantum processor’s connectivity. Many techniques currently exist for solving this problem, wherein SWAP-gate overhead is usually prioritized as a cost metric. We reconstitute quantum circuit mapping using tools from quantum information theory, showing that a lower bound, which we dub the lightcone bound, emerges for a circuit executed on hardware. We also develop an initial placement algorithm based on graph similarity search, aiding us in optimally placing circuit qubits onto a device. 600 realistic benchmarks using the IBM Qiskit compiler and a brute-force method are then tested against the lightcone bound, with results unambiguously verifying the veracity of the bound, while permitting trustworthy estimations of minimal overhead in near-term realizations of quantum algorithms. This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过非复杂性实现量子电路映射的光锥边界
高效地将量子电路映射到硬件上是量子编译过程不可或缺的一部分,在这一过程中,电路会根据量子处理器的连接性进行修改。目前有许多解决这一问题的技术,其中 SWAP 门开销通常作为成本指标优先考虑。我们利用量子信息论的工具重构了量子电路映射,证明在硬件上执行的电路会出现一个下限,我们称之为光锥下限。我们还开发了一种基于图相似性搜索的初始放置算法,帮助我们以最佳方式将电路量子比特放置到设备上。然后,我们使用 IBM Qiskit 编译器和蛮力方法对 600 个现实基准进行了光锥约束测试,结果明确验证了约束的真实性,同时允许对量子算法近期实现的最小开销进行可信的估计。这项工作首次将量子电路不复杂性应用于实际相关的量子计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
npj Quantum Information
npj Quantum Information Computer Science-Computer Science (miscellaneous)
CiteScore
13.70
自引率
3.90%
发文量
130
审稿时长
29 weeks
期刊介绍: The scope of npj Quantum Information spans across all relevant disciplines, fields, approaches and levels and so considers outstanding work ranging from fundamental research to applications and technologies.
期刊最新文献
Quantum networks with coherent routing of information through multiple nodes Quantum simulation of realistic materials in first quantization using non-local pseudopotentials Unleashed from constrained optimization: quantum computing for quantum chemistry employing generator coordinate inspired method Simultaneous discovery of quantum error correction codes and encoders with a noise-aware reinforcement learning agent A quantum leaky integrate-and-fire spiking neuron and network
×
引用
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