Related papers: Quantum computational algorithm for hidden symmetr…
The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…
If $G_1$ and $G_2$ are torsion-free hyperbolic groups and $P<G_1\times G_2$ is a finitely generated subdirect product, then the conjugacy problem in $P$ is solvable if and only if there is a uniform algorithm to decide membership of the…
We consider the bipartite unconstrained 0-1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0-1 quadratic programming problem (QP01). BQP01 has numerous applications and the problem is known…
Following the example of Shor's algorithm for period-finding in the integers, we explore the hidden subgroup problem (HSP) for discrete infinite groups. On the hardness side, we show that HSP is NP-hard for the additive group of rational…
This is a self-contained review on the theory of quantum group and its applications to modern physics. A brief introduction is given to the Yang-Baxter equation in integrable quantum field theory and lattice statistical physics. The quantum…
In this paper, we consider the computational protein design (CPD) problem, which is usually modeled as a 0/1 programming and is extremely challenging due to its combinatorial properties. We propose an efficient algorithm for solving it.…
We study unitary representations of semidirect products of a compact quantum group with a finite group. We give a classification of all irreducible unitary representations, a description of the conjugate representation of irreducible…
Quadratic unconstrained binary optimization problems (QUBOs) are intensively discussed in the realm of quantum computing and polynomial optimization. We provide a vast experimental study of semidefinite programming (SDP) relaxations of…
A product system E over a semigroup P is a family of Hilbert spaces {E_s:s\in P} together with multiplications E_s \times E_t\to E_{st}. We view E as a unitary- valued cocycle on P, and consider twisted crossed products A \times_{\beta,E} P…
The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold…
We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. We find an efficient algorithm for calculating the Ap\'ery set, as well as bounds on the elements of the Ap\'ery…
Quantum Hamiltonians containing nonseparable products of non-commuting operators, such as $\hat{\bf x}^m \hat{\bf p}^n$, are problematic for numerical studies using split-operator techniques since such products cannot be represented as a…
We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of…
We present a unified quantum-classical framework for addressing NP-complete constrained combinatorial optimization problems, generalizing the recently proposed Quantum Conic Programming (QCP) approach. Accordingly, it inherits many…
An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…
This article examines group ring codes over finite fields and finite groups. We also present a section on two-dimensional cyclic codes in the quotient ring $\mathbb{F}_q[x, y] / \langle x^{l} - 1, y^{m} - 1 \rangle$. These two-dimensional…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
The phase point operator $\Delta(q,p)$ is the quantum mechanical counterpart of the classical phase point $(q,p)$. The discrete form of $\Delta(q,p)$ was formulated for an odd number of lattice points by Cohendet et al. and for an even…
We examine the computational complexity of problems in which we are given generators for a partial bijection semigroup and asked to check properties of the generated semigroup. We prove that the following problems are in AC$^0$: (1)…
A model for quantum tunnelling of a cluster comprising A identical particles, coupled by oscillator-type potential, through short-range repulsive potential barriers is introduced for the first time in the new symmetrized-coordinate…