.png){kind=icon}
返回
Ensemble quantum computing by NMR spectroscopy
.png){kind=icon}
OA
AI
DOI：10.1073/pnas.94.5.1634.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A quantum computer (QC) can operate in parallel on all its possible inputs at once, but the amount of information that can be extracted from the result is limited by the phenomenon of wave function collapse, We present a new computational model, which differs from a QC only in that the result of a measurement is the expectation value of the observable, rather than a random eigenvalue thereof, Such an expectation value QC can solve nondeterministic polynomial-time complete problems in polynomial time, This observation is significant precisely because the computational model can be realized, to a certain extent, by NMR spectroscopy on macroscopic ensembles of quantum spins, namely molecules in a test tube, This is made possible by identifying a manifold of statistical spin states, called pseudo-pure states, the mathematical description of which is isomorphic to that of an isolated spin system, The result is a novel NMR computer that can be programmed much like a QC, but in other respects more closely resembles a DNA computer, Most notably, when applied to intractable combinatorial problems, an NMR computer can use an amount of sample, rather than time, which grows exponentially with the size of the problem, Although NMR computers will be limited by current technology to exhaustive searches over only 15 to 20 bits, searches over as much as 50 bits are in principle possible, and more advanced algorithms could greatly extend the range of applicability of such machines.
Keyword:
NMR
quantum computing
DNA computing
nondeterministic polynomial-time complete
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
P
IF:
9.1
论文数:
10.8W
被引数:
73.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容