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

arXiv:2508.07977 · Quantum Information Processing

Expanding a 4-qubit Dicke state to a 5-qubit Dicke state with limited qubit access

Bibhuti Thapa, Oberon Moran, Duc Dung Vu, Fatih Özaydin

Published Dec 17, 2025• 2 citations
arXivHTMLPDF
DOI
10.1007/s11128-025-05021-z

Related papers

Symmetric Dicke States for Arbitrary Qubits by Adiabatic Passage

Mancang Li, Xiaoli Li, Zhang Xiaolong

Journal of Jishou University•Jul 25, 2016•0 citations

Generation of arbitrary Dicke states in remote qubits using linear optics

Andreas Maser, C. Thiel, U. Schilling +3 more

•Jan 1, 2008•0 citations

Polylogarithmic-Weight Dicke States in QAC$^0$ and Arbitrary Symmetric States in QAC$^0_f$

Lucas Gretta, Meghal Gupta, Malvika Raj Joshi

An $n$-qubit Dicke state of weight $k$, is the uniform superposition over all $n$-bit strings of Hamming weight $k$. Dicke states are central to quantum algorithms exhibiting speedups, such as Decoded Quantum Interferometry (Jordan et al., \emph{Nature}, 2025). In the NISQ era, quantum hardware is constrained by both depth and locality, motivating the question of which global operations suffice to prepare such states. QAC$^0$, the quantum analogue of AC$^0$, minimally extends local $O(1)$-depth quantum circuits by allowing arbitrary-width Toffoli (reversible AND) gates. We show that Dicke states of $\mathrm{polylog}(n)$ weight can be prepared in QAC$^0$. This gives the first QAC$^0$ construction of any super-constant-weight $n$-qubit Dicke state, since previous constructions relied on the much more powerful FANOUT$_n$ gate. In general, we show that any weight-$k$ Dicke state can be constructed using FANOUT$_{\min(k,n-k)}$ gates. Combined with recent hardness results, this yields a tight characterization: for $k \leq n/2$, a $n$-qubit weight-$k$ Dicke state can be prepared in QAC$^0$ if and only if FANOUT$_k$ $\in$ QAC$^0$. We develop a limited-fanout state-synthesis toolkit for QAC$^0$ that yields further constant-depth, poly$(n)$-ancilla constructions: 1. Every $n$-qubit symmetric state supported on Hamming weight $\leq k$ can be prepared using FANOUT$_k$ gates. 2. Every $O(\log n)$-qubit state can be prepared using quantum random-access memory (QRAM$_n$), which refers to a coherent indexing gate. QRAM$_n$ is a potentially weaker resource than FANOUT$_n$ and can be implemented in QAC$^0_f$.

quant-pharXiv:2604.15298•Apr 17, 2026•5 citations

Efficient quantum algorithms to construct arbitrary Dicke states

Kaushik Chakraborty, Byung-Soo Choi, Arpita Maitra +1 more

Quantum Information Processing•Jul 22, 2014•10 citations

Universal gates for transforming multipartite entangled Dicke states

Toshiki Kobayashi, Rikizo Ikuta, Şahin Kaya Özdemir +4 more

We determine the minimal number of qubits that it is necessary to have access to in order to transform Dicke states into other Dicke states. In general, the number of qubits in Dicke states cannot be increased via transformation gates by accessing only a single qubit, in direct contrast to other multipartite entangled states such as GHZ, W and cluster states. We construct a universal optimal gate which adds spin-up qubits or spin-down qubits to any Dicke state by minimal access. We also show the existence of a universal gate which transforms any size of Dicke state as long as it has access to at least the required number of qubits. Our results have important consequences for the generation of Dicke states in physical systems such as ion traps, all-optical setups and cavity-quantum electrodynamic settings where they can be used for a variety of quantum information processing tasks.

arXiv:1305.1130•New Journal of Physics•Feb 4, 2014•21 citations

Generation of Dicke States in Distant Matter Qubits with Linear Optics

Ch. Thiel, Joachim von Zanthier, Thierry Bastin +2 more

We propose a method for generating all symmetric Dicke states of distant particles requiring linear optics only. Thereby we grant access to genuine entanglement of any number of qubits via measurement using multifold detection techniques.

The Rochester Conferences on Coherence and Quantum Optics and the Quantum Information and Measurement meeting•Jan 1, 2007•0 citations
Polylogarithmic-Weight Dicke States in QAC0^00 and Arbitrary Symmetric States in QACf0^0_ff0​
An nnn-qubit Dicke state of weight kkk, is the uniform superposition over all nnn-bit strings of Hamming weight kkk. Dicke states are central to quantum algorithms exhibiting speedups, such as Decoded Quantum Interferometry (Jordan et al., \emph{Nature}, 2025). In the NISQ era, quantum hardware is constrained by both depth and locality, motivating the question of which global operations suffice to prepare such states. QAC0^00, the quantum analogue of AC0^00, minimally extends local O(1)O(1)O(1)-depth quantum circuits by allowing arbitrary-width Toffoli (reversible AND) gates. We show that Dicke states of polylog(n)\mathrm{polylog}(n)polylog(n) weight can be prepared in QAC0^00. This gives the first QAC0^00 construction of any super-constant-weight nnn-qubit Dicke state, since previous constructions relied on the much more powerful FANOUTn_nn​ gate. In general, we show that any weight-kkk Dicke state can be constructed using FANOUTmin⁡(k,n−k)_{\min(k,n-k)}min(k,n−k)​ gates. Combined with recent hardness results, this yields a tight characterization: for k≤n/2k \leq n/2k≤n/2, a nnn-qubit weight-kkk Dicke state can be prepared in QAC0^00 if and only if FANOUTk_kk​ ∈\in∈ QAC0^00. We develop a limited-fanout state-synthesis toolkit for QAC0^00 that yields further constant-depth, poly(n)(n)(n)-ancilla constructions: 1. Every nnn-qubit symmetric state supported on Hamming weight ≤k\leq k≤k can be prepared using FANOUTk_kk​ gates. 2. Every O(log⁡n)O(\log n)O(logn)-qubit state can be prepared using quantum random-access memory (QRAMn_nn​), which refers to a coherent indexing gate. QRAMn_nn​ is a potentially weaker resource than FANOUTn_nn​ and can be implemented in QACf0^0_ff0​.
We determine the minimal number of qubits that it is necessary to have access to in order to transform Dicke states into other Dicke states. In general, the number of qubits in Dicke states cannot be increased via transformation gates by accessing only a single qubit, in direct contrast to other multipartite entangled states such as GHZ, W and cluster states. We construct a universal optimal gate which adds spin-up qubits or spin-down qubits to any Dicke state by minimal access. We also show the existence of a universal gate which transforms any size of Dicke state as long as it has access to at least the required number of qubits. Our results have important consequences for the generation of Dicke states in physical systems such as ion traps, all-optical setups and cavity-quantum electrodynamic settings where they can be used for a variety of quantum information processing tasks.