Yuuya Sasaki

Learn More
This paper deals with graph colouring games, an example of pseudo-telepathy, in which two provers can convince a verifier that a graph G is c-colourable where c is less than the chromatic number of the graph. They win the game if they convince the verifier. It is known that the players cannot win if they share only classical information, but they can win in(More)
Bell inequalities, originally introduced as a method to prove that some quantum states show nonlocal behavior, are now studied as a method to capture the extent of the nonlocality of quantum states. Tight Bell inequalities are considered to be more important than redundant ones. Despite the increasing importance of the study of Bell inequalities, few kinds(More)
Relatively few families of Bell inequalities have previously been identified. Some examples are the trivial, CHSH, Imm22, and CGLMP inequalities. This paper presents a large number of new families of tight Bell inequalities for the case of many observables. For example, 44,368,793 inequivalent tight Bell inequalities other than CHSH are obtained for the(More)
In this paper, we investigate the complexity class of Bounded-error Quantum Polynomial-size Branching Programs(BQP-BP) in the case of Measurement-Once. Ablayev et al. have showed that in the case of Bounded-width branching programs, quantum models are equivalent to classical models up to Polynomial-size, Bounded or Exact error bound. However, because their(More)
  • 1