.png){kind=icon}
返回
Combinatorial optimization via highly efficient quantum walks
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.2.023302.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a highly efficient quantum circuit for performing continuous time quantum walks (CTQWs) over an exponentially large set of combinatorial objects, provided that the objects can be indexed efficiently. CTQWs form the core mixing operation of a generalized version of the quantum approximate optimization algorithm, which works by steering the quantum amplitude into high-quality solutions. The efficient quantum circuit holds the promise of finding high-quality solutions to certain classes of NP-hard combinatorial problems such as the Travelling Salesman Problem, maximum set splitting, graph partitioning, and lattice path optimization.
Keyword:
RANKING
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
7.6K
被引数:
2.7W
机构
引用论文
Large-scale silicon quantum photonics implementing arbitrary two-qubit processing实现任意两量子位处理的大规模硅量子光子学.png)
NATURE PHOTONICSOAAI
NATURE PHOTONICSIF32.9
OAAI分享收藏分享收藏A Novel Innate Response of Human Corneal Epithelium to Heat-killed Candida albicans by Producing Peptidoglycan Recognition ProteinsPLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容