arXiv subjects

A. A. Bozhedarov

Publications and source records attributed to A. A. Bozhedarov.

3 recordsLinked to original sources

arXiv2023

Quantum and quantum-inspired optimization for solving the minimum bin packing problem

Quantum computing devices are believed to be powerful in solving hard computational tasks, in particular, combinatorial optimization problems. In the present work, we consider a particular type of the minimum bin packing problem, which can be used for solving the problem of filling spent nuclear fuel in deep-repository canisters that is relevant for atomic energy industry. We first redefine the aforementioned problem it in terms of quadratic unconstrained binary optimization. Such a representation is natively compatible with existing quantum annealing devices as well as quantum-inspired algorithms. We then present the results of the numerical comparison of quantum and quantum-inspired methods. Results of our study indicate on the possibility to solve industry-relevant problems of atomic energy industry using quantum and quantum-inspired optimization.

quant-ph↗

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↗

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↗