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.
2020.qsim
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
New merge booster and diagonal detector components, combined with cache blocking and gate fusion, deliver up to 160x speedup on circuit benchmarks and 34x on diagonal-heavy gates versus prior simulators.
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.
-
Large-Scale Quantum Circuit Simulation on HPC Cluster via Cache Blocking, Boosting, and Gate Fusion Optimization
New merge booster and diagonal detector components, combined with cache blocking and gate fusion, deliver up to 160x speedup on circuit benchmarks and 34x on diagonal-heavy gates versus prior simulators.