.png){kind=icon}
返回
Prime factorization using quantum annealing and computational algebraic geometry
.png){kind=icon}
OA
AI
DOI：10.1038/srep43048.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Grobner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Grobner bases can be used to reduce the degree of Hamiltonians.
Keyword:
ALGORITHM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
28.3W
被引数:
83.5W
机构
暂无机构信息
引用论文
Peripheral neuropathy during bortezomib treatment of multiple myeloma: a review of recent studies
PREAI
分享收藏A Pilot Quantitative Study of Topographic Correlation between Reticular Pseudodrusen and the Choroidal Vasculature Using En Face Optical Coherence Tomography.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容