Answers are grounded in this paper and cite their sources.
Quantum phenomena can be exploited to tackle certain problems beyond the reach of classical approaches. In this study, we focus on coordinated decision-making among many players without communication, the study of which, 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 and quantify it through a Bell-Kochen-Specker inequality violation. To examine many-body contextuality, we implement the N -player Greenberger-Horne-Zeilinger game and separately solve a two-dimensional hidden linear function problem, advancing the state of the art on fidelity and system size in both tasks. Our work introduces benchmarking of quantum processors using contextuality-based algorithms.
No takes yet. Share an insight, caveat, or question.
Kumar et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: