Sundar Pichai· @sundarpichai · X·· 4 小时前AI 评分45
Google Willow 量子处理器用上下文性超越经典极限
AI 导读
Google 在 Willow 量子处理器上利用量子上下文性完成多项任务:在"不可能"的 magic square 游戏中胜率 98.3%(经典极限 88.9%),状态无关上下文性测试得分 5.59(经典上限 4,量子上限 6)。多玩家游戏在最多 71 个量子比特上击败经典策略,并首次规模化运行浅层电路算法,规模达 105 个量子比特。这些任务还能捕捉随机基准测试遗漏的硬件细微错误。
正文 · 原文
Entanglement usually gets top billing in quantum computing, but quantum contextuality, the idea that properties don't have fixed values independent of how you measure them, may be the deeper reason quantum computers can outperform classical ones.
Today on the cover of @ScienceMagazine, we put contextuality to work on our Willow quantum processor:
- won the "impossible" magic square game 98.3% of the time (classical limit: 88.9%)
- measured a 5.59 on state-independent contextuality tests (classical bound: 4, quantum max: 6)
- beat classical strategies in multiplayer games up to 71 qubits
- ran a landmark shallow-circuit algorithm at scale for the first time - up to 105 qubits
These tasks also catch subtle hardware errors random benchmarks miss, a sharper ruler for building better quantum systems. x.com/ScienceMagazine/status/…
来源:Sundar Pichai · x.com