44 citations · 116 across the 5 of their papers we have counts for
5 papers
Polynomial unconstrained binary optimisation inspired by optical simulation
Dmitry A. Chermoshentsev, Aleksei O. Malyshev, Mert Esencan +5
We propose an algorithm inspired by optical coherent Ising machines to solve the problem of polynomial unconstrained binary optimization (PUBO). We benchmark the proposed algorithm…
Blind information reconciliation with polar codes for quantum key distribution
E. O. Kiktenko, A. O. Malyshev, A. K. Fedorov
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 i…
Probability representation of quantum dynamics using pseudostochastic maps
E. O. Kiktenko, A. O. Malyshev, A. S. Mastiukova +3
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 d…
Lightweight authentication for quantum key distribution
E. O. Kiktenko, A. O. Malyshev, M. A. Gavreev +4
Quantum key distribution (QKD) enables unconditionally secure communication between distinct parties using a quantum channel and an authentic public channel. Reducing the portion o…
Error estimation at the information reconciliation stage of quantum key distribution
E. O. Kiktenko, A. O. Malyshev, A. A. Bozhedarov +3
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…