.png){kind=icon}
返回
Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2024.09.005.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Grover Search is currently one of the main quantum algorithms leading to hybrid quantum-classical methods that reduce the worst-case time complexity for some combinatorial optimization problems. Specifically, the combination of Quantum Minimum Finding (obtained from Grover Search) with dynamic programming has proved particularly efficient in improving the complexity of NP-hard problems currently solved by classical dynamic programming. For these problems, the classical dynamic programming complexity in O-& lowast;(c(n)), where O-& lowast; denotes that polynomial factors are ignored, can be reduced by a hybrid algorithm to O-& lowast;(c(quant)(n)), with c(quant)
Keyword:
Discrete optimization
Quantum computing
Scheduling
Dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
The Comprehensive Application of Both Near-Bit and Surface Vibration Measurement to Quickly Identify Coalbed Boundary.png)
All Days
All DaysIF0
PREAI
分享收藏Multidirectional effects of triterpene saponins on cancer cells - mini-review of in vitro studiesOAAI
OAAI分享收藏Application of quantum approximate optimization algorithm to job shop scheduling problem量子近似优化算法在作业车间调度问题中的应用OAAI
OAAI分享收藏
查看更多内容