返回
Quantum algorithms for number fields
DOI:10.1002/prop.200610311.png)
摘要
En 中文
This is a survey of recent results on quantum algorithms for the computation of invariants of number fields, namely the class number and the regulator. Most known classical algorithms for the computation of these values are of subexponential complexity and depend on the truth of a still unproven hypothesis of analytic number theory. We use an important number theoretic concept, Minkowski's Geometry of Numbers, to visualize these invariants, and describe the quantum algorithms developed by Hallgren, Schmidt and Vollmer which compute these invariants using a polynomial number of steps. Computational techniques in number fields, which are necessary to justify the classical part of these quantum algorithms, are the focus of the research of our project group, and are explained in detail.
Keyword:
class number
regulator
number field
QFT
complexity
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
7.8
论文数:
2.0K
被引数:
3.6K
机构
暂无机构信息
引用论文
Synthesis of a Luminescent Compound: 8-Dimethylaminopyridazino[4,5-a][2.2.3]cyclazine-1,4(2H,3H)-diones
HETEROCYCLES
IF0
New eddy-current sensor setup for high-resolution lithium-ion cell dilation measurements用于高分辨率锂离子电池膨胀测量的新型涡流传感器设置
没有更多内容

