Probabilistic imaginary-time evolution via compiled diagonal representations

@misc{li2026probabilistic,
  title = {{Probabilistic imaginary-time evolution via compiled diagonal representations}},
  author = {Hengyue Li and Huazhe Lou and Yang Li and Mingyu Huang and Yusheng Yang and Jianyong Sheng and Jian Sun and Shenggang Ying},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.39600},
  eprint = {2610.39600},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.39600},
}

TY  - UNPB
TI  - Probabilistic imaginary-time evolution via compiled diagonal representations
AU  - Hengyue Li
AU  - Huazhe Lou
AU  - Yang Li
AU  - Mingyu Huang
AU  - Yusheng Yang
AU  - Jianyong Sheng
AU  - Jian Sun
AU  - Shenggang Ying
PY  - 2026
DA  - 2026/10/29
PB  - arXiv
DO  - 10.48550/arxiv.2610.39600
UR  - https://arxiv.org/abs/2610.39600
AB  - We introduce a probabilistic imaginary-time evolution scheme based on a compiled approximate diagonal representation of the Hamiltonian. A basis transformation is optimized offline. For a fixed compiled representation, the online circuit structure and gate count per attempt are independent of the imaginary time, and the same representation can be reused across different input states and evolution times. We derive a condition for enhanced success probability. Numerical tests show reduced online cost relative to termwise Pauli-based methods at a common accuracy threshold. We also examine how approximation errors and offline preparation costs affect the overall benefit.
ER  -