Related papers: Quantum polylogarithms
Despite significant advances in quantum algorithms, quantum programs in practice are often expressed at the circuit level, forgoing helpful structural abstractions common to their classical counterparts. Consequently, as many quantum…
Historically, the polylogarithm has attracted specialists and non-specialists alike with its lovely evaluations. Much the same can be said for Euler sums (or multiple harmonic sums), which, within the past decade, have arisen in…
Considering the difficult problem under classical computing model can be solved by the quantum algorithm in polynomial time, t-multiple discrete logarithm problems presented. The problem is non-degeneracy and unique solution. We talk about…
We give novel and explicit formulas for the Ehrhart quasi-polynomials of rational simple polytopes, in terms of Barnes polynomials and discrete moments of half-open parallelepipeds. These formulas also hold for all positive dilations of a…
Let $X$ be a smooth complete intersection over $\mathbb{C}$ of dimension $n-k$ in the projective space $\mathbf{P}^n_{\mathbb{C}}$, for given positive integers $n$ and $k$. For a given integral homology cycle $[\gamma] \in…
We consider multiple polylogarithms in a single variable at non-positive integers. Defining a connected graded Hopf algebra, we apply Connes' and Kreimer's algebraic Birkhoff decomposition to renormalize multiple polylogarithms at…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
Several researchers, including Leonid Levin, Gerard 't Hooft, and Stephen Wolfram, have argued that quantum mechanics will break down before the factoring of large numbers becomes possible. If this is true, then there should be a natural…
The Ehrhart quasipolynomial of a rational polytope $\mathsf{P}$ encodes fundamental arithmetic data of $\mathsf{P}$, namely, the number of integer lattice points in positive integral dilates of $\mathsf{P}$. Ehrhart quasipolynomials were…
Despite its age, quantum theory still suffers from serious conceptual difficulties. To create clarity, mathematical physicists have been attempting to formulate quantum theory geometrically and to find a rigorous method of quantization, but…
Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…
In the past four decades, the notion of quantum polynomial-time computability has been mathematically modeled by quantum Turing machines as well as quantum circuits. This paper seeks the third model, which is a quantum analogue of the…
We describe a theoretical and effective algorithm which enables us to prove that rather general hypergeometric series and integrals can be decomposed as linear combinations of multiple zeta values, with rational coefficients.
This is a review of ($q$-)hypergeometric orthogonal polynomials and their relation to representation theory of quantum groups, to matrix models, to integrable theory, and to knot theory. We discuss both continuous and discrete orthogonal…
We initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms…
Based on the connection between the categorical derivation of classical programs from specifications and the category-theoretic approach to quantum physics, this paper contributes to extending the laws of classical program algebra to…
Gradient-based algorithms, popular strategies to optimization problems, are essential for many modern machine-learning techniques. Theoretically, extreme points of certain cost functions can be found iteratively along the directions of the…
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…
Monogamy and polygamy of quantum correlations are the fundamental properties of quantum systems. We study the monogamy and polygamy relations satisfied by any quantum correlations in multipartite quantum systems. General monogamy relations…
The purpose of this paper is to show that, under certain combinatorial conditions on the graph, parametric Feynman integrals can be realized as periods on the complement of the determinant hypersurface in an affine space depending on the…