Related papers: Quantum algorithm for imaginary-time Green's funct…
Hybrid quantum-classical algorithms are central to much of the current research in quantum computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era, with a number of experimental demonstrations having already…
Accurate modeling of the electronic structure of warm dense matter is a challenging problem whose solution would allow a better understanding of material properties like equation of state, opacity, and conductivity, with resulting…
One of the potential applications of a quantum computer is solving quantum chemical systems. It is known that one of the fastest ways to obtain somewhat accurate solutions classically is to use approximations of density functional theory.…
A novel method based on spectral Green functions is presented for the simulation of driven open quantum dynamics that can be described by the Lindblad master equation in Liouville density operator space. The method extends the Hilbert space…
A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum…
Quantum simulation advantage over classical memory limitations would allow compact quantum circuits to yield insight into intractable quantum many-body problems, but the interrelated obstacles of large circuit depth in quantum time…
In complex systems, it is often the case that the region of interest forms only one part of a much larger system. The idea of joining two different quantum simulations - a high level calculation on the active region of interest, and a low…
We present a quantum algorithm for simulating complex many-body systems and finding their ground states, combining the use of tensor networks and density matrix renormalization group (DMRG) techniques. The algorithm is based on von…
Hybrid classical-quantum algorithms aim at variationally solving optimisation problems, using a feedback loop between a classical computer and a quantum co-processor, while benefitting from quantum resources. Here we present experiments…
A quantum-mechanical calculation of the single-particle level (s.p.l.) density $g(\epsilon)$ is carried on by using the connection with the single-particle Green's function. The relation between the imaginary part of Green's function and…
In this work we calculate the exact Green's function for arbitrary rectangular potentials. Specifically we focus on Green's function for rectangular quantum wells enlarging the knowledge of exact solutions for Green's functions and also…
The asymptotics of the equal-time one-particle Green's function for the half-filled one-dimensional Hubbard model is studied at finite temperature. We calculate its correlation length by evaluating the largest and the second largest…
Predicting the properties of strongly correlated materials is a significant challenge in condensed matter theory. The widely used dynamical mean-field theory faces difficulty in solving quantum impurity models numerically. Hybrid…
Simulation of realistic classical mechanical systems is of great importance to many areas of engineering such as robotics, dynamics of rotating machinery and control theory. In this work, we develop quantum algorithms to estimate quantities…
It is exponentially hard to simulate quantum systems by classical algorithms, while quantum computer could in principle solve this problem polynomially. We demonstrate such an quantum-simulation algorithm on our NMR system to simulate an…
High-order derivatives of Green's functions are a key ingredient in Taylor-based fast multipole methods, Barnes-Hut $n$-body algorithms, and quadrature by expansion (QBX). In these settings, derivatives underpin either the formation,…
The density of states for a particle moving in a random potential with a Gaussian correlator is calculated exactly using the functional integral technique. It is achieved by expressing the functional degrees of freedom in terms of the…
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems, and the heart of a number of numerical methods that have been used with great success in quantum chemistry, condensed matter and…
We present a quantum algorithm to achieve higher-order transformations of Hamiltonian dynamics. Namely, the algorithm takes as input a finite number of queries to a black-box seed Hamiltonian dynamics to simulate a desired Hamiltonian. Our…
We present a family of algorithms for the numerical approximation of the Schr\"odinger equation with potential concentrated at a finite set of points. Our methods belong to the so-called fast and oblivious convolution quadrature algorithms.…