Proves exponential lower bounds on resources adversaries need to break position-based quantum cryptography through non-local quantum computation, advancing understanding of quantum security under low-degree polynomial constraints.

Proves exponential lower bounds on resources adversaries need to break position-based quantum cryptography through non-local quantum computation, advancing understanding of quantum security under low-degree polynomial constraints.