AIsaAIsaStudio English 打开 AIsa Studio

Google 用 Willow 量子处理器实验证明量子上下文性突破经典界限

原标题:A game you cannot win unless you have a quantum computer

Google Quantum AI 在 Science 发表论文,用超导量子处理器实验演示了测量上下文性:在魔术方阵游戏中,其量子比特以 98.30%(0.9830 ± 0.0001)的胜率击败经典策略 88.89% 的理论上限,并通过 Bell–Kochen–Specker 不等式测得 χ = 5.590 ± 0.008,超过经典界限 4、接近量子极限 6。团队还把任务扩展到更大规模:GHZ 宇称游戏最多用 71 个量子比特仍保持高于经典界限,验证了横跨 45 个量子比特的真纠缠,并用浅层电路在最多 105 个量子比特上求解隐藏线性函数问题。这些任务还能捕捉随机电路基准容易掩盖的细微相干误差,可成为量子硬件的敏感新基准。

为什么值得看

原文用可玩的魔术方阵游戏讲清量子上下文性,并给出 Willow 上的实测数字,读者能直观理解量子优势的来源。

阅读原文 ↗11月20日 AI 日报

本页的摘要、推荐理由与解读出自 AIsa Studio 的 AI 风向智能体,原文版权归原作者所有。

深度解读

发生了什么

Google Research 发布发表于 Science 的论文《Quantum-classical separation in bounded-resource tasks arising from measurement contextuality》,在超导量子处理器上实验演示并量化了量子上下文性,突破经典界限。团队在 Willow 处理器上运行了经典的“魔方游戏”:一个 3×3 网格谜题,在行乘积为 +1、列乘积为 −1 的规则下根本无解。把它变成 Alice 与 Bob 各持一行/一列、不能交流的游戏后,任何事先写好的策略最多赢 9 轮中的 8 轮(88.89%),而量子计算机原则上可以全胜。

实验结果是:量子比特以 98.3%(0.9830 ± 0.0001)的胜率赢得游戏,在上下文性测试中超过经典上限,并在多达 105 个量子比特的任务上胜过经典策略。

关键细节

  • 魔方游戏中,Alice 与 Bob 各持两个共享纠缠 Bell 对的量子比特,通过预设测量获得 ±1 答案。九个版本各跑 100,000 次,量子比特约每六十轮才输一轮。
  • 团队用 Bell–Kochen–Specker 不等式 χ = R1 + R2 + R3 − C1 − C2 − C3 量化上下文性:任何预设答案的宇宙必须满足 χ ≤ 4,量子力学允许到 6。实测 χ = 5.590 ± 0.008,距量子极限仅约 7%。
  • 这个测试与量子态制备无关,因此 χ 是机器本身的属性。测量需在同一对量子比特上连续进行 540 次测量、重复 1,000 次,并借助一个辅助量子比特读取结果而不扰动主比特。
  • 规模实验:GHZ 奇偶游戏中最多 71 个玩家(每比特一人),全程保持高于经典界限(随人数增长趋向 50%);并验证了横跨 45 个比特的真实纠缠。
  • 团队还首次在大规模真实硬件上运行了 2018 年定理中的隐线性函数算法,用恒定深度量子电路在最多 105 个比特的网格上求解,成功率高于一半。

为什么重要

纠缠通常被当作量子计算的“魔法成分”,但越来越多的理论认为上下文性才是更深层资源——它真正驱动某些量子算法超越经典对应物。此前上下文性几乎只在几个粒子的小系统中演示过,它能否在真实量子计算机所依赖的多体系统中存续并保持有用,一直是未决问题。

这组实验在真实硬件上给出了答案:上下文性在规模上依然存在且有用。这些任务还带来一个意外红利:它们能暴露随机电路基准会平均掉、难以察觉的相干错误。这类任务给硬件一个由物理本身设定的天花板——χ = 6、胜率 1——这个天花板永不移动,机器表现与物理极限的差距就成为客观、有意义的评分。这对分子模拟等需要运行结构化算法、错误无处遁形的实际应用尤为重要。

对谁有影响

  • 量子硬件开发者:获得一个能捕捉传统基准遗漏之细微错误的新标尺。
  • 量子基础与计算研究者:关于“测量结果是否都有预先存在值”的近百年争论如今有了可测量、可判定的检验,并为探究量子计算机优势之源提供了实证路径。
  • 容错量子计算领域:理论将上下文性与纠错量子计算机运行完整算法所需的“魔法态”相关联,团队近期已用魔法态培育技术制备出这类态。
全文翻译

这是一道适合周日报纸风格的谜题,你可以现在就尝试一下。画一个 3×3 的网格。在每个单元格中填入 +1 或 −1,需满足两条规则:每行的乘积必须为 +1,每列的乘积必须为 −1。

来吧。我们等着……

你没成功,对吧?这背后有一个优雅的原因。为了让一行的乘积为 +1,它需要偶数个 −1。为了让一列的乘积为 −1,它需要奇数个。把所有行加起来,你会发现网格中包含偶数个 −1。把所有列加起来,你会发现它包含奇数个。嗯……这是不可能的!

这个网格必须同时具备两种矛盾的属性。这样的表格不存在;这是一个悖论。

现在把这个谜题变成一场游戏:每一轮,Alice 拿到一行,Bob 拿到一列。在不交谈的情况下,Alice 按照行规则填写她的行,Bob 按照列规则填写他的列。如果他们在行和列相交的方格中填入相同的数字,他们就赢了。任何预先制定的计划只是一张预写的表格,这意味着他们最多只能在 9 轮中赢 8 轮。如果他们使用量子计算机,情况就会改变。它不会填充那个不可能的网格,但在原则上,它让他们每轮都能赢。

原因在于一种称为 量子语境性 的特性,这可以说是量子力学中最奇怪的特征。爱因斯坦曾著名地问过,当没有人看时,月亮是否还在那里,他以此坚持认为物理属性应该独立于是否有人测量而存在。对于量子系统而言,语境性是一个精确且可实验验证的陈述,答案可以是“不”:你不能为你可能测量的所有事物分配固定、预先存在的值。

测量所得的结果取决于你与之同时进行的其他兼容测量(即取决于其 语境)。这不仅是一个深刻的哲学命题,更是前沿科学的基础,也是新技术的基石。而在上面的游戏中,Alice 和 Bob 可以利用它来构建解决方案。他们的答案不是从预先写好的隐藏表中查找的;那张表并不存在。他们的答案是在测量过程中产生的,而量子相关性将它们紧密地编织在一起,其程度超过了任何经典规则书所允许的范围。

纠缠通常被视为量子计算的“魔法成分”。但越来越多的理论表明,语境性是更深层的资源,是真正推动某些量子算法超越其经典对应物的东西。问题在于,直到最近,语境性几乎 exclusively 在少数粒子的小系统中得到证明。它在由真实量子计算机构成的多体系统中能否幸存并保持有用,一直是一个开放的问题。

这就是我们要回答的问题。在发表于 《科学》 的论文 《源于测量语境性的有界资源任务中的量子-经典分离》 中,我们在超导量子处理器上展示并测量了语境性。我们的量子比特以 98.3% 的胜率赢得神奇方块游戏,在语境性测试中超过经典极限,并在涉及多达 105 个量子比特的任务中优于经典策略。在此过程中,这些任务被证明是量子硬件的一个敏感新基准,能够捕捉到随机电路测试所遗漏的细微错误。

超越经典界限

我们在 Willow 量子处理器上运行了通常被称为 神奇方块游戏 的实验。Alice 和 Bob 各持有两个量子比特,共享两个纠缠的 贝尔对,而不是预写的表格,并使用为其分配的行或列的预设设置进行测量,以获得他们的 ±1 条目。

理论上最好的经典策略至少会在九轮中输掉一轮,胜率最高为 88.89%。当我们每种版本的九局游戏各玩 100,000 次时,我们的量子比特大约六十轮输一次,胜率为 98.30% (0.9830 ± 0.0001)。

这一差距具有意义且具有统计显著性:我们的量子比特协调得比任何预写表格所允许的都要好。这是因为没有单元格的值是预先固定的。每个答案只有在与其所在行或列的其余部分(其语境)一起测量时才形成,而共享的纠缠使得 Alice 和 Bob 对于共享单元格的答案达成一致。

量化语境性

神奇方块游戏展示了语境性的潜在力量,因此接下来我们着手测量机器的语境性程度。我们使用了 贝尔-科肯-斯佩克不等式,它与著名的 贝尔测试 密切相关,后者证明了像上述贝尔对这样的纠缠粒子不能携带预先固定的答案。我们的不等式将一组相关性捆绑为一个单一的数字 χ。用上面游戏中的行和列来表示,它是 χ = R1 + R2 + R3 − C1 − C2 − C3,其中 R 和 C 代表 Alice 和 Bob 之前必须计算的行和列的乘积:

+1

+1

+1

R1 = (+1)×(+1)×(+1) = +1

+1

−1

−1

R2 = (+1)×(−1)×(−1) = +1

−1

+1

−1

R3 = (−1)×(+1)×(−1) = +1

C1 = (+1)×(+1)×(−1) = −1

C2 = (+1)×(−1)×(+1) = −1

C3 = (+1)×(−1)×(−1) = +1

χ = 4

在任何测量结果都是预先确定的宇宙中,必须遵守 χ ≤ 4(试几个表格你就会发现 χ 只能取 -4、0 和 4 的值)。量子力学允许高达 6 的值,这只在所有 R = +1 且所有 C = -1 时才会发生。与大多数此类测试不同,这个测试是 状态无关的:无论你如何制备量子比特都不重要,这使得它成为机器本身的属性,而不是精心选择的输入的属性。

测量 χ 要求很高:每一行和每一列都必须在相同的两个量子比特上依次测量,且不干扰它们。我们用了一个额外的辅助量子比特(“ancilla”)来完成这项工作,它拾取每个结果并进行测量,从而保留两个主量子比特完好无损。我们连续进行了 540 次测量,重复了 1,000 次。

我们测得 χ = 5.590 ± 0.008。

comfortably 超过经典界限 4,仅距离量子极限 7%。这个数字表明:这台机器中存在如此数量的语境性。

它在规模化后是否还能幸存?

两个量子比特是一回事,但量子效应是脆弱的,每增加一个量子比特都会带来噪音,从而抵消这些效应。有用的量子计算需要许多量子比特协同工作,因此问题是语境性在规模化后是否还能幸存。

在 GHZ 奇偶校验游戏 中,N 名玩家共享一个纠缠的 GHZ 态(所有量子比特为 0 和所有量子比特为 1 的叠加态)。每个玩家得到一个一位数的问题,并用一位数回答,互不通信。如果所有答案的奇偶性(偶数或奇数)与由问题设定的规则匹配,他们就赢了。随机猜测有一半的胜率,最好的经典计划也只略好一点:三名玩家时为 75%,随着玩家数量增加,逐渐趋向于 50%。共享的 GHZ 态每次都能赢。我们最多使用了 71 名玩家,每个量子比特一名。噪音使我们低于 100%,并且随着每个添加的量子比特而增长,因此我们的优势缩小,但我们始终保持在经典界限之上。我们还验证了 45 个量子比特之间的真实纠缠,多于早期许多 GHZ 实验的全尺寸。

除了多人游戏之外,相同的物理原理也区分了浅层量子电路和经典电路。2018 年,一项里程碑式的定理 证明,一个特定问题——寻找 隐藏线性函数 ——可以由 恒定深度 量子电路解决,而任何恒定深度的经典电路都无法解决。这种量子优势的根源可以追溯到语境性。

在这个证明中,恒定深度至关重要。这意味着随着问题变大,电路不会变得更深。因为每个输出位都是在固定数量的步骤中计算的,信息只能传播很短的距离。因此,每个经典输出只能“看到”输入的很小邻域,就像一条谣言必须在三分钟内穿越一座城市一样。量子电路由于已经铺设好了纠缠,不受此限制。

该算法从未在真实硬件上大规模运行过。我们运行了它,在多达 105 个量子比特 的网格上解决隐藏线性函数实例,成功率超过二分之一,完全使用了理论规定的浅层电路配方。

意外的红利:更好的尺子

在进行这些实验的过程中,顺便发生了一件有益的事情。这些任务要求许多量子比特同时且精确地达成一致。运行它们暴露了我们系统中的细微相干误差,这种误差会将量子状态稍微偏离目标,而传统的随机电路基准测试往往将其平均到不可见。

这表明了语境性的第二种用途:不仅是作为计算资源,而且是作为一把尺子。

大多数基准测试询问处理器是否能清除某个经典障碍。这些任务则为硬件提供了一个由物理本身设定的上限:χ = 6,胜率为 1,完美的语境分数。机器实现的目标与自然允许的目标之间的距离成为一个客观、有意义的分数。而且不像那些越来越容易跨越的经典障碍,这个上限永远不会移动。我们的量子处理器越好,此类基准测试的区分度就越精确。这对于实际应用特别相关,例如用于化学和材料科学的分子模拟,因为它衡量的是处理器运行结构化算法的能力,在这种算法中,细微的错误无法隐藏。

接下来是什么

关于物理系统在无人观察时是否总是存在的争论已近一个世纪,结果发现它有一个可测量的测试。对于我们的量子比特来说,结论很明确:并非我们测量的所有事物都有预先存在的值等待被观察。理论将语境性 与纠错量子计算机运行完整算法所需的“魔法态”联系起来,我们团队最近使用 魔法态培养 准备了这些状态。

在多个量子比特上测量语境性,让我们能够在真实硬件上探索物理学和计算机科学中的一个开放问题:是什么赋予了量子计算机其优势。

致谢

这项工作由 Google Quantum AI 团队与我们的学术合作者共同完成。我们感谢所有构建和维护使这些实验成为可能的硬件、控制电子设备、低温设备和软件的人员。

查看原文

Here is a Sunday paper-style puzzle you can try right now. Draw a 3×3 grid. Fill every cell with either +1 or −1, subject to two rules: each row must multiply to +1, and each column must multiply to −1.

Go ahead. We’ll wait…

You didn’t manage it, right? There is an elegant reason for that. For a row to multiply to +1, it needs an even number of −1s. For a column to multiply to −1, it needs an odd number. Add up the rows and you learn the grid contains an even number of −1s. Add up the columns and you learn it contains an odd number. Well…That’s impossible!

The grid would have to be two contradictory things at once. No such table exists; it is a paradox.

Now turn the puzzle into a game: Each round, Alice is handed a row and Bob a column. Without talking, Alice fills her row by the row rule and Bob fills his column by the column rule. They win if they put the same number in the square where their row and column intersect. Any plan made in advance is just a pre-written table, meaning at best they will win 8 out of 9 rounds. This changes if they use a quantum computer. It won't fill in the impossible grid, but in principle, it lets them win every round.

The reason is a property called quantum contextuality, arguably the strangest feature of quantum mechanics. Einstein once famously asked whether the moon is there when nobody looks, his way of insisting that physical properties ought to exist whether or not anyone measures them. For quantum systems, contextuality is the precise, experimentally testable statement that the answer can be no: you cannot assign fixed, pre-existing values to everything you might measure.

What a measurement yields can depend on which other compatible measurements you make alongside it (i.e., on its context). This is not only a deep philosophical statement, but more so, cutting-edge science and the basis of a new technology. And in the game above, Alice and Bob can use it to engineer a solution. Their answers are not looked up in a hidden table written in advance; the table does not exist. Their answers come into being as they measure, and quantum correlations stitch them together more tightly than any classical rulebook permits.

Entanglement usually gets top billing as the “magic ingredient” of quantum computing. But a growing body of theory suggests contextuality is the deeper resource, the thing that actually powers certain quantum algorithms past their classical counterparts. The catch is that, until recently, contextuality had been demonstrated almost exclusively in small systems of a few particles. Whether it survives, and stays useful, in the many-body systems that real quantum computers are made of was an open question.

That is the question we set out to answer. In "Quantum-classical separation in bounded-resource tasks arising from measurement contextuality," published in Science, we demonstrate and measure contextuality on our superconducting quantum processors. Our qubits win the magic square game 98.3% of the time, exceed the classical limit on a contextuality test, and outperform classical strategies in tasks spanning up to 105 qubits. Along the way, these tasks proved to be a sensitive new benchmark for quantum hardware, catching subtle errors that random-circuit tests miss.

Beating the classical bound

We ran what is commonly called the magic square game on our Willow quantum processor. Alice and Bob each hold two qubits, sharing two entangled Bell pairs instead of a pre-written table, and measure them using preset settings for their assigned row or column to get their ±1 entries.

The best conceivable classical strategy loses at least one round in nine, winning at most 88.89% of the time. When we played all nine versions of the game 100,000 times apiece, our qubits lost roughly one in sixty, winning 98.30% of them (0.9830 ± 0.0001).

The gap is meaningful and statistically significant: our qubits coordinated better than any pre-written table allows. That's because no cell has a value fixed in advance. Each answer takes shape only when it is measured alongside the rest of its row or column (its context), and shared entanglement makes Alice's and Bob's answers for the shared cell agree.

Putting a number on contextuality

The magic square game demonstrated the potential power of contextuality, so next we set out to measure how contextual a machine is. We used a Bell–Kochen–Specker inequality, closely related to the famous Bell test which showed that entangled particles like the Bell pairs above can't carry answers fixed in advance. Our inequality bundles a set of correlations into a single number, χ. In terms of the rows and columns from the game above it reads, χ = R1 + R2 + R3 − C1 − C2 − C3, where R and C represent the products of the rows and columns Alice and Bob had to calculate earlier:

+1

+1

+1

R1 = (+1)*(+1)*(+1) = +1

+1

−1

−1

R2 = (+1)*(−1)*(−1) = +1

−1

+1

−1

R3 = (−1)*(+1)*(−1) = +1

C1 = (+1)*(+1)*(−1) = −1

C2 = (+1)*(−1)*(+1) = −1

C3 = (+1)*(−1)*(−1) = +1

χ = 4

Any universe where measurement outcomes are predetermined must obey χ ≤ 4 (try a few tables and you will see that χ can only take values -4, 0, and 4). Quantum mechanics permits values up to 6, which can only happen if all Rs = +1 and all Cs = -1. And unlike most such tests, this one is state-independent: it doesn’t matter how you prepare the qubits, which makes it a property of the machine rather than of a carefully chosen input.

Measuring χ is demanding: every row and column must be measured on the same two qubits, one after another, without disturbing them. We did this with an extra helper qubit (an "ancilla") that picks up each result and is measured instead, leaving the two main qubits intact. We ran 540 measurements in a row, repeated 1,000 times.

We measured χ = 5.590 ± 0.008.

Comfortably past the classical bound of 4 and only 7% away from the quantum limit. A number that says: the contextuality is in this machine in this quantity.

Does it survive at scale?

Two qubits are one thing, but quantum effects are fragile, and every added qubit brings noise that can wash them out. Useful quantum computing needs many qubits working together, so the question is whether contextuality survives at scale.

In the GHZ parity game, N players share one entangled GHZ state (a superposition of all qubits being 0 and all being 1). Each player gets a one-bit question and answers with one bit, without communicating. They win if the parity (even or odd) of all the answers matches a rule set by the questions. Random guessing wins half the time, and the best classical plan does only a bit better: 75% for three players, shrinking toward 50% as players are added. A shared GHZ state wins every time. We played with up to 71 players, one per qubit. Noise keeps us below 100% and grows with each added qubit, so our lead narrows, but we stay above the classical bound throughout. We also verified genuine entanglement across 45 qubits, more than the full size of many earlier GHZ experiments.

Beyond multiplayer games, the same physics separates shallow quantum and classical circuits. In 2018, a landmark theorem proved that a specific problem, finding a hidden linear function, can be solved by a constant depth quantum circuit, and that no classical circuit of constant depth can. The source of this quantum advantage traces back to contextuality.

In this proof, constant depth matters. It means the circuit doesn’t get deeper as the problem gets bigger. Because every output bit is computed in a fixed number of steps, information has time to travel only a short distance. Each classical output can therefore only “see” a small neighborhood of the input, like a rumor that must cross a city in three minutes. Quantum circuits, with entanglement already laid down, are not so limited.

That algorithm had never been run at scale on real hardware. We ran it, solving hidden-linear-function instances on grids of up to 105 qubits, with success probabilities above one-half, using exactly the shallow-circuit recipe the theory prescribes.

The unexpected dividend: A better ruler

While running these experiments, something useful happened along the way. These tasks demand that many qubits agree simultaneously and exactly. Running them surfaced subtle coherent errors in our system, the kind that rotates a quantum state slightly off-target, which conventional random-circuit benchmarks tend to average away into invisibility.

That suggests a second use for contextuality: not just as a computational resource, but as a ruler.

Most benchmarks ask whether a processor can clear some classical bar. These tasks instead give hardware a ceiling set by physics itself: χ = 6, a win probability of 1, a perfect contextual fraction. The distance between what a machine achieves and what nature permits becomes an objective, meaningful score. And unlike classical bars that get easier to clear, this ceiling never moves. The better our quantum processors get, the more precisely such a benchmark discriminates. This is particularly relevant for real-world applications, such as simulations of molecules for chemistry and materials science, because it measures a processor’s ability to run structured algorithms, where subtle errors can’t hide.

What comes next

A nearly century-old argument about whether physical systems always exist when nobody looks turns out to have a measurable test. For our qubits, the verdict is clear: not everything we measure can have pre-existing values waiting to be observed. Theory links contextuality to the "magic states" that error-corrected quantum computers need to run full algorithms, which our team recently prepared using magic state cultivation.

Measuring contextuality across many qubits lets us probe an open question in physics and computer science on real hardware: what gives quantum computers their edge.

Acknowledgements

This work was carried out by the Google Quantum AI team together with our academic collaborators. We thank everyone who built and maintained the hardware, control electronics, cryogenics and software that made these experiments possible.

原文版权归 Google Research 及原作者所有,本站转载仅供阅读。如需删除,请联系 support@aisa.one。