Related papers: Randomized biorthogonalization through a two-sided…
We apply a stochastic method of minimizing the ground state energy in variational calculations of light nuclei using the Refined Resonating Group Model (RRGM). The method utilizes a bit representation of the width parameters to be varied.…
The Kaczmarz method is an iterative algorithm for solving systems of linear equalities and inequalities, that iteratively projects onto these constraints. Recently, Strohmer and Vershynin [J. Fourier Anal. Appl., 15(2):262-278, 2009] gave a…
We present a Bayesian scheme for the approximate diagonalisation of several square matrices which are not necessarily symmetric. A Gibbs sampler is derived to simulate samples of the common eigenvectors and the eigenvalues for these…
A new efficient numerical algorithm for interacting fermion systems is proposed and examined in detail. The ground state is expressed approximately by a linear combination of numerically chosen basis states in a truncated Hilbert space. Two…
In this work we propose a probabilistic method which allows an unambiguous modification of two non-orthogonal quantum states. We experimentally implement this protocol by using two-photon polarization states generated in the process of…
We present a hybrid numerical approach to simulate quantum many body problems on two spatial dimensional quantum lattice models via the non-Abelian ab initio version of the density matrix renormalization group method on state-of-the-art…
We present a novel technique for work-efficient parallel derandomization, for algorithms that rely on the concentration of measure bounds such as Chernoff, Hoeffding, and Bernstein inequalities. Our method increases the algorithm's…
Shared-memory parallelization (SMP) strategies for density matrix renormalization group (DMRG) algorithms enable the treatment of complex systems in solid state physics. We present two different approaches by which parallelization of the…
Random subsampling of edges is a commonly employed technique in graph algorithms, underlying a vast array of modern algorithmic breakthroughs. Unfortunately, using this technique often leads to randomized algorithms with no clear path to…
A class of 2x2 random-matrix models is introduced for which the Brody distribution is the exact eigenvalue spacing distribution. The matrix elements consist of constrained finite sums of an exponential random variable raised to various…
The Gram-Schmidt algorithm produces a pairwise orthogonal set from a linearly independent set of vectors in an inner product vector space V. We give a linear algorithm that constructs vectors with the same span and which have pairwise the…
A non-Hermitean operator does not necessarily have a complete set of eigenstates, contrary to a Hermitean one. An algorithm is presented which allows one to decide whether the eigenstates of a given PT-invariant operator on a…
We develop randomized matrix-free algorithms for estimating partial traces, a generalization of the trace arising in quantum physics and chemistry. Our algorithm improves on the typicality-based approach used in [T. Chen and Y-C. Cheng,…
A mixed Gaussian fractional process $\{Y(t)\}_{t \in {\Bbb R}} = \{PX(t)\}_{t \in {\Bbb R}}$ is a multivariate stochastic process obtained by pre-multiplying a vector of independent, Gaussian fractional process entries $X$ by a nonsingular…
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as…
We study the asymptotic distribution of the eigenvalues of random Hermitian periodic band matrices, focusing on the spectral edges. The eigenvalues close to the edges converge in distribution to the Airy point process if (and only if) the…
Solving the generalized eigenvalue problem is a useful method for finding energy eigenstates of large quantum systems. It uses projection onto a set of basis states which are typically not orthogonal. One needs to invert a matrix whose…
An equivalence between attainability of simultaneous diagonalization (SD) and hidden convexity in quadratically constrained quadratic programming (QCQP) stimulates us to investigate necessary and sufficient SD conditions, which is one of…
An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U(N) (or O(N), respectively). An ensemble of…
We first propose a concise singular value decomposition of dual matrices. Then, the randomized version of the decomposition is presented. It can significantly reduce the computational cost while maintaining the similar accuracy. We analyze…