Papers
Topics
Authors
Recent
Search
2000 character limit reached

Subspace Controllability and Clebsch-Gordan Decomposition of Symmetric Quantum Networks

Published 24 Jul 2023 in quant-ph | (2307.12908v1)

Abstract: We describe a framework for the controllability analysis of networks of $n$ quantum systems of an arbitrary dimension $d$, {\it qudits}, with dynamics determined by Hamiltonians that are invariant under the permutation group $S_n$. Because of the symmetry, the underlying Hilbert space, ${\cal H}=(\mathbb{C}d){\otimes n}$, splits into invariant subspaces for the Lie algebra of $S_n$-invariant elements in $u(dn)$, denoted here by $u{S_n}(dn)$. The dynamical Lie algebra ${\cal L}$, which determines the controllability properties of the system, is a Lie subalgebra of such a Lie algebra $u{S_n}(dn)$. If ${\cal L}$ acts as $su\left( \dim(V) \right)$ on each of the invariant subspaces $V$, the system is called {\it subspace controllable}. Our approach is based on recognizing that such a splitting of the Hilbert space ${\cal H}$ coincides with the {\it Clebsch-Gordan} splitting of $(\mathbb{C}d){\otimes n}$ into {\it irreducible representations} of $su(d)$. In this view, $u{S_n}(dn)$, is the direct sum of certain $su(n_j)$ for some $n_j$'s we shall specify, and its {\it center} which is the Abelian (Lie) algebra generated by the {\it Casimir operators}. Generalizing the situation previously considered in the literature, we consider dynamics with arbitrary local simultaneous control on the qudits and a symmetric two body interaction. Most of the results presented are for general $n$ and $d$ but we recast previous results on $n$ qubits in this new general framework and provide a complete treatment and proof of subspace controllability for the new case of $n=3$, $d=3$, that is, {\it three qutrits}.

Authors (1)
Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.