Related papers: Quantum game players can have advantage without di…
Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…
A version of the Monty Hall problem is presented where the players are permitted to select quantum strategies. If the initial state involves no entanglement the Nash equilibrium in the quantum game offers the players nothing more than can…
In the time since a merger of quantum mechanics and game theory was proposed formally in 1999, the two distinct perspectives apparent in this merger of applying quantum mechanics to game theory, referred to henceforth as the theory of…
Entanglement is widely believed to lie at the heart of the advantages offered by a quantum computer. This belief is supported by the discovery that a noiseless (pure) state quantum computer must generate a large amount of entanglement in…
Deviations from classical physics when distant quantum systems become correlated are interesting both fundamentally and operationally. There exist situations where the correlations enable collaborative tasks that are impossible within the…
We investigate the quantum advantage in quantum illumination using two-qubit mixed states as the initial resource. We show that in quantum illumination, the achievable advantage is determined by an interplay between initial entanglement and…
Measurements of Quantum Systems disturb their states. To quantify this non-classical characteristic, Zurek and Ollivier introduced the quantum discord, a quantum correlation which can be nonzero even when entanglement in the system is zero.…
Inspired by the primary goal of quantum thermodynamics -- to characterize quantum signatures and leverage their benefits in thermodynamic scenarios -- , we design a work extraction game within a bipartite framework that exhibits a quantum…
Entanglement is a central feature of quantum theory. Mathematical properties and physical applications of pure state entanglement make it a template to study quantum correlations. However, an extension of entanglement measures to mixed…
The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive…
Quantum resources, such as coherence, discord, and entanglement, play as a key role for demonstrating advantage in many computation and communication tasks. In order to find the nature behind these resources, tremendous efforts have been…
A quantum version of the Minority game for an arbitrary number of agents is considered. It is known that when the number of agents is odd, quantizing the game produces no advantage to the players, but for an even number of agents new Nash…
Many-body quantum games provide a natural perspective on phases of matter in quantum hardware, crisply relating the quantum correlations inherent in phases of matter to the securing of quantum advantage at a device-oriented task. In this…
We present a formalism that captures the process of proving quantum superiority to skeptics as an interactive game between two agents, supervised by a referee. Bob, is sampling from a classical distribution on a quantum device that is…
Quantum advantage, broadly understood as the ability of quantum systems to significantly outperform their classical counterparts, underpins current interest to quantum technologies and is a topic of active investigation. In many situations,…
We analyse the role of degree of entanglement for Vaidman's game in a setting where the players share a set of partially entangled three-qubit states. Our results show that the entangled states combined with quantum strategies may not be…
We calculate the quantum discord between two free modes of a scalar field which start in a maximally entangled state and then undergo a relative, constant acceleration. In a regime where there is no distillable entanglement due to the Unruh…
A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage involve the repeated use of a black box, or oracle,…