Related papers: Investigation of quantum roulette
We discuss some systematic methods for implementing state manipulations in systems formally similar to chains of a few spins with nearest-neighbor interactions, arranged such that there are strong and weak scales of coupling links. States…
We study the separability of permutationally symmetric quantum states. We show that for bipartite symmetric systems most of the relevant entanglement criteria coincide. However, we provide a method to generate examples of bound entangled…
The dynamics of the nuclear-spin quantum computer with large number (L=1000) of qubits is considered using a perturbation approach, based on approximate diagonalization of exponentially large sparse matrices. Small parameters are introduced…
Quantum computers are on the verge of becoming a commercially available reality. They represent a paradigm shift in computing, with a steep learning gradient. The creation of games is a way to ease the transition for beginners. We present a…
This paper discusses the permutations that are generated by rotating $k \times k$ blocks of squares in a union of overlapping $k \times (k+1)$ rectangles. It is found that the single-rotation parity constraints effectively determine the…
Variational quantum algorithms (VQAs) offer a promising near-term approach to finding optimal quantum strategies for playing non-local games. These games test quantum correlations beyond classical limits and enable entanglement…
A setup is proposed to play a quantum version of the famous bimatrix game of Prisoners' Dilemma. Multi-slit electron diffraction with each player's pure strategy consisting of opening one of the two slits at his/her disposal are essential…
Quantum computers that process information by harnessing the remarkable power of quantum mechanics are increasingly being put to practical use. In the future, their impact will be felt in numerous fields, including in online casino games.…
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 study the matrix models $\pi:C(S_N^+)\to M_N(C(X))$ which are flat, in the sense that the standard generators of $C(S_N^+)$ are mapped to rank 1 projections. Our first result is a generalization of the Pauli matrix construction at $N=4$,…
We examine the classical contents of quantum games. It is shown that a quantum strategy can be interpreted as a classical strategies with effective density-dependent game matrices composed of transposed matrix elements. In particular,…
The $N$-player quantum game is analyzed in the context of an Einstein-Podolsky-Rosen (EPR) experiment. In this setting, a player's strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical…
The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be…
We propose an experimental implementation of a quantum game algorithm in a hybrid scheme combining the quantum circuit approach and the cluster state model. An economical cluster configuration is suggested to embody a quantum version of the…
The application of the methods of quantum mechanics to game theory provides us with the ability to achieve results not otherwise possible. Both linear superpositions of actions and entanglement between the players' moves can be exploited.…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…
The aim of this paper is to discuss in some detail the two different quantum schemes for duopoly problems. We investigate under what conditions one of the schemes is more reasonable that the other one. Using the Cournot's duopoly example we…
We investigate the notion of $k$-transitivity for the quantum permutation groups $G\subset S_N^+$, with a brief review of the known $k=1,2$ results, and with a study of what happens at $k\geq3$. We discuss then matrix modelling questions…
We discuss the application of the permutation group S_N to a few problems in hadron physics. A method is proposed for matching a quark model Hamiltonian onto the effective Hamiltonian of the 1/Nc expansion, which makes use of the…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…