Related papers: Genuinely quantum SudoQ and its cardinality
Cardinality constraints are important in many Sat problems; previous studies provide contradictory conclusions about the best encoding to use. Here, three encodings are compared: Sinz's sequential-counter, Bailleux and Boufkhad's…
The conventional paradigm of quantum computing is discrete: it utilizes discrete sets of gates to realize bitstring-to-bitstring mappings, some of them arguably intractable for classical computers. In parameterized quantum approaches, the…
In this paper, we revisit the theory of perfect unary forms over real quadratic fields. Specifically, we deduce an infinite family of real quadratic fields $\mathbb{Q}(\sqrt{d})$ when $d=2$ or $3$ mod $4$, such that there are three classes…
This paper investigates Nash equilibria in pure strategies for quantum approach to the Prisoner's Dilemma. The quantization process involves extending the classical game by introducing two additional unitary strategies. We consider five…
A perfect strategy is one that allows the mutually in-communicated players of a nonlocal game to win every trial of the game. Perfect strategies are basic tools for some fundamental results in quantum computation and crucial resources for…
A novel class of hybrid quantum-classical algorithms based on the variational approach have recently emerged from separate proposals addressing, for example, quantum chemistry and combinatorial problems. These algorithms provide an…
A definition of quantum singularity for the case of static spacetimes has recently been extended to conformally static spacetimes. Here the theory behind quantum singularities in conformally static spacetimes is reviewed, and then applied…
Via elementary examples it is demonstrated that the singularities of classical physics (sampled by the Big Bang in cosmology) need not necessarily get smeared out after quantization. It is proposed that the role of quantum singularities can…
The standard setting of quantum computation for continuous problems uses deterministic queries and the only source of randomness for quantum algorithms is through measurement. This setting is related to the worst case setting on a classical…
A novel family of exactly solvable quantum systems on curved space is presented. The family is the quantum version of the classical Perlick family, which comprises all maximally superintegrable 3-dimensional Hamiltonian systems with…
We investigate the universality of correlation functions of chaotic and disordered quantum systems as an external parameter is varied. A new, general scaling procedure is introduced which makes the theory invariant under reparametrizations.…
The Quantum Satisfiability problem (QSAT) is the generalization of the canonical NP-complete problem - Boolean Satisfiability. (k,s)-QSAT is the following variant of the problem: given a set of projectors of rank 1, acting non-trivially on…
Singularities in general relativity and quantum field theory are often taken not only to motivate the search for a more-fundamental theory (quantum gravity, QG), but also to characterise this new theory and shape expectations of what it is…
We consider the problem of deciding if a set of quantum one-qudit gates $\mathcal{S}=\{U_1,\ldots,U_n\}$ is universal. We provide the compact form criteria leading to a simple algorithm that allows deciding universality of any given set of…
This paper develops and analyses a novel quantum combinatorial game: quantum checkers (codenamed Cheqqers). The concepts of superposition, entanglement, measurements and interference from quantum mechanics are integrated into the game of…
The two-qubit canonical decomposition SU(4) = [SU(2) \otimes SU(2)] Delta [SU(2) \otimes SU(2)] writes any two-qubit quantum computation as a composition of a local unitary, a relative phasing of Bell states, and a second local unitary.…
We derive a charged black hole solution in four dimensions described by $SL(2,R)\times SU(2)\times U(1)/U(1)^2$ WZW coset model. Using the algebraic Hamiltonian method we calculate the corresponding solution that is exact to all orders in…
We consider the classical $n$-queens problem, which asks how many ways one can place $n$ mutually non-attacking queens on an $n$ x $n$ chessboard. We prove that the total number of solutions to the $n$-queens problem $Q(n)$ is divisible by…
We introduce a variational quantum solver for combinatorial optimizations over $m=\mathcal{O}(n^k)$ binary variables using only $n$ qubits, with tunable $k>1$. The number of parameters and circuit depth display mild linear and sublinear…
For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…