Pith. sign in

REVIEW 3 cited by

Quantum Algorithms for Ground-State Preparation and Green's Function Calculation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.05731 v1 pith:YQTI42E2 submitted 2021-12-10 quant-ph cond-mat.str-el

Quantum Algorithms for Ground-State Preparation and Green's Function Calculation

classification quant-ph cond-mat.str-el
keywords gammastatealgorithmsscalingfracfunctionspreparationdelta
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
abstract

We propose quantum algorithms for projective ground-state preparation and calculations of the many-body Green's functions directly in frequency domain. The algorithms are based on the linear combination of unitary (LCU) operations and essentially only use quantum resources. To prepare the ground state, we construct the operator ${\exp}(-\tau \hat{H}^2)$ using Hubbard-Stratonovich transformation by LCU and apply it on an easy-to-prepare initial state. Our projective state preparation procedure saturates the near-optimal scaling, $\mathcal{O}(\frac{1}{\gamma\Delta} \log \frac{1}{\gamma\eta})$, of other currently known algorithms, in terms of the spectral-gap lower bound $\Delta$, the additive error $\eta$ in the state vector, and the overlap lower bound $\gamma$ between the initial state and the exact ground state. It is straightforward to combine our algorithm with spectral-gap amplification technique to achieve quadratically improved scaling $\mathcal{O}(1/\sqrt{\Delta})$ for ground-state preparation of frustration-free Hamiltonians, which we demonstrate with numerical results of the $q$-deformed XXZ chain. To compute the Green's functions, including the single-particle and other response functions, we act on the prepared ground state with the retarded resolvent operator $R(\omega + i\Gamma; \hat{H})$ in the LCU form derived from the Fourier-Laplace integral transform (FIT). Our resolvent algorithm has $\mathcal{O}(\frac{1}{\Gamma^2} \log\frac{1}{\Gamma\epsilon})$ complexity scaling for the frequency resolution $\Gamma$ of the response functions and the targeted error $\epsilon$, while classical algorithms for FIT usually have polynomial scaling over the error $\epsilon$. To illustrate the complexity scaling of our algorithms, we provide numerical results for their application to the paradigmatic Fermi-Hubbard model on a one-dimensional lattice with different numbers of sites.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Spectral functions on a quantum computer through system-environment interaction

    quant-ph 2026-05 unverdicted novelty 7.0

    A new quantum circuit method computes spectral functions A(k,ω) by simulating ARPES-like system-environment coupling, cutting sampling overhead by O(N) and demonstrated on a 54-qubit ion-trap processor for a 27-site chain.

  2. Dynamical structure factor with a pumping approach on a trapped-ion quantum computer

    quant-ph 2026-07 conditional novelty 6.0

    A pumping approach for computing dynamical structure factors on quantum computers directly targets specific frequencies by time-evolving with an oscillating perturbation, demonstrated on 20-qubit trapped-ion hardware.

  3. Measurement-Efficient Variational Quantum Linear Solver for Carleman-Linearized Nonlinear Dynamics

    quant-ph 2026-05 unverdicted novelty 4.0

    Hybrid VQLS pipeline with Carleman linearization recovers high-fidelity solutions to the weakly nonlinear Duffing equation on IBM and Xanadu hardware using symmetry-grouped measurements and optimized ansatzes.