Related papers: Genuinely quantum SudoQ and its cardinality
In its normal form prisoners' dilemma (PD) is represented by a payoff matrix showing players strategies and payoffs. To obtain distinguishing trait and strategic form of PD certain constraints are imposed on the elements of its payoff…
We show that quantum game theory offers solution to the famous Newcomb's paradox (free will problem). Divine foreknowledge is not necessary for successful completion of the game because quantum theory offers a way to discern human…
We present the NMR implementation of a recently proposed quantum algorithm to find the parity of a permutation. In the usual qubit model of quantum computation, speedup requires the presence of entanglement and thus cannot be achieved by a…
It is shown that the finite dimensional irreducible representations of the quantum matrix algebra $ M_q(n) $ ( the coordinate ring of $ GL_q(n) $ ) exist only when q is a root of unity ( $ q^p = 1 $ ). The dimensions of these…
We study a class of Calogero-Sutherland type one dimensional N-body quantum mechanical systems, with potentials given by $$ V( x_1, x_2, \cdots x_N) = \sum_{i <j} {g \over {(x_i - x_j)^2}} - \frac{g^{\prime}}{\sum_{i<j}(x_i - x_j)^2} +…
NP-hard problems are not believed to be exactly solvable through general polynomial time algorithms. Hybrid quantum-classical algorithms to address such combinatorial problems have been of great interest in the past few years. Such…
Let $r_Q(n)$ be the representation number of a nonnegative integer $n$ by the quaternary quadratic form $Q=x_1^2+2x_2^2+x_3^2+x_4^2+x_1x_3+x_1x_4+x_2x_4$. We first prove the identity $r_Q(p^2n)=r_Q(p^2)r_Q(n)/r_Q(1)$ for any prime $p$…
We elucidate the profound connection between physics and computation by proposing and examining the model of the non-Hermitian quantum computer (NQC). In addition to conventional quantum gates such as the Hadamard, phase, and CNOT gates,…
A Newtonian approach to quantum gravity is studied. At least for weak gravitational fields it should be a valid approximation. Such an approach could be used to point out problems and prospects inherent in a more exact theory of quantum…
This paper presents a complete algorithmic study of the decision Boolean Satisfiability Problem under the classical computation and quantum computation theories. The paper depicts deterministic and probabilistic algorithms, propositions of…
This paper presents a new mathematical formalism that describes the quantization of games. The study of so-called quantum games is quite new, arising from a seminal paper of D. Meyer \cite{Meyer} published in Physics Review Letters in 1999.…
In this paper, we present a QUBO formulation designed to solve a series of generalisations of the LinkedIn queens game, a version of the N-queens problem, for the Takuzu game (or Binairo), for the most recent LinkedIn game, Tango, and for…
We give the complete set of irreducible representations of U(SU(2))_q when q is a m-th root of unity. In particular we show that their dimensions are less or equal to m. Some of them are not highest weight representations.
In the past few years it has been shown that universal quantum computation can be obtained by projective measurements alone, with no need for unitary gates. This suggests that the underlying logic of quantum computing may be an algebra of…
We consider the most general SU(3) singlet space of gauged N=8 supergravity in four-dimensions. The SU(3)-invariant six scalar fields in the theory can be viewed in terms of six real four-forms. By exponentiating these four-forms, we…
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 Jackiw-Teitelboim gravity with the matter degrees of freedom is considered. The classical model is exactly solvable and its solutions describe non-trivial gravitational scattering of matter wave-packets. For huge amount of the solutions…
We propose an approach for quantifying a quantum circuit's quantumness as a means to understand the nature of quantum algorithmic speedups. Since quantum gates that do not preserve the computational basis are necessary for achieving quantum…
The mathematical aspects of the popular logic game Sudoku incorporate a significant number of the group theory concepts. In this note, we describe all symmetric transformations of the Sudoku grid. We do not intend to obtain a new strategy…
The Quantum Kolkata restaurant problem is a multiple-choice version of the quantum minority game, where a set of n non-communicating players have to chose between one of m choices. A payoff is granted to the players that make a unique…