Related papers: Quantum Dating Market
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…
We study a quantum version of the sequential game illustrating problems connected with making rational decisions. We compare the results that the two models (quantum and classical) yield. In the quantum model intransitivity gains importance…
We introduce hybrid classical-quantum algorithms for problems involving a large classical data set X and a space of models Y such that a quantum computer has superposition access to Y but not X. These algorithms use data reduction…
Quantum Game Theory provides us with new tools for practising games and some other risk related enterprices like, for example, gambling. The two party gambling protocol presented by Goldenberg {\it et al} is one of the simplest yet still…
Grover's algorithm is a quantum search algorithm that proceeds by repeated applications of the Grover operator and the Oracle until the state evolves to one of the target states. In the standard version of the algorithm, the Grover operator…
A game in which one player makes unitary transformations of a simple system, and another seeks to confound the resulting state by a randomly chosen action is analyzed carefully. It is shown that the second player can reduce any system to a…
Recently Marinatto and Weber introduced an interesting new scheme for quantizing games, and applied their scheme to the famous game 'Battle of the Sexes'. In this Comment we make two observations: (a) the overall quantization scheme is…
We describe human-subject laboratory experiments on probabilistic auctions based on previously proposed auction protocols involving the simulated manipulation and communication of quantum states. These auctions are probabilistic in…
We study a quantum game played by two players with restricted multiple strategies. It is found that in this restricted quantum game Nash equilibrium does not always exist when the initial state is entangled. At the same time, we find that…
Quantum computing is a growing field where the information is processed by two-levels quantum states known as qubits. Current physical realizations of qubits require a careful calibration, composed by different experiments, due to noise and…
Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary…
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum information with one or more other parties. In particular, we focus…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
Quantum Algorithms have long captured the imagination of computer scientists and physicists primarily because of the speed up achieved by them over their classical counterparts using principles of quantum mechanics. Entanglement is believed…
The strategic Go game, known for the tedious mathematical complexities, has been used as a theme in many fiction, movies, and books. Here, we introduce the Go game and provide a new version of quantum Go in which the boxes are initially in…
Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Since quantum systems produce counter-intuitive patterns believed not to be efficiently…
Replication of DNA and synthesis of proteins are studied from the view-point of quantum database search. Identification of a base-pairing with a quantum query gives a natural (and first ever) explanation of why living organisms have 4…
Classical phase-space variables are normally chosen to promote to quantum operators in order to quantize a given classical system. While classical variables can exploit coordinate transformations to address the same problem, only one set of…
This paper presented two general quantum search algorithms. We derived the iterated formulas and the simpler approximate formulas and the precise formula for the amplitude in the desired state. A mathematical proof of Grover's algorithm…
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…