Constructs an explicit unitary Q using the quantum Schur transform to coherently map fixed-N first-quantized states to occupation-number form with poly(N,d,log(1/ε)) gate complexity.
Low-depth quantum sym- metrization
3 Pith papers cite this work, alongside 2 external citations. Polarity classification is still indexing.
3
Pith papers citing it
2
external citations · external index
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
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 qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.
citing papers explorer
-
Efficient Quantum Circuits for Coherent Conversion Between General First- and Second-Quantized Many-Body Representations
Constructs an explicit unitary Q using the quantum Schur transform to coherently map fixed-N first-quantized states to occupation-number form with poly(N,d,log(1/ε)) gate complexity.
-
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.
-
Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.