Related papers: Quantum dilogarithms and partition q-series
Genetic algorithms, which mimic evolutionary processes to solve optimization problems, can be enhanced by using powerful semi-local search algorithms as mutation operators. Here, we introduce reverse quantum annealing, a class of quantum…
For each simple Lie algebra $\mathfrak{g}$, we construct an algebra embedding of the quantum group $U_q(\mathfrak{g})$ into certain quantum torus algebra $D_\mathfrak{g}$ via the positive representations of split real quantum group. The…
We use an injection method to prove a new class of partition inequalities involving certain $q$-products with two to four finitization parameters. Our new theorems are a substantial generalization of work by Andrews and of previous work by…
For any acyclic quiver, Keller-Scherotzke provided a stratifying functor from the category of finite-dimensional modules of the singular Nakajima category to the derived category of the quiver. Under this functor, a degeneration of strata…
This text gives some results about quantum torsors. Our starting point is an old reformulation of torsors recalled recently by Kontsevich. We propose an unification of the definitions of torsors in algebraic geometry and in Poisson…
Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky and Rosen [18]. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation,…
In the context of the mixing dynamical systems we present a derivation of the Gaussian ensembles distributions from mixing quantum systems having a classical analog that is mixing. We find that mixing factorization property is satisfied for…
In quantum/classical (QM/CM) partitioning methods for multi-scale modeling, one is often forced to introduce uncontrolled phenomenological effects of the environment (CM) in the quantum (QM) domain as ab initio quantum calculations are…
Stirling number of the first and the second kinds have seen many generalizations and applications in various areas of mathematics. We introduce some combinatorial parameters which realize $q$-analogues and Broder's $r$-variants of Stirling…
In this paper we compute the motivic Donaldson--Thomas invariants for the quiver with one loop and any potential. As the presence of arbitrary potentials requires the full machinery of \hat(\mu)-equivariant motives, we give a detailed…
Certain quantum topological invariants of three manifolds can be written in the form of the Gaussian sum. It is shown that such topological invariants can be approximated efficiently by a quantum computer. The invariants discussed here are…
In this paper, we consider three types of polynomial equations in quantum computer: linear divisibility equation, which belongs to a special type of binary-quadratic Diophantine equation; quadratic congruence equation with restriction in…
We give two quantum algorithms for computing (twisted) Kloosterman sums attached to a finite field $\mathbf{F}$ of $q$ elements. The first algorithm computes a quantum state containing, as its coefficients with respect to the standard…
Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been…
We show how general principles of symmetry in quantum mechanics lead to twisted notions of a group representation. This framework generalizes both the classical 3-fold way of real/complex/quaternionic representations as well as a…
We review several algebraic, combinatorial and geometric interpretations of motivic Donaldson-Thomas invariants of symmetric quivers.
We present outlines of a general method to reach certain kinds of $q$-multiple sum identities. Throughout our exposition, we shall give generalizations to the results given by Dilcher, Prodinger, Fu and Lascoux, Zeng, and Guo and Zhang…
We introduce new entanglement monotones which generalize, to the case of many parties, those which give rise to the majorization-based partial ordering of bipartite states' entanglement. We give some examples of restrictions they impose on…
Time-dependent linear differential equations are a common type of problem that needs to be solved in classical physics. Here we provide a quantum algorithm for solving time-dependent linear differential equations with logarithmic dependence…
Multiple polylogarithms are periods of variations of mixed Tate motives. Conjecturally, they deliver all such periods. We introduce deformations of multiple polylogarithms depending on a complex parameter h. We call them quantum…