量子
量子位元
Kochen-Specker定理
计算机科学
水准点(测量)
算法
量子算法
功能(生物学)
布尔函数
量子计算机
工作(物理)
统计物理学
数学
理论计算机科学
量子系统
量子电路
平方(代数)
量子态
量子信道
人工智能
魔术(望远镜)
量子力学
拓扑(电路)
电流(流体)
量子信息
量子技术
量子相位估计算法
作者
Shashwat Kumar,Eliott N. Rosenberg,Alejandro Grajales Dau,Rodrigo G. Cortiñas,Maslov, Dmitri,Oliver, Richard,Adam Zalcman,M. Neeley,Alice Pagano,Aaron Szasz,Ilya Drozdov,Zlatko Minev,Craig Gidney,Noureldin Yosri,Stijn J. de Graaf,Aniket Maiti,Dmitry A. Abanin,Rajeev Acharya,Laleh Aghababaie Beni,Georg Aigeldinger
标识
DOI:10.48550/arxiv.2512.02284
摘要
The prevailing view is that quantum phenomena can be harnessed to tackle certain problems beyond the reach of classical approaches. Quantifying this capability as a quantum-classical separation and demonstrating it on current quantum processors has remained elusive. Using a superconducting qubit processor, we show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits. With a few qubits, we illustrate quantum contextuality with the magic square game, as well as quantify it through a Kochen--Specker--Bell inequality violation. To examine many-body contextuality, we implement the N-player GHZ game and separately solve a 2D hidden linear function problem, exceeding classical success rate in both. Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI