Assessing the query complexity limits of quantum phase estimation using symmetry-aware spectral bounds

被引:1
|
作者
Cortes, Cristian L. [1 ]
Rocca, Dario [1 ]
Gonthier, Jerome F. [1 ]
Ollitrault, Pauline J. [1 ]
Parrish, Robert M. [1 ]
Anselmetti, Gian-Luca R. [2 ]
Degroote, Matthias [2 ]
Moll, Nikolaj [2 ]
Santagati, Raffaele [2 ]
Streif, Michael [2 ]
机构
[1] QC Ware Corp, Palo Alto, CA 94301 USA
[2] Boehringer Ingelheim GmbH & Co KG, Quantum Lab, D-55218 Ingelheim, Germany
关键词
SIMULATION; CHEMISTRY;
D O I
10.1103/PhysRevA.110.022420
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
The computational cost of quantum algorithms for physics and chemistry is closely linked to the spectrum of the Hamiltonian, a property that manifests in the necessary rescaling of its eigenvalues. The typical approach of using the 1-norm as an upper bound to the spectral norm to rescale the Hamiltonian suits the most general case of bounded Hermitian operators but neglects the influence of symmetries commonly found in chemical systems. In this work, we introduce a hierarchy of symmetry-aware spectral bounds that provide a unified understanding of the performance of quantum phase estimation algorithms using block-encoded electronic structure Hamiltonians. We present a variational and numerically tractable method for computing these bounds, based on orbital optimization, to demonstrate that the computed bounds are smaller than conventional spectral bounds for a variety of molecular benchmark systems. We also highlight the unique analytical and numerical scaling behavior of these bounds in the thermodynamic and complete basis set limits. Our work shows that there is room for improvement in reducing the 1-norm, not yet achieved through methods like double factorization and tensor hypercontraction, but highlights the potential challenges in improving the performance of current quantum algorithms beyond small constant factors through 1-norm reduction techniques alone.
引用
收藏
页数:12
相关论文
共 4 条
  • [1] Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
    Laplante, S
    Magniez, F
    19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 294 - 304
  • [2] Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
    Laplante, Sophie
    Magniez, Frederic
    SIAM JOURNAL ON COMPUTING, 2008, 38 (01) : 46 - 62
  • [3] Precision bounds for quantum phase estimation using two-mode squeezed Gaussian states
    Zhang, Jian-Dong
    Li, Chuang
    Hou, Lili
    Wang, Shuai
    CHINESE PHYSICS B, 2025, 34 (01)
  • [4] Precision bounds for quantum phase estimation using two-mode squeezed Gaussian states
    张建东
    李闯
    侯丽丽
    王帅
    Chinese Physics B, 2025, 34 (01) : 232 - 237