Maximizing the Hilbert space for a finite number of distinguishable quantum states.

Abstract

Given a particular quantum computing architecture, how might one optimize its resources to maximize its computing power? We consider quantum computers with a number of distinguishable quantum states, and entangled particles shared between those states. Hilbert-space dimensionality is linked to nonclassicality and, hence, quantum computing power. We find that qutrit-based quantum computers optimize the Hilbert-space dimensionality and so are expected to be more powerful than other qudit implementations. In going beyond qudits, we identify structures with much higher Hilbert-space dimensionalities.