Quantum Walk Random Number Generation: Memory-based Models
Minu J. Bae

TL;DR
This paper analyzes a quantum walk-based random number generator with memory, optimizing its parameters and exploring how system size and coin number affect randomness quality.
Contribution
It introduces a memory-based quantum walk model with a generalized coin operator for improved randomness extraction in quantum cryptography.
Findings
Randomness quality depends on memory size and coin number.
Optimized parameters enhance the unpredictability of the quantum walk.
System behavior varies significantly across different configurations.
Abstract
The semi-source independent quantum walk random number generator (SI-QW-QRNG) is a cryptographic protocol that extracts a string of true random bits from a quantum random walk with an adversary controls a randomness source, but the dimension of the system is known. This paper analyzes SI-QW-QRNG protocols with a memory-based quantum walk state. The new protocol utilizes a generalized coin operator with various parameters to optimize the randomness of the quantum walk state. We focus on evaluations of the protocols in multiple scenarios and walk configurations. Moreover, we show some interesting behavior of the system depending on the size of the memory space and the number of quantum coins.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
