arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.07930quant-phcs.CC
收藏

基于贝尔不等式的量子信息优势

Quantum information advantage based on Bell inequalities

Centre for Quantum Technologies, Quantum Computing Research Centre, Department of Computer Science, Hon Hai (Foxconn) Research Institute National University of Singapore(新加坡国立大学鸿海(富士康)研究院量子计算研究中心量子技术中心计算机科学系)

Rahul Jain, Srijita Kundu

AI总结:

本文提出了一种基于并行重复CHSH游戏关系的量子信息优势协议,采用信息度量替代量子比特计数,具有更高效的验证者和抗噪证明者。

摘要:

最近,Kretschmer 等人[KGD+25]展示了所提出的一种量子信息优势协议的实验验证。我们提出了一种基于从并行重复CHSH游戏中推导出的关系的替代方案。我们的内存度量是基于信息度量,与[KGD+25]不同,他们计数量子比特的数量。我们的方案具有高效的验证者和具有抗噪的量子证明者,这可能比[KGD+25]更高效。

英文摘要:

Recently, Kretschmer et al. [KGD+25] presented an experimental demonstration of a proposed quantum information advantage protocol. We present an alternate proposal based on a relation derived from parallel-repeated CHSH games. Our memory measure is based on an information measure and is different from [KGD+25], where they count the number of qubits. Our proposal has an efficient verifier and a noise-robust quantum prover which is arguably much more efficient compared to [KGD+25].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑