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:2312.05060 · Physical Review Research

Global variational quantum circuits for arbitrary symmetric state preparation

Liam J. Bond, Matthew J. Davis, Jiří Minář, R. Gerritsma, Gavin K. Brennen, Arghavan Safavi-Naini

Published Jun 20, 2025• 16 citations
arXivHTMLPDF

Abstract

Quantum states that are symmetric under particle exchange play a crucial role in fields such as quantum metrology and quantum error correction. We use a variational circuit composed of global one-axis twisting and global rotations to efficiently prepare arbitrary symmetric states, i.e., any superposition of Dicke states. The circuit does not require local addressability or ancilla qubits and thus can be readily implemented in a variety of experimental platforms including trapped-ion quantum simulators and cavity QED systems. We provide analytic and numerical evidence that any N -qubit symmetric state can be prepared in 2 N / 3 steps. We demonstrate the utility of our protocol by preparing (i) metrologically useful N -qubit Dicke states of up to N = 300 qubits in O ( 1 ) gate steps with theoretical infidelities 1 − F < 10 − 3 , (ii) the N = 9 Ruskai codewords in P = 4 gate steps with 1 − F < 10 − 4 , and (iii) the N = 13 Gross codewords in P = 7 gate steps with 1 − F < 10 − 4 . Focusing on trapped-ion platforms, for the N = 9 Ruskai and N = 13 Gross codewords we estimate that the protocol achieves fidelities ≳ 95 % in the presence of typical experimental noise levels, thus providing a pathway to the preparation of a wide range of useful highly entangled quantum states.

DOI
10.1103/physrevresearch.7.l022072

Related papers

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

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•3 citations

Optimizing one-axis twists for variational Bayesian quantum metrology

Tyler G. Thurtell, Akimasa Miyake

Quantum metrology and sensing seek advantages in estimating an unknown parameter of some quantum state or channel, using entanglement such as spin squeezing produced by one-axis twists or other quantum resources. In particular, qubit phase estimation, or rotation sensing, appears as a ubiquitous problem with applications to electric field sensing, magnetometry, atomic clocks, and gyroscopes. By adopting the Bayesian formalism to the phase estimation problem to account for limited initial knowledge about the value of the phase, we formulate variational metrology and treat the state preparation (or encoding) and measurement (or decoding) procedures as parameterized quantum circuits. It is important to understand how effective various parametrized protocols are as well as how robust they are to the effects of complex noise such as spatially correlated noise. First, we propose a family of parametrized encoding and decoding protocols called arbitrary-axis twist ansatzes, and show that it can lead to a substantial reduction in the number of one-axis twists needed to achieve a target estimation error. Furthermore, we demonstrate that the estimation error associated with these strategies decreases with system size in a faster manner than classical (or no-twist) protocols, even in the less-explored regimes where the prior information is limited. Last, using a polynomial-sized tensor network algorithm, we numerically analyze practical variational metrology beyond the symmetric subspace of a collective spin and find that quantum advantage persists for the arbitrary-axis twist ansatzes with a few one-axis twists and smaller total twisting angles for practically relevant noise levels. Published by the American Physical Society 2024

arXiv:2212.12461•Physical Review Research•May 16, 2024•10 citations

Constant-Depth Unitary Preparation of Dicke States

Malvika Raj Joshi, Francisca Vasconcelos

Dicke states serve as a critical resource in quantum metrology, communication, and computation. However, unitary preparation of Dicke states is limited to logarithmic depth in standard circuit models and existing constant-depth protocols require measurement and feed-forward. In this work, we present the first unitary, constant-depth protocols for exact Dicke state preparation. We overcome the logarithmic-depth barrier by moving beyond the standard circuit model and leveraging global interactions (native to architectures such as neutral atoms and trapped ions). Specifically, utilizing unbounded CZ gates (i.e. within the QAC$^0$ circuit class), we offer circuits for exact computation of constant-weight Dicke states, using polynomial ancillae, and approximation of weight-1 Dicke states (i.e. $W$ states), using only constant ancillae. Granted additional access to the quantum FAN-OUT operation (i.e. upgrading to the QAC$_f^0$ circuit class), we also achieve exact and clean preparation of arbitrary-weight Dicke states, with polynomial ancillae. These protocols distinguish the constant-depth capabilities of quantum architectures based on connectivity and offer a novel path toward resolving a long-standing quantum complexity conjecture.

quant-pharXiv:2601.10693•Jan 16, 2026•6 citations

Entanglement Generation via Single-Qubit Rotations in a Torn Hilbert Space

Tao Zhang, Zhihao Chi, Jiazhong Hu

We propose an efficient yet simple protocol to generate arbitrary symmetric entangled states with only global single-qubit rotations in a torn Hilbert space. The system is based on spin-1/2 qubits in a resonator such as atoms in an optical cavity or superconducting qubits coupled to a main bus. By sending light or microwave into the resonator, it induces ac Stark shifts on particular angular-momentum eigenstates (Dicke states) of qubits. Then we are able to generate barriers that hinder transitions between adjacent Dicke states and tear the original Hilbert space into pieces. Therefore, a simple global single-qubit rotation becomes highly nontrivial, and thus generates entanglement among the many-body system. By optimal control of energy shifts on Dicke states, we are able to generate arbitrary symmetric entangled states. We also exemplify that we can create varieties of useful states with near-unity fidelities in only one or very few steps, including W states, spin-squeezed states (SSSs), and Greenberger-Horne-Zeilinger states. Particularly, the SSS can be created by only one step with a squeezing parameter ξ R 2 ∼ 1 / N 0.843 approaching the Heisenberg limit. Our finding establishes a way for universal entanglement generations with only single-qubit drivings where all the multiple-qubit controls are integrated into simply switching on or off microwave. It has direct applications in the variational quantum optimizer, which is available with existing technology. Published by the American Physical Society 2024

arXiv:2312.04507•PRX Quantum•Sep 5, 2024•5 citations

Efficient circuits for leaf-separable state preparation

Sunil Vittal, Anthony Wilkie, Nika Rastegari +2 more

Efficient state preparation is a challenging and important problem in quantum computing. In this work, we present a recursive state preparation algorithm that combines logarithmic-depth Dicke state circuits with Hamming weight encoders for efficiently preparing ``leaf-separable" quantum states. The algorithm is built on binary partition trees, generalized weight distribution blocks (gWDBs), and leaf-level encoders. We evaluate the performance of the algorithm by numerically simulating it on randomly generated target states with between 4 and 15 qubits. Compared to general state preparation approaches which require $O(2^n)$ CX gates, our algorithm achieves a circuit depth of $O(k\log\frac{n}{k} + 2^k)$ and uses $O(n(k+2^k))$ two-qubit gates, where $k < n$ denotes the subtree size. We also compare implementations of the algorithm with and without the use of ancilla qubits, providing a detailed analysis of the trade-offs in circuit depth and two-qubit gate counts. These results contribute to scalable state preparation for quantum algorithms that require structured inputs such as Dicke or near-Dicke states.

quant-pharXiv:2511.11227•Nov 17, 2025•2 citations
Quantum states that are symmetric under particle exchange play a crucial role in fields such as quantum metrology and quantum error correction. We use a variational circuit composed of global one-axis twisting and global rotations to efficiently prepare arbitrary symmetric states, i.e., any superposition of Dicke states. The circuit does not require local addressability or ancilla qubits and thus can be readily implemented in a variety of experimental platforms including trapped-ion quantum simulators and cavity QED systems. We provide analytic and numerical evidence that any N -qubit symmetric state can be prepared in 2 N / 3 steps. We demonstrate the utility of our protocol by preparing (i) metrologically useful N -qubit Dicke states of up to N = 300 qubits in O ( 1 ) gate steps with theoretical infidelities 1 − F < 10 − 3 , (ii) the N = 9 Ruskai codewords in P = 4 gate steps with 1 − F < 10 − 4 , and (iii) the N = 13 Gross codewords in P = 7 gate steps with 1 − F < 10 − 4 . Focusing on trapped-ion platforms, for the N = 9 Ruskai and N = 13 Gross codewords we estimate that the protocol achieves fidelities ≳ 95 % in the presence of typical experimental noise levels, thus providing a pathway to the preparation of a wide range of useful highly entangled quantum states.
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]).
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.
Quantum metrology and sensing seek advantages in estimating an unknown parameter of some quantum state or channel, using entanglement such as spin squeezing produced by one-axis twists or other quantum resources. In particular, qubit phase estimation, or rotation sensing, appears as a ubiquitous problem with applications to electric field sensing, magnetometry, atomic clocks, and gyroscopes. By adopting the Bayesian formalism to the phase estimation problem to account for limited initial knowledge about the value of the phase, we formulate variational metrology and treat the state preparation (or encoding) and measurement (or decoding) procedures as parameterized quantum circuits. It is important to understand how effective various parametrized protocols are as well as how robust they are to the effects of complex noise such as spatially correlated noise. First, we propose a family of parametrized encoding and decoding protocols called arbitrary-axis twist ansatzes, and show that it can lead to a substantial reduction in the number of one-axis twists needed to achieve a target estimation error. Furthermore, we demonstrate that the estimation error associated with these strategies decreases with system size in a faster manner than classical (or no-twist) protocols, even in the less-explored regimes where the prior information is limited. Last, using a polynomial-sized tensor network algorithm, we numerically analyze practical variational metrology beyond the symmetric subspace of a collective spin and find that quantum advantage persists for the arbitrary-axis twist ansatzes with a few one-axis twists and smaller total twisting angles for practically relevant noise levels. Published by the American Physical Society 2024
Dicke states serve as a critical resource in quantum metrology, communication, and computation. However, unitary preparation of Dicke states is limited to logarithmic depth in standard circuit models and existing constant-depth protocols require measurement and feed-forward. In this work, we present the first unitary, constant-depth protocols for exact Dicke state preparation. We overcome the logarithmic-depth barrier by moving beyond the standard circuit model and leveraging global interactions (native to architectures such as neutral atoms and trapped ions). Specifically, utilizing unbounded CZ gates (i.e. within the QAC0^00 circuit class), we offer circuits for exact computation of constant-weight Dicke states, using polynomial ancillae, and approximation of weight-1 Dicke states (i.e. WWW states), using only constant ancillae. Granted additional access to the quantum FAN-OUT operation (i.e. upgrading to the QACf0_f^0f0​ circuit class), we also achieve exact and clean preparation of arbitrary-weight Dicke states, with polynomial ancillae. These protocols distinguish the constant-depth capabilities of quantum architectures based on connectivity and offer a novel path toward resolving a long-standing quantum complexity conjecture.
We propose an efficient yet simple protocol to generate arbitrary symmetric entangled states with only global single-qubit rotations in a torn Hilbert space. The system is based on spin-1/2 qubits in a resonator such as atoms in an optical cavity or superconducting qubits coupled to a main bus. By sending light or microwave into the resonator, it induces ac Stark shifts on particular angular-momentum eigenstates (Dicke states) of qubits. Then we are able to generate barriers that hinder transitions between adjacent Dicke states and tear the original Hilbert space into pieces. Therefore, a simple global single-qubit rotation becomes highly nontrivial, and thus generates entanglement among the many-body system. By optimal control of energy shifts on Dicke states, we are able to generate arbitrary symmetric entangled states. We also exemplify that we can create varieties of useful states with near-unity fidelities in only one or very few steps, including W states, spin-squeezed states (SSSs), and Greenberger-Horne-Zeilinger states. Particularly, the SSS can be created by only one step with a squeezing parameter ξ R 2 ∼ 1 / N 0.843 approaching the Heisenberg limit. Our finding establishes a way for universal entanglement generations with only single-qubit drivings where all the multiple-qubit controls are integrated into simply switching on or off microwave. It has direct applications in the variational quantum optimizer, which is available with existing technology. Published by the American Physical Society 2024
Efficient state preparation is a challenging and important problem in quantum computing. In this work, we present a recursive state preparation algorithm that combines logarithmic-depth Dicke state circuits with Hamming weight encoders for efficiently preparing ``leaf-separable" quantum states. The algorithm is built on binary partition trees, generalized weight distribution blocks (gWDBs), and leaf-level encoders. We evaluate the performance of the algorithm by numerically simulating it on randomly generated target states with between 4 and 15 qubits. Compared to general state preparation approaches which require O(2n)O(2^n)O(2n) CX gates, our algorithm achieves a circuit depth of O(klog⁡nk+2k)O(k\log\frac{n}{k} + 2^k)O(klogkn​+2k) and uses O(n(k+2k))O(n(k+2^k))O(n(k+2k)) two-qubit gates, where k<nk < nk<n denotes the subtree size. We also compare implementations of the algorithm with and without the use of ancilla qubits, providing a detailed analysis of the trade-offs in circuit depth and two-qubit gate counts. These results contribute to scalable state preparation for quantum algorithms that require structured inputs such as Dicke or near-Dicke states.