Related papers: New coins from old: computing with unknown bias

Physical Unclonable Functions (PUFs) are modern solutions for cheap and secure key storage. The security level strongly depends on a PUF's unpredictability, which is impaired if certain bits of the PUF response tend towards the same value…

This paper develops a comprehensive probabilistic setup to compute approximating functions in active subspaces. Constantine et al. proposed the active subspace method in (Constantine et al., 2014) to reduce the dimension of computational…

The seminal idea of quantum money not forgeable due to laws of Quantum Mechanics proposed by Stephen Wiesner, has laid foundations for the Quantum Information Theory in early '70s. Recently, several other schemes for quantum currencies have…

Wiesner's unforgeable quantum money scheme is widely celebrated as the first quantum information application. Based on the no-cloning property of quantum mechanics, this scheme allows for the creation of credit cards used in authenticated…

A pseudorandom code is a keyed error-correction scheme with the property that any polynomial number of encodings appear random to any computationally bounded adversary. We show that the pseudorandomness of any code tolerating a constant…

Let $\theta \in(0,1)$ and $(\mathcal{M},\tau)$ be a semifinite von Neumann algebra. We consider the function spaces introduced by Sobolev (denoted by $S_{d,\theta}$), showing that there exists a constant $d>0 $ depending on $p$, $0<p\le…

Investigating the classical simulability of quantum circuits provides a promising avenue towards understanding the computational power of quantum systems. Whether a class of quantum circuits can be efficiently simulated with a probabilistic…

By using a new way to encode Boolean functions in a reversible gate, an algorithm is developed in quantum computing over Z_2, symbolized QC/2, (as opposed to QC over C) that needs only one function evaluation to solve the Grover Database…

Fixpoints are ubiquitous in computer science and when dealing with quantitative semantics and verification one often considers least fixpoints of (higher-dimensional) functions over the non-negative reals. We show how to approximate the…

For $1<p\leq 2$, any $n\geq 1$ and any $f:\{-1,1\}^{n} \to \mathbb{R}$, we obtain $(\mathbb{E} |\nabla f|^{p})^{1/p} \geq C(p)(\mathbb{E}|f|^{p} - |\mathbb{E}f|^{p})^{1/p}$ where $C(p)$ is the smallest positive zero of the confluent…

Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs, serving as secure fingerprints for cryptographic protocols like authentication. Quantum PUFs (QPUFs) extend this…

We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs.…

It is well known that if a function $f$ satisfies $$\|f(x) e^{\pi \alpha |x|^2}\|_p + \| \widehat{f}(\xi) e^{\pi \alpha |\xi|^2} \|_q<\infty \qquad\qquad\qquad(*)$$ with $\alpha=1$ and $1\le p,q<\infty$, then $f\equiv 0.$ We prove that if…

We determine the {\em real} counting function $N(q)$ ($q\in [1,\infty)$) for the hypothetical "curve" $C=\overline {\Sp \Z}$ over $\F_1$, whose corresponding zeta function is the complete Riemann zeta function. Then, we develop a theory of…

In this paper we address the following question: given $ p\in (1,\infty)$, $n \geq 1$, does there exists a constant $A(p,n)>1$ such that $\| M f\|_{L^{p}}\geq A(n,p) \| f\|_{L^{p}}$ for any nonnegative $f \in L^{p}(\mathbb{R}^{n})$, where…

The problem of creating a three-sided dice with the probability of it landing on each of its sides being equal to 1/3 has been around for many years. Various approaches have been attempted, but as different authors achieved at different…

Let $\{f_i:\mathbb{F}_p^i \to \{0,1\}\}$ be a sequence of functions, where $p$ is a fixed prime and $\mathbb{F}_p$ is the finite field of order $p$. The limit of the sequence can be syntactically defined using the notion of ultralimit.…

A landmark result from rational approximation theory states that $x^{1/p}$ on $[0,1]$ can be approximated by a type-$(n,n)$ rational function with root-exponential accuracy. Motivated by the recursive optimality property of Zolotarev…

We show that some problems in information security can be solved without using one-way functions. The latter are usually regarded as a central concept of cryptography, but the very existence of one-way functions depends on difficult…

We define the pivotal set of a Boolean function and we prove a fundamental inequality on its expected size, when the inputs are independent random coins of parameter~$p$. We give two complete proofs of this inequality. Along the way, we…