.png){kind=icon}
返回
Efficient quantum algorithm for solving structured problems via multistep quantum computation
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.5.L012004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In classical computation, a problem can be solved in multiple steps where the calculated results of each step can be copied and used repeatedly. However, in quantum computation, it is difficult to realize a similar multistep computation process because the no-cloning theorem forbids making copies of an unknown quantum state perfectly. We find a method based on a quantum resonant transition to protect and reuse an unknown quantum state that encodes the calculated results of an intermediate step without copying it, and present a quantum algorithm that solves a problem via multistep quantum computation. We demonstrate that this algorithm can solve a type of structured search problems efficiently.
期刊
IF:
4.2
论文数:
7.6K
被引数:
2.7W
机构
引用论文
Simultaneous measurement of the Young's modulus and the Poisson ratio of thin elastic layers.png)
Soft Matter
Soft MatterIF0
PREAI
分享收藏Labiatamides A, B, and other eunicellan diterpenoids from the Senegalese gorgonian Eunicella labiataTetrahedron
TetrahedronIF0
PREAI
分享收藏Incorporating benthic community changes into hydrochemical-based projections of coral reef calcium carbonate production under ocean acidificationCoral Reefs
OAAI
Coral ReefsIF0
OAAI分享收藏The Impacts of Climate Change on Agricultural Production, Land Use and Economy of the Legal Amazon Region Between 2030 and 2049EconomiAOAAI
EconomiAIF0
OAAI分享收藏
查看更多内容