scholarly journals Entanglement and quantum strategies reduce congestion costs in Pigou networks

Author(s):  
Naini Dudhe ◽  
Colin Benjamin
Author(s):  
Heng Zhang ◽  
Junsuo Zhao ◽  
Wenjun Zhang ◽  
Dan Li ◽  
Xi Yong ◽  
...  

1999 ◽  
Vol 82 (5) ◽  
pp. 1052-1055 ◽  
Author(s):  
David A. Meyer
Keyword(s):  

2007 ◽  
Vol 41 (8) ◽  
pp. 734-749 ◽  
Author(s):  
Elena Safirova ◽  
Kenneth Gillingham ◽  
Sébastien Houde

2016 ◽  
Vol 16 (13&14) ◽  
pp. 1191-1211 ◽  
Author(s):  
Dimeter Ostrev

We consider the infinite family of non-local games CHSH(n). We consider nearly-optimal strategies for CHSH(n). We introduce a notion of approximate homomorphism for strategies and show that any nearly-optimal strategy for CHSH(n) is approximately homomorphic to the canonical optimal CHSH(n) strategy. This demonstrates that any nearly-optimal CHSH(n) strategy must approximately contain the algebraic structure of the canonical optimal strategy.


2016 ◽  
Vol 51 (4) ◽  
pp. 1789-1809
Author(s):  
Hongzhong Fan ◽  
Shah Muhammad Kamran ◽  
Mingliang Li ◽  
Qiliang Zhou

2019 ◽  
Vol 7 ◽  
Author(s):  
WILLIAM SLOFSTRA

We construct a linear system nonlocal game which can be played perfectly using a limit of finite-dimensional quantum strategies, but which cannot be played perfectly on any finite-dimensional Hilbert space, or even with any tensor-product strategy. In particular, this shows that the set of (tensor-product) quantum correlations is not closed. The constructed nonlocal game provides another counterexample to the ‘middle’ Tsirelson problem, with a shorter proof than our previous paper (though at the loss of the universal embedding theorem). We also show that it is undecidable to determine if a linear system game can be played perfectly with a finite-dimensional strategy, or a limit of finite-dimensional quantum strategies.


Sign in / Sign up

Export Citation Format

Share Document