Related papers: Implementing 2-qubit pseudo-telepathy games on noi…
We present a multipartite nonlocal game in which each player must guess the input received by his neighbour. We show that quantum correlations do not perform better than classical ones at this game, for any prior distribution of the inputs.…
We introduce two two-player quantum pseudo-telepathy games based on two recently proposed all-versus-nothing (AVN) proofs of Bell's theorem [A. Cabello, Phys. Rev. Lett. 95, 210401 (2005); Phys. Rev. A 72, 050101(R) (2005)]. These games…
Quantum mechanics courses focus mostly on its computational aspects. This alone does not provide the same depth of understanding as most physicists have of classical mechanics. The understanding of classical mechanics is significantly…
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…
An approach towards quantum games is proposed that uses the unusual probabilities involved in EPR-type experiments directly in two-player games.
Quantum mechanics is known to provide significant improvements in information processing tasks when compared to classical models. These advantages range from computational speeds-up to security improvements. A key question is where these…
Games are useful tools for introducing new concepts to students. This paper describes a competitive two-player game for sophomore students in a modern physics survey course or junior/senior students in an introductory quantum mechanics…
We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games…
Simulating the topological phases of matter in synthetic quantum simulators is a topic of considerable interest. Given the universality of digital quantum simulators, the prospect of digitally simulating exotic topological phases is greatly…
In this paper from 2011 we approach some questions about quantum contextuality with tools from formal logic. In particular, we consider an experiment associated with the Peres-Mermin square. The language of all possible sequences of…
Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond the capabilities of known classical…
We generalize the quantum Prisoner's Dilemma to the case where the players share a non maximally entangled states. We show that the game exhibits an intriguing structure as a function of the amount of entanglement with two thresholds which…
The physics of dirty bosons highlights the intriguing interplay of disorder and interactions in quantum systems, playing a central role in describing, for instance, ultracold gases in a random potential, doped quantum magnets, and amorphous…
We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g. the…
Quantum computing has the potential to provide solutions to problems that are intractable on classical computers, but the accuracy of the current generation of quantum computers suffer from the impact of noise or errors such as leakage,…
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement on the two states to determine the players' payoffs. We…
Topological symmetries, invertible and otherwise, play a fundamental role in the investigation of quantum field theories. Despite their ubiquitous importance across a multitude of disciplines ranging from string theory to condensed matter…
Today, people are looking forward to get an awesome computational power. This kind of desire can be answered by quantum computing. By adopting quantum mechanics theory, it can generate a very fast computation result. As known, quantum…
We use the example of playing a 2-player game with entangled quantum objects to investigate the effect of quantum correlation. We find that for simple game scenarios it is classical correlation that is the central feature and that these…
The complexity of free games with two or more classical players was essentially settled by Aaronson, Impagliazzo, and Moshkovitz (CCC'14). There are two complexity classes that can be considered quantum analogues of classical free games:…