Related papers: Relative error due to a single bit-flip in floatin…
We detect and quantify significant numerical biases in the determination of the slope of power laws with Salpeter (or similar) indices from uniformly-binned data using chi-square minimization. The biases are caused by the correlation…
Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…
In this work, we provide energy-efficient architectural support for floating point accuracy. Our goal is to provide accuracy that is far greater than that provided by the processor's hardware floating point unit (FPU). Specifically, for…
In the setting of error-correcting codes with feedback, Alice wishes to communicate a $k$-bit message $x$ to Bob by sending a sequence of bits over a channel while noiselessly receiving feedback from Bob. It has been long known (Berlekamp,…
We demonstrate a quantum error correction scheme that protects against accidental measurement, using an encoding where the logical state of a single qubit is encoded into two physical qubits using a non-deterministic photonic CNOT gate. For…
The Inverse Problem for the estimation of a point-wise approximation error occurring at the discretization and solving of the system of partial differential equations is addressed. The set of the differences between the numerical solutions…
We study how entanglement among the register qubits affects the gate fidelity in the one-way quantum computation if a measurement is inaccurate. We derive an inequality which shows that the mean gate fidelity is upper bounded by a…
Error-correcting codes are usually envisioned to counter errors by operating unitary corrections depending on the projective measurement results of some syndrome observables. We here propose a way to use them in a more integrated way, where…
We probabilistically analyze the performance of the arithmetic coding algorithm under a probability model for binary data in which a message is received by a coder from a source emitting independent equally distributed bits, with 1…
We establish a sharp estimate for a minimal number of binary digits (bits) needed to represent all bounded total generalized variation functions taking values in a general totally bounded metric space $(E,\rho)$ up to an accuracy of…
We prove limit theorems for the number of fixed points occurring in a random pattern-avoiding permutation distributed according to a one-parameter family of biased distributions. The bias parameter exponentially tilts the distribution…
We describe a procedure based on the iteration of an initial function by an appropriated operator, acting on continuous functions, in order to get a fixed point. This fixed point will be a calibrated subaction for the doubling map on the…
Alice seeks an information-theoretically secure source of private random data. Unfortunately, she lacks a personal source and must use remote sources controlled by other parties. Alice wants to simulate a coin flip of specified bias…
We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup (with respect to the number of variables) compared to prior…
We study K-equivalent birational maps which are resolved by a single blowup. Examples of such maps include standard flops and twisted Mukai flops. We give a criterion for such maps to be a standard flop or a twisted Mukai flop. As an…
Estimates of the quantum accuracy threshold often tacitly assume that it is possible to interact arbitrary pairs of qubits in a quantum computer with a failure rate that is independent of the distance between them. None of the many physical…
In this paper, we present a loss-tolerant quantum strong coin flipping protocol with bias 0.359. This is an improvement over Berlin etal's protocol [BBBG08] which achieves a bias of 0.4. To achieve this, we extend Berlin et al.'s protocol…
This thesis examines a modern concept for machine numbers based on interval arithmetic called 'Unums' and compares it to IEEE 754 floating-point arithmetic, evaluating possible uses of this format where floating-point numbers are…
We present a quantum protocol for the task of weak coin flipping. We find that, for one choice of parameters in the protocol, the maximum probability of a dishonest party winning the coin flip if the other party is honest is 1/sqrt(2). We…
In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…