Related papers: Local Randomness: Examples and Application
This paper presents algorithms for local inversion of maps and shows how several important computational problems such as cryptanalysis of symmetric encryption algorithms, RSA algorithm and solving the elliptic curve discrete log problem…
Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to compute some global structural feature of the graph. Such algorithms use only local information available at nodes to determine local aspects of the…
Post-quantum cryptography studies the security of classical, i.e. non-quantum cryptographic protocols against quantum attacks. Until recently, the considered adversaries were assumed to use quantum computers and behave like classical…
Representing multi-mode squeezed light with a Gaussian random vector, our locally deterministic detection model challenges the CHSH game, achieving fidelities exceeding 96\%. Squeezing strength, detector threshold, and efficiency influence…
It is pointed out that the local hidden variables model of Bell and Clauser-Horne-Shimony-Holt (CHSH) gives $|<B>|\leq 2\sqrt{2}$ or $|<B>|\leq 2$ for the quantum CHSH operator $B={\bf a}\cdot {\bf \sigma}\otimes ({\bf b}+{\bf…
We study the nonlocality of arbitrary dimensional bipartite quantum states. By computing the maximal violation of a set of multi-setting Bell inequalities, an analytical and computable lower bound has been derived for general two-qubit…
This thesis is divided into two parts. In Part I we introduce a new formalism for quantum strategies, which specify the actions of one party in any multi-party interaction involving the exchange of multiple quantum messages among the…
Assume we are given (finitely many) mutually independent variables and (finitely many) "undesirable" events, each depending on a subset of the variables of at most $k$ elements, called the scope of the event. Assume that the probability of…
We present a parallel device independent quantum key distribution (DIQKD) protocol based on the CHSH game and prove its security. Using techniques developed for analysing the parallel repetition of anchored non-local games, we show that the…
Motivated by Buscemi's semi-quantum nonlocal game [PRL 108, 200401(2012)], We propose an entanglement witness game, a quantum game based on entanglement witness. Similar as the semi-quantum nonlocal game, the existence of entanglement…
We investigate the relation between Bell inequalities and nonlocal games by presenting a systematic method for their bilateral conversion. In particular, we show that while to any nonlocal game there naturally corresponds a unique Bell…
In recent years, the use of information principles to understand quantum correlations has been very successful. Unfortunately, all principles considered so far have a bipartite formulation, but intrinsically multipartite principles, yet to…
We introduce a three-player nonlocal game, with a finite number of classical questions and answers, such that the optimal success probability of $1$ in the game can only be achieved in the limit of strategies using arbitrarily…
In the classical framework of local distributed network computing, it is generally assumed that the entities executing distributed algorithms are altruistic. However, in various scenarios, the value of the output produced by an entity may…
A well-known theorem of Chung and Graham states that if $h\geq 4$ then a tournament $T$ is quasirandom if and only if $T$ contains each $h$-vertex tournament the "correct number" of times as a subtournament. In this paper we investigate the…
In this work, we introduce a new toolkit for analyzing cloning games, a notion that captures stronger and more quantitative versions of the celebrated quantum no-cloning theorem. This framework allows us to analyze a new cloning game based…
Bipartite quantum states with higher Schmidt numbers have been shown to outperform those with lower Schmidt numbers in various quantum information processing tasks, highlighting the operational advantage of entanglement dimensionality.…
We introduce a simple single-system game inspired by the Clauser-Horne-Shimony-Holt (CHSH) game. For qubit systems subjected to unitary gates and projective measurements, we prove that any strategy in our game can be mapped to a strategy in…
Quantum pseudotelepathy is a strong form of nonlocality. Different from the conventional non-local games where quantum strategies win statistically, e.g., the Clauser-Horne-Shimony-Holt game, quantum pseudotelepathy in principle allows…
Brakerski et. al [BCM+18] introduced the model of cryptographic testing of a single untrusted quantum device and gave a protocol for certifiable randomness generation. We use the leakage resilience properties of the Learning With Errors…