Related papers: Low-rank decomposition for quantum simulations wit…
Tensor decomposition is a mathematically supported technique for data compression. It consists of applying some kind of a Low Rank Decomposition technique on the tensors or matrices in order to reduce the redundancy of the data. However, it…
We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…
Any four-dimensional Supersymmetric Quantum Field Theory with eight supercharges can be associated to a certain complex symplectic manifold called the "K-theoretic Coulomb branch" of the theory. The collection of K-theoretic Coulomb…
Many statistical problems involve the estimation of a $\left(d\times d\right)$ orthogonal matrix $\textbf{Q}$. Such an estimation is often challenging due to the orthonormality constraints on $\textbf{Q}$. To cope with this problem, we…
In recent years, reduced basis methods (RBMs) have been adapted to the many-body eigenvalue problem and they have been used, largely in nuclear physics, as fast emulators able to bypass expensive direct computations while still providing…
In this work we present a low-rank algorithm for computing low-rank approximations of large-scale Lyapunov operator $\varphi$-functions. These computations play a crucial role in implementing of matrix-valued exponential integrators for…
We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the…
Using a complete basis set we have obtained an analytic expression for the matrix elements of the Coulomb interaction. These matrix elements are written in a closed form. We have used the basis set of the three-dimensional isotropic quantum…
We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…
Efficient methods for the simulation of quantum circuits on classic computers are crucial for their analysis due to the exponential growth of the problem size with the number of qubits. Here we study lumping methods based on bisimulation,…
We introduce a new basis of the non-commutative symmetric functions whose commutative images are Schur functions. Dually, we build a basis of the quasi-symmetric functions which expand positively in the fundamental quasi-symmetric functions…
We consider the problem of constructing a canonical polyadic (CP) decomposition for a tensor network, rather than a single tensor. We illustrate how it is possible to reduce the complexity of constructing an approximate CP representation of…
We develop a higher order generalization of the LQ decomposition and show that this decomposition plays an important role in likelihood-based estimation and testing for separable, or Kronecker structured, covariance models, such as the…
The problem of finding and characterizing minimal sets of dequantizers and quantizers applied in the mapping of operators onto functions is considered, for finite-dimensional quantum systems. The general properties of such sets are…
The mechanism of describing quantum states by standard probability (tomographic one) instead of wave function or density matrix is elucidated. Quantum tomography is formulated in an abstract Hilbert space framework, by means of the identity…
Real-space refinement of atomic models in macromolecular crystallography or in cryo electron microscopy fits a model to a map obtained experimentally. This requires generating model maps of a limited resolution which moreover may vary from…
Electronic structure methods for accurate calculation of molecular properties have a high cost that grows steeply with the problem size, therefore, it is helpful to have the underlying atomic basis functions that are less in number but of…
The necessity of complex numbers in quantum mechanics has long been debated. This paper develops a real Kahler space formulation of quantum mechanics [19], asserting equivalence to the standard complex Hilbert space framework. By mapping…
Ab initio methods for electronic structure of molecules have reached a satisfactory accuracy for calculation of static properties, but remain too expensive for quantum dynamical calculations. We propose an efficient semiclassical method for…
Intuitively, if a density operator has small rank, then it should be easier to estimate from experimental data, since in this case only a few eigenvectors need to be learned. We prove two complementary results that confirm this intuition.…