Related papers: Direct Extension of Density-Matrix Renormalization…
A novel parallel hybrid quantum-classical algorithm for the solution of the quantum-chemical ground-state energy problem on gate-based quantum computers is presented. This approach is based on the reduced density-matrix functional theory…
Smoothing filter is the method of choice for image preprocessing and pattern recognition. We present a new concurrent method for smoothing 2D object in binary case. Proposed method provides a parallel computation while preserving the…
We investigate the application of the Density Matrix Renormalization Group (DMRG) to the Hubbard model in momentum-space. We treat the one-dimensional models with dispersion relations corresponding to nearest-neighbor hopping and $1/r$…
We propose a convex variational approach to compute localized density matrices for both zero temperature and finite temperature cases, by adding an entry-wise $\ell_1$ regularization to the free energy of the quantum system. Based on the…
The Density Matrix Renormalization Group (DMRG) method has become a prominent tool for simulating strongly correlated electronic systems characterized by dominant static correlation effects. However, capturing the full scope of electronic…
In order to optimize the ordering of the lattice sites in the momentum space and quantum chemistry versions of the density matrix renormalization group (DMRG) method we have studied the separability and entanglement of the target state for…
We present a symmetry-adapted extension of sample-based quantum diagonalization (SQD) that rigorously embeds space-group symmetry into the many-body subspace sampled by quantum hardware. The method is benchmarked on the two-leg ladder…
Quantum state tomography (QST) allows for the reconstruction of quantum states through measurements and some inference technique under the assumption of repeated state preparations. Bayesian inference provides a promising platform to…
A variant of White's density matrix renormalisation group scheme which is designed to compute low-lying energies of one-dimensional quantum lattice models with a large number of degrees of freedom per site is described. The method is tested…
An efficient density matrix renormalization group (DMRG) algorithm is presented and applied to Y-junctions, systems with three arms of $n$ sites that meet at a central site. The accuracy is comparable to DMRG of chains. As in chains, new…
Block2 is an open source framework to implement and perform density matrix renormalization group and matrix product state algorithms. Out-of-the-box it supports the eigenstate, time-dependent, response, and finite-temperature algorithms. In…
We describe how the entanglement renormalisation approach to topological lattice systems leads to a general procedure for treating the whole spectrum of these models, in which the Hamiltonian is gradually simplified along a parallel…
Systems of Y-junctions are interesting both from a fundamental viewpoint and because of their potential use in nanoscale devices. These systems can be studied numerically with the density matrix renormalization group(DMRG), but existing…
The density-matrix renormalization group method (DMRG) has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems. In the…
Matrix models of 2d quantum gravity coupled to matter field are investigated by the renormalized perturbational method, in which the matrix model Hamiltonian is represented by the equivalent vector model. By the saddle point method, the…
Matrix models of 2d quantum gravity coupled to matter field are investigated by the renormalized perturbational method, in which the matrix model Hamiltonian is represented by the equivalent vector model. By the saddle point method, the…
We develop a novel parallel decomposition strategy for unweighted, undirected graphs, based on growing disjoint connected clusters from batches of centers progressively selected from yet uncovered nodes. With respect to similar previous…
To prepare images for better segmentation, we need preprocessing applications, such as smoothing, to reduce noise. In this paper, we present an enhanced computation method for smoothing 2D object in binary case. Unlike existing approaches,…
The increasing complexity of deep learning recommendation models (DLRM) has led to a growing need for large-scale distributed systems that can efficiently train vast amounts of data. In DLRM, the sparse embedding table is a crucial…
Hierarchical matrices approximate a given matrix by a decomposition into low-rank submatrices that can be handled efficiently in factorized form. $\mathcal{H}^2$-matrices refine this representation following the ideas of fast multipole…