Quantum Computing and Hidden Variables II: The Complexity of Sampling Histories


This paper shows that, if we could examine the entire history of a hidden variable, then we could efficiently solve problems that are believed to be intractable even for quantum computers. In particular, under any hidden-variable theory satisfying a reasonable axiom called “indifference to the identity,” we could solve the Graph Isomorphism and Approximate… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics