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.
Preparation of Hamming-Weight-Preserving Quantum States with Log-Depth Quantum Circuits, August 2025
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
CCD-QAOA incorporates counterdiabatic terms into the QAOA ansatz and shows higher approximation ratios than standard XY-mixer, Grover-mixer, and penalty QAOA for portfolio problems with budget and risk constraints.
citing papers explorer
-
Preparing multi-qudit states in a definite-weight subspace
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.
-
Constrained Counterdiabatic Quantum Approximate Optimization Algorithm for Portfolio Optimization
CCD-QAOA incorporates counterdiabatic terms into the QAOA ansatz and shows higher approximation ratios than standard XY-mixer, Grover-mixer, and penalty QAOA for portfolio problems with budget and risk constraints.