相关论文: The Quantum Monty Hall Problem

Quantum uncertainty is a well-known property of quantum mechanics that states the impossibility of predicting measurement outcomes of multiple incompatible observables simultaneously. In contrast, the uncertainty in the classical domain…

We study the advantages of quantum strategies in evolutionary social dilemmas on evolving random networks. We focus our study on the two-player games: prisoner's dilemma, snowdrift and stag-hunt games. The obtained result show the benefits…

We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg, which initiated the study of this field. By generalizing…

A fundamental limitation of quantum communication is that a single qubit can carry at most 1 bit of classical information. For an important class of quantum communication channels, known as entanglement-breaking, this limitation holds even…

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 simulation of quantum effects requires certain classical resources, and quantifying them is an important step in order to characterize the difference between quantum and classical physics. For a simulation of the phenomenon of…

Sharing correlated random variables is a resource for a number of information theoretic tasks such as privacy amplification, simultaneous message passing, secret sharing and many more. In this article, we show that to establish such a…

In this letter we show that communication when restricted to a single information carrier (i.e. single particle) and finite speed of propagation is fundamentally limited for classical systems. On the other hand, quantum systems can surpass…

A novel class of hybrid quantum-classical algorithms based on the variational approach have recently emerged from separate proposals addressing, for example, quantum chemistry and combinatorial problems. These algorithms provide an…

Encoding information in quantum systems can offer surprising advantages but at the same time there are limitations that arise from the fact that measuring an observable may disturb the state of the quantum system. In our work, we provide an…

We show that given an explicit description of a multiplayer game, with a classical verifier and a constant number of players, it is QMA-hard, under randomized reductions, to distinguish between the cases when the players have a strategy…

The concept of forming harmonious coalitions is introduced to both classical and quantum symmetric cooperative game. In both cases, players are motivated to form coalitions. Also, the main feature of the cooperative game is conserved.

We consider the dating market decision problem under the quantum mechanics point of view. Quantum states whose associated amplitudes are modified by men strategies are used to represent women. Grover quantum search algorithm is used as a…

The quantum advantage arising in a simplified multi-player quantum game, is found to be a disadvantage when the game's qubit-source is corrupted by a noisy "demon". Above a critical value of the corruption-rate, or noise-level, the coherent…

We analyze the quantum penny flip game using geometric algebra and so determine all possible unitary transformations which enable the player Q to implement a winning strategy. Geometric algebra provides a clear visual picture of the quantum…

Any physical transformation that equally distributes quantum information over a large number M of users can be approximated by a classical broadcasting of measurement outcomes. The accuracy of the approximation is at least of the order 1/M.…

This paper reconsiders the problem of the absent-minded driver who must choose between alternatives with different payoff with imperfect recall and varying degrees of knowledge of the system. The classical absent-minded driver problem…

We introduce a quantum version of the Game of Life and we use it to study the emergence of complexity in a quantum world. We show that the quantum evolution displays signatures of complex behaviour similar to the classical one, however a…

According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…

A quantum password is a quantum mechanical analogue of the classical password. Our proposal is completely quantum mechanical in nature, i.e. at no point is information stored and manipulated classically. We show that, in contrast to quantum…