Pith. sign in

Optimal Circuit Size for Fixed-Hamming-Weight Quantum States Preparation

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

We study the problem of efficiently preparing fixed-Hamming-weight (HW-$k$) quantum states, which are superpositions of $n$-qubit computational basis states with exactly $k$ ones. We present a quantum circuit construction that prepares any $n$-qubit HW-$k$ state with a circuit size of $O(\binom{n}{k})$ using at most $\max\{0, n-3\}$ ancillary qubits. This is the first construction that achieves the theoretical lower bound on circuit size while using only a small number of ancillary qubits. We believe that the techniques presented in this work can be extended to other quantum state preparation algorithms based on decision diagrams, potentially reducing the reliance on ancillary qubits or lowering the overall circuit size.

fields

quant-ph 2

years

2026 2

representative citing papers

Preparing multi-qudit states in a definite-weight subspace

quant-ph · 2026-06-23 · unverdicted · novelty 6.0 · 2 refs

A deterministic algorithm prepares arbitrary multi-qudit states in a definite-weight subspace via Gray-code ordering of multiset permutations, reducing preparation to controlled 2-qudit Gray rotations, and is demonstrated on Bethe states of the SU(3) Heisenberg model and SU(d) Dicke states.

citing papers explorer

Showing 2 of 2 citing papers.