REVIEW 2 cited by
Improved Quantum Power Method and Numerical Integration Using Quantum Singular Value Transformation
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
Quantum singular value transformation (QSVT) is a framework that has been shown to unify many primitives in quantum algorithms. In this work, we leverage the QSVT framework in two directions. We first show that the QSVT framework can accelerate one recently introduced quantum power method, which substantially improves its running time. Additionally, we incorporate several elementary numerical integration techniques, such as the rectangular method, Monte Carlo method, and quadrature method, into the QSVT framework, which results in polynomial speedup with respect to the size or the number of points of the grid. Our results thus provide further examples to demonstrate the potential of the QSVT and how it may enhance quantum algorithmic tasks.
Forward citations
Cited by 2 Pith papers
-
Simple Quantum Gradient Descent Without Coherent Oracle Access
A QSVT-based quantum gradient descent algorithm is proposed that avoids coherent oracle access, but key construction steps and complexity claims are not adequately supported.
-
New Quantum Algorithm for Principal Component Analysis
A new QPCA algorithm replaces quantum phase estimation with a block-encoding and quantum power method, with complexity depending on the eigenvalue gap rather than the largest eigenvalue.
Discussion (0). Continue with ORCID to comment.