arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.03297cond-mat.str-elcond-mat.otherquant-ph
收藏

强关联Majorana边模的普适拓扑量子计算

Universal topological quantum computation with strongly correlated Majorana edge modes

Ye-Min Zhan, Yu-Ge Chen, Bin Chen, Ziqiang Wang, Yue Yu, Xi Luo

摘要:

基于Majorana的量子门不适合于进行普适的拓扑量子计算,而基于Fibonacci的量子门很难用电子学方法实现,并且与传统的量子线路模型很难吻合。在文献\cite{hukane}中,我们证明了在三临界伊辛模型中,手征拓扑超导体中强关联的Majorana边模可以分解为Fibobacci任意子$τ$和热算符任意子$\varepsilon$.通过费米子模式之间的相互作用,$τ$和$\varepsilon$的解禁闭产生了任意子{碰撞},并给出了$τ$或$\varepsilon$的编织。通过这些编织,拓扑地组装了一组通用门的完整成员,Pauli门,Hadamard门和额外相位门(对于1-qubit)以及受控非门(对于2-qubit)。量子信息的编码和计算结果的读出可以通过电信号来实现。采用疏密混合编码,我们建立了量子线路(其中受控非门为概率门),并设计了相应的手性拓扑超导体薄膜器件。作为普适拓扑量子计算的一个例子,我们展示了Shor的整数分解算法的应用。

英文摘要:

Majorana-based quantum gates are not complete for performing universal topological quantum computation while Fibonacci-based gates are difficult to be realized electronically and hardly coincide with the conventional quantum circuit models. In Ref. \cite{hukane}, it has been shown that a strongly correlated Majorana edge mode in a chiral topological superconductor can be decomposed into a Fibobacci anyon $τ$ and a thermal operator anyon $\varepsilon$ in the tricritical Ising model. The deconfinement of $τ$ and $\varepsilon$ via the interaction between the fermion modes yields the anyon {collisions} and gives the braiding of either $τ$ or $\varepsilon$. With these braidings, the complete members {of} a set of universal gates, the Pauli gates, the Hadamard gate and extra phase gates for 1-qubit as well as controlled-not gate for 2-qubits, are topologically assembled. Encoding quantum information and reading out the computation results can be carried out through electric signals. With the sparse-dense mixed encodings, we set up the quantum circuit {where the controlled-not gate turns out { to be} a probabilistic gate} and design the corresponding devices with thin films of the chiral topological superconductor. As an example of the universal topological quantum computing, we show the application to Shor's integer factorization algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑