Quantum communication complexity of linear regression

IF 0.8 Q3 COMPUTER SCIENCE, THEORY & METHODS ACM Transactions on Computation Theory Pub Date : 2023-09-22 DOI:10.1145/3625225
Ashley Montanaro, Changpeng Shao
{"title":"Quantum communication complexity of linear regression","authors":"Ashley Montanaro, Changpeng Shao","doi":"10.1145/3625225","DOIUrl":null,"url":null,"abstract":"Quantum computers may achieve speedups over their classical counterparts for solving linear algebra problems. However, in some cases – such as for low-rank matrices – dequantised algorithms demonstrate that there cannot be an exponential quantum speedup. In this work, we show that quantum computers have provable polynomial and exponential speedups in terms of communication complexity for some fundamental linear algebra problems if there is no restriction on the rank. We mainly focus on solving linear regression and Hamiltonian simulation. In the quantum case, the task is to prepare the quantum state of the result. To allow for a fair comparison, in the classical case, the task is to sample from the result. We investigate these two problems in two-party and multiparty models, propose near-optimal quantum protocols and prove quantum/classical lower bounds. In this process, we propose an efficient quantum protocol for quantum singular value transformation, which is a powerful technique for designing quantum algorithms. We feel this will be helpful in developing efficient quantum protocols for many other problems.","PeriodicalId":44045,"journal":{"name":"ACM Transactions on Computation Theory","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Computation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3625225","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 8

Abstract

Quantum computers may achieve speedups over their classical counterparts for solving linear algebra problems. However, in some cases – such as for low-rank matrices – dequantised algorithms demonstrate that there cannot be an exponential quantum speedup. In this work, we show that quantum computers have provable polynomial and exponential speedups in terms of communication complexity for some fundamental linear algebra problems if there is no restriction on the rank. We mainly focus on solving linear regression and Hamiltonian simulation. In the quantum case, the task is to prepare the quantum state of the result. To allow for a fair comparison, in the classical case, the task is to sample from the result. We investigate these two problems in two-party and multiparty models, propose near-optimal quantum protocols and prove quantum/classical lower bounds. In this process, we propose an efficient quantum protocol for quantum singular value transformation, which is a powerful technique for designing quantum algorithms. We feel this will be helpful in developing efficient quantum protocols for many other problems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
量子通信复杂度线性回归
在解决线性代数问题时,量子计算机可能比经典计算机实现更快的速度。然而,在某些情况下——比如对于低秩矩阵——去量子化算法证明不可能有指数级的量子加速。在这项工作中,我们表明,如果没有秩限制,量子计算机在一些基本线性代数问题的通信复杂性方面具有可证明的多项式和指数加速。我们主要集中在求解线性回归和哈密顿模拟。在量子情况下,任务是准备结果的量子态。为了进行公平的比较,在经典情况下,任务是从结果中抽样。我们在两方和多方模型中研究了这两个问题,提出了近最优量子协议,并证明了量子/经典下界。在此过程中,我们提出了一种高效的量子奇异值变换的量子协议,这是设计量子算法的有力技术。我们认为这将有助于为许多其他问题开发有效的量子协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
ACM Transactions on Computation Theory
ACM Transactions on Computation Theory COMPUTER SCIENCE, THEORY & METHODS-
CiteScore
2.30
自引率
0.00%
发文量
10
期刊最新文献
Small-Space Spectral Sparsification via Bounded-Independence Sampling Tight Sum-of-Squares lower bounds for binary polynomial optimization problems Optimal Polynomial-time Compression for Boolean Max CSP On p -Group Isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors Quantum communication complexity of linear regression
×
引用
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