Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum Phaselift

Published 9 Feb 2026 in quant-ph | (2602.09119v1)

Abstract: Estimating quantum time-series such as the Loschmidt amplitude f(t)=ψe<sup>iHtψf(t)=\langleψ|\mathrm{e}<sup>{-\mathrm{i}Ht}|ψ\rangle is central to spectroscopy, Hamiltonian analysis, and many phase-estimation algorithms. Direct estimation via the Hadamard test requires controlled implementations of e<sup>iHt\mathrm{e}<sup>{-\mathrm{i}Ht}, and the depth of these controlled circuits grows with tt, making long-time estimation challenging on near-term hardware. We introduce Quantum Phaselift, a lifting-based framework that estimates the rank-one matrix Z=ff<sup>Z = f f<sup>\dagger rather than estimating ff directly. We propose simple quantum circuits for estimating the entries of ZZ and show that measuring only a narrow band of this matrix around the diagonal is sufficient to uniquely recover ff. Crucially, this reformulation decouples the controlled circuit depth from the maximum evolution time to scale instead with the width of the measured band. We prove that a O(1)O(1) bandwidth suffices for generic signals, leading to substantial savings in controlled operations compared to direct estimation methods. We develop three recovery algorithms with provable exact recovery in the noiseless setting and stability under measurement noise. Finally, we numerically demonstrate that high-quality recovery is possible for the 2D Fermi-Hubbard and 2D transverse-field Ising model signals of size exceeding 100 time points using only a few million measurement shots and reasonable post-processing time, making our time-series estimation techniques efficient and effective for near-term implementations.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.