Related papers: Quantum Dating Market
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…
The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…
We build new quantum games, similar to the spin flip game, where as a novelty the players perform measurements on a quantum system associated to a continuous time search algorithm. The measurements collapse the wave function into one of the…
Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The authors have recently proposed a quantum description of financial market in terms of quantum game…
We review some of quantum algorithms for search problems: Grover's search algorithm, its generalization to amplitude amplification, the applications of amplitude amplification to various problems and the recent quantum algorithms based on…
We consider the problem of search of an unstructured list for a marked element, when one is given advice as to where this element might be located, in the form of a probability distribution. The goal is to minimise the expected number of…
We analysed quantum version of the game battle of sexes using a general initial quantum state. For a particular choice of initial entangled quantum state it is shown that the classical dilemma of the battle of sexes can be resolved and a…
Quantum game theory is the study of strategic behavior by agents with access to quantum technology. Broadly speaking, this technology can be employed in either of two ways: As part of a randomization device or as part of a communications…
It is suggested that the individual outcomes of a measurement process can be understood within standard quantum mechanics in terms of the measuring apparatus, treated as a quantum computer, executing Grover's search algorithm.
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 algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
Quantum game theory is a recently developing field of physical research. In this paper, we investigate quantum games in a systematic way. With the famous instance of the Prisoner's Dilemma, we present the fascinating properties of quantum…
We investigate a multi-player and multi-choice quantum game. We start from two-player and two-choice game and the result is better than its classical version. Then we extend it to N-player and N-choice cases. In the quantum domain, we…
Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The paper is devoted to the analysis of interference of quantum strategies in quantum market games.
Quantum strategies have been successfully applied to game theory for years. However, as a reverse problem of game theory, the theory of mechanism design is ignored by physicists. In this paper, the theory of mechanism design is generalized…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle)…
Game theory is the mathematical framework for analyzing strategic interactions in conflict and competition situations. In recent years quantum game theory has earned the attention of physicists, and has emerged as a branch of quantum…
This paper consider the possibility of using some quantum tools in decision making strategies. In particular, we consider here a dynamical open quantum system helping two players, $\G_1$ and $\G_2$, to take their decisions in a specific…
We recast Grover's generalised search algorithm in a geometric language even when the states are not approximately orthogonal. We provide a possible search algorithm based on an arbitrary unitary transformation which can speed up the steps…
Search-base algorithms have widespread applications in different scenarios. Grover's quantum search algorithms and its generalization, amplitude amplification, provide a quadratic speedup over classical search algorithms for unstructured…