CoChat

Exact and efficient Lanczos method on a quantum computer

Open access
Kirby, William, Motta, Mario, Mezzacapo, Antonio · 2023 · Quantum
Cited by 66

The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.

Abstract

We present an algorithm that uses block encoding on a quantum computer to exactly construct a Krylov space, which can be used as the basis for the Lanczos method to estimate extremal eigenvalues of Hamiltonians. While the classical Lanczos method has exponential cost in the system size to represent the Krylov states for quantum systems, our efficient quantum algorithm achieves this in polynomial time and memory. The construction presented is exact in the sense that the resulting Krylov space is identical to that of the Lanczos method, so the only approximation with respect to the exact method is due to finite sample noise. This is possible because, unlike previous quantum Krylov methods, our algorithm does not require simulating real or imaginary time evolution. We provide an explicit error bound for the resulting ground state energy estimate in the presence of noise. For our method to be successful efficiently, the only requirement on the input problem is that the overlap of the initial state with the true ground state must be Ω(1/poly(n)) for n qubits.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.22331/q-2023-05-23-1018

Cites

23 of 23 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 23 references

Cited by

  • Challenges and opportunities in quantum optimization

    Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201

    “QPE is also valuable for optimization when a problem is encoded into non-diagonal Hamiltonians 240,241 .”
  • Early Fault-Tolerant Quantum Computing

    Katabarwa, A., Gratsea, K., Caesura, A., & Johnson, P. D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020101 · Cited by 103

    “…Variational Quantum Phase Estimation [53] Fourier Filtering [62] Statistical Phase Estimation [63] Gaussian Filter [106] QCELS [57] Quantum Lanczos [58] Rejection Sampling [66] Gaussian QPE [107] Ground State Preparation Gaussian Booster [56] QET-U [55] Single-Ancilla Lindbladian [108] The…”
    BackgroundMethodInfluential
  • Variational benchmarks for quantum many-body problems

    Wu, D., Rossi, R., Vicentini, F., Astrakhantsev, N., Becca, F., Cao, X., Carrasquilla, J., Ferrari, F., Georges, A., Hibat-Allah, M., et al. (2024) · Science · doi:10.1126/science.adg9774 · Cited by 79

    “A fundamental challenge in assessing newly established computational methods, either based on classical or quantum computing, is defining a consistent accuracy metric.”
    BackgroundSelf-citation

See all 66

Metadata

Authors
Kirby, W., Motta, M., & Mezzacapo, A.
Venue
Quantum
Published
2023-05-23
Volume
7
Pages
1018
ISSN
2521-327X (ISSN-L)
OpenAlex
W4378087241
Cited by
66
References
23
FWCI
5.80
Type
journal article
Language
en
Open access
gold

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: Exact and efficient Lanczos method on a quantum computer. https://app.cochat.ai/papers/10.22331/q-2023-05-23-1018
The paper
Kirby, W., Motta, M., & Mezzacapo, A. (2023). Exact and efficient Lanczos method on a quantum computer. Quantum. https://doi.org/10.22331/q-2023-05-23-1018

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.