Efficient phase-factor evaluation in quantum signal processing
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the use of variable precision arithmetic and can only be applied to polynomials of a relatively low degree. We present here an optimization-based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and quantum linear system problems. Our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of a degree larger than $10\phantom{\rule{0.16em}{0ex}}000$ with errors below ${10}^{\ensuremath{-}12}$.
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 2×
“, the HHL algorithm [15] for the matrix inverse), the method of linear combination of unitaries (LCU) [3, 6], and the method of quantum signal processing (QSP) [11, 20, 22].”
MethodFunctions of Matrices: Theory and Computation
Higham, N. J. (2008) · doi:10.1137/1.9780898717778 · Cited by 2,113
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244 · cited 2×
“[2] P.”
BackgroundHamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · Quantum · doi:10.22331/q-2019-07-12-163 · Cited by 854
Childs, A. M., Kothari, R., & Somma, R. D. (2017) · SIAM Journal on Computing · doi:10.1137/16m1087072 · Cited by 646 · cited 4×
“, the HHL algorithm [15] for the matrix inverse), the method of linear combination of unitaries (LCU) [3, 6], and the method of quantum signal processing (QSP) [11, 20, 22].”
BackgroundMethodInfluentialToward the first quantum simulation with quantum speedup
Childs, A. M., Maslov, D., Nam, Y., Ross, N. J., & Su, Y. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1801723115 · Cited by 551
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters
Berry, D. W., Childs, A. M., & Kothari, R. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.54 · Cited by 372 · cited 3×
“, the HHL algorithm [15] for the matrix inverse), the method of linear combination of unitaries (LCU) [3, 6], and the method of quantum signal processing (QSP) [11, 20, 22].”
MethodMethodology of Resonant Equiangular Composite Quantum Gates
Low, G. H., Yoder, T. J., & Chuang, I. L. (2016) · Physical Review X · doi:10.1103/physrevx.6.041067 · Cited by 159 · cited 2×
“, the HHL algorithm [15] for the matrix inverse), the method of linear combination of unitaries (LCU) [3, 6], and the method of quantum signal processing (QSP) [11, 20, 22].”
Method
Cited by
Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
Dong, Y., & Lin, L. (2021) · Physical Review A · doi:10.1103/physreva.103.062412 · Cited by 34
“Numerical results shows that a better approximation to g(x) can be obtained by solving a minimax problem using the Remez algorithm [21], and the polynomial can be chosen to be either even or odd.”
BackgroundMethodInfluentialSelf-citationProspects for NMR spectral prediction on fault-tolerant quantum computers
Elenewski, J. E., Camara, C. M., & Kalev, A. (2026) · Physical Review Research · doi:10.1103/km66-ltpl · Cited by 3
Quantum algorithm for metabolic network analysis
Joshi, A., & Koyama, T. (2026) · Machine Learning with Applications · doi:10.1016/j.mlwa.2026.100913
Metadata
- Authors
- Dong, Y., Meng, X., Whaley, K. B., & Lin, L.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2021-04-22
- Volume
- 103
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W3007060332
- Cited by
- 139
- References
- 10
- FWCI
- 7.23
- 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: Efficient phase-factor evaluation in quantum signal processing. https://app.cochat.ai/papers/10.1103/physreva.103.042419
- The paper
- Dong, Y., Meng, X., Whaley, K. B., & Lin, L. (2021). Efficient phase-factor evaluation in quantum signal processing. Physical Review A. https://doi.org/10.1103/physreva.103.042419
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.