Related papers: Quantum Dating Market
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…
Game theory is central to the understanding of competitive interactions arising in many fields, from the social and physical sciences to economics. Recently, as the definition of information is generalized to include entangled quantum…
Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve entanglement among many states which is…
The Prisoners' Dilemma is perhaps the most famous model in the field of game theory. Consequently, it is natural to investigate its quantum version when one considers to apply quantum strategies to game theory. There are two main results in…
It is argued from several points of view that quantum probabilities might play a role in statistical settings. New approaches toward quantum foundations have postulates that appear to be equally valid in macroscopic settings. One such…
We describe a quantum model of simple choice game (constructed upon entangled state of two qubits), which involves the fundamental problem of transitive - intransitive preferences. We compare attainability of optimal intransitive strategies…
In game theory, a popular model of a struggle for survival among three competing agents is a truel, or three person generalization of a duel. Adopting the ideas recently developed in quantum game theory, we present a quantum scheme for the…
Quantum computers are different from binary digital electronic computers based on transistors. Common digital computing encodes the data into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum…
Quantum Genetic Algorithms (QGAs) are an emerging field of multivariate quantum optimization that emulate Darwinian evolution and natural selection, with vast applications in chemistry and engineering. The appropriate application of fitness…
When a probe qubit is coupled to a quantum register that represents a physical system, the probe qubit will exhibit a dynamical response only when it is resonant with a transition in the system. Using this principle, we propose a quantum…
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…
The noncooperative Nash equilibrium solution of classical games corresponds to a rational expectations attitude on the part of the players. However, in many cases, games played by human players have outcomes very different from Nash…
We present a full implementation and simulation of a novel quantum reinforcement learning method. Our work is a detailed and formal proof of concept for how quantum algorithms can be used to solve reinforcement learning problems and shows…
Quantum mechanics can speed up a range of search applications over unsorted data. For example imagine a phone directory containing N names arranged in completely random order. To find someone's phone number with a probability of 50%, any…
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…
We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal…
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The…
Grover's quantum algorithm for an unstructured search problem and the Count algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum…
We propose a continuous time quantum search algorithm using a generalization of the Jaynes-Cummings model. In this model the states of the atom are the elements among which the algorithm realizes the search, exciting resonances between the…
Effect of replacing the classical game object with a quantum object is analyzed. We find this replacement requires a throughout reformation of the framework of Game Theory. If we use density matrix to represent strategy state of players,…