Related papers: Quantum subspace expansion algorithm for Green's f…
Quantitative descriptions of strongly correlated materials pose a considerable challenge in condensed matter physics and chemistry. A promising approach to address this problem is quantum embedding methods. In particular, the dynamical…
A complex but important challenge in understanding quantum mechanical phenomena is the simulation of quantum many-body dynamics. Although quantum computers offer significant potential to accelerate these simulations, their practical…
We present an efficient algorithm for simulating open quantum systems dynamics described by the Lindblad master equation on quantum computers, addressing key challenges in the field. In contrast to existing approaches, our method achieves…
The Fermi-Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum…
The study of real-time evolution of lattice quantum field theories using classical computers is known to scale exponentially with the number of lattice sites. Due to a fundamentally different computational strategy, quantum computers hold…
We calculate the energy levels of a system of neutrinos undergoing collective oscillations as functions of an effective coupling strength and radial distance from the neutrino source using the quantum Lanczos (QLanczos) algorithm…
We study the gate-based implementation of the binary reflected Gray code (BRGC) and binary code of the unitary time evolution operator due to the Laplacian discretized on a lattice with periodic boundary conditions. We find that the…
Many phenomena of strongly correlated materials are encapsulated in the Fermi-Hubbard model whose thermodynamical properties can be computed from its grand canonical potential according to standard procedures. In general, there is no closed…
The description of quantum many-body dynamics is extremely challenging on classical computers, as it can involve many degrees of freedom. On the other hand, the time evolution of quantum states is a natural application for quantum computers…
We use a diagrammatic hopping expansion to calculate finite-temperature Green functions of the Bose-Hubbard model which describes bosons in an optical lattice. This technique allows for a summation of subsets of diagrams, so the divergence…
The two-time Green function method in quantum electrodynamics of high-Z few-electron atoms is described in detail. This method provides a simple procedure for deriving formulas for the energy shift of a single level and for the energies and…
The extended Hubbard model on a two-dimensional lattice captures key physical phenomena, but is challenging to simulate due to the presence of long-range interactions. In this work, we present an efficient quantum algorithm for simulating…
We present a quantum-classical hybrid implementation of the Liouvillian recursion method to compute many-body Green's functions using a quantum computer. From an approximate ground state preparation circuit, this algorithm produces the…
We show how to represent the state and the evolution of a quantum computer (or any system with an $N$--dimensional Hilbert space) in phase space. For this purpose we use a discrete version of the Wigner function which, for arbitrary $N$, is…
We propose a hybrid approach to simulate quantum many body dynamics by combining Trotter based quantum algorithm with classical dynamic mode decomposition. The interest often lies in estimating observables rather than explicitly obtaining…
In this paper, we present a generalized Green's function method which can be used to investigate the quantum phase transitions analytically in a systematic way for ultracold Bose systems in bipartite optical lattices. As an example, to the…
We report an implementation of the recursion method that addresses quantum many-body dynamics in the nonperturbative regime. The method essentially amounts to constructing a Lanczos basis in the space of operators and solving coupled…
If a quantum mechanical Hamiltonian has an infinite symmetric tridiagonal (Jacobi) matrix form in some discrete Hilbert-space basis representation, then its Green's operator can be constructed in terms of a continued fraction. As an…
Large-scale classical simulation of quantum computers is crucial for benchmarking quantum algorithms, establishing boundaries of quantum advantage and exploring heuristic quantum algorithms. We present a full-state vector simulation…
We propose an iterative variational quantum algorithm to simulate the time evolution of arbitrary initial states within a given subspace. The algorithm compresses the Trotter circuit into a shorter-depth parameterized circuit, which is…