Related papers: Quantum polylogarithms
We develop the theory of multiple polylogarithms from analytic, Hodge and motivic point of view. Define the category of mixed Tate motives over a ring of integers in a number field. Describe explicitly the multiple polylogarithm Hopf…
Classical polylogarithms give rise to a variation of mixed Hodge-Tate structures on the punctured projective line $S=\mathbb{P}^1\setminus \{0, 1, \infty\}$, which is an extension of the symmetric power of the Kummer variation by a trivial…
Polylogarithms are those multiple polylogarithms that factor through a certain quotient of the de Rham fundamental group of the thrice punctured line known as the polylogarithmic quotient. Building on work of Dan-Cohen, Wewers, and Brown,…
It's well known that multiple polylogarithms give rise to good unipotent variations of mixed Hodge-Tate structures. In this paper we shall {\em explicitly} determine these structures related to multiple logarithms and some other multiple…
To each local field (including the real or complex numbers) we associate a quantum dilogarithm and show that it satisfies a pentagon identity and some symmetries. Using an angled version of these quantum dilogarithms, we construct three…
Feynman integrals are central to all calculations in perturbative Quantum Field Theory. They often give rise to iterated integrals of dlog-forms with algebraic arguments, which in many cases can be evaluated in terms of multiple…
Feynman integrals are very often computed from their differential equations. It is not uncommon that the $\varepsilon$-factorised differential equation contains only dlog-forms with algebraic arguments, where the algebraic part is given by…
We introduce general q-deformed multiple polylogarithms which even in the dilogarithm case differ slightly from the deformation usually discussed in the literature. The merit of the deformation as suggested, here, is that q-deformed…
Quantum computing has been studied over the past four decades based on two computational models of quantum circuits and quantum Turing machines. To capture quantum polynomial-time computability, a new recursion-theoretic approach was taken…
Deligne and Goncharov constructed a neutral tannakian category of mixed Tate motives unramified over $\mathbb{Z}[\mu_N,1/N]$. Brown and Hain--Matsumoto computed the depth 2 quadratic relations of the motivic Galois group of this category…
The fractional polylogarithms, depending on a complex parameter $\a$, are defined by a series which is analytic inside the unit disk. After an elementary conversion of the series into an integral presentation, we show that the fractional…
Polylogarithmic time delineates a relevant notion of feasibility on several classical computational models such as Boolean circuits or parallel random access machines. As far as the quantum paradigm is concerned, this notion yields the…
Polylogrithmic functions, such as the logarithm or dilogarithm, satisfy a number of algebraic identities. For the logarithm, all the identities follow from the product rule. For the dilogarithm and higher-weight classical polylogarithms,…
In this article, we study the analytic properties of the multiple polylogarithms in the $s$-aspect. Although the domain of absolute convergence of the series defining the multiple polylogarithms is well-known, the study towards a larger…
We study the de Rham fundamental group of the configuration space $E^{(n)}$ of $n+1$ marked points on an elliptic curve $E$, and define multiple elliptic polylogarithms. These are multivalued functions on $E^{(n)}$ with unipotent monodromy,…
Multiple polylogarithms appear in analytic calculations of higher order corrections in quantum field theory. In this article we study the numerical evaluation of multiple polylogarithms. We provide algorithms, which allow the evaluation for…
A polynomial depth quantum circuit effects, by definition a poly-local unitary transformation of tensor product state space. It is a physically reasonable belief [Fy][L][FKW] that these are precisely the transformations which will be…
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…
In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…
A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…