Constant-Depth Unitary Preparation of Dicke States

• URL: http://arxiv.org/abs/2601.10693v1
• Date: Thu, 15 Jan 2026 18:51:09 GMT
• Title: Constant-Depth Unitary Preparation of Dicke States
• Abstract summary: 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.
• Score: 0.24350063807321942
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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 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.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Constant-depth adaptive preparation of Dicke and symmetric states [8.455444430741668]
  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.
  arXiv  Detail & Related papers  (2026-08-02T10:46:16Z)
• Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
  Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
  arXiv  Detail & Related papers  (2025-11-24T16:36:06Z)
• State complexity and phase identification in adaptive quantum circuits [6.041950339728775]
  We show that states within the same quantum phase, defined by a set of quantum states connected with constant-depth circuits, must share the same scaling of weight or anti-shallowness.<n>This establishes these quantities as indicators of quantum phases and their essential roles in many-body physics.
  arXiv  Detail & Related papers  (2025-09-21T10:03:05Z)
• Implementing a Universal Set of Geometric Quantum Gates through Dressed-State assisted STA [39.27725073249277]
  We analyze the implementation of single-qubit gates in a two-level system driven by a microwave field.<n>We show how the dynamical phase can be canceled to obtain purely geometric operations.<n>We extend the protocol to construct non two-qubit gates, highlighting its feasibility for scalable quantum information processing.
  arXiv  Detail & Related papers  (2025-09-10T16:14:34Z)
• Quantum Homogenization as a Quantum Steady State Protocol on NISQ Hardware [42.52549987351643]
  Quantum homogenization is a reservoir-based quantum state approximation protocol.<n>We extend the standard quantum homogenization protocol to the dynamically-equivalent ($mathttSWAP$)$alpha$ formulation.<n>We show that our proposed protocol yields a completely positive, trace preserving (CPTP) map under which the code subspace is correctable.
  arXiv  Detail & Related papers  (2024-12-19T05:50:54Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Dynamical weight reduction of Pauli measurements [0.0]
  We formalize dynamical weight reduction (DWR) schemes in which a high-weight Pauli measurement is decomposed into a sequence of measurements of smaller weight. We highlight three examples that achieve a constant time or a constant space overhead. This work showcases the flexibility in compiling a measurement circuit in terms of lower-weight measurements using deformations of ZX diagrams.
  arXiv  Detail & Related papers  (2024-10-16T13:03:33Z)
• Learning dynamic quantum circuits for efficient state preparation [0.0]
  Dynamic quantum circuits (DQCs) incorporate mid-circuit measurements and gates conditioned on these measurement outcomes. We develop scalable tensor network algorithms which find high-fidelity DQC preparations for generic states. Our work demonstrates the power of an algorithmic approach to generating DQC circuits, broadening their scope of applications to new areas of quantum computing.
  arXiv  Detail & Related papers  (2024-10-11T17:47:46Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• 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)
• 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)
• On Actual Preparation of Dicke State on a Quantum Computer [4.098348230722067]
  We study the importance of concise realizations of Partially defined Unitary Transformations for better circuit construction. We provide the most efficient Deterministic Dicke State Preparation Circuit in terms of CNOT and single qubit gate counts. We analyze different ways of distributing the CNOT gates in the circuit and its affect on the induced error.
  arXiv  Detail & Related papers  (2020-07-03T13:40:32Z)

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.