Related papers: Deterministic equivalence for noisy perturbations
We address the calculation of transition probabilities in multiplicative noise stochastic differential equations using a path integral approach. We show the equivalence between the conditional probability and the propagator of a quantum…
A quantum algorithm for computing the determinant of a unitary matrix $U\in U(N)$ is given. The algorithm requires no preparation of eigenstates of $U$ and estimates the phase of the determinant to $t$ binary digits accuracy with…
A sequence of approximations for the determinant and its logarithm of a complex matrixis derived, along with relative error bounds. The determinant approximations are derived from expansions of det(X)=exp(trace(log(X))), and they apply to…
Logarithmic perturbation theory (LPT) is developed and applied to quasinormal modes (QNMs) in open systems. QNMs often do not form a complete set, so LPT is especially convenient because summation over a complete set of unperturbed states…
Dynamics of deterministic systems perturbed by random additive noise is characterized quantitatively. Since for such systems the KS-entropy diverges we analyse the difference between the total entropy of a noisy system and the entropy of…
Finding solid and practical quantum advantages via noisy quantum devices without error correction is a critical but challenging problem. Conversely, comprehending the fundamental limitations of the state-of-the-art is equally crucial. In…
Various types of stabilizing controls lead to a deterministic difference equation with the following property: once the initial value is positive, the solution tends to the unique positive equilibrium. Introducing additive perturbations can…
We introduce a novel algorithm for approximating the logarithm of the determinant of a symmetric positive definite (SPD) matrix. The algorithm is randomized and approximates the traces of a small number of matrix powers of a specially…
In this brief paper the probability density of a random real, complex and quaternion determinant is rederived using singular values. The behaviour of suitably rescaled random determinants is studied in the limit of infinite order of the…
In this work we consider deterministic, symmetric matrices with heavy-tailed noise imposed on entries within a fixed distance $K$ to the diagonal. The most important example is discrete 1d random Schr\"odinger operator defined on…
Probabilistic approach to Boolean matrix factorization can provide solutions robustagainst noise and missing values with linear computational complexity. However,the assumption about latent factors can be problematic in real world…
The measurement outcomes of two incompatible observables on a particle can be precisely predicted when it is maximally entangled with a quantum memory, as quantified recently [Nature Phys. 6, 659 (2010)]. We explore the behavior of the…
We consider the first-order theory of random variables with the probabilistic independence relation, which concerns statements consisting of random variables, the probabilistic independence symbol, logical operators, and existential and…
Recently, Pagh presented a randomized approximation algorithm for the multiplication of real-valued matrices building upon work for detecting the most frequent items in data streams. We continue this line of research and present new {\em…
A method is suggested for treating those complicated physical problems for which exact solutions are not known but a few approximation terms of a calculational algorithm can be derived. The method permits one to answer the following rather…
It was recently conjectured that 1/f noise is a fundamental characteristic of spectral fluctuations in chaotic quantum systems. This conjecture is based on the behavior of the power spectrum of the excitation energy fluctuations, which is…
Let $A$ be drawn uniformly at random from the set of all $n\times n$ symmetric matrices with entries in $\{-1,1\}$. We show that \[ \mathbb{P}( \det(A) = 0 ) \leq e^{-cn},\] where $c>0$ is an absolute constant, thereby resolving a…
We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total…
We prove an estimate on the smallest singular value of a multiplicatively and additively deformed random rectangular matrix. Suppose $n\le N \le M \le \Lambda N$ for some constant $\Lambda \ge 1$. Let $X$ be an $M\times n$ random matrix…
We consider the influence of stochastic perturbations on stability of a unique positive equilibrium of a difference equation subject to prediction-based control. These perturbations may be multiplicative $$x_{n+1}=f(x_n)-\left( \alpha +…