arXiv:2609.40349
Efficient Calculation of Equilibrium Correlation Functions
Yizhi Shen, Roel Van Beeumen, Wibe A. de Jong, Efekan Kökcü
Abstract
A majority of measurable dynamic quantities of a physical system is described as an equilibrium correlation function of the form $G_{AB}(t-t') = \left<A(t)B(t')\right>$, where $t'$ represents the impact time and $t$ represents the response time. Conventional quantum algorithms to compute such quantities via Hamiltonian simulation such as the Hadamard test, variational methods, or linear-response-based algorithms share one feature in common: each time point $t-t'$ is calculated by a different quantum circuit, leading to at least $O(N_t)$ total shots, and at least $O(N_t^2)$ total quantum gates. Here, we provide a different approach: utilizing $O(\log N_t)$ ancilla qubits to store time as a quantum variable, and effectively parallelize the computation of an equilibrium correlation function by requiring only a single quantum circuit for all time points. We show that this circuit needs to be run only $O(\log N_t)$ times, which in total requires $O(N_t \log N_t)$ quantum resources in the large system size limits. We prove that this scaling is optimal, and demonstrate our algorithm calculating the Green's function of a one-dimensional spinless Hubbard model.
AI Summary
The paper addresses the measurement cost of equilibrium dynamical correlation functions on quantum simulators: estimating many time lags without running a separate Hadamard-test circuit for each lag. It assumes a supplied stationary state, either an eigenstate or a mixed state commuting with the Hamiltonian. The construction coherently selects the probe-insertion time using $\log_2 N_t$ clock qubits while leaving Hamiltonian evolution uncontrolled. The reduced clock state is a Toeplitz matrix containing the correlation values. Fourier measurement, with one padding qubit, samples the spectral function convolved with a Fejér window. Each outcome supplies an unbiased estimator for every lag. For $|j|\leq N_t/2$, simultaneous additive error $\epsilon$ with failure probability $\delta$ requires $O(\epsilon^{-2}\log(N_t/\delta))$ executions. A matching $\Omega(\epsilon^{-2}\log N_t)$ copy lower bound follows from a family of distinguishable stationary instances and Holevo–Fano bounds; it applies to independent clock-state copies, not coherent preparation access. A selector qubit extends the method to cross-correlations; Pauli decomposition handles nonunitary probes. Resource comparisons give an order-$N_t$ saving over pointwise Hadamard tests for fixed-order product formulas. Qubitization incurs per-segment precision overhead, making savings regime-dependent rather than universally linear. Finite-shot behavior is tested numerically on an eight-site interacting spinless fermion chain. The estimator’s normalization amplifies noise near the longest lags, motivating the half-window restriction. Each execution needs roughly twice the maximum evolution time of the compared Hadamard tests. State-preparation costs are not solved, and nonequilibrium or out-of-time-order extensions remain open because the Toeplitz structure generally disappears.
Error found: The abstract's unqualified optimality wording exceeds the proved lower bound, which establishes optimal sample complexity only for protocols receiving independent copies of the constructed clock state, not optimal total quantum resources. The numerical comparison allocates approximately half the equal-resource Hadamard-test budget: M clock shots correspond to approximately 4M, rather than 2M, total Hadamard-test shots in the stated evolution-dominated regime.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.