Quantum [Formula: see text]-qubit states that are totally symmetric under the permutation of qubits are essential ingredients of important algorithms and applications in quantum information. Consequently, there is significant interest in developing methods to prepare and manipulate Dicke states, which form a basis for the subspace of fully symmetric states. Two simple protocols for transforming Dicke states are considered. An algebraic characterization of the operations that these protocols induce is obtained in terms of the Weyl algebra [Formula: see text] and [Formula: see text]. Fixed points under the application of the combination of both protocols are explicitly determined. Connections with the binary Hamming scheme, the Hadamard transform and Krawtchouk polynomials are highlighted.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.
Quantum [Formula: see text]-qubit states that are totally symmetric under the permutation of qubits are essential ingredients of important algorithms and applications in quantum information. Consequently, there is significant interest in developing methods to prepare and manipulate Dicke states, which form a basis for the subspace of fully symmetric states. Two simple protocols for transforming Dicke states are considered. An algebraic characterization of the operations that these protocols induce is obtained in terms of the Weyl algebra [Formula: see text] and [Formula: see text]. Fixed points under the application of the combination of both protocols are explicitly determined. Connections with the binary Hamming scheme, the Hadamard transform and Krawtchouk polynomials are highlighted.This article is part of the theme issue 'Numerical analysis, spectral graph theory, orthogonal polynomials and quantum algorithms'.
In this paper, we study efficient algorithms towards the construction of any arbitrary Dicke state. Our contribution is to use proper symmetric Boolean functions that involve manipulations with Krawtchouk polynomials. Deutsch-Jozsa algorithm, Grover algorithm and the parity measurement technique are stitched together to devise the complete algorithm. Further, motivated by the work of Childs et al (2002), we explore how one can plug the biased Hadamard transformation in our strategy. Our work compares fairly with the results of Childs et al (2002).
Abstract The symmetric subspace of multi-qubit systems, that is, the space of states invariant under permutations, is commonly encountered in applications in the context of quantum information and communication theory. It is known that the symmetric subspace can be described in terms of irreducible representations of the group SU(2), whose representation spaces form a basis of symmetric states, the so-called Dicke states. In this work, we present deformations of the symmetric subspace as deformations of this group structure, which are promoted to a quantum group U q ( su ( 2 ) ) . We see that deformations of the symmetric subspace obtained in this manner correspond to local deformations of the inner product of each spin, in such a way that departure from symmetry can be encoded in a position-dependent inner product. The consequences and possible extensions of these results are also discussed.
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 ∣DaN⟩ (a=1,2,…,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 ∣WN⟩ 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 O(N2.08) for W states and O(N1.78) for a=2 Dicke states.
Efficient preparation of Dicke states and, more generally, permutation-symmetric states is important for quantum metrology, quantum networking, and collective quantum information processing. Measurements and classical feedforward enable low-depth preparations of these states, with a cost of ancillary qubits. In this work, we introduce an exact constant-depth adaptive preparation protocol for arbitrary Dicke-(n,k) states and further symmetric states. We first provide a protocol preparing the uniform subset superposition state, as a primitive, using constant-depth adaptive circuit with O(k2log2n) ancillary qubits and success probability at least 1/k. This yields an exact, probabilistic, constant-depth Dicke-state preparation protocol using O(n2+k2log2n+knlognloglogn) ancillary qubits. Parallel repetition suppresses the failure probability exponentially without increasing the quantum depth. Moreover, the uniform subset superposition state is also of independent interest as the uniform vertex state of the Johnson graph and as the compact uniform subset state appearing in quantum-walk and topological-data-analysis algorithms. We further establish a general lifting framework that coherently combines clean unitary Dicke-state preparation circuits to prepare arbitrary symmetric states with only polynomial ancillary overhead. Combined with recent constant-depth unitary Dicke-state constructions, this gives an exact constant-depth preparation protocol for arbitrary n-qubit symmetric states using O(n3logn) ancillary qubits.
Abstract. This paper describes a framework for the controllability analysis of networks of [Formula: see text] quantum systems of an arbitrary dimension [Formula: see text] , qudits, with dynamics determined by Hamiltonians that are invariant under the permutation group [Formula: see text]. Because of the symmetry, the underlying Hilbert space, [Formula: see text], splits into invariant subspaces for the Lie algebra of [Formula: see text]-invariant elements in [Formula: see text], denoted here by [Formula: see text]. The dynamical Lie algebra [Formula: see text], which determines the controllability properties of the system, is a Lie subalgebra of such a Lie algebra [Formula: see text]. If [Formula: see text] acts as [Formula: see text] on each of the invariant subspaces [Formula: see text], the system is called subspace controllable. The described approach is based on recognizing that such a splitting of the Hilbert space [Formula: see text] coincides with the Clebsch–Gordan splitting of [Formula: see text] into irreducible representations of [Formula: see text]. In this view, [Formula: see text] is the direct sum of certain [Formula: see text] for some [Formula: see text]’s we shall specify and its center, which is the Abelian (Lie) algebra generated by the Casimir operators. Most of the results presented are for general [Formula: see text] and [Formula: see text], but the paper provides a complete treatment and proof of subspace controllability for the new case of a system with [Formula: see text], [Formula: see text], that is, three qutrits. The results are motivated by recent great interest in symmetric quantum states and systems (see, e.g., [K. Eckert et al., Ann. Phys., 299 (2001), pp. 88–127], [A. W. Harrow, “The Church of the Symmetric Subspace,” https://arxiv.org/abs/1308.6595 , 2013], [P. Migdal, J. Rodriguez-Laguna, and M. Lewenstein, Phys. Rev. A, 88 (2013), 021335]) both at the theoretical and experimental levels and by recent proposals in geometric quantum machine learning [M. Cerezo et al., Nature Comput. Sci., 2 (2022), pp. 567–576], [Q. T. Nguyen et al., PRX Quant., 5 (2024), 020328] to exploit symmetries in the data and in quantum circuits to improve the performance of learning protocols.