模拟量子寄存器解纠缠

Paweł Ryszawa
{"title":"模拟量子寄存器解纠缠","authors":"Paweł Ryszawa","doi":"10.5604/01.3001.0012.2003","DOIUrl":null,"url":null,"abstract":"Implementing quantum-inspired algorithms on classical computers suffers trade-off between the necessity of saving operational memory and the amount of memory necessary to fully represent a quantum state with possible entanglement. The latter is well known to consume the memory exponentially in the number of qubits. This paper sketches out the idea on how to reduce significantly the amount of necessary memory while distorting the entanglement moderately or not at all. At present, considered are real nonnegative probability amplitudes.","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Modelling quantum register disentanglement\",\"authors\":\"Paweł Ryszawa\",\"doi\":\"10.5604/01.3001.0012.2003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Implementing quantum-inspired algorithms on classical computers suffers trade-off between the necessity of saving operational memory and the amount of memory necessary to fully represent a quantum state with possible entanglement. The latter is well known to consume the memory exponentially in the number of qubits. This paper sketches out the idea on how to reduce significantly the amount of necessary memory while distorting the entanglement moderately or not at all. At present, considered are real nonnegative probability amplitudes.\",\"PeriodicalId\":240434,\"journal\":{\"name\":\"Computer Science and Mathematical Modelling\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Science and Mathematical Modelling\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5604/01.3001.0012.2003\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science and Mathematical Modelling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5604/01.3001.0012.2003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在经典计算机上实现受量子启发的算法,需要在节省操作内存的必要性和充分表示具有可能纠缠的量子态所需的内存量之间进行权衡。众所周知,后者以量子位的数量呈指数级消耗内存。本文概述了如何在适度扭曲或完全不扭曲纠缠的情况下显著减少必要内存量的想法。目前考虑的是实数非负概率幅值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Modelling quantum register disentanglement
Implementing quantum-inspired algorithms on classical computers suffers trade-off between the necessity of saving operational memory and the amount of memory necessary to fully represent a quantum state with possible entanglement. The latter is well known to consume the memory exponentially in the number of qubits. This paper sketches out the idea on how to reduce significantly the amount of necessary memory while distorting the entanglement moderately or not at all. At present, considered are real nonnegative probability amplitudes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Image caption generation using transfer learning Overview of selected reinforcement learning solutions to several game theory problems When AI Fails to See: The Challenge of Adversarial Patches Fuzzy sets in modeling patient’s disease states in medical diagnostics support algorithms Analysis of selected reinforcement learning applications in contract bridge
×
引用
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