Zlatko K. Minev

Preprint · 2025 · large collaboration

Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality

Shashwat Kumar, Eliott Rosenberg, Alejandro Grajales Dau, …, Zlatko Minev, Craig Gidney, Noureldin Yosri, …

On a superconducting processor, quantum contextuality lifts success probabilities beyond classical limits in the magic square game, the N-player GHZ game and a 2D hidden linear function problem. The same tasks suggest contextuality-based benchmarks for quantum processors.

Abstract

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.