A route to quantum computing through the theory of quantum graphs
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Based on our previous works, and in order to relate them with the theory of quantum graphs and the quantum computing principles, we once again try to introduce some newly developed technical structures just by relying on our toy example, the coordinate ring of $n\times n$ quantum matrix algebra $M_q(n)$, and the associated directed locally finite graphs $\mathcal{G}(\Pi_n)$, and the Cuntz-Krieger $C^*$-graph algebras. Meaningly, we introduce a $(4i-6)$-qubit quantum system by using the Cuntz-Krieger $\mathcal{G}(\Pi_i)$-families associated to the $4i-6$ distinct Hamiltonian paths of $\mathcal{G}(\Pi_i)$, for $i\in\{2,\cdots,n\}$. We also will present a proof of a claim raised in our previous paper concerning the graph $C^*$-algebra structure and the associated Cuntz-Krieger $\mathcal{G}(\Pi_n)$-families.