Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.17630 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914489040896000 |
|---|---|
| author | Yang, Gengzhi Wu, Di Yang, Haizhao Wu, Xiaodi Liu, Ji |
| author_facet | Yang, Gengzhi Wu, Di Yang, Haizhao Wu, Xiaodi Liu, Ji |
| contents | We propose a versatile and efficient algorithmic framework for optimizing fermion-to-qubit mappings by generalizing the idea of randomized block coordinate descent. Our greedy approach, termed Randomized Subsystem Descent, iteratively samples a tractable subsystem from the full Hamiltonian, performs optimization within the subsystem under a given metric, and then reintegrates the updated subsystem into the global operator. Restricting the optimization to a subsystem at each iteration ensures computational efficiency, bypassing the dimensional bottlenecks that usually hinder global search heuristics. We benchmark our algorithm on one- and two-dimensional lattice hopping models, the Hubbard model with up to $16 \times 16$ sites, alongside a collection of molecular electronic-structure Hamiltonians with up to 54 modes and more than 180,000 Pauli strings. Across all benchmarks, our method consistently provides appreciable reduction in (weighted) Pauli weight, suggesting that Randomized Subsystem Descent is a practical and scalable framework for lowering the resource overhead of finding hardware-efficient Hamiltonian encodings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_17630 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Randomized Subsystem Descent for Fermion-to-Qubit Mapping Yang, Gengzhi Wu, Di Yang, Haizhao Wu, Xiaodi Liu, Ji Quantum Physics We propose a versatile and efficient algorithmic framework for optimizing fermion-to-qubit mappings by generalizing the idea of randomized block coordinate descent. Our greedy approach, termed Randomized Subsystem Descent, iteratively samples a tractable subsystem from the full Hamiltonian, performs optimization within the subsystem under a given metric, and then reintegrates the updated subsystem into the global operator. Restricting the optimization to a subsystem at each iteration ensures computational efficiency, bypassing the dimensional bottlenecks that usually hinder global search heuristics. We benchmark our algorithm on one- and two-dimensional lattice hopping models, the Hubbard model with up to $16 \times 16$ sites, alongside a collection of molecular electronic-structure Hamiltonians with up to 54 modes and more than 180,000 Pauli strings. Across all benchmarks, our method consistently provides appreciable reduction in (weighted) Pauli weight, suggesting that Randomized Subsystem Descent is a practical and scalable framework for lowering the resource overhead of finding hardware-efficient Hamiltonian encodings. |
| title | Randomized Subsystem Descent for Fermion-to-Qubit Mapping |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2604.17630 |