您当前的位置:
首页 >
文章列表页 >
Quantum Approximate Optimization Algorithm for Graph Partitioning
PAPERS | 更新时间:2025-12-11
    • Quantum Approximate Optimization Algorithm for Graph Partitioning

    • ACTA ELECTRONICA SINICA   Vol. 52, Issue 6, Pages: 2025-2036(2024)
    • DOI:10.12263/DZXB.20220784    

      CLC: TP301.6;
    • Received:06 July 2022

      Revised:2023-02-16

      Published:25 June 2024

    移动端阅览

  • YUAN Zhi-qiang, YANG Si-chun, RUAN Yue, et al. Quantum Approximate Optimization Algorithm for Graph Partitioning[J]. Acta Electronica Sinica, 2024, 52(06): 2025-2036. DOI:10.12263/DZXB.20220784

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

23

下载量

0

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

A Novel SAR Super-Resolution Method via Signal Extrapolation and Hierarchical Learning
Research on Radio Signal Modulation Recognition Based on Hyperbolic State Space Model
Adaptive Output Consensus of Heterogeneous Open Multi-Agent Systems under Actuator Attacks
Attention Penalty and Adaptive Learning Scene Graph for Joint Multimodal Aspect-Based Sentiment Analysis
Low Sidelobe and High Aperture Efficiency Reflectarray Based on Metasurface

Related Author

YUAN Zhi-qiang
YANG Si-chun
RUAN Yue
XUE Xi-ling
TAO Tao

Related Institution

School of Computer Science and Technology, Anhui University of Technology, Maanshan
0