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

Preparation and Compression of Symmetric Pure Quantum States

Andreas Bärtschi

Published Feb 19, 2024• 0 citations
OpenAlex

Abstract

Symmetric under permutation of the qubits.All terms with the same Hamming Weight must have the same amplitude: ⇒ Dicke States |D n k are equal superpositions of all HW-k strings.⇒ They form an orthonormal basis for symmetric pure states.Efficient in terms of Circuit Model: Deterministic Scheme, Linear Nearest Neighbor architecture.Small total number of Gates: O(n 2 ) many.Shallow Depth: O(n) steps.

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

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

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

Entangled symmetric states of N qubits with positive partial transpositions

Remigiusz Augusiak, Jordi Tura, Jan Samsonowicz +1 more

•Jun 14, 2012•0 citations

A Divide-and-Conquer Approach to Dicke State Preparation

Shamminuj Aktar, Andreas Bärtschi, Abdel‐Hameed A. Badawy +1 more

We present a divide-and-conquer approach to deterministically prepare Dicke states |Dkn> (i.e. equal-weight superpositions of all n-qubit states with Hamming Weight k) on quantum computers. In an experimental evaluation for up to n=6 qubits on IBM Quantum Sydney and Montreal devices, we achieve significantly higher state fidelity compared to previous results [Mukherjee et.al. TQE'2020, Cruz et.al. QuTe'2019]. The fidelity gains are achieved through several techniques: Our circuits first divide the Hamming weight between blocks of n/2 qubits, and then conquer those blocks with improved versions of Dicke state unitaries [Brtschi et.al. FCT'2019]. Due to the sparse connectivity on IBM's heavy-hex-architectures, these circuits are implemented for linear nearest neighbor topologies. Further gains in (estimating) the state fidelity are due to our use of measurement error mitigation and hardware progress.

arXiv:2112.12435•IEEE Transactions on Quantum Engineering•Jan 1, 2022•49 citations

Exact quantum Hamming-weight computation at optimal depth and minimum width

Wei Zi, Pei Yuan, Junhong Nie

Hamming-weight computation and symmetric Boolean functions are basic primitives for quantum arithmetic and state preparation, where circuit depth and qubit overhead matter. We construct an exact circuit computing the Hamming weight of an $n$-qubit register with depth $O(\log n)$ and size $O(n\log n)$, using only the $n$ input qubits and $m=\lceil\log_2(n+1)\rceil$ binary output qubits. The circuit uses arbitrary one-qubit gates and CNOTs with all-to-all connectivity. Both depth and total width are optimal. Our constructions combine tree structures and pipelining, temporarily using input qubits as workspace. We also give exact circuits for every symmetric Boolean function with the same depth and size bounds, using only $m$ ancillary qubits returned to zero. Finally, we apply the counter to exact preparation of balanced Dicke states for even $n$. With only $O(\log n)$ ancillary qubits, we obtain expected depth $O(\log^2 n)$ using measurements and classical feedforward, and depth $O(n^{1/4}\log n)$ using unitary gates alone.

quant-pharXiv:2610.25315•Oct 20, 2026•0 citations
Symmetric under permutation of the qubits.All terms with the same Hamming Weight must have the same amplitude: ⇒ Dicke States |D n k are equal superpositions of all HW-k strings.⇒ They form an orthonormal basis for symmetric pure states.Efficient in terms of Circuit Model: Deterministic Scheme, Linear Nearest Neighbor architecture.Small total number of Gates: O(n 2 ) many.Shallow Depth: O(n) steps.
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]).
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 present a divide-and-conquer approach to deterministically prepare Dicke states |Dkn> (i.e. equal-weight superpositions of all n-qubit states with Hamming Weight k) on quantum computers. In an experimental evaluation for up to n=6 qubits on IBM Quantum Sydney and Montreal devices, we achieve significantly higher state fidelity compared to previous results [Mukherjee et.al. TQE'2020, Cruz et.al. QuTe'2019]. The fidelity gains are achieved through several techniques: Our circuits first divide the Hamming weight between blocks of n/2 qubits, and then conquer those blocks with improved versions of Dicke state unitaries [Brtschi et.al. FCT'2019]. Due to the sparse connectivity on IBM's heavy-hex-architectures, these circuits are implemented for linear nearest neighbor topologies. Further gains in (estimating) the state fidelity are due to our use of measurement error mitigation and hardware progress.
Hamming-weight computation and symmetric Boolean functions are basic primitives for quantum arithmetic and state preparation, where circuit depth and qubit overhead matter. We construct an exact circuit computing the Hamming weight of an nnn-qubit register with depth O(log⁡n)O(\log n)O(logn) and size O(nlog⁡n)O(n\log n)O(nlogn), using only the nnn input qubits and m=⌈log⁡2(n+1)⌉m=\lceil\log_2(n+1)\rceilm=⌈log2​(n+1)⌉ binary output qubits. The circuit uses arbitrary one-qubit gates and CNOTs with all-to-all connectivity. Both depth and total width are optimal. Our constructions combine tree structures and pipelining, temporarily using input qubits as workspace. We also give exact circuits for every symmetric Boolean function with the same depth and size bounds, using only mmm ancillary qubits returned to zero. Finally, we apply the counter to exact preparation of balanced Dicke states for even nnn. With only O(log⁡n)O(\log n)O(logn) ancillary qubits, we obtain expected depth O(log⁡2n)O(\log^2 n)O(log2n) using measurements and classical feedforward, and depth O(n1/4log⁡n)O(n^{1/4}\log n)O(n1/4logn) using unitary gates alone.