Random sampling of permutations through quantum circuits
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918012436611072 |
|---|---|
| author | Adhikari, Bibhas |
| author_facet | Adhikari, Bibhas |
| contents | In this paper, we introduce a classical algorithm for random sampling of permutations, drawing inspiration from the Steinhaus-Johnson-Trotter algorithm. Our approach takes a comprehensive view of permutation sampling by expressing them as products of adjacent transpositions. Building on this, we develop a quantum analogue of the classical algorithm using a quantum circuit model for random sampling of permutations. As an application, we present a quantum algorithm for the two-sample randomization test to assess the difference of means in classical data. Finally, we propose a nested corona product graph generative model for symmetric groups, which facilitates random sampling of permutations from specific sets of permutations through a quantum circuit model. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_03018 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Random sampling of permutations through quantum circuits Adhikari, Bibhas Quantum Physics Discrete Mathematics Combinatorics In this paper, we introduce a classical algorithm for random sampling of permutations, drawing inspiration from the Steinhaus-Johnson-Trotter algorithm. Our approach takes a comprehensive view of permutation sampling by expressing them as products of adjacent transpositions. Building on this, we develop a quantum analogue of the classical algorithm using a quantum circuit model for random sampling of permutations. As an application, we present a quantum algorithm for the two-sample randomization test to assess the difference of means in classical data. Finally, we propose a nested corona product graph generative model for symmetric groups, which facilitates random sampling of permutations from specific sets of permutations through a quantum circuit model. |
| title | Random sampling of permutations through quantum circuits |
| topic | Quantum Physics Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/2409.03018 |