量子算法微分

G. Colucci, F. Giacosa
{"title":"量子算法微分","authors":"G. Colucci, F. Giacosa","doi":"10.26421/QIC21.1-2-5","DOIUrl":null,"url":null,"abstract":"In this work we present an algorithm to perform algorithmic differentiation in the context of quantum computing. We present two versions of the algorithm, one which is fully quantum and one which employees a classical step (hybrid approach). Since the implementation of elementary functions is already possible on quantum computers, the scheme that we propose can be easily applied. Moreover, since some steps (such as the CNOT operator) can (or will be) faster on a quantum computer than on a classical one, our procedure may ultimately emonstrate that quantum algorithmic differentiation has an advantage relative to its classical counterpart.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"3 1","pages":"80-94"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quantum algorithmic differentiation\",\"authors\":\"G. Colucci, F. Giacosa\",\"doi\":\"10.26421/QIC21.1-2-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we present an algorithm to perform algorithmic differentiation in the context of quantum computing. We present two versions of the algorithm, one which is fully quantum and one which employees a classical step (hybrid approach). Since the implementation of elementary functions is already possible on quantum computers, the scheme that we propose can be easily applied. Moreover, since some steps (such as the CNOT operator) can (or will be) faster on a quantum computer than on a classical one, our procedure may ultimately emonstrate that quantum algorithmic differentiation has an advantage relative to its classical counterpart.\",\"PeriodicalId\":20904,\"journal\":{\"name\":\"Quantum Inf. Comput.\",\"volume\":\"3 1\",\"pages\":\"80-94\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Inf. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26421/QIC21.1-2-5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Inf. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26421/QIC21.1-2-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在这项工作中,我们提出了一种在量子计算背景下执行算法微分的算法。我们提出了两个版本的算法,一个是完全量子的,一个是采用经典步骤(混合方法)的。由于在量子计算机上已经可以实现初等函数,因此我们提出的方案可以很容易地应用。此外,由于某些步骤(如CNOT运算符)在量子计算机上可以(或将)比在经典计算机上更快,我们的过程可能最终证明量子算法微分相对于其经典对偶具有优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Quantum algorithmic differentiation
In this work we present an algorithm to perform algorithmic differentiation in the context of quantum computing. We present two versions of the algorithm, one which is fully quantum and one which employees a classical step (hybrid approach). Since the implementation of elementary functions is already possible on quantum computers, the scheme that we propose can be easily applied. Moreover, since some steps (such as the CNOT operator) can (or will be) faster on a quantum computer than on a classical one, our procedure may ultimately emonstrate that quantum algorithmic differentiation has an advantage relative to its classical counterpart.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A quantization of interacting particle systems Guidelines to use the ICSM for developing quantum-classical systems A Comparative Analysis of Quantum-based Approaches for Scalable and Efficient Data mining in Cloud Environments On the quantum complexity of integration of a function with unknown singularity Site recurrence for continuous-time open quantum walks on the line
×
引用
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