Related papers: Improved Constructions of Two-Source Extractors

We obtain a first order post-Minkowskian two-body effective potential whose post-Newtonian expansion directly reproduces the Einstein-Infeld-Hoffmann potential. Post-Minkowskian potentials can be extracted from on-shell scattering…

We show that using qutrits rather than qubits leads to a substantial reduction in the overhead cost associated with an approach to fault-tolerant quantum computing known as magic state distillation. We construct a family of $[[9m-k, k,…

Two different constructions generating the low-energy expansion of genus-one configuration-space integrals appearing in one-loop open-string amplitudes have been put forward in \rcites{Mafra:2019xms, *Mafra:2019ddf, Broedel:2019gba}. We are…

We study the effects of introducing a feedback channel in the two-receiver erasure source-broadcast problem in which a binary equiprobable source is to be sent over an erasure broadcast channel to two receivers subject to erasure distortion…

How to implement quantum oracle with limited resources raises concerns these days. We design two ancilla-adjustable and efficient algorithms to synthesize SAT-oracle, the key component in solving SAT problems. The previous work takes 2m-1…

We establish improved bounds for bilinear forms with Kloosterman fractions of the form ${\sum\sum}_{m,n} \alpha_m \beta_n e(a\overline{m}/(bn))$ with $M<m\le 2M$, $N < n \le 2N$ and $(m,n)=1$. Our approach works directly with arbitrary…

We develop efficient binary (i.e., 1-bit) and multi-bit coding schemes for estimating the scale parameter of $\alpha$-stable distributions. The work is motivated by the recent work on one scan 1-bit compressed sensing (sparse signal…

In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime $p$ less than $x$, the basic idea is to fix a constant $q\propto x^{1-\varepsilon}$, pick a uniformly…

We demonstrate how using two qubits can drastically improve the estimation of environment parameters as compared to using only a single qubit. The two qubits are coupled to a common harmonic oscillatorenvironment, and the properties of the…

Random bit generators (RBGs) are key components of a variety of information processing applications ranging from simulations to cryptography. In particular, cryptographic systems require "strong" RBGs that produce high-entropy bit…

We present novel and sharp lower bounds for higher load moments in the classical problem of mapping $M$ balls into $N$ bins by $q$-universal hashing, specialized to the case when $M=N$. As a corollary we prove a tight counterpart for the…

Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…

Estimating the second frequency moment of a stream up to $(1\pm\varepsilon)$ multiplicative error requires at most $O(\log n / \varepsilon^2)$ bits of space, due to a seminal result of Alon, Matias, and Szegedy. It is also known that at…

An optimized digital shaping filter has been developed for the GERDA experiment which searches for neutrinoless double beta decay in 76Ge. The GERDA Phase I energy calibration data have been reprocessed and an average improvement of 0.3 keV…

Two-Ievel (qubit) clock systems are often used to perform precise measurement of time. In this work, we propose a compression protocol for $n$ identically prepared states of qubit clocks. The protocol faithfully encodes the states into…

We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with non destructive single-shot readout of the two qubits. With this processor, we run the Grover…

We prove that a unitary matrix has an exact representation over the Clifford+T gate set with local ancillas if and only if its entries are in the ring Z[1/sqrt(2),i]. Moreover, we show that one ancilla always suffices. These facts were…

In this paper we provide an explicit bound for $|\zeta(1+it)|$ in the form of $|\zeta(1+it)|\leq \min\left(\log t, \frac{1}{2}\log t+1.93, \frac{1}{5}\log t+44.02 \right)$. This improves on the current best-known explicit bound of…

We consider the multi-user lossy source-coding problem for continuous alphabet sources. In a previous work, Ziv proposed a single-user universal coding scheme which uses uniform quantization with dither, followed by a lossless source…

Constructing explicit RIP matrices is an open problem in compressed sensing theory. In particular, it is quite challenging to construct explicit RIP matrices that break the square-root bottleneck. On the other hand, providing explicit…