arXiv:2610.02103
Unitary Schur Sampling of Qudits via Random SWAP Tests: Hunt for Antisymmetry
Shrigyan Brahmachari, David Jakab, Henry D. Pfister, Iman Marvian
Abstract
Schur sampling is a fundamental primitive for extracting permutation-invariant information from many-body quantum systems and has broad applications in quantum information science. Circuit-based implementations typically rely on coherent representation-theoretic operations such as Clebsch-Gordan transforms, generalized phase estimation, or quantum Fourier transforms over the symmetric group. We show that unitary Schur sampling of arbitrary permutation-invariant mixed states on $n$ $d$-dimensional qudits can instead be implemented using only pairwise SWAP tests, namely, two-qudit projective measurements onto the symmetric and antisymmetric subspaces. Our protocol achieves error $ε$ in diamond distance using $O(n\min\{n,d\}^{3}\log^2(n/ε))$ random SWAP tests. The central idea is to repeatedly identify and extract the largest antisymmetric subsystem. This turns unitary Schur sampling into a search for antisymmetry and gives the algorithm a natural interpretation as a stochastic traversal of a Young diagram. The protocol preserves the $\mathrm{SU}(d)$-irrep state while preparing a canonical pure state in the multiplicity subsystem. As an application, we consider quantum purity amplification (QPA), in which multiple noisy copies of a pure quantum state are combined to produce a state of higher purity. We show that the optimal purified state can be obtained by retaining a single designated output qudit and discarding the rest.
AI Summary
The paper asks whether unitary Schur sampling of $n$ $d$-dimensional qudits can be implemented without coherent representation-theoretic circuits, using only pairwise SWAP measurements and classical control. The target channel returns the Young-diagram label, preserves the corresponding $\mathrm{SU}(d)$-irrep state, and resets the permutation-multiplicity subsystem to a fixed pure state encoded in the original registers. Arbitrary inputs are first permutation-twirled, so only permutation-invariant information is retained. The protocol recursively extracts maximal fully antisymmetric subsystems, whose sizes give successive Young-diagram column lengths. An efficient algorithm grows each subsystem one qudit at a time, using repeated failed growth attempts to certify completion. Pieri’s branching rule establishes the recursive sector structure; bounds on growth probabilities and a stochastic Young-diagram traversal give a high-probability cost of $O(nd^2\log(n/\epsilon))$ ideal antisymmetric measurements. A separate recovery construction simulates each growth measurement, including its post-measurement state, using $O(k\log(1/\delta))$ SWAP tests for an antisymmetric block of size $k$. Together these yield diamond-distance error at most $\epsilon$ using $O(n\min\{n,d\}^3\log^2(n/\epsilon))$ SWAP tests on every execution. For optimal single-output quantum purity amplification, the canonical output encoding makes the remaining operation simply retaining a designated qudit and discarding the rest. The SWAP-based measurement simulation requires the antisymmetric-block promise, rather than working on arbitrary inputs. Complexity counts SWAP tests, not elementary gates; improving the local-dimension dependence remains open.
ChatGPT was used for proofreading, editing, and improving the clarity and presentation of the manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 19 pages + 29 pages of Appendices, 2 Figures, Preliminary version