Table of Contents

Dicke State

Dicke state is a symmetric superposition of all $n$-qubit computational basis states with exactly $k$ qubits in the $|1\rangle$ state. Dicke states generalize W states (the special case $k=1$) and are resources for quantum metrology and quantum error correction.

Definition

For $n$ qubits, the Dicke state $D_n^{(k)}$ is:

$$D_n^{(k)} = \frac{1}{\sqrt{\binom{n}{k}}} \sum_{\text{all states with } k \text{ ones}} |x_1 x_2 \cdots x_n\rangle$$

The normalization factor is the binomial coefficient $\binom{n}{k}$, ensuring the state is normalized.

Examples

Properties

Measurement

Measuring a Dicke state in the computational basis yields one of the $\binom{n}{k}$ basis states with equal probability $1/\binom{n}{k}$. The outcome is a fixed Hamming weight, a key distinction from arbitrary superpositions.

Applications

Relation to Other States

Generation

Create $D_n^{(k)}$ via:

  1. Prepare all qubits in $|0\rangle$
  2. Apply Hadamards to $k$ designated qubits to create equal superposition
  3. Apply controlled-X gates to enforce the symmetric superposition and fixed Hamming weight

Efficient preparation requires $O(n \log n)$ gates; for arbitrary $k$ in fixed-size systems, direct state preparation is often easier than gate synthesis.

Scalability

As $n$ grows, Dicke states with $k \approx n/2$ become increasingly entangled and resource-intensive to prepare. Classical simulation of Dicke states with $k$ far from 0 or $n$ requires exponential resources.