English
Related papers

Related papers: Correlation Bounds and Markov Analysis for Ring-Os…

200 papers

Despite the ubiquity of U-statistics in modern Probability and Statistics, their non-asymptotic analysis in a dependent framework may have been overlooked. In a recent work, a new concentration inequality for U-statistics of order two for…

Statistics Theory · Mathematics 2023-01-25 Quentin Duchemin , Yohann De Castro , Claire Lacour

We present a fully digital framework that replicates the statistical behavior of coherent-state quantum random number generation (QRNG) by harnessing system timing jitter through random permutation processes. Our approach transforms…

Quantum Physics · Physics 2025-12-15 Randy Kuang

Multi-label ranking, which returns multiple top-ranked labels for each instance, has a wide range of applications for visual tasks. Due to its complicated setting, prior arts have proposed various measures to evaluate model performances.…

Machine Learning · Computer Science 2024-07-10 Zitai Wang , Qianqian Xu , Zhiyong Yang , Peisong Wen , Yuan He , Xiaochun Cao , Qingming Huang

The true random number generators (TRNGs) have received extensive attention because of their wide applications in information transmission and encryption. The true random numbers generated by TRNG are typically applied to the encryption…

Applied Physics · Physics 2020-06-24 Yong Yao , Xing Chen , Wang Kang , Youguang Zhang , Weisheng Zhao

We present an efficient method to extract the amount of true randomness that can be obtained by a Quantum Random Number Generator (QRNG). By repeating the measurements of a quantum system and by swapping between two mutually unbiased bases,…

Quantum Physics · Physics 2014-12-23 G. Vallone , D. Marangon , M. Tomasin , P. Villoresi

Randomized benchmarking is a powerful technique to efficiently estimate the performance and reliability of quantum gates, circuits and devices. Here we propose to perform randomized benchmarking in a coherent way, where superpositions of…

Quantum Physics · Physics 2021-07-14 Jorge Miguel-Ramiro , Alexander Pirker , Wolfgang Dür

With the widespread use of communication technologies, cryptosystems are therefore critical to guarantee security over open networks as the Internet. Pseudo-random number generators (PRNGs) are fundamental in cryptosystems and information…

Cryptography and Security · Computer Science 2011-12-06 Jacques M. Bahi , Jean-François Couchot , Christophe Guyeux , Qianxue Wang

We report on an experimental investigation of the transition of a quantum system with integrable classical dynamics to one with violated time-reversal (T) invariance and chaotic classical counterpart. High-precision experiments are…

Quantum Physics · Physics 2024-01-30 Xiaodong Zhang , Weihua Zhang , Jiongning Che , Barbara Dietz

Recently, the precise performance of the Generalized LASSO algorithm for recovering structured signals from compressed noisy measurements, obtained via i.i.d. Gaussian matrices, has been characterized. The analysis is based on a framework…

Information Theory · Computer Science 2015-03-26 Christos Thrampoulidis , Babak Hassibi

We present several different types of multivariate statistical techniques used in the measurement of the inclusive top pair production cross section in $p \bar{p}$-collisions at $\sqrt{s} = 1.96 \text{TeV}$ employing the full RunII data…

High Energy Physics - Experiment · Physics 2014-12-15 Jiří Franc , Petr Bouř , Michal Štěpánek , Václav Kůs

Quantum Random Number Generators (QRNGs) emerged as a promising solution for generating truly random numbers. In the present article, we give an overview of QRNGs highlighting the merits and demerits of various strategies briefly. Then…

The quantum entanglement is an important feature of many protocols in the field of quantum computing. In this paper we evaluate a level of entanglement in short qutrit chains. This evaluation is carried out with use of the CCNR criterion…

Quantum Physics · Physics 2015-10-21 Marek Sawerwain , Joanna Wiśniewska

We present a statistical framework for extracting spatially resolved entanglement directly from an ensemble of marginal (one-body) wavefunctions in Time-Dependent Quantum Monte Carlo (TDQMC). Treating the guide waves as a statistical…

Quantum Physics · Physics 2026-05-05 Ivan P. Christov

We address the problem of detecting deviations of binary sequence from randomness,which is very important for random number (RNG) and pseudorandom number generators (PRNG). Namely, we consider a null hypothesis $H_0$ that a given bit…

Information Theory · Computer Science 2007-07-13 B. Ya. Ryabko , V. A. Monarev

In this paper, we derive non-asymptotic achievability and converse bounds on the random number generation with/without side-information. Our bounds are efficiently computable in the sense that the computational complexity does not depend on…

Information Theory · Computer Science 2016-09-28 Masahito Hayashi , Shun Watanabe

The zeros of the random Laurent series $1/\mu - \sum_{j=1}^\infty c_j/z^j$, where each $c_j$ is an independent standard complex Gaussian, is known to correspond to the scaled eigenvalues of a particular additive rank 1 perturbation of a…

Mathematical Physics · Physics 2018-07-19 Peter J. Forrester , Jesper R. Ipsen

Some recent work on confidence intervals for randomized quasi-Monte Carlo (RQMC) sampling found a surprising result: ordinary Student $t$ 95% confidence intervals based on a modest number of replicates were seen to be very effective and…

Numerical Analysis · Mathematics 2025-03-26 Zexin Pan , Art B. Owen

Quantum technologies promise information processing and communication technology advancements, including random number generation (RNG). Using Bell inequalities, a user of a quantum RNG hardware can certify that the values provided by an…

Quantum Physics · Physics 2025-11-20 Robert Okuła , Piotr Mironowicz

The paper presents exponentially-strong converses for source-coding, channel coding, and hypothesis testing problems. More specifically, it presents alternative proofs for the well-known exponentially-strong converse bounds for almost…

Information Theory · Computer Science 2023-01-18 Mustapha Hamad , Michele Wigger , Mireille Sarkiss

In this paper, we present a method to certify the approximation quality of a low rank tensor to a given third order symmetric tensor. Under mild assumptions, best low rank approximation is attained if a control parameter is zero or…

Optimization and Control · Mathematics 2023-07-21 Shenglong Hu , Defeng Sun , Kim-Chuan Toh
‹ Prev 1 3 4 5 6 7 10 Next ›