Quantum

Sparse-QITE: Discovering Compact Generators for Quantum Imaginary-Time Evolution via Regularization Methods

Read full article at source ↗

Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 16/10/2026, 04:13:25 UTC.

Briefings

Sparse-QITE is a regularization method for Quantum Imaginary-Time Evolution (QITE) that promotes compact generators by reducing the number of quantum operations. The method derives rigorous bounds on sparsification error and benchmarks results in one-dimensional transverse-field Ising and antiferromagnetic Heisenberg models. In scalability experiments, active support grows much slower than in standard QITE, with some large-domain cases requiring only about 1% of the standard-QITE gate count while maintaining high accuracy. The approach also introduces adaptive and active-discovery variants to further reduce measurement requirements.

Key points

• Sparse-QITE reduces the number of quantum operations by promoting compact generators in QITE.
• The method achieves approximately 1% of the standard-QITE gate count for large domains while maintaining high accuracy.

Context

Quantum imaginary-time evolution provides a systematic route to ground-state preparation, but its cost grows rapidly with locality D, where the local Pauli basis scales as 4^D. This method introduces a regularized formulation that promotes compact generators, reducing the number of quantum operations and yielding circuits with fewer gates and lower depth.

Limitations

The evidence is limited to one-dimensional transverse-field Ising and antiferromagnetic Heisenberg models. Rigorous bounds on sparsification error are derived, but the specific error values are not provided. The method's performance in higher-dimensional systems or different physical models remains untested.

Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 16/10/2026, 04:47:34 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.

View archived briefing on IPFS
bafybeifhajadm7ddinpondhr6g3i6qrmkryu3kuxup3qaipo4zd66b5uhq