Related papers: Genuinely quantum SudoQ and its cardinality
In this paper we compute classical Minkowsky spacetime solutions of pure SU(2) and SU(3) gauge theories, in Landau gauge. The solutions are regular everywhere except at the origin and/or infinity, are characterized by a four momentum $k$…
A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit…
Although quantum computers have the potential to efficiently solve certain problems considered difficult by known classical approaches, the design of a quantum circuit remains computationally difficult. It is known that the optimal gate…
Let $N_q$ be the number of solutions to the equation $$ (a_1^{}x_1^{m_1}+\dots+a_n^{}x_n^{m_n})^k=bx_1^{k_1}\cdots x_n^{k_n} $$ over the finite field $\mathbb F_q=\mathbb F_{p^s}$. Carlitz found formulas for~$N_q$ when…
Let Q(N;q,a) denotes the number of squares in the arithmetic progression qn+a, for n=0, 1,...,N-1, and let Q(N) be the maximum of Q(N;q,a) over all non-trivial arithmetic progressions qn + a. Rudin's conjecture asserts that Q(N)=O(Sqrt(N)),…
We show that $A_2(7,4) \leq 388$ and, more generally, $A_q(7,4) \leq (q^2-q+1)[7]_q + q^4 - 2q^3 + 3q^2 - 4q + 4$ by semidefinite programming for $q \leq 101$. Furthermore, we extend results by Bachoc et al. on SDP bounds for $A_2(n,d)$,…
Let $q$ be a prime power, let $\mathbb F_q$ be the finite field with $q$ elements and let $d_1, \ldots, d_k$ be positive integers. In this note we explore the number of solutions $(z_1, \ldots, z_k)\in\overline{\mathbb F}_q^k$ of the…
The truncation in the number of single-trace chiral primary operators of $\N=4$ SYM and its conjectured connection with gravity on quantum spacetimes are elaborated. The model of quantum spacetime we use is $AdS^5_q \times S^5_q$ for $q$ a…
A family of maximally superintegrable systems containing the Coulomb atom as a special case is constructed in N-dimensional Euclidean space. Two different sets of N commuting second order operators are found, overlapping in the Hamiltonian…
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…
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…
The locker puzzle is a game played by multiple players against a referee. It has been previously shown that the best strategy that exists cannot succeed with probability greater than 1-ln2 \approx 0.31, no matter how many players are…
We construct quartic quasitopological gravity, a theory of gravity containing terms quartic in the curvature that yields second order differential equations in the spherically symmetric case. Up to a term proportional to the quartic term in…
Quantum computing is seeking to realize hardware-optimized algorithms for application-related computational tasks. NP (nondeterministic-polynomial-time) is a complexity class containing many important but intractable problems like the…
The main obstacle in attempts to construct a consistent quantum gravity is the absence of independent flat time. This can in principle be cured by going out to higher dimensions. The modern paradigm assumes that the fundamental theory of…
We prove that there are at most 13 real quadratic fields that admit a ternary universal quadratic lattice, thus establishing a strong version of Kitaoka's Conjecture for quadratic fields. More generally, we obtain explicit upper bounds on…
In this paper, we study the subset-sum problem by using a quantum heuristic approach similar to the verification circuit of quantum Arthur-Merlin games. Under described certain assumptions, we show that the exact solution of the subset sum…
We propose the variational quantum singular value decomposition based on encoding the elements of the considered { $N\times N$} matrix into the state of a quantum system of appropriate dimension. This method doesn't use the expansion of…
We give three explicit quantum Latin squares of order $6$, with cardinalities $13$, $15$, and $17$. Throughout, vectors differing only by a global phase are counted as identical. The cardinality-$13$ construction is based on an orthogonal…
The entanglement classification of four qubits is related to the extremal black holes of the 4-dimensional STU model via a time-like reduction to three dimensions. This correspondence is generalised to the entanglement classification of a…