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:2608.30176

Data and code for collision-model Dicke-state preparation: depth-fidelity frontiers, circuit costs, and superconducting-processor measurements

Duc-Kha Vu, Minh Tam Nguyen, Şahin K. Özdemir, Özgür E. Müstecaplıoğlu, Fatih Ozaydin

quant-phSubmitted Aug 31, 2026• Announced Sep 1, 2026• 0 citations
arXivHTMLPDF

Abstract

Dicke states are multipartite entangled states in which a fixed number of quantum excitations is coherently shared among many qubits. Originally introduced in the context of cooperative emission and superradiance, they are now important resources for quantum sensing, networking, and collective quantum phenomena. Preparing prescribed Dicke states with high fidelity, however, remains challenging, particularly as the system size and excitation number increase. Here we present an open dataset and accompanying code for preparing Dicke states using a collision-based quantum protocol. The dataset covers systems from five to fourteen qubits over a broad range of excitation numbers and records how the best-found noiseless preparation fidelity changes with circuit depth. It also provides circuit-resource estimates and experimental measurements for selected states on the 54-qubit IQM Emerald superconducting processor. The accompanying code reproduces the processed data and validation checks, providing a reusable benchmark for studying the trade-off between state-preparation fidelity, circuit cost, and hardware noise.

Comments
15 pages, 5 figures

Related papers

Constant-depth adaptive preparation of Dicke and symmetric states

Rui Luo, Junjie Chen, Xiongfeng Ma

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(k^2\log^2 n)$ ancillary qubits and success probability at least $1/k$. This yields an exact, probabilistic, constant-depth Dicke-state preparation protocol using $O\left(n^2+k^2\log^2 n+kn\log n\log\log n\right)$ 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(n^3\sqrt{\log n})$ ancillary qubits.

quant-pharXiv:2608.01144•Aug 4, 2026•0 citations

Scalable Experimental Bounds for Entangled Quantum State Fidelities

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

Estimating the state preparation fidelity of highly entangled states on noisy intermediate-scale quantum (NISQ) devices is important for benchmarking and application considerations. Unfortunately, exact fidelity measurements quickly become prohibitively expensive, as they scale exponentially as O (3 N for N -qubit states, using full state tomography with measurements in all Pauli bases combinations. However, Somma et al.established that the complexity could be drastically reduced when looking at fidelity lower bounds for states that exhibit symmetries, such as Dicke states and GHZ states. These bounds must still be tight enough for larger states to provide reasonable estimations on NISQ devices. For the first time and more than 15 years after the theoretical introduction, we report meaningful lower bounds for the state preparation fidelity of all Dicke states up to N =10 and all GHZ states up to N =20 on Quantinuum H1 ion-trap systems using efficient implementations of recently proposed scalable circuits for these states. Our achieved lower bounds match or exceed previously reported exact fidelities on superconducting systems for much smaller states. Furthermore, we provide evidence that for large Dicke states \(\left|\smash{D_{N/2}^{N}} \right\rangle\) , we may resort to a GHZ-based approximate state preparation to achieve better fidelity. This work provides a path forward to benchmarking entanglement as NISQ devices improve in size and quality.

arXiv:2210.03048•ACM Transactions on Quantum Computing•Nov 11, 2024•1 citation

Scalable Multi-QPU Circuit Design for Dicke State Preparation: Optimizing Communication Complexity and Local Circuit Costs

Ziheng Chen, Junhong Nie, Xiaoming Sun +2 more

Preparing large-qubit Dicke states is of broad interest in quantum computing and quantum metrology. However, the number of qubits available on a single quantum processing unit (QPU) is limited -- motivating the distributed preparation of such states across multiple QPUs as a practical approach to scalability. In this article, we investigate the distributed preparation of $n$-qubit $k$-excitation Dicke states $D(n,k)$ across a general number $p$ of QPUs, presenting a distributed quantum circuit (each QPU hosting approximately $\lceil n/p \rceil$ qubits) that prepares the state with communication complexity $O(p \log k)$, circuit size $O(nk)$, and circuit depth $O\left(p^2 k + \log k \log (n/k)\right)$. To the best of our knowledge, this is the first construction to simultaneously achieve logarithmic communication complexity and polynomial circuit size and depth. We also establish a lower bound on the communication complexity of $p$-QPU distributed state preparation for a general target state. This lower bound is formulated in terms of the canonical polyadic rank (CP-rank) of a tensor associated with the target state. For the special case $p = 2$, we explicitly compute the CP-rank corresponding to the Dicke state $D(n,k)$ and derive a lower bound of $\lceil\log (k + 1)\rceil$, which shows that the communication complexity of our construction matches this fundamental limit.

quant-pharXiv:2601.20393•Jan 29, 2026•0 citations

Resilience Beyond the Light Cone: Error-Detected Primitives for Practical Dynamic Circuits

Kevin C. Smith, Bibek Pokharel, Satvik Maurya +1 more

Dynamic circuits, which augment unitary operations with mid-circuit measurements and classical feedforward, can generate long-range entanglement in constant depth, enabling low-depth primitives ranging from nontrivial state preparation to many-qubit entangling gates. Escaping the light-cone constraints of unitary circuits, however, comes at a cost: these primitives typically require a number of mid-circuit measurements that scales with system size and that, together with feedforward latency, can introduce errors that degrade the long-range entanglement they rely on. Here, we alleviate this tension by showing that many such primitives, when cast into a common framework, admit an error-detection scheme that trades infidelity for postselection overhead with no additional ancillas. Our framework thus unifies and upgrades a broad class of primitives including fan-out gates, multi-qubit Pauli rotations, the preparation of W and higher-weight Dicke states, and certain non-normal matrix product states. We also introduce a reduced-depth, error-detected implementation of the Hadamard test, extending the use cases of dynamic circuits to a key algorithmic primitive. Finally, we establish the practical utility of our scheme through experiments on a superconducting quantum processor. We demonstrate the error-detected preparation of a long-range entangled Bell pair spanning a 100-qubit chain with fidelity $F=0.59\pm0.02$, surpassing the entanglement-certification threshold $F>0.5$ that the baseline dynamic-circuit implementation fails to reach ($0.39\pm0.01$). Separately, we demonstrate constant-depth preparation of W states of up to 20 qubits by consuming GHZ states of up to 40 qubits, finding absolute fidelity improvements of $ΔF\approx 0.2$ across the largest sizes studied. Altogether, these results bring low-depth dynamic-circuit primitives within practical reach on present-day hardware.

quant-pharXiv:2609.08925•Sep 9, 2026•0 citations

Quantum State Certification via Effective Parent Hamiltonians from Local Measurement Data

Guy-Philippe Nadon, Guanyi Heng, Pacôme Gasnier +8 more

The preparation and certification of quantum states is a fundamental challenge across quantum information technology. We introduce a tomography-free state certification method that lower-bounds the fidelity by estimating expectation values of engineered parent-Hamiltonian terms from local measurement data. We apply this framework to construct a parent Hamiltonian that enables certification and variational optimization across the Dicke-state family, which includes the single-excitation $W_n$ state. We experimentally validate the framework on IBM quantum hardware, certifying genuine multipartite entanglement for $W_n$ states up to six qubits and establishing positive lower bounds on the state fidelity up to thirteen qubits. For Dicke states with two- and three-excitations, we certify genuine multipartite entanglement up to seven qubits. Within this stringent certification framework, these results constitute among the largest witness-certified demonstrations of such states on a programmable quantum processor.

quant-pharXiv:2603.04499•Mar 6, 2026•0 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•0 citations
Dicke states are multipartite entangled states in which a fixed number of quantum excitations is coherently shared among many qubits. Originally introduced in the context of cooperative emission and superradiance, they are now important resources for quantum sensing, networking, and collective quantum phenomena. Preparing prescribed Dicke states with high fidelity, however, remains challenging, particularly as the system size and excitation number increase. Here we present an open dataset and accompanying code for preparing Dicke states using a collision-based quantum protocol. The dataset covers systems from five to fourteen qubits over a broad range of excitation numbers and records how the best-found noiseless preparation fidelity changes with circuit depth. It also provides circuit-resource estimates and experimental measurements for selected states on the 54-qubit IQM Emerald superconducting processor. The accompanying code reproduces the processed data and validation checks, providing a reusable benchmark for studying the trade-off between state-preparation fidelity, circuit cost, and hardware noise.
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)(n,k)(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(k2log⁡2n)O(k^2\log^2 n)O(k2log2n) ancillary qubits and success probability at least 1/k1/k1/k. This yields an exact, probabilistic, constant-depth Dicke-state preparation protocol using O(n2+k2log⁡2n+knlog⁡nlog⁡log⁡n)O\left(n^2+k^2\log^2 n+kn\log n\log\log n\right)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 nnn-qubit symmetric states using O(n3log⁡n)O(n^3\sqrt{\log n})O(n3logn​) ancillary qubits.
Estimating the state preparation fidelity of highly entangled states on noisy intermediate-scale quantum (NISQ) devices is important for benchmarking and application considerations. Unfortunately, exact fidelity measurements quickly become prohibitively expensive, as they scale exponentially as O (3 N for N -qubit states, using full state tomography with measurements in all Pauli bases combinations. However, Somma et al.established that the complexity could be drastically reduced when looking at fidelity lower bounds for states that exhibit symmetries, such as Dicke states and GHZ states. These bounds must still be tight enough for larger states to provide reasonable estimations on NISQ devices. For the first time and more than 15 years after the theoretical introduction, we report meaningful lower bounds for the state preparation fidelity of all Dicke states up to N =10 and all GHZ states up to N =20 on Quantinuum H1 ion-trap systems using efficient implementations of recently proposed scalable circuits for these states. Our achieved lower bounds match or exceed previously reported exact fidelities on superconducting systems for much smaller states. Furthermore, we provide evidence that for large Dicke states ∣DN/2N⟩\left|\smash{D_{N/2}^{N}} \right\rangle∣DN/2N​⟩ , we may resort to a GHZ-based approximate state preparation to achieve better fidelity. This work provides a path forward to benchmarking entanglement as NISQ devices improve in size and quality.
Preparing large-qubit Dicke states is of broad interest in quantum computing and quantum metrology. However, the number of qubits available on a single quantum processing unit (QPU) is limited -- motivating the distributed preparation of such states across multiple QPUs as a practical approach to scalability. In this article, we investigate the distributed preparation of nnn-qubit kkk-excitation Dicke states D(n,k)D(n,k)D(n,k) across a general number ppp of QPUs, presenting a distributed quantum circuit (each QPU hosting approximately ⌈n/p⌉\lceil n/p \rceil⌈n/p⌉ qubits) that prepares the state with communication complexity O(plog⁡k)O(p \log k)O(plogk), circuit size O(nk)O(nk)O(nk), and circuit depth O(p2k+log⁡klog⁡(n/k))O\left(p^2 k + \log k \log (n/k)\right)O(p2k+logklog(n/k)). To the best of our knowledge, this is the first construction to simultaneously achieve logarithmic communication complexity and polynomial circuit size and depth. We also establish a lower bound on the communication complexity of ppp-QPU distributed state preparation for a general target state. This lower bound is formulated in terms of the canonical polyadic rank (CP-rank) of a tensor associated with the target state. For the special case p=2p = 2p=2, we explicitly compute the CP-rank corresponding to the Dicke state D(n,k)D(n,k)D(n,k) and derive a lower bound of ⌈log⁡(k+1)⌉\lceil\log (k + 1)\rceil⌈log(k+1)⌉, which shows that the communication complexity of our construction matches this fundamental limit.
Dynamic circuits, which augment unitary operations with mid-circuit measurements and classical feedforward, can generate long-range entanglement in constant depth, enabling low-depth primitives ranging from nontrivial state preparation to many-qubit entangling gates. Escaping the light-cone constraints of unitary circuits, however, comes at a cost: these primitives typically require a number of mid-circuit measurements that scales with system size and that, together with feedforward latency, can introduce errors that degrade the long-range entanglement they rely on. Here, we alleviate this tension by showing that many such primitives, when cast into a common framework, admit an error-detection scheme that trades infidelity for postselection overhead with no additional ancillas. Our framework thus unifies and upgrades a broad class of primitives including fan-out gates, multi-qubit Pauli rotations, the preparation of W and higher-weight Dicke states, and certain non-normal matrix product states. We also introduce a reduced-depth, error-detected implementation of the Hadamard test, extending the use cases of dynamic circuits to a key algorithmic primitive. Finally, we establish the practical utility of our scheme through experiments on a superconducting quantum processor. We demonstrate the error-detected preparation of a long-range entangled Bell pair spanning a 100-qubit chain with fidelity F=0.59±0.02F=0.59\pm0.02F=0.59±0.02, surpassing the entanglement-certification threshold F>0.5F>0.5F>0.5 that the baseline dynamic-circuit implementation fails to reach (0.39±0.010.39\pm0.010.39±0.01). Separately, we demonstrate constant-depth preparation of W states of up to 20 qubits by consuming GHZ states of up to 40 qubits, finding absolute fidelity improvements of ΔF≈0.2ΔF\approx 0.2ΔF≈0.2 across the largest sizes studied. Altogether, these results bring low-depth dynamic-circuit primitives within practical reach on present-day hardware.
The preparation and certification of quantum states is a fundamental challenge across quantum information technology. We introduce a tomography-free state certification method that lower-bounds the fidelity by estimating expectation values of engineered parent-Hamiltonian terms from local measurement data. We apply this framework to construct a parent Hamiltonian that enables certification and variational optimization across the Dicke-state family, which includes the single-excitation WnW_nWn​ state. We experimentally validate the framework on IBM quantum hardware, certifying genuine multipartite entanglement for WnW_nWn​ states up to six qubits and establishing positive lower bounds on the state fidelity up to thirteen qubits. For Dicke states with two- and three-excitations, we certify genuine multipartite entanglement up to seven qubits. Within this stringent certification framework, these results constitute among the largest witness-certified demonstrations of such states on a programmable quantum processor.
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.