Sampled sub-block hashing for large input randomness extraction

• URL: http://arxiv.org/abs/2308.02856v1
• Date: Sat, 5 Aug 2023 12:09:05 GMT
• Title: Sampled sub-block hashing for large input randomness extraction
• Authors: Hong Jie Ng, Wen Yu Kon, Ignatius William Primaatmaja, Chao Wang, Charles Lim
• Abstract summary: Randomness extraction is an essential post-processing step in quantum cryptography systems. Large input data size could heavily penalise the speed and resource consumption of the randomness extraction process. We propose a sampled sub-block hashing approach to circumvent this problem.
• Score: 2.549884936158282
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Randomness extraction is an essential post-processing step in practical quantum cryptography systems. When statistical fluctuations are taken into consideration, the requirement of large input data size could heavily penalise the speed and resource consumption of the randomness extraction process, thereby limiting the overall system performance. In this work, we propose a sampled sub-block hashing approach to circumvent this problem by randomly dividing the large input block into multiple sub-blocks and processing them individually. Through simulations and experiments, we demonstrate that our method achieves an order-of-magnitude improvement in system throughput while keeping the resource utilisation low. Furthermore, our proposed approach is applicable to a generic class of quantum cryptographic protocols that satisfy the generalised entropy accumulation framework, presenting a highly promising and general solution for high-speed post-processing in quantum cryptographic applications such as quantum key distribution and quantum random number generation.

Related papers

• Quadratic Advantage with Quantum Randomized Smoothing Applied to Time-Series Analysis [0.0]
  We present an analysis of quantum randomized smoothing, how data encoding and perturbation modeling approaches can be matched to achieve meaningful robustness certificates. We show how constrained $k$-distant Hamming weight perturbations are a suitable noise distribution here, and elucidate how they can be constructed on a quantum computer. This may allow quantum computers to efficiently scale randomized smoothing to more complex tasks beyond the reach of classical methods.
  arXiv  Detail & Related papers  (2024-07-25T13:15:16Z)
• Random Aggregate Beamforming for Over-the-Air Federated Learning in Large-Scale Networks [66.18765335695414]
  We consider a joint device selection and aggregate beamforming design with the objectives of minimizing the aggregate error and maximizing the number of selected devices. To tackle the problems in a cost-effective manner, we propose a random aggregate beamforming-based scheme. We additionally use analysis to study the obtained aggregate error and the number of the selected devices when the number of devices becomes large.
  arXiv  Detail & Related papers  (2024-02-20T23:59:45Z)
• Real-Time Seedless Post-Processing for Quantum Random Number Generators [3.9265817364556503]
  We introduce a real-time two-source quantum randomness extractor against quantum side information. Our extractor is tailored for forward block sources, a novel category of min-entropy sources. Applying our extractors to the raw data of one of the most commonly used quantum random number generators, we achieve a simulated extraction speed as high as 64 Gbps.
  arXiv  Detail & Related papers  (2024-01-29T03:41:07Z)
• Randomized semi-quantum matrix processing [0.0]
  We present a hybrid quantum-classical framework for simulating generic matrix functions. The method is based on randomization over the Chebyshev approximation of the target function. We prove advantages on average depths, including quadratic speed-ups on costly parameters.
  arXiv  Detail & Related papers  (2023-07-21T18:00:28Z)
• Improved Real-time Post-Processing for Quantum Random Number Generators [10.453509966841022]
  We propose two novel quantum-proof randomness extractors for reverse block sources that realize real-time block-wise extraction. Our designs achieve a significantly higher extraction speed and a longer output data length with the same seed length. Applying our extractors to the raw data generated by a widely used quantum random number generator, we achieve a simulated extraction speed as high as $300$ Gbps.
  arXiv  Detail & Related papers  (2023-01-20T15:02:37Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Super-resolution GANs of randomly-seeded fields [68.8204255655161]
  We propose a novel super-resolution generative adversarial network (GAN) framework to estimate field quantities from random sparse sensors. The algorithm exploits random sampling to provide incomplete views of the high-resolution underlying distributions. The proposed technique is tested on synthetic databases of fluid flow simulations, ocean surface temperature distributions measurements, and particle image velocimetry data.
  arXiv  Detail & Related papers  (2022-02-23T18:57:53Z)
• Quantum verification and estimation with few copies [63.669642197519934]
  The verification and estimation of large entangled systems represents one of the main challenges in the employment of such systems for reliable quantum information processing. This review article presents novel techniques focusing on a fixed number of resources (sampling complexity) and thus prove suitable for systems of arbitrary dimension. Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of selective quantum state tomography.
  arXiv  Detail & Related papers  (2021-09-08T18:20:07Z)
• Uncorrelated problem-specific samples of quantum states from zero-mean Wishart distributions [4.289102530380288]
  We present a two-step algorithm for sampling from the quantum state space. We establish the explicit form of the induced Wishart distribution for quantum states. We demonstrate that this sampling algorithm is very efficient for one-qubit and two-qubit states, and reasonably efficient for three-qubit states.
  arXiv  Detail & Related papers  (2021-06-16T03:06:41Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Efficiently Sampling Functions from Gaussian Process Posteriors [76.94808614373609]
  We propose an easy-to-use and general-purpose approach for fast posterior sampling. We demonstrate how decoupled sample paths accurately represent Gaussian process posteriors at a fraction of the usual cost.
  arXiv  Detail & Related papers  (2020-02-21T14:03:16Z)

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.