Related papers: Weak coin flipping with small bias

In this work, we establish a nontrivial level of distribution for densities on $\{1,\ldots, N\}$ obtained by a biased coin convolution. As a consequence of sieving theory, one then derives the expected lower bound for the weight of such…

Ferrie and Combes [PRL 113 120404 (2014)] produce a classical measurement scheme that supposedly exhibits `anomalous' weak values. I show that their model is flawed due to an incorrect definition of the weak value. As a consequence their…

Given a sequence of numbers $\{p_n\}$ in $[0,1]$, consider the following experiment. First, we flip a fair coin and then, at step $n$, we turn the coin over to the other side with probability $p_n$, $n\ge 2$. What can we say about the…

We formulate and prove a general weak limit theorem for quantum random walks in one and more dimensions. With $X_n$ denoting position at time $n$, we show that $X_n/n$ converges weakly as $n \to \infty$ to a certain distribution which is…

We discuss the security implications of noise for quantum coin tossing protocols. We find that if quantum error correction can be used, so that noise levels can be made arbitrarily small, then reasonable security conditions for coin tossing…

We demonstrate the conditional reversal of a weak (partial-collapse) quantum measurement on a photonic qubit. The weak quantum measurement causes a nonunitary transformation of a qubit which is subsequently reversed to the original state…

The weak values and weak measurement formalism were initially limited to pure states, which were later extended to mixed states, leading to intriguing applications in quantum information processing tasks. Weak values are considered to be…

We demonstrate a means of detecting weak optical transitions in cold atoms that undergo cyclic routines with high sensitivity. The gain in sensitivity is made by probing atoms on alternate cycles leading to a regular modulation of the…

flip is an extremely simple and maximally local classical decoder which has been used to great effect in certain classes of classical codes. When applied to quantum codes there exist constant-weight errors (such as half of a stabiliser)…

A protocol of quantum dense coding protection of two qubits is proposed in amplitude damping (AD) channel using weak measurement and reversal measurement. It is found that the capacity of quantum dense coding under the weak measurement and…

The most elementary quantum walk is characterized by a 2-dimensional unitary coin flip matrix, which can be parameterized by 4 real variables. The influence of the choice of the coin flip matrix on the time evolution operator is analysed in…

This paper explores the well known approximation approach to decide weak bisimilarity of Basic Parallel Processes. We look into how different refinement functions can be used to prove weak bisimilarity decidable for certain subclasses. We…

We propose a practical quantum oblivious transfer and a bit commitment protocols which replace the single-photon source with weak coherent pulses and allow error and loss in channel and detectors. These protocols can be realized with…

We discuss the (twisted) weak positivity theorem. We also treat some applications.

The lack of perfect randomness can cause significant problems in securing communication between two parties. McInnes and Pinkas proved that unconditionally secure encryption is impossible when the key is sampled from a weak random source.…

The quantum measurement procedure based on the Lorentz transformation formalism and weak perturbation of the system is considered. In the simple case of a single-qubit it turns out that one can perform 4-dimension pseudo-rotation along with…

Within the simultaneous message passing model of communication complexity, under a public-coin assumption, we derive the minimum achievable worst-case error probability of a classical fingerprinting protocol with one-sided error. We then…

We provide tight upper and lower bounds on the noise resilience of interactive communication over noisy channels with feedback. In this setting, we show that the maximal fraction of noise that any robust protocol can resist is 1/3.…

Blind quantum computation allows a client with limited quantum capabilities to interact with a remote quantum computer to perform an arbitrary quantum computation, while keeping the description of that computation hidden from the remote…

TCP is the dominating transmission protocol in the Internet since decades. It proved its flexibility to adapt to unknown and changing network conditions. A distinguished TCP feature is the comparably fair resource sharing. Unfortunately,…