Related papers: Kolmogorov variation: KAM with knobs (\`a la Kolmo…
Bayesian inference, while foundational to probabilistic reasoning, is often hampered by the computational intractability of posterior distributions, particularly through the challenging evidence integral. Conventional approaches like Markov…
It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…
In this paper we study subsequences of random numbers. In Kamae (1973), selection functions that depend only on coordinates are studied, and their necessary and sufficient condition for the selected sequences to be normal numbers is given.…
A practical approach is presented which allows the use of a non-invariant regularization scheme for the computation of quantum corrections in perturbative quantum field theory. The theoretical control of algebraic renormalization over…
In the gravitational-wave analysis of pulsar-timing-array datasets, parameter estimation is usually performed using Markov Chain Monte Carlo methods to explore posterior probability densities. We introduce an alternative procedure that…
We give a proof of the convergence of an algorithm for the construction of lower dimensional elliptic tori in nearly integrable Hamiltonian systems. The existence of such invariant tori is proved by leading the Hamiltonian to a suitable…
We consider the quantum implementations of the two classical iterative solvers for a system of linear equations, including the Kaczmarz method which uses a row of coefficient matrix in each iteration step, and the coordinate descent method…
In this paper, we consider a classical Hamiltonian normal form with degeneracy in normal direction. In previous results, one needs to assume that the perturbation satisfies certain non-degenerate conditions in order to remove the degeneracy…
The standard quantum search algorithm lacks a feature, enjoyed by many classical algorithms, of having a fixed-point, i.e. a monotonic convergence towards the solution. Here we present two variations of the quantum search algorithm, which…
Kolmogorov-Arnold Networks or KANs have shown the ability to outperform classical Deep Neural Networks, while using far fewer trainable parameters for regression problems on scientific domains. Even more powerful has been their…
From a simple path integral involving a variable volatility in the velocity differences, we obtain velocity probability density functions with exponential tails, resembling those observed in fully developed turbulence. The model yields…
In this paper we present efficient algorithms for the computation of several invariant objects for Hamiltonian dynamics. More precisely, we consider KAM tori (i.e diffeomorphic copies of the torus such that the motion on them is conjugated…
Withdrawn by the author due to irreparable errors. We present a quantum algorithm that in the black-box model performs a search in an ordered list of N elements. Using 3/4 log N + O(1) queries, it achieves a success probability of at least…
In this paper, we exploit the concept of Kolmogorov $n$-widths to establish optimality benchmarks for reduced-order methods used in phononic, acoustic, and photonic band structure calculations. The Bloch-transformed operators are entire…
The translation of Grover's search algorithm from its standard version, designed for implementation on a single quantum system amenable to projective measurements, into one suitable for an ensemble of quantum computers, whose outputs are…
We demonstrate the utility of the numerical Contractor Renormalization (CORE) method for quantum spin systems by studying one and two dimensional model cases. Our approach consists of two steps: (i) building an effective Hamiltonian with…
We shall use a Renormalization Group (RG) scheme in order to prove the classical KAM result in the case of a non-analytic perturbation (the latter will be assumed to have continuous derivatives up to a sufficiently large order). We shall…
It is known that any continuous multivariate function can be represented exactly by a composition functions of a single variable - the so-called Kolmogorov-Arnold representation. It can be a convenient tool for tasks where it is required to…
This paper continues the discussion started in [CK19] concerning Arnold's legacy on classical KAM theory and (some of) its modern developments. We prove a detailed and explicit `global' Arnold's KAM Theorem, which yields, in particular, the…
Achieving reliable performance on early fault-tolerant quantum hardware will depend on protocols that manage noise without incurring prohibitive overhead. We propose a novel framework that integrates quantum computation with the…