Harnessing subspace controllability: Dynamical generation of Dicke states in Heisenberg-coupled qubit arrays with a single local control

TL;DR

This paper demonstrates a method to efficiently generate Dicke states in Heisenberg-coupled qubit arrays using subspace controllability and optimal control algorithms, achieving scalable state preparation times.

Contribution

It introduces a control scheme leveraging subspace controllability and the dCRAB algorithm for fast Dicke state generation in linear qubit arrays.

Findings

Optimal control fields enable Dicke state preparation in up to 9 qubits.

Preparation times scale polynomially with the number of qubits, approximately as N^{2.08} for W states.

The method achieves state-to-state controllability within fixed excitation subspaces.

Abstract

We explore the feasibility of realizing Dicke states in qubit arrays with always-on isotropic Heisenberg coupling between adjacent qubits, assuming a single Zeeman-type control acting in the $z$ direction on an actuator qubit. The Lie-algebraic criteria of controllability imply that such an array is not completely controllable, but satisfies the conditions for subspace controllability on any subspace with a fixed number of excitations. Therefore, a qubit array described by the model under consideration is state-to-state controllable for an arbitrary choice of initial and final states that have the same Hamming weight. This limited controllability is exploited here for the time-efficient dynamical generation of an $a$-excitation Dicke state $|D^{N}_{a}\rangle$ ($a=1,2,\ldots, N-1$) in a linear array with $N$ qubits starting from a generic Hamming-weight-$a$ product state. To dynamically generate the desired Dicke states -- including $W$ states $|W_{N}\rangle$ as their special ($a=1$) case -- in the shortest possible time with a single local $Z$ control, we employ an optimal-control scheme based on the {\em dressed Chopped RAndom Basis} (dCRAB) algorithm. We optimize the target-state fidelity over the expansion coefficients of smoothly-varying control fields in a truncated random Fourier basis; this is done by combining Nelder-Mead-type local optimizations with the multistart-based clustering algorithm that facilitates searches for global extrema. In this manner, we obtain the optimal control fields for Dicke-state preparation in arrays with up to $9$ qubits. Based on our numerical results, we find that the shortest possible state-preparation times scale as $\mathcal{O}(N^{2.08})$ for $W$ states and $\mathcal{O}(N^{1.78})$ for $a=2$ Dicke states.