engleski

Quantum Computers, Discrete Space, and Entanglement

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 Greechie 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.

Quantum computer algebra; MMP diagrams; Hilbert lattices; Kochen-Specker theorem; Hilbert space

nije evidentirano