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

代数、逻辑与量子比特:量子算盘

Algebra, Logic and Qubits: Quantum Abacus

Alexander Yu. Vlasov

摘要:

费米子系统的正则反对易关系可以用有限维矩阵代数表示,而玻色子的正则对易关系则不能用有限维矩阵代数表示。在描述了CAR和有界量子计算网络的Clifford代数表示的更简单情况后,本文讨论了CCR。对于代数的表示,使用具有固定数量的量子比特的量子网络是不够的,并且考虑具有附加新单元的基本操作的图灵机更方便,用于在有限项中描述无限带-它对量子情况具有直接的推广,但是对于CCR,有必要使用量子图灵机的对称化版本。这个系统在这里被称为量子算盘,因为它与古代的计数设备(算盘)有相似之处。

英文摘要:

The canonical anticommutation relations (CAR) for fermion systems can be represented by finite-dimensional matrix algebra, but it is impossible for canonical commutation relations (CCR) for bosons. After description of more simple case with representation of CAR and (bounded) quantum computational networks via Clifford algebras in the paper are discussed CCR. For representation of the algebra it is not enough to use quantum networks with fixed number of qubits and it is more convenient to consider Turing machine with essential operation of appending new cells for description of infinite tape in finite terms --- it has straightforward generalization for quantum case, but for CCR it is necessary to work with symmetrized version of the quantum Turing machine. The system is called here quantum abacus due to understanding analogy with the ancient counting devices (abacus).

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

↑