Fast Quantum Algorithm for Numerical Gradient Estimation
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Given a black box for f, a smooth real scalar function of d real variables, one wants to estimate [symbol: see text]f at a given point with n bits of precision. On a classical computer this requires a minimum of d + 1 black box queries, whereas on a quantum computer it requires only one query regardless of d. The number of bits of precision to which f must be evaluated matches the classical requirement in the limit of large n.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
Cited by
Simulating Chemistry Using Quantum Computers
Kassal, I., Whitfield, J. D., Perdomo-Ortiz, A., Yung, M.-H., & Aspuru-Guzik, A. (2011) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-032210-103512 · Cited by 352
Quantum gradient descent for linear systems and least squares
Kerenidis, I., & Prakash, A. (2020) · Physical Review A · doi:10.1103/physreva.101.022316 · Cited by 171
“Quantum algorithms for gradient estimation have been studied before [15, 7, 16, 11], where a quantum algorithm is used to estimate the gradient of a given function, while a classical algorithm performs the gradient descent.”
MethodHarrow, A. W., & Napp, J. C. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.140502 · Cited by 121
“isy estimate of the gradient in low depth. An alternative approach for measuring the gradient in variational algorithms was recentlyproposed in[GAW17],whichbuildsonJordan’sgradientmeasurementalgorithm[Jor05]. Their algorithm offers significantly better performance for obtaining precise estimates of the gradient, but als…”
BackgroundAdvances in quantum reinforcement learning
Dunjko, V., Taylor, J. M., & Briegel, H. J. (2017) · 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC) · doi:10.1109/smc.2017.8122616 · Cited by 81
“In this case one can, for instance, use “quantum-improved” gradient descent methods [20], or use “completely quantum” gradient descent techniques [19].”
BackgroundMethodQuantum algorithm for molecular properties and geometry optimization
Kassal, I., & Aspuru-Guzik, A. (2009) · The Journal of Chemical Physics · doi:10.1063/1.3266959 · Cited by 76
Metadata
- Authors
- Jordan, S. P.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2005-07-28
- Volume
- 95
- Issue
- 5
- Pages
- 050501-050501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2062938319
- Cited by
- 117
- References
- 1
- FWCI
- 2.75
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast Quantum Algorithm for Numerical Gradient Estimation. https://app.cochat.ai/papers/10.1103/physrevlett.95.050501
- The paper
- Jordan, S. P. (2005). Fast Quantum Algorithm for Numerical Gradient Estimation. Physical Review Letters. https://doi.org/10.1103/physrevlett.95.050501
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.