Post-Processing Techniques for Time-of-Arrival Based Quantum Random Number Generators

Guardat en:
Dades bibliogràfiques
Publicat a:PQDT - Global (2025)
Autor principal: Solymos, Balázs
Publicat:
ProQuest Dissertations & Theses
Matèries:
Accés en línia:Citation/Abstract
Full Text - PDF
Full text outside of ProQuest
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!

MARC

LEADER 00000nab a2200000uu 4500
001 3288377641
003 UK-CbPIL
020 |a 9798265486981 
035 |a 3288377641 
045 2 |b d20250101  |b d20251231 
084 |a 189128  |2 nlm 
100 1 |a Solymos, Balázs 
245 1 |a Post-Processing Techniques for Time-of-Arrival Based Quantum Random Number Generators 
260 |b ProQuest Dissertations & Theses  |c 2025 
513 |a Dissertation/Thesis 
520 3 |a Unpredictability is a key resource for many computational applications like cryptography, statistical simulations, probabilistic games (e.g., gambling), fair selection, or even quantum key distribution. Quantum random number generators promise guaranteed quality, secure, fully random output by utilizing the fundamentally indeterministic nature of quantum measurements. While these generators can be based on any quantum phenomena, advancements in quantum optics are making architectures based on various properties of photons more accessible, with continuously increasing capabilities. One such architecture is photonic time-of-arrival based generators, where the non-deterministic emission times of single photons are measured. One of the main advantages of this scheme is that it can be realized with a relatively simple measurement setup while offering substantial output entropy rates. The expected output of any random number generator is a uniformly distributed sequence of zeroes and ones. Actual physical measurement statistics, however, typically follow some other non-uniform distribution, mandating the need for various post-processing steps. Additionally, potential imperfections and non-idealities can also influence the measurement statistics and must be handled. Thus, the non-trivial task of post-processing is to transform physical measurement results to a high quality output bitstream while striving for optimal bit-generation efficiency with affordable computational costs. After briefly introducing the topic of quantum random number generation in the first chapter, this thesis explores and presents various challenges and possible solutions associated with post-processing the measurement results of time-of-arrival based quantum random number generators. The second chapter presents a scheme for dealing with unwanted correlations due to typical hardware imperfections. The third and fourth chapters present two different post-processing schemes to generate uniform output. The first is inspired by the continuous probability integral transform and can be used in practical scenarios where the measurement setup is well characterized, while the second one is based on universal hashing, offering increased error tolerances at the cost of elevated computational costs. The theoretical results and claims of the thesis are also verified experimentally. 
653 |a Cryptography 
653 |a Quantum computing 
653 |a Simulation 
653 |a Computers 
653 |a Quantum physics 
653 |a Random variables 
653 |a Protocol 
653 |a Communication 
653 |a Cloning 
653 |a Sensors 
653 |a Trust 
653 |a Noise 
653 |a Data encryption 
653 |a Algorithms 
653 |a Entropy 
653 |a Computer science 
773 0 |t PQDT - Global  |g (2025) 
786 0 |d ProQuest  |t ProQuest Dissertations & Theses Global 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/3288377641/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/3288377641/fulltextPDF/embedded/L8HZQI7Z43R0LA5T?source=fedsrch 
856 4 0 |3 Full text outside of ProQuest  |u http://hdl.handle.net/10890/62016