Quantum Computers, Discrete Space, and Entanglement
Mladen Pavicic
Abstract
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.
Create a lesson
Related papers
An entangling Hubbard quasiparticle collider on a digital quantum processor
Chan Bin Bark, Hanbyul Kim, Yoonil Koo et al.
A Warped Born Rule Turns an Observer into a Maxwell's Demon
Olumakinde Ogunnaike
A scalable sample-based quantum diagonalization solver for general Pauli-sum Hamiltonians
Yutaro Iiyama
Quantum Query Complexity of Maximum Degree and its Generalizations
Amin Shiraz Gilani, Nikhil S. Mande, Subhasree Patro et al.
Maximally antiflat fixed-particle-number fermionic states
Rahul Gupta, Arya Haghighian, James D. Whitfield
An Annealing-based Quantum Neural Network with Discrete Wavelet Transforms for Enhanced Air Pollution Nowcasting
Otto Menegasso Pires, André Saimon, Daniela Herrmann et al.