Related papers: A bound on the quantum value of all compiled nonlo…
This document presents the security protocol verifier CryptoVerif.CryptoVerif does not rely on the symbolic, Dolev-Yao model, but on the computational model. It can verify secrecy, correspondence (which include authentication), and…
Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player-two…
We show that the class MIP* of languages that can be decided by a classical verifier interacting with multiple all-powerful quantum provers sharing entanglement is equal to the class RE of recursively enumerable languages. Our proof builds…
Bell inequality violations are often taken as evidence that quantum nonlocality guarantees intrinsic randomness, effectively playing the role of a "dice" at the heart of many device-independent cryptographic protocols. We show that there…
We present a classical interactive protocol that verifies the validity of a quantum witness state for the local Hamiltonian problem. It follows from this protocol that approximating the non-local value of a multi-player one-round game to…
We introduce a notion of strategies based on averaging for nonlocal games in quantum information theory. These so-called statistical strategies come in a commuting type and a more specific spatial type, which are respectively special cases…
A number of recent studies have focused on novel features in game theory when the games are played using quantum mechanical toolbox (entanglement, unitary operators, measurement). Researchers have concentrated in two-player-two strategy,…
The non-local game scenario provides a powerful framework to study the limitations of classical and quantum correlations, by studying the upper bounds of the winning probabilities those correlations offer in cooperation games where…
We report the first demonstration of a quantum game on an all-optical one-way quantum computer. Following a recent theoretical proposal we implement a quantum version of Prisoner's Dilemma, where the quantum circuit is realized by a 4-qubit…
Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a…
In recent years methods have been proposed to extend classical game theory into the quantum domain. This paper explores further extensions of these ideas that may have a substantial potential for further research. Upon reformulating quantum…
In this work, we consider two-sender, one-receiver communication over a discrete memoryless multiple-access channel without feedback, where two senders may cooperate on channel coding by using preshared resources, such as shared randomness,…
There are few explicit examples of two player nonlocal games with a large gap between classical and quantum value. One of the reasons is that estimating the classical value is usually a hard computational task. This paper is devoted to…
A proof of quantumness (PoQ) allows a classical verifier to efficiently test if a quantum machine is performing a computation that is infeasible for any classical machine. In this work, we propose a new approach for constructing PoQ…
This thesis explores foundational aspects of quantum information theory and quantum cryptography. First, we investigate quantum correlations in interactive settings, including the CHSH and graph isomorphism games. We aim to distinguish…
We introduce a systematic approach for analyzing device-independent single-prover interactive protocols under computational assumptions. This is done by establishing an explicit correspondence with Bell inequalities and nonlocal games and…
Nonlocal games with advantageous quantum strategies give arguably the most fundamental demonstration of the power of quantum resources over their classical counterparts. Recently, certain multiplayer generalizations of nonlocal games have…
An obstacle affecting any proposal for a topological quantum computer based on Ising anyons is that quasiparticle braiding can only implement a finite (non-universal) set of quantum operations. The computational power of this restricted set…
Several variants of nonlocal games have been considered in the study of quantum entanglement and nonlocality. This paper concerns two of these variants, called quantum-classical games and extended nonlocal games. We give a construction of…
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple quantum-information-theoretic conditions which must be…