Quantum random power method for ground state computation
<|reference_start|>Quantum random power method for ground state computation: We present a quantum-classical hybrid random power method that approximates a ground state of a Hamiltonian. The quantum part of our method computes a fixed number of elements of a Hamiltonian-matrix polynomial via a quantum polynomial filtering technique. This technique can be implemented using Hamiltonian simulation or block encoding, suitable for early fault-tolerant and fault-tolerant regimes, respectively. The classical part of our method is a randomized iterative algorithm that takes as input the matrix elements computed from the quantum part and outputs an approximation of ground state of the Hamiltonian. For the per-iteration complexity of our method, the required classical time is independent of system size, and the quantum circuit complexity depends polylogarithmically on the system size. We prove that with probability one, our method converges to an approximation of a ground state of the Hamiltonian. We also show a lower bound of the fidelity of the approximate ground state with the true one. The lower bound depends linearly on the magnitude of noise occurring from quantum computation if it is smaller than a critical value. Several numerical experiments demonstrate that our method provides a good approximation of ground state in the presence of systematic and/or sampling noise.<|reference_end|>
@article{ko2024quantum,
    title={Quantum random power method for ground state computation},
    author={Taehee Ko, Hyowon Park, Sangkook Choi},
    journal={arXiv preprint arXiv:2408.08556},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.08556},
    primaryClass={quant-ph cs.NA math.NA}
}