Quantum approximate optimization via learning-based adaptive optimization
Abstract Combinatorial optimization problems are ubiquitous and computationally hard to solve in general. Quantum approximate optimization algorithm (QAOA), one of the most representative quantum-classical hybrid algorithms, is designed to solve combinatorial optimization problems by transforming th...
Main Authors: | Lixue Cheng, Yu-Qin Chen, Shi-Xin Zhang, Shengyu Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2024-03-01
|
Series: | Communications Physics |
Online Access: | https://doi.org/10.1038/s42005-024-01577-x |
Similar Items
-
Quantum approximate optimization algorithm with adaptive bias fields
by: Yunlong Yu, et al.
Published: (2022-06-01) -
Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm
by: Yunlong Yu, et al.
Published: (2023-06-01) -
Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer
by: Linghua Zhu, et al.
Published: (2022-07-01) -
Energy-Efficient Cluster Head Selection via Quantum Approximate Optimization
by: Jaeho Choi, et al.
Published: (2020-10-01) -
Quantum dropout: On and over the hardness of quantum approximate optimization algorithm
by: Zhenduo Wang (王朕铎), et al.
Published: (2023-06-01)