Related papers: Matrix-product-state-based band-Lanczos solver for…
We present a matrix product state (MPS) algorithm to approximate ground states of translationally invariant systems with periodic boundary conditions. For a fixed value of the bond dimension D of the MPS, we discuss how to minimize the…
The coupled cluster method (CCM) is a powerful and widely applied technique of modern-day quantum many-body theory. It has been used with great success in order to understand the properties of quantum magnets at zero temperature. This is…
We develop a new projected wave function approach which is based on projection operators in the form of matrix-product operators (MPOs). Our approach allows to variationally improve the short range entanglement of a given trial wave…
The theory of a novel bond-order potential, which is based on the block Lanczos algorithm, is presented within an orthogonal tight-binding representation. The block scheme handles automatically the very different character of sigma and pi…
This work considers large-scale Lyapunov matrix equations of the form $AX + XA = \boldsymbol{c}\boldsymbol{c}^T$, where $A$ is a symmetric positive definite matrix and $\boldsymbol{c}$ is a vector. Motivated by the need to solve such…
Quantization is a widely used technique to compress neural networks. Assigning uniform bit-widths across all layers can result in significant accuracy degradation at low precision and inefficiency at high precision. Mixed-precision…
We present a study of the entanglement properties of Gaussian cluster states, proposed as a universal resource for continuous-variable quantum computing. A central aim is to compare mathematically-idealized cluster states defined using…
We present an algorithm to compute Green's functions on quantum computers for interacting electron systems, which is a challenging task on conventional computers. It uses a continued fraction representation based on the Lanczos method,…
Quantum computing is arguably one of the most revolutionary and disruptive technologies of this century. Due to the ever-increasing number of potential applications as well as the continuing rise in complexity, the development, simulation,…
We consider the approximation of $B^T (A+sI)^{-1} B$ where $A\in\mathbb{R}^{n\times n}$ is large, symmetric positive definite, and has a dense spectrum, and $B\in\mathbb{R}^{n\times p}$, $p\ll n$. Our target application is the computation…
Measurement-based quantum computing (MBQC) is a promising alternative to traditional circuit-based quantum computing predicated on the construction and measurement of cluster states. Recent work has demonstrated that MBQC provides a more…
The continuous matrix product state (cMPS) ansatz is a promising numerical tool for studying quantum many-body systems in continuous space. Although it provides a clean framework that allows one to directly simulate continuous systems, the…
Matrix product states are useful representations for a large variety of naturally occurring quantum states. Studying their typical properties is important for understanding universal behavior, including quantum chaos and thermalization, as…
The canonical form of Matrix Product States (MPS) and the associated fundamental theorem, which relates different MPS representations of a state, are the theoretical framework underlying many of the analytical results derived through MPS,…
Matrix product states (MPS) are a central language for one-dimensional quantum matter and a practical target for near-term quantum simulators and variational algorithms. Yet, while substantial effort has focused on preparing MPS with…
The matrix product state (MPS) ansatz offers a promising approach for finding the ground state of molecular Hamiltonians and solving quantum chemistry problems. Building on this concept, the proposed technique of quantum circuit MPS (QCMPS)…
Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is…
We solve the nonequilibrium dynamical mean-field theory (DMFT) using matrix product states (MPS). This allows us to treat much larger bath sizes and by that reach substantially longer times (factor $\sim$ 2 -- 3) than with exact…
We propose a method, based on matrix product states, for studying the time evolution of many-body quantum lattice systems under continuous and site-resolved measurement. Both the frequency and the strength of generalized measurements can be…
A state-preserving quantum counting algorithm is used to obtain coefficients of a Lanczos recursion from a single ground state wavefunction on the quantum computer. This is used to compute the continued fraction representation of an…