14 citations · 18 across the 3 of their papers we have counts for
4 papers
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
Tsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto
A central problem in quantum computational complexity is how to prevent entanglement-assisted cheating in multi-prover interactive proof systems. It is well-known that the standard…
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-Prover Interactive Proof Systems
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda +2
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as multi…
New Classes of Facets of Cut Polytope and Tightness of I_{mm22} Bell Inequalities
David Avis, Tsuyoshi Ito
The Grishukhin inequality Gr_7 is a facet of CutP_7, the cut polytope on seven points, which is ``sporadic'' in the sense that its proper generalization has not been known. In this…
Deriving Tight Bell Inequalities for 2 Parties with Many 2-valued Observables from Facets of Cut Polytopes
David Avis, Hiroshi Imai, Tsuyoshi Ito +1
Relatively few families of Bell inequalities have previously been identified. Some examples are the trivial, CHSH, I_{mm22}, and CGLMP inequalities. This paper presents a large num…