Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physico-mathematical modelling and informational technologies

Improvement of the deterministic preparation of Dicke states

Andrii Fesenko

Published Jul 1, 2023• 0 citations
Publisher
DOI
10.15407/fmmit2023.37.138

Related papers

Deterministic Preparation of Dicke States

Andreas Bärtschi, Stephan Eidenbenz

arXiv:1904.07358•Lecture notes in computer science•Jan 1, 2019•153 citations

Robust preparation of Dicke-states by multi-ion STIRAP

I. E. Linington, Nikolay V. Vitanov

Bulletin of the American Physical Society•May 29, 2008•0 citations

Depth-Efficient Quantum Circuit Synthesis for Deterministic Dicke State Preparation

Pei Yuan, Shengyu Zhang

The $n$-qubit $k$-weight Dicke states $|D^n_k\rangle$, defined as the uniform superposition of all computational basis states with exactly $k$ qubits in state $|1\rangle$, form a basis of the symmetric subspace and represent an important class of entangled quantum states with broad applications in quantum computing. We propose deterministic quantum circuits for Dicke state preparation under two commonly seen qubit connectivity constraints: 1. All-to-all qubit connectivity: our circuit has depth $O(\log(k)\log(n/k)+k)$, which improves the previous best bound of $O(k\log(n/k))$. 2. Grid qubit connectivity ($(n_1\times n_2)$-grid, $n_1\le n_2$): (a) For $k\ge n_2/n_1$, we design a circuit with depth $O(k\log(n/k)+n_2)$, surpassing the prior $O(\sqrt{nk})$ bound. (b) For $k< n_2/n_1$, we design an optimal-depth circuit with depth $O(n_2)$. Furthermore, we establish the depth lower bounds of $Ω(\log(n))$ for all-to-all qubit connectivity and $Ω(n_2)$ for $(n_1\times n_2)$-grid connectivity constraints, demonstrating the near-optimality of our constructions.

arXiv:2505.15413•May 21, 2025•16 citations

Deterministic preparation of entangled Dicke states

Hui Wang, Marlan O. Scully, Girish S. Agarwal

Dicke states $|J=N/2,m\rangle$ of a collection of $N$ atoms were central to Dicke's theory of superradiance. Except for the fully polarized end states, they are entangled many-body states; in particular, the single-excitation Dicke state is the W state well known in quantum information science. However, deterministic preparation of Dicke states with a prescribed spin projection remains challenging, especially without relying on postselection or heralding. Here we present a detuning-programmed Hamiltonian protocol using atoms or qubits in a dispersive cavity subject to a coherent transverse drive. In the absence of the drive, the off-resonant cavity produces an effective collective-spin interaction. By combining this cavity-mediated interaction with the coherent drive, tuning the atom--drive detuning enables the protocol, in principle, to target any allowed Dicke state along the symmetric Dicke ladder. Starting from the transverse-drive ground state, adiabatic ground-state interpolation prepares the selected Dicke state by ramping down the drive strength while ramping up the cavity-mediated interaction. After preparation, tuning the cavity into resonance with the atoms or qubits provides a direct way to probe the collective-emission response of the prepared Dicke state. We discuss implementation with superconducting circuit QED and show that the prepared states, especially the central Dicke state with $m=0$, provide resources for quantum sensing with Heisenberg-limited scaling.

quant-pharXiv:2608.22168•Aug 25, 2026•2 citations

Short-Depth Circuits for Dicke State Preparation

Andreas Bärtschi, Stephan Eidenbenz

We present short-depth quantum circuits to deterministically prepare any Dicke state $\left| {D_k^n} \right\rangle $, which is the equal-amplitude superposition of all n-qubit computational basis states with Hamming Weight k. Dicke states are an important class of entangled quantum states with a large variety of applications, and a long history of experimental creation in physical systems. On the other hand, not much is known regarding efficient scalable quantum circuits for Dicke state preparation on realistic quantum computing hardware connectivities.Concretely, we present preparation circuits for Dicke states $\left| {D_k^n} \right\rangle $ with (i) depth of $\mathcal{O}\left( {k\log \frac{n}{k}} \right)$ for all-to-all connectivity (such as on current ion trap devices); (ii) depth of $\mathcal{O}\left( {k\surd \frac{n}{k}} \right) = \mathcal{O}(\sqrt {nk} )$ for Grid connectivity on grids of size $\Omega \left( {\surd \frac{n}{s}} \right) \times \mathcal{O}(\sqrt {ns} )$ with s ≤ k (such as on most current superconducting qubit devices).Both approaches have a total gate count of $\mathcal{O}(kn)$, need no ancilla qubits, and generalize to preparation and compression of those symmetric pure states, in which all non-zero amplitudes correspond to states with Hamming weight at most k. Our work significantly improves and expands previous state-of-the art circuits which had depth $\mathcal{O}(n)$ on a Linear Nearest Neighbor connectivity for arbitrary k (FCT 2019 [4]) and depth $\mathcal{O}(\log n)$ on all-to-all connectivity for k = 1 (AQT 2019 [9]).

arXiv:2207.09998•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•62 citations

Deterministic Preparation of Arbitrary Spin Eigenfunctions

Wenxuan Tao, Jianan Wang, Fen Zuo

Quantum states with conserved total spins, or spin eigenfunctions, are important for studying quantum chemistry and quantum manybody physics problems. A typical class of spin eigenfunctions are Dicke states, which attain maximal spins. While we already have many efficient quantum algorithms to prepare Dicke states, it is not yet clear if we could do so for arbitrary spin eigenfunctions deterministically. Generalizing Bärtschi and Eidenbenz's elegant algorithms for Dicke state preparation, we successfully prepare arbitrary spin eigenfunctions characterized by branching paths and binary spin trees. As a byproduct, we also develop the corresponding classical algorithms to reconstruct all these spin states.

quant-pharXiv:2608.22892•Aug 25, 2026•0 citations
The nnn-qubit kkk-weight Dicke states ∣Dkn⟩|D^n_k\rangle∣Dkn​⟩, defined as the uniform superposition of all computational basis states with exactly kkk qubits in state ∣1⟩|1\rangle∣1⟩, form a basis of the symmetric subspace and represent an important class of entangled quantum states with broad applications in quantum computing. We propose deterministic quantum circuits for Dicke state preparation under two commonly seen qubit connectivity constraints: 1. All-to-all qubit connectivity: our circuit has depth O(log⁡(k)log⁡(n/k)+k)O(\log(k)\log(n/k)+k)O(log(k)log(n/k)+k), which improves the previous best bound of O(klog⁡(n/k))O(k\log(n/k))O(klog(n/k)). 2. Grid qubit connectivity ((n1×n2)(n_1\times n_2)(n1​×n2​)-grid, n1≤n2n_1\le n_2n1​≤n2​): (a) For k≥n2/n1k\ge n_2/n_1k≥n2​/n1​, we design a circuit with depth O(klog⁡(n/k)+n2)O(k\log(n/k)+n_2)O(klog(n/k)+n2​), surpassing the prior O(nk)O(\sqrt{nk})O(nk​) bound. (b) For k<n2/n1k< n_2/n_1k<n2​/n1​, we design an optimal-depth circuit with depth O(n2)O(n_2)O(n2​). Furthermore, we establish the depth lower bounds of Ω(log⁡(n))Ω(\log(n))Ω(log(n)) for all-to-all qubit connectivity and Ω(n2)Ω(n_2)Ω(n2​) for (n1×n2)(n_1\times n_2)(n1​×n2​)-grid connectivity constraints, demonstrating the near-optimality of our constructions.
Dicke states ∣J=N/2,m⟩|J=N/2,m\rangle∣J=N/2,m⟩ of a collection of NNN atoms were central to Dicke's theory of superradiance. Except for the fully polarized end states, they are entangled many-body states; in particular, the single-excitation Dicke state is the W state well known in quantum information science. However, deterministic preparation of Dicke states with a prescribed spin projection remains challenging, especially without relying on postselection or heralding. Here we present a detuning-programmed Hamiltonian protocol using atoms or qubits in a dispersive cavity subject to a coherent transverse drive. In the absence of the drive, the off-resonant cavity produces an effective collective-spin interaction. By combining this cavity-mediated interaction with the coherent drive, tuning the atom--drive detuning enables the protocol, in principle, to target any allowed Dicke state along the symmetric Dicke ladder. Starting from the transverse-drive ground state, adiabatic ground-state interpolation prepares the selected Dicke state by ramping down the drive strength while ramping up the cavity-mediated interaction. After preparation, tuning the cavity into resonance with the atoms or qubits provides a direct way to probe the collective-emission response of the prepared Dicke state. We discuss implementation with superconducting circuit QED and show that the prepared states, especially the central Dicke state with m=0m=0m=0, provide resources for quantum sensing with Heisenberg-limited scaling.
We present short-depth quantum circuits to deterministically prepare any Dicke state $\left| {D_k^n} \right\rangle $, which is the equal-amplitude superposition of all n-qubit computational basis states with Hamming Weight k. Dicke states are an important class of entangled quantum states with a large variety of applications, and a long history of experimental creation in physical systems. On the other hand, not much is known regarding efficient scalable quantum circuits for Dicke state preparation on realistic quantum computing hardware connectivities.Concretely, we present preparation circuits for Dicke states $\left| {D_k^n} \right\rangle $ with (i) depth of O(klog⁡nk)\mathcal{O}\left( {k\log \frac{n}{k}} \right)O(klogkn​) for all-to-all connectivity (such as on current ion trap devices); (ii) depth of O(k√nk)=O(nk)\mathcal{O}\left( {k\surd \frac{n}{k}} \right) = \mathcal{O}(\sqrt {nk} )O(k√kn​)=O(nk​) for Grid connectivity on grids of size Ω(√ns)×O(ns)\Omega \left( {\surd \frac{n}{s}} \right) \times \mathcal{O}(\sqrt {ns} )Ω(√sn​)×O(ns​) with s ≤ k (such as on most current superconducting qubit devices).Both approaches have a total gate count of O(kn)\mathcal{O}(kn)O(kn), need no ancilla qubits, and generalize to preparation and compression of those symmetric pure states, in which all non-zero amplitudes correspond to states with Hamming weight at most k. Our work significantly improves and expands previous state-of-the art circuits which had depth O(n)\mathcal{O}(n)O(n) on a Linear Nearest Neighbor connectivity for arbitrary k (FCT 2019 [4]) and depth O(log⁡n)\mathcal{O}(\log n)O(logn) on all-to-all connectivity for k = 1 (AQT 2019 [9]).
Quantum states with conserved total spins, or spin eigenfunctions, are important for studying quantum chemistry and quantum manybody physics problems. A typical class of spin eigenfunctions are Dicke states, which attain maximal spins. While we already have many efficient quantum algorithms to prepare Dicke states, it is not yet clear if we could do so for arbitrary spin eigenfunctions deterministically. Generalizing Bärtschi and Eidenbenz's elegant algorithms for Dicke state preparation, we successfully prepare arbitrary spin eigenfunctions characterized by branching paths and binary spin trees. As a byproduct, we also develop the corresponding classical algorithms to reconstruct all these spin states.