Algebra, Logic and Qubits: Quantum Abacus
| dc.creator | Vlasov, Alexander Yu. | |
| dc.date | 2000-01-27 | |
| dc.date | 2000-02-15 | |
| dc.date.accessioned | 2026-07-07T05:59:34Z | |
| dc.date.available | 2026-07-07T05:59:34Z | |
| dc.description | 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). | |
| dc.description | 12 pages LaTeXe, (v2: eq.12 corrected, v3: minor changes) | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0001100 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0001100 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/88727 | |
| dc.subject | Quantum Physics | |
| dc.title | Algebra, Logic and Qubits: Quantum Abacus | |
| dc.type | text |