Exact classical recognition of the Kochen–Specker promise problem needs χ(G) states while a QFA needs only ξ(G), giving an exponential memory separation that disappears under bounded confusability.
Implementing a Quantum Finite Automaton in IBMQ using Custom Control Pulses,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum Memory Advantage from Contextuality
Exact classical recognition of the Kochen–Specker promise problem needs χ(G) states while a QFA needs only ξ(G), giving an exponential memory separation that disappears under bounded confusability.