Quantum computational advantage implies contextuality

TL;DR

This paper demonstrates that achieving quantum computational advantage inherently requires quantum contextuality, linking computational power to fundamental quantum properties and extending existing theorems like Gottesman-Knill.

Contribution

It establishes a fundamental connection between quantum advantage and contextuality, generalizing previous results and providing a new perspective on quantum computational power.

Findings

Quantum advantage implies contextuality in quantum algorithms

Generalizes Gottesman-Knill theorem to broader classes of algorithms

Highlights the fundamental role of contextuality in quantum computing

Abstract

We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum algorithms. Our result subsumes versions of Gottesman-Knill theorem as special cases.