arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0003137quant-ph
收藏

费米子量子计算

Fermionic quantum computation

Sergey Bravyi, Alexei Kitaev

摘要:

我们定义了一个模型的量子计算与本地费米子模式(LFM)-网站可以是空的或占据的费米子。利用$m$ LFM的Foch空间与$m$量子位的Hilbert空间之间的标准对应,一个费米子门的模拟需要$O(m)$量子位门,反之亦然。我们表明,使用不同的编码,模拟成本可以减少到$O(\log m)$和一个常数,分别。有界度图上的最近邻费米子门可以以常数代价进行模拟。我们还研究了用马约拉纳费米子计算,马约拉纳费米子基本上是LFM的一半。与量子位量子码的一些联系。

英文摘要:

We define a model of quantum computation with local fermionic modes (LFMs) -- sites which can be either empty or occupied by a fermion. With the standard correspondence between the Foch space of $m$ LFMs and the Hilbert space of $m$ qubits, simulation of one fermionic gate takes $O(m)$ qubit gates and vice versa. We show that using different encodings, the simulation cost can be reduced to $O(\log m)$ and a constant, respectively. Nearest-neighbors fermionic gates on a graph of bounded degree can be simulated at a constant cost. A universal set of fermionic gates is found. We also study computation with Majorana fermions which are basically halves of LFMs. Some connection to qubit quantum codes is made.

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

↑