REVIEW 2 cited by
Approximation Theory and the Design of Fast Algorithms
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
Signed reviews
read the original abstract
We survey key techniques and results from approximation theory in the context of uniform approximations to real functions such as e^{-x}, 1/x, and x^k. We then present a selection of results demonstrating how such approximations can be used to speed up primitives crucial for the design of fast algorithms for problems such as simulating random walks, graph partitioning, solving linear system of equations, computing eigenvalues and combinatorial approaches to solve semi-definite programs.
Forward citations
Cited by 2 Pith papers
-
Estimating Green's functions with a robust quantum Arnoldi method
ROQAM formulates Green's function estimation via orthogonal polynomials to preserve Hessenberg structure under finite precision, enabling lower precision with depth and outperforming QSVD by orders of magnitude in res...
-
Partition function estimation with a quantum coin toss
Partition functions can be estimated from the success probability of a block-encoded imaginary-time propagator, with sample complexity O(2^n e^β/(Z_β ε_r²)).
Discussion (0). Continue with ORCID to comment.