A NISQ-friendly Coined Quantum Walk Algorithm for Chaos-based Cryptographic Applications
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918450652250112 |
|---|---|
| author | Gibson, Natalie Keckman, Niklas Marchesin, Andrea Raasakka, Matti Tittonen, Ilkka |
| author_facet | Gibson, Natalie Keckman, Niklas Marchesin, Andrea Raasakka, Matti Tittonen, Ilkka |
| contents | We present a novel lackadaisical alternating quantum walk (LAQW) algorithm whose circuit depth scales as $\mathcal{O}(n^2+nt)$ for a $n\times n$ lattice over $t$ time steps. We show that this is a significant depth reduction compared to the existing controlled alternating quantum walk (CAQW) model, which has a circuit depth that scales as $\mathcal{O}(n^2t)$ (Li et al., 2017, arXiv:1707.07389). This makes the implementation of the LAQW viable for Noisy Intermediate-scale Quantum (NISQ) devices. We then showcase the applicability of the LAQW algorithm by proposing a chaos-based symmetric-key generation scheme. Our approach uses the LAQW as a quantum entropy source from which reproducible random bitstring sequences are generated using the underlying probability distribution and subsequent post-processing methods. We provide a comprehensive evaluation of the LAQW algorithm and demonstrate the reproducibility of 128-bit keys under simulated quantum noise provided by IBM's FakeTorino backend. A direct comparison with the CAQW model, which has been used in image encryption and hash function schemes (Li et al., 2017, arXiv:1707.07389; Abd EL-Latif et al., 2020, ScienceDirect; Abd El-Latif, Abd El-Atty, and Venegas-Andraca, 2020, ScienceDirect), highlights the potential and usefulness of the LAQW model in cryptographic applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_15030 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A NISQ-friendly Coined Quantum Walk Algorithm for Chaos-based Cryptographic Applications Gibson, Natalie Keckman, Niklas Marchesin, Andrea Raasakka, Matti Tittonen, Ilkka Quantum Physics We present a novel lackadaisical alternating quantum walk (LAQW) algorithm whose circuit depth scales as $\mathcal{O}(n^2+nt)$ for a $n\times n$ lattice over $t$ time steps. We show that this is a significant depth reduction compared to the existing controlled alternating quantum walk (CAQW) model, which has a circuit depth that scales as $\mathcal{O}(n^2t)$ (Li et al., 2017, arXiv:1707.07389). This makes the implementation of the LAQW viable for Noisy Intermediate-scale Quantum (NISQ) devices. We then showcase the applicability of the LAQW algorithm by proposing a chaos-based symmetric-key generation scheme. Our approach uses the LAQW as a quantum entropy source from which reproducible random bitstring sequences are generated using the underlying probability distribution and subsequent post-processing methods. We provide a comprehensive evaluation of the LAQW algorithm and demonstrate the reproducibility of 128-bit keys under simulated quantum noise provided by IBM's FakeTorino backend. A direct comparison with the CAQW model, which has been used in image encryption and hash function schemes (Li et al., 2017, arXiv:1707.07389; Abd EL-Latif et al., 2020, ScienceDirect; Abd El-Latif, Abd El-Atty, and Venegas-Andraca, 2020, ScienceDirect), highlights the potential and usefulness of the LAQW model in cryptographic applications. |
| title | A NISQ-friendly Coined Quantum Walk Algorithm for Chaos-based Cryptographic Applications |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2604.15030 |