We consider a class of spin networks where each spin in a certain set interacts, via Ising coupling, with a set of central spins, and the control acts simultaneously on all the spins. This is a common situation for instance in NV centers in diamonds, and we focus on the physical case of up to two central spins. Due to the permutation symmetries of the network, the system is not globally controllable but it displays invariant subspaces of the underlying Hilbert space. The system is said to be subspace controllable if it is controllable on each of these subspaces. We characterize the given invariant subspaces and the dynamical Lie algebra of this class of systems and prove subspace controllability in every case.
We consider a class of spin networks where each spin in a certain set interacts via Ising coupling with a single central spin. This is a common situation for instance in NV centers in diamonds. Due to the permutation symmetries of the network, the system is not globally controllable but it displays invariant subspaces of the underlying Hilbert space. The system is said to be subspace controllable if it is controllable on each of these subspaces. We characterize the given invariant subspaces and the dynamical Lie algebra of this class of systems and prove subspace controllability.
The unitary group acting on the Hilbert space
H:=(C2)⊗3 of three quantum bits admits a Lie subgroup,
US3(8), of elements which permute with the symmetric group of permutations of three objects. Under the action of such a Lie subgroup, the Hilbert space
H splits into three invariant subspaces of dimensions
4,
2 and
2 respectively, each corresponding to an irreducible representation of
su(2). The subspace of dimension
4 is uniquely determined and corresponds to states that are themselves invariant under the action of the symmetric group. This is the so called {\it symmetric sector.} The subspaces of dimension two are not uniquely determined and we parametrize them all. We provide an analysis of pure states that are in the subspaces invariant under
US3(8). This concerns their entanglement properties, separability criteria and dynamics under the Lie subgroup
US3(8). As a physical motivation for the states and dynamics we study, we propose a physical set-up which consists of a symmetric network of three spin
21 particles under a common driving electro-magnetic field. {For such system, we solve the control theoretic problem of driving a separable state to a state with maximal distributed entanglement.
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
Sn. Because of the symmetry, the underlying Hilbert space,
H=(Cd)⊗n, splits into invariant subspaces for the Lie algebra of
Sn-invariant elements in
u(dn), denoted here by
uSn(dn). The dynamical Lie algebra
L, which determines the controllability properties of the system, is a Lie subalgebra of such a Lie algebra
uSn(dn). If
L acts as
su(dim(V)) 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
H coincides with the {\it Clebsch-Gordan} splitting of
(Cd)⊗n into {\it irreducible representations} of
su(d). In this view,
uSn(dn), is the direct sum of certain
su(nj) for some
nj'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}.
In this paper, we present a controllability analysis of the quantum Ising periodic chain of n spin 1/2 particles where the interpolating parameter between the two Hamiltonians plays the role of the control. A fundamental result in the control theory of quantum systems states that the set of achievable evolutions is (dense in) the Lie group corresponding to the Lie algebra generated by the Hamiltonians of the system. Such a dynamical Lie algebra therefore characterizes all the state transitions available for a given system. For the Ising spin periodic chain we characterize such a dynamical Lie algebra and therefore the set of all reachable states. In particular, we prove that the dynamical Lie algebra is a (3n-1)-dimensional Lie sub-algebra of su(2^n) which is a direct sum of a two dimensional center and a (3n-3)-dimensional semisimple Lie subalgebra. This in turn is the direct sum of n-1 Lie algebras isomorphic to su(2) parametrized by the eigenvalues of a fixed matrix. We display the basis for each of these Lie subalgebras. Therefore the problem of control for the Ising spin periodic chain is, modulo the two dimensional center, a problem of simultaneous control of n-1 spin 1/2 particles. In the process of proving this result, we develop some tools which are of general interest for the controllability analysis of quantum systems with symmetry.
Entanglement, a unique quantum resource with no classical counterpart, remains at the heart of quantum information. The Greenberger-Horne-Zeilinger (GHZ) and
W states are two inequivalent classes of multipartite entangled states which cannot be transformed into each other by means of local operations and classic communication. In this paper, we present the methods to prepare the GHZ and
W states via global controls on a long-range Ising spin model. For the GHZ state, general solutions are analytically obtained for an arbitrary-size spin system, while for the
W state, we find a standard way to prepare the
W state that is analytically illustrated in three- and four-spin systems and numerically demonstrated for larger-size systems. The number of parameters required in the numerical search increases only linearly with the size of the system.