Related papers: Improved Constructions of Two-Source Extractors

Superconducting qubits provide a promising platform for physically realising quantum computers at scale. Such devices require precision control at microwave frequencies. Common practice is to synthesise such control signals using IQ…

We consider the problem of constructing fast and small binary adder circuits. Among widely-used adders, the Kogge-Stone adder is often considered the fastest, because it computes the carry bits for two $n$-bit numbers (where $n$ is a power…

Spectrally-tunable quantum-light sources are key elements for the realization of long-distance quantum communication. A deterministically fabricated single-photon source with a photon-extraction efficiency of {\eta}=(20 +- 2) % and a tuning…

We prove an exponential decay concentration inequality to bound the tail probability of the difference between the log-likelihood of discrete random variables on a finite alphabet and the negative entropy. The concentration bound we derive…

We generalize an efficient exact synthesis algorithm for single-qubit unitaries over the Clifford+T gate set which was presented by Kliuchnikov, Maslov and Mosca. Their algorithm takes as input an exactly synthesizable single-qubit…

Here we consider perfect entanglers from another perspective. It is shown that there are some {\em special} perfect entanglers which can maximally entangle a {\em full} product basis. We have explicitly constructed a one-parameter family of…

The development of high-energy, high-power, multi-octave light-transients is currently subject of intense research driven by emerging applications in attosecond spectroscopy and coherent control. We report on a phase-stable, multi-octave…

This article studies one-generator and two-generator quasi-cyclic codes over finite fields. We present two versions of necessary and sufficient conditions for the symplectic selforthogonality of one-generator quasi-cyclic codes, using both…

The entropy accumulation theorem states that the smooth min-entropy of an $n$-partite system $A = (A_1, \ldots, A_n)$ is lower-bounded by the sum of the von Neumann entropies of suitably chosen conditional states up to corrections that are…

Quantum random number generation is a technique to generate random numbers by extracting randomness from specific quantum processes. As for practical random number generators, they are required not only to have no information leakage but…

The resource overhead required to achieve net computational benefits from quantum error correction (QEC) limits its utility while current systems remain constrained in size, despite exceptional progress in experimental demonstrations. In…

A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…

Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle. In practice, unfortunately, the quantum randomness is inevitably mixed with classical randomness due to…

Tensor completion exhibits an interesting computational-statistical gap in terms of the number of samples needed to perform tensor estimation. While there are only $\Theta(tn)$ degrees of freedom in a $t$-order tensor with $n^t$ entries,…

We present the problem of two-terminal source coding with Common Sum Reconstruction (CSR). Consider two terminals, each with access to one of two correlated sources. Both terminals want to reconstruct the sum of the two sources under some…

Here we present two novel contributions for achieving quantum advantage in solving difficult optimisation problems, both in theory and foreseeable practice. (1) We introduce the "Quantum Tree Generator", an approach to generate in…

Quantum computing carries significant potential for addressing practical problems. However, currently available quantum devices suffer from noisy quantum gates, which degrade the fidelity of executed quantum circuits. Therefore, quantum…

We propose a hierarchical meta-learning-inspired model for music source separation (Meta-TasNet) in which a generator model is used to predict the weights of individual extractor models. This enables efficient parameter-sharing, while still…

We prove a lower estimate on the increase in entropy when two copies of a conditional random variable $X | Y$, with $X$ supported on $\mathbb{Z}_q=\{0,1,\dots,q-1\}$ for prime $q$, are summed modulo $q$. Specifically, given two i.i.d copies…

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. We find that the mixed multiplicative…