arXiv subjects

Kanin Aungskunsiri

Publications and source records attributed to Kanin Aungskunsiri.

4 recordsLinked to original sources

arXiv2023

Multiplexing quantum tunneling diodes for random number generation

Random numbers are indispensable resources for application in modern science and technology. Therefore, a dedicate entropy source is essential, particularly cryptographic tasks and modern applications. In this work, we experimentally demonstrated a scheme to generate random numbers by multiplexing eight tunnel diodes onto a single circuit. As a result, the data rate of random number generation was significantly enhanced to eight folds. In comparison to the original scheme that employed one diode, this multiplexing scheme produced data with higher entropy. These data were then post-processed with the Toeplitz-hashing extractor, yielding final outputs that achieved almost full entropy and satisfied the U.S. National Institute of Standards and Technology (NIST) Special Publication 800-90B validation. These data also passed the NIST Special Publication 800-22 statistical randomness examination and had no sign of patterns detected from an autocorrelation analysis.

physics.app-ph↗

arXiv2023

Random number generation from a quantum tunneling diode

Random numbers are important in many activities, including communication, encryption, science, gambling, finance, and decision-making. There is a strong demand for a hardware random number generator that could support cryptographic applications. In this work, we propose a quantum tunneling diode as a source of true randomness achieved by applying electrical current sweeps through the device and then harnessing a time-counting unit to measure fluctuation of current flows. Our approach can be implemented with inexpensive electronics and could be integrated into systems that require random numbers such as portable communication devices.

physics.app-ph↗

arXiv2017

Quantum processing by remote quantum control

Client-server models enable computations to be hosted remotely on quantum servers. We present a novel protocol for realizing this task, with practical advantages when using technology feasible in the near term. Client tasks are realized as linear combinations of operations implemented by the server, where the linear coefficients are hidden from the server. We report on an experimental demonstration of our protocol using linear optics, which realizes linear combination of two single-qubit operations by a remote single-qubit control. In addition, we explain when our protocol can remain efficient for larger computations, as well as some ways in which privacy can be maintained using our protocol.

quant-ph↗

arXiv2015

Efficient Quantum Walk on a Quantum Processor

The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms. In this paper, we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks which could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle we have experimentally implemented the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.

quant-ph↗