Related papers: Correlation Bounds and Markov Analysis for Ring-Os…
The characterization of errors in a quantum system is a fundamental step for two important goals. First, learning about specific sources of error is essential for optimizing experimental design and error correction methods. Second,…
A leading proposal for verifying near-term quantum supremacy experiments on noisy random quantum circuits is linear cross-entropy benchmarking. For a quantum circuit $C$ on $n$ qubits and a sample $z \in \{0,1\}^n$, the benchmark involves…
Measurements can qualitatively alter correlations and entanglement emerging in gapless quantum matter. We show how a single round of measurements on gapless quantum systems can, upon rotating the measurement basis, induce non-trivial…
Computing partition functions, the normalizing constants of probability distributions, is often hard. Variants of importance sampling give unbiased estimates of a normalizer Z, however, unbiased estimates of the reciprocal 1/Z are harder to…
The multi-scale entanglement renormalization ansatz (MERA) is a tensor network that can efficiently parameterize critical ground states on a 1D lattice, and also suggestively implement some aspects of the holographic correspondence of…
We study the equivalence testing problem where the goal is to determine if the given two unknown distributions on $[n]$ are equal or $\epsilon$-far in the total variation distance in the conditional sampling model (CFGM, SICOMP16; CRS,…
We study entanglement in a simple model comprising two coupled linear harmonic oscillators of the same natural frequency. The system is separable in the center of mass (COM) and relative coordinates into two oscillators of frequency…
Consider a spiked random tensor obtained as a mixture of two components: noise in the form of a symmetric Gaussian $p$-tensor for $p\geq 3$ and signal in the form of a symmetric low-rank random tensor. The latter is defined as a linear…
Random Number Generators (RNGs) are crucial for applications ranging from cryptography to simulations. Depending on the source of randomness, RNGs are classified into Pseudo-Random Number Generators (PRNGs), True Random Number Generators…
Low-rank matrix recovery addresses the problem of recovering an unknown low-rank matrix from few linear measurements. Nuclear-norm minimization is a tractible approach with a recent surge of strong theoretical backing. Analagous to the…
Gurau (2020) proposed a generalization of the trace of the matrix resolvent to tensors of higher order, and recent work has explored analogs of the Wigner semicircle and Marchenko-Pastur distributions from random matrix theory as well as…
Given a symmetric social network, we are interested in testing whether it has only one community or multiple communities. The desired tests should (a) accommodate severe degree heterogeneity, (b) accommodate mixed-memberships, (c) have a…
The spectral test of random number generators (R.R. Coveyou and R.D. McPherson, 1967) is generalized. The sequence of random numbers is analyzed explicitly not just via their n-tupel distributions. The generalized analysis of many…
A structured random matrix ensemble that maintains constant modulus entries and unit-norm columns, often called a random phase-rotated (RPR) matrix, is considered in this paper. We analyze the coherence statistics of RPR measurement…
In many scientific tasks we are interested in discovering whether there exist any correlations in our data. This raises many questions, such as how to reliably and interpretably measure correlation between a multivariate set of attributes,…
The threshold scan at future lepton colliders is the most precise known method to determine the top quark mass (well below 100 MeV), a fundamental parameter of the Standard Model that co-determines the stability properties of the…
An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the…
We consider ensembles of real symmetric band matrices with entries drawn from an infinite sequence of exchangeable random variables, as far as the symmetry of the matrices permits. In general the entries of the upper triangular parts of…
To increase the number of wireless devices, e.g., mobile or IoT terminals, cryptosystems are essential for secure communications. In this regard, random number generation is crucial because the appropriate function of cryptosystems relies…
We establish quantitative bounds for rates of convergence and asymptotic variances for iterated conditional sequential Monte Carlo (i-cSMC) Markov chains and associated particle Gibbs samplers. Our main findings are that the essential…