arXiv subjects

A. O. Malyshev

Publications and source records attributed to A. O. Malyshev.

4 recordsLinked to original sources

arXiv2020

Lightweight authentication for quantum key distribution

Quantum key distribution (QKD) enables unconditionally secure communication between distinct parties using a quantum channel and an authentic public channel. Reducing the portion of quantum-generated secret keys, that is consumed during the authentication procedure, is of significant importance for improving the performance of QKD systems. In the present work, we develop a lightweight authentication protocol for QKD based on a `ping-pong' scheme of authenticity check for QKD. An important feature of this scheme is that the only one authentication tag is generated and transmitted during each of the QKD post-processing rounds. For the tag generation purpose, we design an unconditionally secure procedure based on the concept of key recycling. The procedure is based on the combination of almost universal$_2$ polynomial hashing, XOR universal$_2$ Toeplitz hashing, and one-time pad (OTP) encryption. We demonstrate how to minimize both the length of the recycled key and the size of the authentication key, that is required for OTP encryption. As a result, in real case scenarios, the portion of quantum-generated secret keys that is consumed for the authentication purposes is below 1\%. Finally, we provide a security analysis of the full quantum key growing process in the framework of universally composable security.

quant-ph↗

arXiv2020

Blind information reconciliation with polar codes for quantum key distribution

We suggest a new protocol for the information reconciliation stage of quantum key distribution based on polar codes. The suggested approach is based on the blind technique, which is proved to be useful for low-density parity-check (LDPC) codes. We show that the suggested protocol outperforms the blind reconciliation with LDPC codes, especially when there are high fluctuations in quantum bit error rate (QBER).

quant-ph↗

arXiv2020

Probability representation of quantum dynamics using pseudostochastic maps

In this work, we consider a probability representation of quantum dynamics for finite-dimensional quantum systems with the use of pseudostochastic maps acting on true probability distributions. These probability distributions are obtained via symmetric informationally complete positive operator-valued measure (SIC-POVM) and can be directly accessible in an experiment. We provide SIC-POVM probability representations both for unitary evolution of the density matrix governed by the von Neumann equation and dissipative evolution governed by Markovian master equation. In particular, we discuss whereas the quantum dynamics can be simulated via classical random processes in terms of the conditions for the master equation generator in the SIC-POVM probability representation. We construct practical measures of nonclassicality non-Markovianity of quantum processes and apply them for studying experimental realization of quantum circuits realized with the IBM cloud quantum processor.

quant-ph↗

arXiv2018

Error estimation at the information reconciliation stage of quantum key distribution

Quantum key distribution (QKD) offers a practical solution for secure communication between two distinct parties via a quantum channel and an authentic public channel. In this work, we consider different approaches to the quantum bit error rate (QBER) estimation at the information reconciliation stage of the post-processing procedure. For reconciliation schemes employing low-density parity-check (LDPC) codes, we develop a novel syndrome-based QBER estimation algorithm. The algorithm suggested is suitable for irregular LDPC codes and takes into account punctured and shortened bits. Testing our approach in a real QKD setup, we show that an approach combining the proposed algorithm with conventional QBER estimation techniques allows one to improve the accuracy of the QBER estimation.

quant-ph↗