Randomized Subsystem Descent for Fermion-to-Qubit Mapping

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 × 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 an 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.

Authors

Institutions

Publication Details

Journal
Journal of Chemical Theory and Computation
Published
2026-11-19
DOI
https://doi.org/10.1021/acs.jctc.6c01412
Citations
3
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.90

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Randomized Subsystem Descent for Fermion-to-Qubit Mapping

Gengzhi Yang, Haizhao Yang, Ji Liu, Xiaodi Wu et al.
3 citations
Journal of Chemical Theory and Computation
Quantum Computing Algorithms and Architecture
2.90
article

Randomized Subsystem Descent for Fermion-to-Qubit Mapping

Gengzhi Yang, Haizhao Yang, Ji Liu, Xiaodi Wu, Di Wu
article en
3 citations

Abstract

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 × 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 an 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.

Journal of Chemical Theory and Computation
Argonne National Laboratory (US), University of Maryland, College Park (US)
National Science Foundation, U.S. Department of Energy, Defense Advanced Research Projects Agency, Office of Science, Advanced Scientific Computing Research
Openalex Percentile: Top 9%
Quantum Computing Algorithms and Architecture
2.90
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon