相关论文: An alternative implementation of the Lanczos algor…
This work introduces a method for determining the energy spectrum of lattice quantum chromodynamics (LQCD) by applying the Lanczos algorithm to the transfer matrix and using a bootstrap generalization of the Cullum-Willoughby method to…
Gutzwiller-projected fermionic states can be efficiently implemented within quantum Monte Carlo calculations to define extremely accurate variational wave functions for Heisenberg models on frustrated two-dimensional lattices, not only for…
In this study, we provide a novel wave packet propagation method that generalizes the Hagedorn approach by introducing alternative primitive basis sets that are better suited to describe different physical processes. More precisely, in our…
We review a recent approach for the simulation of many-body interacting systems based on an efficient generalization of the Lanczos method for Quantum Monte Carlo simulations. This technique allows to perform systematic corrections to a…
Maxwell's equations are cast in the form of the Schr\"{o}dinger equation. The Lanczos propagation method is used in combination with the fast Fourier pseudospectral method to solve the initial value problem. As a result, a time-domain,…
Maxwell's equations for electrodynamics of dispersive and absorptive (passive) media are written in the form of the Schr\"odinger equation with a non-Hermitian Hamiltonian. The Lanczos time-propagation scheme is modified to include…
The method of quantum Lanczos recursion is extended to solve for multiple excitations on the quantum computer. While quantum Lanczos recursion is in principle capable of obtaining excitations, the extension to a block Lanczos routine can…
Variational procedure is developed that yields lowest frequencies of small-amplitude oscillations of classical Hamiltonian systems. Genuine Lanczos recursion is generalized to treat related non-Hermitian eigenvalue problems.
We present a hardware agnostic error mitigation algorithm for near term quantum processors inspired by the classical Lanczos method. This technique can reduce the impact of different sources of noise at the sole cost of an increase in the…
We show that the standard Lanczos algorithm can be efficiently implemented statistically and self consistently improved, using the stochastic reconfigurat ion method, which has been recently introduced to stabilize the Monte Carlo sign…
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…
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,…
The Lanczos algorithm is evaluated for solving the time-independent as well as the time-dependent Dirac equation with arbitrary electromagnetic fields. We demonstrate that the Lanczos algorithm can yield very precise eigenenergies and…
We increase the efficiency of a recently proposed time integration scheme for time dependent quantum transport by using the Lanczos method for time evolution. We illustrate our modified scheme in terms of a simple one dimensional model. Our…
The variational principle of quantum mechanics is the backbone of hybrid quantum computing for a range of applications. However, as the problem size grows, quantum logic errors and the effect of barren plateaus overwhelm the quality of the…
This paper presents a new technique to calculate the evolution of a quantum wavefunction in a chosen spatial basis by minimizing the accumulated action. Introduction of a finite temporal basis reduces the problem to a set of linear…
Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories. Here, we simulate one-particle…
Recent work found that an analysis formalism based on the Lanczos algorithm allows energy levels to be extracted from Euclidean correlation functions with faster ground-state convergence than effective masses, convergent estimators for…
By exploiting the invariance of the molecular Hamiltonian by a unitary transformation of the orbitals it is possible to significantly shorter the depth of the variational circuit in the Variational Quantum Eigensolver (VQE) algorithm by…
An efficient algorithm for time propagation of the time-dependent Kohn-Sham equations is presented. The algorithm is based on dividing the Hamiltonian into small time steps and assuming that it is constant over these steps. This allows for…