Related papers: Disentangling a Deep Learned Volume Formula
We derive quantitative error bounds for deep neural networks (DNNs) approximating option prices on a $d$-dimensional risky asset as functions of the underlying model parameters, payoff parameters and initial conditions. We cover a general…
Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of $\mathcal{P}$. We consider $…
Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve…
The convergence rates on polynomial interpolation in most cases are estimated by Lebesgue constants. These estimates may be overestimated for some special points of sets for functions of limited regularities. In this paper, by applying the…
We show the $n$ colored Jones polynomials of a highly twisted link approach the Kauffman bracket of an $n$ colored skein element. This is in the sense that the corresponding categorifications of the colored Jones polynomials approach the…
We consider the computation of the volume of the union of high-dimensional geometric objects. While showing that this problem is #P-hard already for very simple bodies (i.e., axis-parallel boxes), we give a fast FPRAS for all objects where…
The entanglement entropy of many quantum systems is difficult to compute in general. They are obtained as a limiting case of the R\'enyi entropy of index $m$, which captures the higher moments of the reduced density matrix. In this work, we…
We study the problem of approximating the mixed volume $V(P_1^{(\alpha_1)}, \dots, P_k^{(\alpha_k)})$ of an $k$-tuple of convex polytopes $(P_1, \dots, P_k)$, each of which is defined as the convex hull of at most $m_0$ points in…
Union volume estimation is a classical algorithmic problem. Given a family of objects $O_1,\ldots,O_n \subseteq \mathbb{R}^d$, we want to approximate the volume of their union. In the special case where all objects are boxes (also known as…
We show that the volume of a convex body in $\mathbb{R}^{n}$ in the general membership oracle model can be computed to within relative error $\varepsilon$ using $\widetilde{O}(n^{3.5}\psi^{2} + n^3/\varepsilon^{2})$ oracle queries, where…
We construct a quantum algorithm to approximate efficiently the colored Jones polynomial of the plat presentation of any oriented link L at a fixed root of unity q. Our construction is based on SU(2) Chern-Simons topological quantum field…
We prove the volume conjecture for any twist knots by using an equivalence relation, complex analysis, analytic continuation, and function of several complex variables on the basis of colored Jones polynomials.
Polyhedral-type approximations of convex-like domains in $\mathbb{C}^d$ have been considered recently by the second author. In particular, the decay rate of the error in optimal volume approximation as a function of the number of facets has…
A test on the numerical accuracy of the semiclassical approximation as a function of the principal quantum number has been performed for the Pullen--Edmonds model, a two--dimensional, non--integrable, scaling invariant perturbation of the…
The expectation value of a Wilson loop in a Chern--Simons theory is a knot invariant. Its skein relations have been derived in a variety of ways, including variational methods in which small deformations of the loop are made and the changes…
Operator learning has the potential to strongly impact scientific computing by learning solution operators for differential equations, potentially accelerating multi-query tasks such as design optimization and uncertainty quantification by…
We prove an explicit cabling formula for the colored Jones polynomial. As an application we prove the volume conjecture for all zero volume knots and links, i.e. all knots and links that are obtained from the unknot by repeated cabling and…
The Kashaev-Murakami-Murakami Volume Conjecture connects the hyperbolic volume of a knot complement to the asymptotics of certain evaluations of the colored Jones polynomials of the knot. We introduce a closely related conjecture for…
Quantum Singular Value Transformation (QSVT) provides a unified framework for applying polynomial functions to the singular values of a block-encoded matrix. QSVT prepares a state proportional to $\bA^{-1}\bb$ with circuit depth…
Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…