Constant-depth adaptive preparation of Dicke and symmetric states

• URL: http://arxiv.org/abs/2608.01144v1
• Date: Sun, 02 Aug 2026 10:46:16 GMT
• Title: Constant-depth adaptive preparation of Dicke and symmetric states
• Abstract summary: Efficient preparation of Dicke states and, more generally, permutation-symmetric states is important for quantum information processing.<n>We introduce an exact constant-depth adaptive preparation protocol for arbitrary Dicke-$(n,k)$ states and further symmetric states.
• Score: 8.455444430741668
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Adiabatic Quantum Phase Estimation [47.3103723337301]
  Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $$ in Heisenberg-limited time $T= (1/)$.<n>Standard gate-based implementations of QPE require deep controlled time-evolution circuits and are not native to analog hardware.<n>We present a simple adiabatic protocol for QPE that achieves the optimal Heisenberg-limited scaling $T = Oleft( frac1 logleft(-1right)right)$ in both the precision $$
  arXiv  Detail & Related papers  (2026-05-21T17:31:36Z)
• Constant-Depth Unitary Preparation of Dicke States [0.24350063807321942]
  unitary preparation of Dicke states is limited to logarithmic depth in standard circuit models.<n>We present the first unitary, constant-depth protocols for exact Dicke state preparation.
  arXiv  Detail & Related papers  (2026-01-15T18:51:09Z)
• Efficient nonclassical state preparation via generalized parity measurement [1.99945301851239]
  We propose a measurement-based protocol that leverages the Jaynes-Cummings interaction of the bosonic mode with an ancillary two-level atom.<n>We can efficiently filter out the unwanted population and push the target mode conditionally toward the desired Fock state.<n>Our protocol can also be used to prepare a large Dicke state $|J1000,0rangle$ of a spin ensemble with a sufficiently high fidelity by less than $3$ measurements.
  arXiv  Detail & Related papers  (2025-08-20T14:50:27Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Short-Depth Circuits for Dicke State Preparation [0.0]
  We present short-depth circuits to deterministically prepare any Dicke state. Dicke states are an important class of entangled quantum states with a large variety of applications.
  arXiv  Detail & Related papers  (2022-07-20T16:01:03Z)
• Bipartite quantum measurements with optimal single-sided distinguishability [0.0]
  We look for a basis with optimal single-sided mutual state distinguishability in $Ntimes N$ Hilbert space. In the case $N=2$ of a two-qubit system our solution coincides with the elegant joint measurement introduced by Gisin. We show that the one-party measurement that distinguishes the states of an optimal basis of the composite system leads to a local quantum state tomography.
  arXiv  Detail & Related papers  (2020-10-28T10:30:35Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)
• Verification of phased Dicke states [2.4173125243170377]
  Dicke states are examples of quantum states with genuine multipartite entanglement. Phased Dicke states are a generalization of Dicke states and include antisymmetric basis states. We propose practical and efficient protocols for verifying phased Dicke states.
  arXiv  Detail & Related papers  (2020-04-15T04:09:56Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.