Related papers: Genuinely quantum SudoQ and its cardinality

This paper deals with a generalized Sudoku problem and investigates the unicity of a given solution. We introduce constraint sets, which is a generalization of the rows, columns and blocks of a classical Sudoku puzzle. The unicity property…

We report the first demonstration of a quantum game on an all-optical one-way quantum computer. Following a recent theoretical proposal we implement a quantum version of Prisoner's Dilemma, where the quantum circuit is realized by a 4-qubit…

In this paper we give a novel solution to a classical completion problem for square matrices. This problem was studied by many authors through time, and it is completely solved in [2, 3]. In this paper we relate this classical problem to a…

We prove that if $k$ is a positive integer then for every finite field $\mathbb{F}$ of cardinality $q\neq 2$ and for every positive integer $n$ such that $q^n>(k-1)^4$, every $n\times n$ matrix over $\mathbb{F}$ can be expressed as a sum of…

This pedagogical article solves an interesting problem in quantum measure theory. Although a quantum measure $\mu$ is a generalization of an ordinary probability measure, $\mu$ need not satisfy the usual additivity condition. Instead, $\mu$…

Bianchi type I cosmological model in (n+1)-dimensional gravity with several forms is considered. When the electric non-composite brane ansatz is adopted, the Wheeler-DeWitt (WDW) equation for the model, written in a conformally covariant…

We classify the supersymmetric vacua of N=4, d=5 supergravity in terms of G-structures. We identify three classes of solutions: with R^3, SU(2) and generic SO(4) structure. Using the Killing spinor equations, we fully characterize the first…

We obtain partial progress towards answering the question of whether the quantity defined in the Mondrian Puzzle can ever equal 0. More specifically, we obtain a nontrivial lower bound for the cardinality of the set $\{n\leq x: M(n)\neq0…

Quantum systems with a finite number of states at all times have been a primary element of many physical models in nuclear and elementary particle physics, as well as in condensed matter physics. Today, however, due to a practical demand in…

For any fixed dimension $d \geq 3$ we construct a Nikodym set in $F_q^d$ of cardinality $q^d - (\frac{d-2}{\log 2} +1+o(1)) q^{d-1} \log q$ in the limit $q \to \infty$, when $q$ is an odd prime power. This improves upon the naive random…

Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player-two…

Translationally invariant symmetric polynomials as coordinates for $N$-body problems with identical particles are proposed. It is shown that in those coordinates the Calogero and Sutherland $N$-body Hamiltonians, after appropriate gauge…

Quantum computing offers significant potential for solving NP-hard combinatorial (optimization) problems that are beyond the reach of classical computers. One way to tap into this potential is by reformulating combinatorial problems as a…

Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, single round quantum games or at most finitely repeated games have been widely studied, however…

For every positive integer $n$, the quantum integer $[n]_q$ is the polynomial $[n]_q = 1 + q + q^2 + ... + q^{n-1}.$ A quadratic addition rule for quantum integers consists of sequences of polynomials $\mathcal{R}' =…

A game is rigid if a near-optimal score guarantees, under the sole assumption of the validity of quantum mechanics, that the players are using an approximately unique quantum strategy. Rigidity has a vital role in quantum cryptography as it…

The prevailing view is that quantum phenomena can be harnessed to tackle certain problems beyond the reach of classical approaches. Quantifying this capability as a quantum-classical separation and demonstrating it on current quantum…

In this paper, by using permutation matrices as a representation of symmetric group $S_N$ and Fourier matrix, we investigate quantum roulette with an arbitrary $N$-state. This strategy, which we introduce, is general method that allows us…

Three player quantum Kolkata restaurant problem is modeled using three entangled qutrits. This first use of three level quantum states in this context is a step towards a $N$-choice generalization of the $N$-player quantum minority game. It…

For any odd integer $n\geq3$ a board (of size $n$) is a square array of $n\times n$ positions with a simple rule of how to move between positions. The goal of the game we introduce is to find a path from the upper left corner of a board to…