Related papers: Importance truncation for the in-medium similarity…
We describe a low cost alternative to the standard variational DMRG (density matrix renormalization group) algorithm that is analogous to the combination of selected configuration interaction plus perturbation theory (SCI+PT). We denote the…
The application of renormalization group methods to microscopic nuclear many-body calculations is discussed. We present the solution of the renormalization group equations in the particle-hole channels for neutron matter and the application…
Group-prior based regularization method has led to great successes in various image processing tasks, which can usually be considered as a low-rank matrix minimization problem. As a widely used surrogate function of low-rank, the nuclear…
Matrix completion focuses on recovering a matrix from a small subset of its observed elements, and has already gained cumulative attention in computer vision. Many previous approaches formulate this issue as a low-rank matrix approximation…
Measurements on near-term quantum processors are inevitably subject to hardware imperfections that lead to readout errors. Mitigation of such unavoidable errors is crucial to better explore and extend the power of near-term quantum…
GEneral Matrix Multiply (GEMM) is a central operation in deep learning and corresponds to the largest chunk of the compute footprint. Therefore, improving its efficiency is an active topic of ongoing research. A popular strategy is the use…
We present a new balancing-based structure-preserving model reduction technique for linear port-Hamiltonian descriptor systems. The proposed method relies on a modification of a set of two dual generalized algebraic Riccati equations that…
We have applied the momentum space version of the Density Matrix Renormalization Group method ($k$-DMRG) in quantum chemistry in order to study the accuracy of the algorithm in the new context. We have shown numerically that it is possible…
The Truncated Nonsmooth Newton Multigrid (TNNMG) method is a robust and efficient solution method for a wide range of block-separable convex minimization problems, typically stemming from discretizations of nonlinear and nonsmooth partial…
In this work, we consider the matrix completion problem, where the objective is to reconstruct a low-rank matrix from a few observed entries. A commonly employed approach involves nuclear norm minimization. For this method to succeed, the…
Using a new approximate strong-randomness renormalization group (RG), we study the many-body localized (MBL) phase and phase transition in one-dimensional quantum systems with short-range interactions and quenched disorder. Our RG is built…
Although overparameterized models have shown their success on many machine learning tasks, the accuracy could drop on the testing distribution that is different from the training one. This accuracy drop still limits applying machine…
Iterative proportional fitting (IPF) is a widely used method for spatial microsimulation. The technique results in non-integer weights for individual rows of data. This is problematic for certain applications and has led many researchers to…
We consider the problem of low-rank decomposition of incomplete multiway tensors. Since many real-world data lie on an intrinsically low dimensional subspace, tensor low-rank decomposition with missing entries has applications in many data…
A highly anticipated use of quantum computers is the simulation of complex quantum systems including molecules and other many-body systems. One promising method involves directly applying a linear combination of unitaries (LCU) to…
We develop a systematic, omnibus approach to goodness-of-fit testing for parametric distributional models when the variable of interest is only partially observed due to censoring and/or truncation. In many such designs, tests based on the…
In physics we attempt to infer the rules governing a system given only the results of imprecise measurements. This is an ill-posed problem because certain features of the system's state cannot be resolved by the measurements. However, by…
We develop a Machine-Learning Renormalization Group (MLRG) algorithm to explore and analyze many-body lattice models in statistical physics. Using the representation learning capability of generative modeling, MLRG automatically learns the…
Hamiltonian Truncation (HT) methods provide a powerful numerical approach for investigating strongly coupled QFTs. In this work, we develop HT techniques to analyse a specific Renormalization Group (RG) flow recently proposed in Refs. [1,…
The Density Matrix Renormalization Group (DMRG) has become a powerful numerical method that can be applied to low-dimensional strongly correlated fermionic and bosonic systems. It allows for a very precise calculation of static, dynamic and…