Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Approximating dynamical correlation functions with constant depth quantum circuits (2406.03204v1)

Published 5 Jun 2024 in quant-ph

Abstract: One of the most important quantities characterizing the microscopic properties of quantum systems are dynamical correlation functions. These correlations are obtained by time-evolving a perturbation of an eigenstate of the system, typically the ground state. In this work, we study approximations of these correlation functions that do not require time dynamics. We show that having access to a circuit that prepares an eigenstate of the Hamiltonian, it is possible to approximate the dynamical correlation functions up to exponential accuracy in the complex frequency domain $\omega=\Re(\omega)+i\Im(\omega)$, on a strip above the real line $\Im(\omega)=0$. We achieve this by exploiting the continued fraction representation of the dynamical correlation functions as functions of frequency $\omega$, where the level $k$ approximant can be obtained by measuring a weight $O(k)$ operator on the eigenstate of interest. In the complex $\omega$ plane, we show how this approach allows to determine approximations to correlation functions with accuracy that increases exponentially with $k$. We analyse two algorithms to generate the continuous fraction representation in scalar or matrix form, starting from either one or many initial operators. We prove that these algorithms generate an exponentially accurate approximation of the dynamical correlation functions on a region sufficiently far away from the real frequency axis. We present numerical evidence of these theoretical results through simulations of small lattice systems. We comment on the stability of these algorithms with respect to sampling noise in the context of quantum simulation using quantum computers.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com