REVIEW 2 cited by
Fast Phase Factor Finding for Quantum Signal Processing
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
read the original abstract
This paper presents two efficient and stable algorithms for recovering phase factors in quantum signal processing (QSP), a crucial component of many quantum algorithms. The first algorithm, the ``Half Cholesky" method, which is based on nonlinear Fourier analysis and fast solvers for structured matrices, demonstrates robust performance across all regimes. The second algorithm, ``Fast Fixed Point Iteration," provides even greater efficiency in the non-fully-coherent regime. Both theoretical analysis and numerical experiments demonstrate the significant advantages of these new methods over all existing approaches.
Forward citations
Cited by 2 Pith papers
-
Matrix inversion polynomials for the quantum singular value transformation
An explicit, provably optimal polynomial for approximating 1/x in QSVT matrix inversion, with a stable recurrence and minimum degree formula.
-
von Neumann measurement and quantum phase estimation of block-encoded Hamiltonians
A von Neumann measurement based phase/energy estimation routine on block-encoded Hamiltonians with Clifford+T complexity bounds, undermined by internal register-count and success-probability inconsistencies.
Discussion (0). Sign in to comment.