Reliable computation from contextual correlations
Abstract
An operational approach to the study of computation based on correlations considers black-boxes with one-bit inputs and outputs, controlled by a limited classical computer capable only of performing sums modulo-2. In this setting, it was shown that non-contextual correlations do not provide any extra computational power, while contextual correlations were found to be necessary for the deterministic evaluation of non-linear Boolean functions. Here we investigate the requirements for reliable computation in this setting, that is, the evaluation of any Boolean function with success probability bounded away from 1/2. We show that bipartite CHSH quantum correlations suffice for reliable computation. We also prove that an arbitrarily small violation of a multipartite GHZ non-contextuality inequality also suffices for reliable computation.
Cite
@article{arxiv.1706.09757,
title = {Reliable computation from contextual correlations},
author = {André L. Oestereich and Ernesto F. Galvão},
journal= {arXiv preprint arXiv:1706.09757},
year = {2017}
}
Comments
5 pages, no figures. v2: corrected argument in section IV, other slight changes for clarity