Related papers: Quantum advantage beyond entanglement in Bayesian …
Quantum computers solve intractable problems which classically require an exponentially long time to compute. With the development of large-scale experiments that claim quantum advantage, a vital issue has now emerged. What are the errors,…
We study the procedure for sequential unambiguous state discrimination. A qubit is prepared in one of two possible states, and measured by two observers Bob and Charlie sequentially. A necessary condition for the state to be unambiguously…
Entanglement is of paramount importance in quantum information theory. Its supremacy over classical correlations has been demonstrated in numerous information theoretic protocols. Here we study possible adequacy of quantum entanglement in…
We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol, when played repeatedly ad infinitum. We focus on establishing that such repeated games -- by virtue of inherent quantum-mechanical…
Random access codes have provided many examples of quantum advantage in communication, but concern only one kind of information retrieval task. We introduce a related task - the Torpedo Game - and show that it admits greater quantum…
We present the classical Hotelling model we want to quantize, and investigate the quantum consequences of the game. Our results demonstrate that the quantum game give higher profit for both players, and that with the quantum entanglement…
We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…
The quantum mechanical approach to the well known prisoners dilemma, one of the basic examples to illustrate the concepts of Game Theory, is implemented with a classical optical resource, nonquantum entanglement between spin and orbital…
Recently, the fast development of quantum technologies led to the need for tools allowing the characterization of quantum resources. In particular, the ability to estimate non-classical aspects, e.g. entanglement and quantum discord, in…
A theory is universal contextual if its prediction cannot be reproduced by an ontological model satisfying both preparation and measurement noncontextuality assumptions. In this report, we first generalize the logical proofs of quantum…
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 address the question of the role of quantum correlations beyond entanglement in context of quantum magnetometry. To this end, we study the evolution of the quantum discord, measured by the rescaled discord, of two electron-spin qubits…
Classical game theory is a powerful tool focusing on optimized resource distribution, allocation and sharing in classical wired and wireless networks. As quantum networks are emerging as a means of providing true connectivity between…
In this work we successfully present a quantum version of the multiplayer Colonel Blotto game. We find that players with access to the quantum strategies has a advantage over the classical ones. The payoff is invariant under the order of…
Quantum computing has the potential to solve complex problems faster and more efficiently than classical computing. It can achieve speedups by leveraging quantum phenomena like superposition, entanglement, and tunneling. Quantum walks (QWs)…
One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed…
We present a quantum approach to a signaling game; a special kind of extensive games of incomplete information. Our model is based on quantum schemes for games in strategic form where players perform unitary operators on their own qubits of…
Calculation of the quantum discord requires to find the minimum of the quantum conditional entropy $S(\rho^{AB}|\{\Pi^B_{k}\})$ over all measurements on the subsystem $B$. In this paper, we provide a simple relation for the conditional…
It is well known that quantum, randomized and deterministic (sequential) query complexities are polynomially related for total boolean functions. We find that significantly larger separations between the parallel generalizations of these…
The celebrated Clauser, Horne, Shimony and Holt (CHSH) game model helps to perform the security analysis of many two-player quantum protocols. This game specifies two Boolean functions whose outputs have to be computed to determine success…