Related papers: Quantum Algorithm for Green's Functions Measuremen…
Quantum simulators are engineered devices controllably designed to emulate complex and classically intractable quantum systems. A key challenge is to certify whether the simulator truly mimics the Hamiltonian of interest. This certification…
Variational quantum algorithms (VQAs) have been proposed as one of the most promising approaches to demonstrate quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, it has been unclear whether VQAs can maintain…
We study the Hubbard model using the Cellular Dynamical Mean-Field Theory (CDMFT) with quantum Monte Carlo (QMC) simulations. We present the algorithmic details of CDMFT with the Hirsch-Fye QMC method for the solution of the…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
We investigate the Hubbard model on the triangular lattice at half-filling using the dynamical cluster approximation (DCA) and dual fermion (DF) methods in combination with continuous-time quantum Monte carlo (CT QMC) and semiclassical…
Simulating a fermionic system on a quantum computer requires encoding the anti-commuting fermionic variables into the operators acting on the qubit Hilbert space. The most familiar of which, the Jordan-Wigner transformation, encodes…
With resonances treated as eigenstates of a non-Hermitian quantum Hamiltonian, the task of localization of the complex energy eigenvalues is considered. The paper is devoted to the reduced version of this task in which one only computes the…
The Fermi-Hubbard model is one of the central paradigms in the physics of strongly-correlated quantum many-body systems. Here we propose a quantum circuit algorithm based on the $\mathrm{Z}_2$ lattice gauge theory (LGT) representation of…
We propose and demonstrate a unified hierarchical method to measure $n$-point correlation functions that can be applied to driven, dissipative, or otherwise open or non-equilibrium quantum systems. In this method, the time evolution of the…
It is expected that the simulation of correlated fermions in chemistry and material science will be one of the first practical applications of quantum processors. Given the rapid evolution of quantum hardware, it is increasingly important…
We propose a fast and versatile algorithm to calculate local and transport properties such as conductance, shot noise, local density of state or local currents in mesoscopic quantum systems. Within the non equilibrium Green function…
The $n$-time correlation function is pivotal for establishing connections between theoretical predictions and experimental observations of a quantum system. Conventional methods for computing $n$-time correlation functions on quantum…
We consider a hybrid digital-analog quantum computing approach, which allows implementing any quantum algorithm without standard two-qubit gates. This approach is based on the always-on interaction between qubits, which can provide an…
Hybrid quantum-classical algorithms have been proposed to circumvent noise limitations in quantum computers. Such algorithms delegate only a calculation of the expectation value to the quantum computer. Among them, the Variational Quantum…
We describe an algorithm that computes the ground state energy and correlation functions for 2-local Hamiltonians in which interactions between qubits are weak compared to single-qubit terms. The running time of the algorithm is polynomial…
A quantum Monte Carlo method with non-local update scheme is presented. The method is based on a path-integral decomposition and a worm operator which is local in imaginary time. It generates states with a fixed number of particles and…
We derive a method to efficiently compute the Green function of on arbitrary Hamiltonians defined on semi-infinite and periodic quasi-one-dimensional lattices. Computing the Green function is the backbone of quantum transport, electronic…
The Quantum Singular Value Transformation (QSVT) is a technique that provides a unified framework for describing many of the quantum algorithms discovered to date. We implement a noise-free simulation of the technique to investigate how it…
Quantum Monte Carlo and quantum simulation are both important tools for understanding quantum many-body systems. As a classical algorithm, quantum Monte Carlo suffers from the sign problem, preventing its application to most fermion systems…
We present a hybrid quantum-classical framework for simulating generic matrix functions more amenable to early fault-tolerant quantum hardware than standard quantum singular-value transformations. The method is based on randomization over…