A synchronous game that robustly certifies a strategy under maximally entangled projective assumptions robustly certifies the same strategy for all finite-dimensional strategies, with polynomially related robustness.
Over- lapping Qubits
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Lifting the maximally-entangledness assumption in robust self-testing for synchronous games
A synchronous game that robustly certifies a strategy under maximally entangled projective assumptions robustly certifies the same strategy for all finite-dimensional strategies, with polynomially related robustness.