Related papers: A game of quantum advantage: linking verification …

In this perspective we discuss verification of quantum devices in the context of specific examples, formulated as proposed experiments. Our first example is verification of analog quantum simulators as Hamiltonian learning, where the input…

The simulation complexity of predicting the time evolution of delocalized many-body quantum systems has attracted much recent interest, and simulations of such systems in real quantum hardware are promising routes to demonstrating a quantum…

Game theory is a well established branch of mathematics whose formalism has a vast range of applications from the social sciences, biology, to economics. Motivated by quantum information science, there has been a leap in the formulation of…

Incorporating sample efficiency, by requiring the number of states consumed by broadcasting does not exceed that of a naive prepare-and-distribute strategy, gives rise to the no practical quantum broadcasting theorem. To navigate this…

A critical question for the field of quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of state-of-the-art classical computers,…

The certification of randomness is essential for both fundamental science and information technologies. Unlike traditional random number generators, randomness obtained from nonlocal correlations is fundamentally guaranteed to be…

With experimental quantum computing technologies now in their infancy, the search for efficient means of testing the correctness of these quantum computations is becoming more pressing. An approach to the verification of quantum computation…

Lottery is a game in which multiple players take chances in the hope of getting some rewards in cash or kind. In addition, from the time of the early civilizations, lottery has also been considered as an apposite method to allocate scarce…

In this thesis we introduce quantum refereed games, which are quantum interactive proof systems with two competing provers. We focus on a restriction of this model that we call "short quantum games" and we prove an upper bound and a lower…

We point out a flaw in the unfair case of the quantum Prisoner's Dilemma as introduced in the pioneering Letter "Quantum Games and Quantum Strategies" of Eisert, Wilkens and Lewenstein. It is not true that the so-called miracle move therein…

We implement an experiment on a photonic quantum processor establishing efficacy of the elementary quantum system in classical information storage. The advantage is established by considering a class of simple bipartite games played with…

We present a framework that utilizes quantum algorithms, an architecture aware quantum noise model and an ideal simulator to benchmark quantum computers. The benchmark metrics highlight the difference between the quantum computer evolution…

Persuasion, defined as the act of exploiting an informational advantage in order to effect the decisions of others, is ubiquitous. Indeed, persuasive communication has been estimated to account for almost a third of all economic activity in…

Quantum computers provide an opportunity to efficiently sample from probability distributions that include non-trivial interference effects between amplitudes. Using a simple process wherein all possible state histories can be specified by…

One of the core challenges of research in quantum computing is concerned with the question whether quantum advantages can be found for near-term quantum circuits that have implications for practical applications. Motivated by this mindset,…

We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate…

Quantum computers that process information by harnessing the remarkable power of quantum mechanics are increasingly being put to practical use. In the future, their impact will be felt in numerous fields, including in online casino games.…

Quantum pseudo-telepathy games are good examples of explaining the strangeness of quantum mechanics and demonstrating the advantage of quantum resources over classical resources. Most of the quantum pseudo-telepathy games are common…

We analyze classically defined games for which a quantum team has an advantage over any classical team. The quantum team has a clear advantage in games in which the players of each team are separated in space and the quantum team can use…

Bit commitment is a fundamental cryptographic primitive in which Bob wishes to commit a secret bit to Alice. Perfectly secure bit commitment has been proven impossible through asynchronous exchange of classical and quantum information.…