.png){kind=icon}
返回
Quasi-exact quantum computation
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.2.033116.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study quasi-exact quantum error-correcting codes and quantum computation with them. A quasi-exact code is an approximate code such that it contains a finite number of scaling parameters, the tuning of which can flow it to corresponding exact codes, serving as its fixed points. The computation with a quasi-exact code cannot realize any logical gate to arbitrary accuracy. To overcome this, the notion of quasi-exact universality is proposed, which makes quasi-exact quantum computation a feasible model especially for executing moderate-size algorithms. We find that the incompatibility between universality and transversality of the set of logical gates does not persist in the quasi-exact scenario. A class of covariant quasi-exact codes is defined which proves to support a transversal and quasi-exact universal set of logical gates for SU(d). This work opens the possibility of quantum computation with quasi-exact universality, transversality, and fault tolerance.
Keyword:
ERROR-CORRECTING CODES
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
7.6K
被引数:
2.7W
机构
引用论文
Attitudes Toward Affirmative Action: A Comparison of Color-Blind Versus Modern Racist Attitudes
PREAI
分享收藏Classifying quantum phases using matrix product states and projected entangled pair states.png)
PHYSICAL REVIEW B
OAAI
PHYSICAL REVIEW BIF3.7
OAAI分享收藏分享收藏
查看更多内容