Gabriel Senno

Learn More
Well quasi-orders (wqo’s) are an important mathematical tool for proving termination of many algorithms. Under some assumptions upper bounds for the computational complexity of such algorithms can be extracted by analyzing the length of controlled bad sequences. We develop a new, self-contained study of the length of bad sequences over the product ordering(More)
We study the length functions of controlled bad sequences over some well quasi-orders (wqo’s) and classify them in the Fast Growing Hierarchy. We develop a new and selfcontained study of the length of bad sequences over the disjoint product in N (Dickson’s Lemma), which leads to recently discovered upper bounds but through a simpler argument. We also give a(More)
Many experimental setups in quantum physics use pseudorandomness in places where the theory requires randomness. In this Letter we show that the use of pseudorandomness instead of proper randomness in quantum setups has potentially observable consequences. First, we present a new loophole for Bell-like experiments: if some of the parties choose their(More)
Quantum mechanics postulates random outcomes. However, a model making the same output predictions but in a deterministic manner would be, in principle, experimentally indistinguishable from quantum theory. In this work we consider such models in the context of nonlocality on a device-independent scenario. That is, we study pairs of nonlocal boxes that(More)
The question of how large Bell inequality violations can be, for quantum distributions, has been the object of much work in the past several years. We say a Bell inequality is normalized if its absolute value does not exceed 1 for any classical (i.e. local) distribution. Upper and (almost) tight lower bounds have been given in terms of number of outputs of(More)
  • 1