REVIEW 6 cited by
Exact and efficient Lanczos method on a quantum computer
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
Exact and efficient Lanczos method on a quantum computer
read the original 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 $\Omega(1/\text{poly}(n))$ for $n$ qubits.
Forward citations
Cited by 6 Pith papers
-
Constrained Optimal Polynomials for Quantum Linear System Solvers
Constrained Uniform Polynomial (CUP) and Constrained Adaptive Polynomial (CAP) solvers achieve lower error than standard QSVT and Chebyshev methods in noise-limited regimes by optimizing accuracy versus block-encoding...
-
Nonisothermal global-pressure exactness in fractured multiphase flow with aperture feedback
A new mixed saturation-temperature compatibility condition is derived for exact global-pressure equivalence in nonisothermal multiphase fractured flow, with numerical benchmarks confirming regimes where exactness hold...
-
Orthogonal Quantum Krylov Diagonalisation
OQKD realizes classical Lanczos orthogonality and tridiagonal structure on a quantum computer via Hamiltonian polynomials and GQSP, removing overlap regularization while matching Chebyshev-QKD query complexity.
-
Orthogonal Quantum Krylov Diagonalisation
An orthogonal quantum Krylov algorithm (OQKD) implements classical Lanczos recursion via GQSP polynomial transformations, avoiding overlap-matrix regularization but inheriting an exponential GQSP normalization overhead.
-
Nonisothermal global-pressure exactness in fractured multiphase flow with aperture feedback
Constrained optimal polynomials (CUP and CAP) reduce quantum linear system solver errors under noise by jointly optimizing approximation accuracy and block-encoding normalization, outperforming standard QSVT and Cheby...
-
Unitaria: Quantum Linear Algebra via Block Encodings
Unitaria is a new open-source Python library that provides a high-level, composable interface for block encodings in quantum computing, enabling automatic circuit generation and classical simulation-based verification.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.