.png){kind=icon}
Return
Improvement of Quantum Approximate Optimization Algorithm for Max-Cut Problems
.png){kind=icon}
OA
AI
DOI：10.3390/s22010244.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The objective of this short letter is to study the optimal partitioning of value stream networks into two classes so that the number of connections between them is maximized. Such kind of problems are frequently found in the design of different systems such as communication network configuration, and industrial applications in which certain topological characteristics enhance value-stream network resilience. The main interest is to improve the Max-Cut algorithm proposed in the quantum approximate optimization approach (QAOA), looking to promote a more efficient implementation than those already published. A discussion regarding linked problems as well as further research questions are also reviewed.
Keywords:
Industry 4
0
quantum approximate optimization algorithm
value-stream networks
optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.2W
Citations:
20.9W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveDigital Twin and Big Data Towards Smart Manufacturing and Industry 4.0: 360 Degree Comparison.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSave
ShareSave
View more