Commutator-guided repair and classical-accessibility boundaries for shallow quantum circuits

Trainability does not guarantee low-energy arrival: a shallow quantum circuit can be optimizable yet fail, under fixed depth and evaluation budgets, to reach Hamiltonian-selected states. We introduce a commutator-guided repair for this operational failure mode. Low-order host--Hamiltonian commutators and fixed same-support companion axes define a restricted pool of local Pauli rotations, from which a compact completion layer is selected before full reoptimization. Across 189 paired six-qubit trials, unrepaired circuits achieve 0/189 strict successes, a non-deployable per-trial control envelope achieves 109/189, and two predeclared selectors achieve 133/189 and 127/189. The repair loses to matched controls for transverse-field Ising, is weak for pure-ZZ MaxCut, and remains size-limited for weighted MIS. Under fixed-depth geometric locality, repaired losses and gradients are classically computable, while corresponding ground-state targets admit low-bond-dimension tensor-network approximations through the tested sizes. The method reveals a trainability--arrival--classical-accessibility tradeoff rather than quantum advantage.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-17
DOI
https://doi.org/10.48550/arxiv.2611.22087
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Commutator-guided repair and classical-accessibility boundaries for shallow quantum circuits

Srinivasan Raghuraman, Sunpreet S. Arora, Harshal Shah, Yifeng Peng et al.
arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
preprint

Commutator-guided repair and classical-accessibility boundaries for shallow quantum circuits

Srinivasan Raghuraman, Sunpreet S. Arora, Harshal Shah, Yifeng Peng, Bin Yan, Kim Wagner
preprint en

Abstract

Trainability does not guarantee low-energy arrival: a shallow quantum circuit can be optimizable yet fail, under fixed depth and evaluation budgets, to reach Hamiltonian-selected states. We introduce a commutator-guided repair for this operational failure mode. Low-order host--Hamiltonian commutators and fixed same-support companion axes define a restricted pool of local Pauli rotations, from which a compact completion layer is selected before full reoptimization. Across 189 paired six-qubit trials, unrepaired circuits achieve 0/189 strict successes, a non-deployable per-trial control envelope achieves 109/189, and two predeclared selectors achieve 133/189 and 127/189. The repair loses to matched controls for transverse-field Ising, is weak for pure-ZZ MaxCut, and remains size-limited for weighted MIS. Under fixed-depth geometric locality, repaired losses and gradients are classically computable, while corresponding ground-state targets admit low-bond-dimension tensor-network approximations through the tested sizes. The method reveals a trainability--arrival--classical-accessibility tradeoff rather than quantum advantage.

arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
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