Probabilistic modeling over permutations using quantum computers
arXiv QuantumArchived Mar 25, 2026✓ Full text saved
arXiv:2603.22401v1 Announce Type: new Abstract: Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock spectral methods for machine learning over permutation-structured data, which appear in applications such as multi-object tracking and recommendation systems. It has been shown previously that a powerful way of buildi
Full text archived locally
✦ AI Summary· Claude Sonnet
Quantum Physics
[Submitted on 23 Mar 2026]
Probabilistic modeling over permutations using quantum computers
Vasilis Belis, Giulio Crognaletti, Matteo Argenton, Michele Grossi, Maria Schuld
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock spectral methods for machine learning over permutation-structured data, which appear in applications such as multi-object tracking and recommendation systems. It has been shown previously that a powerful way of building probabilistic models over permutations is to use the framework of non-Abelian harmonic analysis, as the model's group Fourier spectrum captures the interaction complexity: "low frequencies" correspond to low order correlations, and "high frequencies" to more complex ones. This can be used to construct a Markov chain model driven by alternating steps of diffusion (a group-equivariant convolution) and conditioning (a Bayesian update). However, this approach is computationally challenging and hence limited to simple approximations. Here we construct a quantum algorithm that encodes the exact probabilistic model -- a classically intractable object -- into the amplitudes of a quantum state by making use of the Quantum Fourier Transform (QFT) over the symmetric group. We discuss the scaling, limitations, and practical use of such an approach, which we envision to be a first step towards useful applications of non-Abelian QFTs.
Comments: 36 pages, 4 Figures
Subjects: Quantum Physics (quant-ph); Machine Learning (cs.LG)
Cite as: arXiv:2603.22401 [quant-ph]
(or arXiv:2603.22401v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2603.22401
Focus to learn more
Submission history
From: Vasilis Belis [view email]
[v1] Mon, 23 Mar 2026 18:00:12 UTC (605 KB)
Access Paper:
HTML (experimental)
view license
Current browse context:
quant-ph
< prev | next >
new | recent | 2026-03
Change to browse by:
cs
cs.LG
References & Citations
INSPIRE HEP
NASA ADS
Google Scholar
Semantic Scholar
Export BibTeX Citation
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Demos
Related Papers
About arXivLabs
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)