arXiv QuantumArchived Apr 20, 2026✓ Full text saved
arXiv:2604.15441v1 Announce Type: new Abstract: A key challenge in classical machine learning is to mitigate overparameterization by selecting sparse solutions. We translate this concept to the quantum domain, introducing quantum sparsity as a principle based on minimizing quantum information shared across multiple parties. This allows us to address fundamental issues in quantum data processing and convergence issues such as the barren plateau problem in Variational Quantum Algorithm (VQA). We p
Full text archived locally
✦ AI Summary· Claude Sonnet
Quantum Physics
[Submitted on 16 Apr 2026]
Quantum computation at the edge of chaos
Tomohiro Hashizume, Zhengjun Wang, Frank Schlawin, Dieter Jaksch
A key challenge in classical machine learning is to mitigate overparameterization by selecting sparse solutions. We translate this concept to the quantum domain, introducing quantum sparsity as a principle based on minimizing quantum information shared across multiple parties. This allows us to address fundamental issues in quantum data processing and convergence issues such as the barren plateau problem in Variational Quantum Algorithm (VQA). We propose a practical implementation of this principle using the topological Entanglement Entropy (TEE) as a cost function regularizer. A non-negative TEE is associated with states with a sparse structure in a suitable basis, while a negative TEE signals untrainable chaos. The regularizer, therefore, guides the optimization along the critical edge of chaos that separates these regimes. We link the TEE to structural complexity by analyzing quantum states encoding functions of tunable smoothness, deriving a quantum Nyquist-Shannon sampling theorem that bounds the resource requirements and error propagation in VQA. Numerically, our TEE regularizer demonstrates significantly improved convergence and precision for complex data encoding and ground-state search tasks. This work establishes quantum sparsity as a design principle for robust and efficient VQAs.
Comments: 18 pages, 5 figures
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:2604.15441 [quant-ph]
(or arXiv:2604.15441v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2604.15441
Focus to learn more
Submission history
From: Tomohiro Hashizume [view email]
[v1] Thu, 16 Apr 2026 18:02:17 UTC (1,099 KB)
Access Paper:
HTML (experimental)
view license
Current browse context:
quant-ph
< prev | next >
new | recent | 2026-04
References & Citations
INSPIRE HEP
NASA ADS
Google Scholar
Semantic Scholar
Export BibTeX Citation
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Demos
Related Papers
About arXivLabs
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)