Quantum Computers, Discrete Space, and Entanglement
| dc.creator | Pavicic, Mladen | |
| dc.date | 2002-06-30 | |
| dc.date.accessioned | 2026-07-07T06:04:31Z | |
| dc.date.available | 2026-07-07T06:04:31Z | |
| dc.description | We consider algebras underlying Hilbert spaces used by quantum information algorithms. We show how one can arrive at equations on such algebras which define n-dimensional Hilbert space subspaces which in turn can simulate quantum systems on a quantum system. In doing so we use MMP diagrams and linear algorithms. MMP diagrams are tractable since an n-block of an MMP diagram has n elements while an n-block of a standard lattice diagram has 2^n elements. An immediate test for such an approach is a generation of minimal and arbitrary Kochen-Specker vectors and we present a minimal state-independent Kochen-Specker set of seven vectors from a Hilbert space with more than four dimensions. | |
| dc.description | 6 pages, RevTeX, Author's http://m3k.grad.hr/pavicic | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0207003 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0207003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90323 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum Computers, Discrete Space, and Entanglement | |
| dc.type | text |