Nonlocality under Computational Assumptions

Nonlocality and its connections to entanglement are fundamental features of quantum mechanics that have found numerous applications in quantum information science. A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. An important practical consideration is that the runtime of the parties has to be shorter than the time it takes light to travel between them. One way to model this restriction is to assume that the parties are computationally bounded. We therefore initiate the study of nonlocality under computational assumptions and derive the following results:

Authors

• Grzegorz Gluch
• Khashayar Barooti
• Alexandru Gheorghiu
• Marc-Olivier Renou

Keywords

• Complexity Theory
• Delegated Quantum Computation
• Learning With Errors
• Nonlocality