Quantum Walk Random Number Generation: Memory-based Models

• URL: http://arxiv.org/abs/2207.08973v3
• Date: Tue, 11 Oct 2022 18:28:31 GMT
• Title: Quantum Walk Random Number Generation: Memory-based Models
• Authors: Minu J. Bae
• Abstract summary: This paper analyzes SI-QW-QRNG protocols with a memory-based quantum walk state. We show some interesting behavior of the system depending on the size of the memory space and the number of quantum coins.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels [49.126395046088014]
  We show that the existence of a DI code in the quantum setting follows from a suitable packing in a modified space of output quantum states. This result enables us to tighten the capacity lower bound for DI over quantum channels beyond the simultaneous decoding approach.
  arXiv  Detail & Related papers  (2025-04-29T17:57:36Z)
• How much secure randomness is in a quantum state? [0.0]
  How much cryptographically-secure randomness can be extracted from a quantum state? We consider a general adversarial model that allows for an adversary who has quantum side-information about both the source and the measurement device.
  arXiv  Detail & Related papers  (2024-10-21T19:16:56Z)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Optimal Conversion from Classical to Quantum Randomness via Quantum Chaos [0.0]
  In a recently proposed paradigm known as deep thermalization, random quantum states of system A are generated by performing projective measurements on system B. In this scheme, the randomness of the projected state ensemble arises from the intrinsic randomness of the outcomes when B is measured. We show that for generic chaotic systems this conversion is optimal in that each bit of injected classical entropy generates as much additional quantum randomness as adding an extra qubit to B.
  arXiv  Detail & Related papers  (2024-10-07T16:41:23Z)
• A Programmable True Random Number Generator Using Commercial Quantum Computers [4.306143768014157]
  We demonstrate that a quantum computer can serve as a high-quality, weakly random source for a generalized user-defined probability mass function. We introduce an automated and flexible method for implementing a TRNG as a programmed quantum circuit that executes on commercially-available, gate-model quantum computers.
  arXiv  Detail & Related papers  (2023-04-07T20:12:18Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Pseudo Quantum Random Number Generator with Quantum Permutation Pad [1.2233362977312945]
  This paper proposes a pseudo quantum random number generator with a quantum algorithm called quantum permutation pad or QPP. Using a QPP pad 64 8-bit permuation, pQRNG holds 107,776 bits of entropy for the pseudo random number generation. It can be used as a deterministic PRNG or entropy booster of other PRNGs.
  arXiv  Detail & Related papers  (2023-03-02T14:42:23Z)
• Self-testing randomness from a nuclear spin system [0.9774183498779745]
  We present a proof-of-concept random number generator based on a nuclear spin system for the first time. The entropy of randomness in the experimental data is quantified by two dimension witness certification protocols.
  arXiv  Detail & Related papers  (2022-03-09T08:43:45Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• Quantum Random Number Generation using a Solid-State Single-Photon Source [89.24951036534168]
  Quantum random number generation (QRNG) harnesses the intrinsic randomness of quantum mechanical phenomena. We demonstrate QRNG with a quantum emitter in hexagonal boron nitride. Our results open a new avenue to the fabrication of on-chip deterministic random number generators.
  arXiv  Detail & Related papers  (2020-01-28T22:47:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.