期刊文献+

经典、量子及其混合场景下的经典关联生成协议

Classical,Quantum and Quantum-Classical Hybrid Protocols for Generating Classical Correlations
下载PDF
导出
摘要 在信息处理任务中,多方共享的随机变量和量子纠缠都是重要的计算资源,其中共享的随机变量也被称为经典关联。经典关联生成问题研究的是生成目标关联所需消耗的最少随机性或量子纠缠的数量。该文综述性地介绍了在经典场景、量子场景以及经典、量子混合场景下的经典关联生成协议。其中,非负秩和半正定秩分别刻画了生成目标关联所需共享的最少随机性与量子纠缠的量。基于这一结果,事先共享量子纠缠相比于事先共享随机性展示出了指数级优势。考虑到近期可实现的量子设备规模有限,经典、量子混合场景下的经典关联生成协议是一个现实的选择。在可操控的量子系统大小有限的前提之下,可用k区块半正定秩来量化完成经典关联生成任务所需通讯的最少经典比特。在这一混合协议中,量子资源仍能表现出相对经典资源而言的巨大优越性。由此可见,经典关联生成问题提供了一个新的视角来对比量子资源和经典资源之间的差别。 Shared randomness and quantum entanglement are important resources for many information processing tasks,where the former is also called classical correlation.In the classical correlation generation problem,we study the minimum amount of shared randomness or quantum entanglement needed to produce a target classical correlation.Here we review classical protocol,quantum protocol,and classical and quantum hybrid protocols for generating classical correlations.First,in classical protocol and quantum protocol the minimum amount of shared randomness and quantum entanglement required are characterized by nonnegative rank and positive semidefinite rank,respectively.Based on these results,sharing prior quantum entanglement shows exponentially advantage over sharing prior randomness in such a task.Second,since it is hard to access large-scale quantum system in the near future,classical-quantum hybrid protocol is also introduced to produce large scale classical correlations.When the size of manipulable quantum systems is limited,the minimum amount of extra classical resources needed to generate a target classical correlation is characterized by the concept of k-block positive semidefinite rank.In classical-quantum hybrid protocols,it turns out that quantum resources still enjoy huge advantages over classical resources.Therefore,the classical correlation generation problem provides a new insight to compare the computational power of quantum and classical resources.
作者 林小蝶 魏朝晖 LIN Xiaodie;WEI Zhaohui(Institute for Interdisciplinary Information Sciences,Tsinghua University Haidian Beijing 100084;Yau Mathematical Sciences Center,Tsinghua University Haidian Beijing 100084;Yanqi Lake Beijing Institute of Mathematical Sciences and Applications,Haidian Beijing 100084)
出处 《电子科技大学学报》 EI CAS CSCD 北大核心 2023年第1期2-7,共6页 Journal of University of Electronic Science and Technology of China
基金 国家自然科学基金重点项目(61832015) 科技部重点研发计划(2018YFA0306703,2021YFE0113100)。
关键词 通讯复杂度 关联复杂度 关联生成 混合协议 量子优势 communication complexity correlation complexity correlation generation hybrid protocol quantum advantage
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部