Related papers: Optimum ratio between two bases in Bennett-Brassar…
The phase randomized light is one of the key assumptions in the security proof of Bennett-Brassard 1984 (BB84) quantum key distribution (QKD) protocol implemented with an attenuated laser. Though the assumption has been believed to be…
Quantum key distribution (QKD) systems require optimal performance of both quantum and classical channels - utilizing as few as possible qubits and bits for establishing as many as possible key bits. Here we report a way to determine if a…
We study ordinal approximation algorithms for maximum-weight bipartite matchings. Such algorithms only know the ordinal preferences of the agents/nodes in the graph for their preferred matches, but must compete with fully omniscient…
We present new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to two related exponential codeword length objectives. The objectives explored here are exponential-average…
The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applications in wireless communication networks. In this paper, we…
We analyze the security of the two-way continuous-variable quantum key distribution protocol in reverse reconciliation against general two-mode attacks, which represent all accessible attacks at fixed channel parameters. Rather than against…
This paper suggests an improvement to the BB84 scheme in Quantum key distribution. The original scheme has its weakness in letting quantifiably more information gain to an eavesdropper during public announcement of unencrypted bases lists.…
In this paper we derive a new bound on the secret key-rate of the High Dimensional BB84 protocol operating with multiple mutually unbiased bases (MUBs). To our knowledge, our proof is the first for this protocol that is both general (in…
We introduce a quantum cloning bound which we apply to a straightforward and relatively direct security proof of the prepare-and-measure Bennett-Brassard 1984 (BB84) quantum key distribution (QKD) protocol against collective attacks. The…
We study the problem of minimizing a sum of convex objective functions where the components of the objective are available at different nodes of a network and nodes are allowed to only communicate with their neighbors. The use of…
A general framework of optimal eavesdropping on BB84 protocol was provided by Fuchs et al. [Phys. Rev. A, 1997]. An upper bound on mutual information was derived, which could be achieved by a specific type of interaction and the…
The optimization of Binary Neural Networks (BNNs) relies on approximating the real-valued weights with their binarized representations. Current techniques for weight-updating use the same approaches as traditional Neural Networks (NNs) with…
Distinguishability of photons in non-operational degrees of freedom compromises unconditional security of quantum key distribution since an eavesdropper can improve attack strategies by exploiting this distinguishability. However, the…
A method to compute the optimal success probability of discrimination of N arbitrary quantum states is presented, based on the decomposition of any N-outcome measurement into sequences of nested two-outcome ones. In this way the…
In this work, we address the problem of Hessian inversion bias in distributed second-order optimization algorithms. We introduce a novel shrinkage-based estimator for the resolvent of gram matrices which is asymptotically unbiased, and…
In this paper, we try to uncover the second-order essence of several first-order optimization methods. For Nesterov Accelerated Gradient, we rigorously prove that the algorithm makes use of the difference between past and current gradients,…
The security of two-state quantum key distribution against individual attack is estimated when the channel has losses and noises. We assume that Alice and Bob use two nonorthogonal single-photon polarization states. To make our analysis…
Large-scale distributed training of deep neural networks suffer from the generalization gap caused by the increase in the effective mini-batch size. Previous approaches try to solve this problem by varying the learning rate and batch size…
It is shown that the optimum strategy of the eavesdropper, as described in the preceding paper, can be expressed in terms of a quantum circuit in a way which makes it obvious why certain parameters take on particular values, and why…
We present an approach to the unconditional security of quantum key distribution protocols based on the uncertainty principle. The approach applies to every case that has been treated via the argument by Shor and Preskill, and relieve them…