2002/06/30 by Mladen Pavičić, Mladen Pavicic, Pavicic, Mladen
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0207003
6 pages, RevTeX, Author's http://m3k.grad.hr/pavicic
arxiv created 2002/06/30 · openalex publication_date 2002/06/30 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 2n 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.