Pith. sign in

REVIEW 2 cited by

Quantum Algorithm to Prepare Quasi-Stationary States

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 2407.07893 v1 pith:PFSVHLGH submitted 2024-07-10 quant-ph cond-mat.stat-mech

classification quant-phcond-mat.stat-mech
keywords quantumalgorithmmany-bodystatesdynamicseigenstatesenergypolynomial
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum dynamics can be analyzed via the structure of energy eigenstates. However, in the many-body setting, preparing eigenstates associated with finite temperatures requires time scaling exponentially with system size. In this work we present an efficient quantum search algorithm which produces quasi-stationary states, having energies supported within narrow windows of a dense many-body spectrum. In time scaling polynomially with system size, the algorithm produces states with inverse polynomial energy width, which can in turn be used to analyze many-body dynamics out to polynomial times. The algorithm is based on quantum singular value transformations and quantum signal processing, and provides a quadratic speedup over measurement-based approaches. We discuss how this algorithm can be used as a primitive to investigate the mechanisms underlying thermalization and hydrodynamics in many-body quantum systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Efficient preparation of entangled states in cavity QED with Grover's algorithm

    quant-ph 2025-01 conditional novelty 6.0 of 10

    Grover's algorithm, implemented through cavity-mediated photon phase shifts, can deterministically prepare Dicke, GHZ, and cat states of N atoms in about N^{1/4} photon scattering events without individual addressing.

  2. Strategic Plan for Neutral Atom Quantum Computation

    quant-ph 2026-07 conditional novelty 3.0 of 10

    If qubit-count growth (~1.8x/yr) and gate-error reduction (~0.62x/yr) continue, neutral-atom quantum computers could reach practical quantum advantage within a decade, this roadmap projects.

Pith tools