VanQver: the variational and adiabatically navigated quantum eigensolver

被引:10
|
作者
Matsuura, Shunji [1 ]
Yamazaki, Takeshi [1 ]
Senicourt, Valentin [1 ]
Huntington, Lee [1 ]
Zaribafiyan, Arman [1 ]
机构
[1] 1QB Informat Technol 1QBit, Vancouver, BC V6C 2B5, Canada
关键词
adiabatic quantum computing; quantum chemistry; variational method; quantum annealing; hybrid algorithm; !text type='PYTHON']PYTHON[!/text] FRAMEWORK; SIMULATIONS; DYNAMICS; QUTIP;
D O I
10.1088/1367-2630/ab8080
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The accelerated progress in manufacturing noisy, intermediate-scale quantum (NISQ) computing hardware has opened the possibility of exploring its application in transforming approaches to solving computationally challenging problems. The important limitations common among all NISQ computing technologies are the absence of error correction and the short coherence time, which limit the computational power of these systems. Shortening the required time of a single run of a quantum algorithm is essential for reducing environment-induced errors and for the efficiency of the computation. We have investigated the ability of a variational version of adiabatic state preparation (ASP) to generate an accurate state more efficiently compared to existing adiabatic methods. The standard ASP method uses a time-dependent Hamiltonian, connecting the initial Hamiltonian with the final Hamiltonian. In the current approach, a navigator Hamiltonian is introduced which has a non-zero amplitude only in the middle of the annealing process. Both the initial and navigator Hamiltonians are determined using variational methods. A Hermitian cluster operator, inspired by coupled-cluster theory and truncated to single and double excitations/de-excitations, is used as a navigator Hamiltonian. A comparative study of our variational algorithm (VanQver) with that of standard ASP, starting with a Hartree-Fock Hamiltonian, is presented. The results indicate that the introduction of the navigator Hamiltonian significantly improves the annealing time required to achieve chemical accuracy by two to three orders of magnitude. The efficiency of the method is demonstrated in the ground-state energy estimation of molecular systems, namely, H-2, P4, and LiH.
引用
收藏
页数:16
相关论文
共 50 条
  • [1] Variational denoising for variational quantum eigensolver
    Tran, Quoc Hoan
    Kikuchi, Shinji
    Oshima, Hirotaka
    PHYSICAL REVIEW RESEARCH, 2024, 6 (02):
  • [2] Accelerated Variational Quantum Eigensolver
    Wang, Daochen
    Higgott, Oscar
    Brierley, Stephen
    PHYSICAL REVIEW LETTERS, 2019, 122 (14)
  • [3] Variational quantum state eigensolver
    Cerezo, M.
    Sharma, Kunal
    Arrasmith, Andrew
    Coles, Patrick J.
    NPJ QUANTUM INFORMATION, 2022, 8 (01)
  • [4] Variational quantum state eigensolver
    M. Cerezo
    Kunal Sharma
    Andrew Arrasmith
    Patrick J. Coles
    npj Quantum Information, 8
  • [5] Variational quantum eigensolver for frustrated quantum systems
    Uvarov, Alexey
    Biamonte, Jacob D.
    Yudin, Dmitry
    PHYSICAL REVIEW B, 2020, 102 (07)
  • [6] Cascaded variational quantum eigensolver algorithm
    Gunlycke, Daniel
    Hellberg, C. Stephen
    Stenger, John P. T.
    PHYSICAL REVIEW RESEARCH, 2024, 6 (01):
  • [7] Orbital expansion variational quantum eigensolver
    Wu, Yusen
    Huang, Zigeng
    Sun, Jinzhao
    Yuan, Xiao
    Wang, Jingbo B.
    Lv, Dingshun
    QUANTUM SCIENCE AND TECHNOLOGY, 2023, 8 (04)
  • [8] Variational quantum eigensolver with fewer qubits
    Liu, Jin-Guo
    Zhang, Yi-Hong
    Wan, Yuan
    Wang, Lei
    PHYSICAL REVIEW RESEARCH, 2019, 1 (02):
  • [9] Penalty methods for a variational quantum eigensolver
    Kuroiwa, Kohdai
    Nakagawa, Yuya O.
    PHYSICAL REVIEW RESEARCH, 2021, 3 (01):
  • [10] Improving the Variational Quantum Eigensolver Using Variational Adiabatic Quantum Computing
    Harwood, Stuart M.
    Trenev, Dimitar
    Stober, Spencer T.
    Barkoutsos, Panagiotis
    Gujarati, Tanvi P.
    Mostame, Sarah
    Greenberg, Donny
    ACM TRANSACTIONS ON QUANTUM COMPUTING, 2022, 3 (01):