Variational optimization for quantum problems using deep generative networks

Abstract Optimization drives advances in quantum science and machine learning, yet most generative models aim to mimic data rather than to discover optimal answers to challenging problems. Here we present a variational generative optimization network that learns to map simple random inputs into high quality solutions across a variety of quantum tasks. We demonstrate that the network rapidly identifies entangled states exhibiting an optimal advantage in entanglement detection when allowing classical communication, attains the ground state energy of an eighteen spin model without encountering the barren plateau phenomenon that hampers standard hybrid algorithms, and—after a single training run—outputs multiple orthogonal ground states of degenerate quantum models. Because the method is model agnostic, parallelizable and runs on current classical hardware, it can accelerate future variational optimization problems in quantum information, quantum computing and beyond.

Authors

Institutions

Publication Details

Journal
Communications Physics
Published
2025-08-15
DOI
https://doi.org/10.1038/s42005-025-02261-4
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48

Funders

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

Variational optimization for quantum problems using deep generative networks

L. Zhang, Zhaohui Wei, Xiaodie Lin, Kaiyan Yang et al.
1 citations
Communications Physics
Quantum Computing Algorithms and Architecture
2.48
article

Variational optimization for quantum problems using deep generative networks

L. Zhang, Zhaohui Wei, Xiaodie Lin, Kaiyan Yang, Peidong Wang, Zizhu Wang, Xiao Zeng
article en
1 citations

Abstract

Abstract Optimization drives advances in quantum science and machine learning, yet most generative models aim to mimic data rather than to discover optimal answers to challenging problems. Here we present a variational generative optimization network that learns to map simple random inputs into high quality solutions across a variety of quantum tasks. We demonstrate that the network rapidly identifies entangled states exhibiting an optimal advantage in entanglement detection when allowing classical communication, attains the ground state energy of an eighteen spin model without encountering the barren plateau phenomenon that hampers standard hybrid algorithms, and—after a single training run—outputs multiple orthogonal ground states of degenerate quantum models. Because the method is model agnostic, parallelizable and runs on current classical hardware, it can accelerate future variational optimization problems in quantum information, quantum computing and beyond.

Communications PhysicsVol. 8(1)
University of Electronic Science and Technology of China (CN), Chinese University of Hong Kong (HK), Beijing Institute of Mathematical Sciences and Applications, Fuzhou University (CN), Tsinghua University (CN)
National Natural Science Foundation of China, Sichuan Province Science and Technology Support Program, National Key Research and Development Program of China
Openalex Percentile: Top 9%
Quantum Computing Algorithms and Architecture
2.48
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.