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.
I present a short approach to discretizing continuous unitary evolution. It gives a correspondence in both directions between continuous unitary evolutions and products of unitaries in finite dimensions, and I use it to reduce discrete adiabatic theorems to continuous ones. At fine steps, holding truncated samples of a regulated Hamiltonian on a suitable finite partition gives an approximating product. Conversely, rounding the clock identifies a product of
T unit-step samples with a continuous evolution, up to two half-step phases. I bound its operator-norm distance from the original evolution by
O(1/T) through cancellation within each time step. This assumes bounded first and second derivatives, bounded spectral width, and eigenvalue differences bounded away from nonzero multiples of
2π, uniformly in
T. For a unitary walk with these derivative bounds, a fixed common free spectral arc supplies a Hermitian logarithm path satisfying the comparison hypotheses. Continuous simulation guarantees then transfer to the phase-corrected product, and continuous adiabatic bounds to the product itself, with an explicit additive
O(1/T) error and each adiabatic theorem's hypotheses retained. For positive definite quantum linear systems of condition number
κ, this comparison and continuous adiabatic theory give a rescaled qubitized walk with
O(κ/δ) steps for leakage
δ, matching the scaling previously obtained through a discrete adiabatic theorem. These products need no discrete adiabatic theorem.