Searcharxiv⌕ Search

arXiv subjects

E. O. Kiktenko

Publications and source records attributed to E. O. Kiktenko.

At least 37 records · Page 2Linked to original sources

Tomographic and entropic analysis of modulated signals

We study an application of the quantum tomography framework for the time-frequency analysis of modulated signals. In particular, we calculate optical tomographic representations and Wigner-Ville distributions for signals with amplitude and frequency modulations. We also consider time-frequency entropic relations for modulated signals, which are naturally associated with the Fourier analysis. A numerical toolbox for calculating optical time-frequency tomograms based on pseudo Wigner-Ville distributions for modulated signals is provided.

eess.SP↗

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↗

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↗

SPHINCS$^+$ post-quantum digital signature scheme with Streebog hash function

Many commonly used public key cryptosystems will become insecure once a scalable quantum computer is built. New cryptographic schemes that can guarantee protection against attacks with quantum computers, so-called post-quantum algorithms, have emerged in recent decades. One of the most promising candidates for a post-quantum signature scheme is SPHINCS$^+$, which is based on cryptographic hash functions. In this contribution, we analyze the use of the new Russian standardized hash function, known as Streebog, for the implementation of the SPHINCS$^+$ signature scheme. We provide a performance comparison with SHA-256-based instantiation and give benchmarks for various sets of parameters.

cs.CR↗

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↗

Protecting quantum systems from decoherence with unitary operations

Decoherence is a fundamental obstacle to the implementation of large-scale and low-noise quantum information processing devices. In this work, we suggest an approach for suppressing errors by employing pre-processing and post-processing unitary operations, which precede and follow the action of a decoherence channel. In contrast to quantum error correction and measurement-based methods, the suggested approach relies on specifically designed unitary operators for a particular state without the need in ancillary qubits or post-selection procedures. We consider the case of decoherence channels acting on a single qubit belonging to a many-qubit state. Pre-processing and post-processing operators can be either individual, that is acting on the qubit effected by the decoherence channel only, or collective, that is acting on the whole multi-qubit state. We give a classification of possible strategies for the protection scheme, analyze them, and derive expressions for the optimal unitary operators providing the maximal value of the fidelity regarding initial and final states. Specifically, we demonstrate the equivalence of the schemes where one of the unitary operations is individual while the other is collective. We then consider the realization of our approach for the basic decoherence models, which include single-qubit depolarizing, dephasing, and amplitude damping channels. We also demonstrate that the decoherence robustness of multi-qubit states for these decoherence models is determined by the entropy of the reduced state of the qubit undergoing the decoherence channel.

quant-ph↗

Scalable quantum computing with qudits on a graph

We show a significant reduction of the number of quantum operations and the improvement of the circuit depth for the realization of the Toffoli gate by using qudits. This is done by establishing a general relation between the dimensionality of qudits and their topology of connections for a scalable multi-qudit processor, where higher qudit levels are used for substituting ancillas. The suggested model is of importance for the realization of quantum algorithms and as a method of quantum error correction codes for single-qubit operations.

quant-ph↗

Revealing quantum chaos with machine learning

Understanding properties of quantum matter is an outstanding challenge in science. In this paper, we demonstrate how machine-learning methods can be successfully applied for the classification of various regimes in single-particle and many-body systems. We realize neural network algorithms that perform a classification between regular and chaotic behavior in quantum billiard models with remarkably high accuracy. We use the variational autoencoder for autosupervised classification of regular/chaotic wave functions, as well as demonstrating that variational autoencoders could be used as a tool for detection of anomalous quantum states, such as quantum scars. By taking this method further, we show that machine learning techniques allow us to pin down the transition from integrability to many-body quantum chaos in Heisenberg XXZ spin chains. For both cases, we confirm the existence of universal W shapes that characterize the transition. Our results pave the way for exploring the power of machine learning tools for revealing exotic phenomena in quantum many-body systems.

quant-ph↗

Estimating the precision for quantum process tomography

Quantum tomography is a widely applicable tool for complete characterization of quantum states and processes. In the present work, we develop a method for precision-guaranteed quantum process tomography. With the use of the Choi-Jamiolkowski isomorphism, we generalize the recently suggested extended norm minimization estimator for the case of quantum processes. Our estimator is based on the Hilbert-Schmidt distance for quantum processes. Specifically, we discuss the application of our method for characterizing quantum gates of a superconducting quantum processor in the framework of the IBM Q Experience.

quant-ph↗

Detecting brute-force attacks on cryptocurrency wallets

Blockchain is a distributed ledger, which is protected against malicious modifications by means of cryptographic tools, e.g. digital signatures and hash functions. One of the most prominent applications of blockchains is cryptocurrencies, such as Bitcoin. In this work, we consider a particular attack on wallets for collecting assets in a cryptocurrency network based on brute-force search attacks. Using Bitcoin as an example, we demonstrate that if the attack is implemented successfully, a legitimate user is able to prove that fact of this attack with a high probability. We also consider two options for modification of existing cryptocurrency protocols for dealing with this type of attacks. First, we discuss a modification that requires introducing changes in the Bitcoin protocol and allows diminishing the motivation to attack wallets. Second, an alternative option is the construction of special smart-contracts, which reward the users for providing evidence of the brute-force attack. The execution of this smart-contract can work as an automatic alarm that the employed cryptographic mechanisms, and (particularly) hash functions, have an evident vulnerability.

cs.CR↗

Modular quantum key distribution setup for research and development applications

Quantum key distribution (QKD), ensuring the unconditional security of information, attracts a significant deal of interest. An important task is to design QKD systems as a platform for education as well as for research and development applications and fast prototyping new QKD protocols. Here we present a modular QKD setup driven by National Instruments (NI) cards with open source LabView code, open source Python code for post-processing procedures, and open source protocol for external applications. An important feature of the developed apparatus is its flexibility offering possibilities to modify optical schemes and verify novel QKD protocols. Another distinctive feature of the developed setup is the implementation of the decoy-state protocol, which is a standard tool for secure long-distance quantum communications. By testing the plug-and-play scheme realizing BB84 and decoy-state BB84 QKD protocols, we demonstrate that developed QKD setup shows a high degree of robustness beyond laboratory conditions. We demonstrate the results of the use of the developed modular setup for urban QKD experiments.

quant-ph↗

Symmetric blind information reconciliation for quantum key distribution

Quantum key distribution (QKD) is a quantum-proof key-exchange scheme which is fast approaching the communication industry. An essential component in QKD is the information reconciliation step, which is used for correcting the quantum-channel noise errors. The recently suggested blind reconciliation technique, based on low-density parity-check (LDPC) codes, offers remarkable prospectives for efficient information reconciliation without an a priori error rate estimation. We suggest an improvement of the blind-information-reconciliation protocol promoting a significant increase in the efficiency of the procedure and reducing its interactivity. The proposed technique is based on introducing symmetry in operations of parties, and the consideration of results of unsuccessful belief-propagation decodings.

quant-ph↗

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↗

Quantum communication protocols as a benchmark for quantum computers

We point out that realization of quantum communication protocols in programmable quantum computers provides a deep benchmark for capabilities of real quantum hardware. Particularly, it is prospective to focus on measurements of entropy-based characteristics of the performance and to explore whether a "quantum regime" is preserved. We perform proof-of-principle implementations of superdense coding and quantum key distribution BB84 using 5- and 16-qubit superconducting quantum processors of IBM Quantum Experience. We focus on the ability of these quantum machines to provide an efficient transfer of information between distant parts of the processors by placing Alice and Bob at different qubits of the devices. We also examine the ability of quantum devices to serve as quantum memory and to store entangled states used in quantum communication. Another issue we address is an error mitigation. Although it is at odds with benchmarking, this problem is nevertheless of importance in a general context of quantum computation with noisy quantum devices. We perform such a mitigation and noticeably improve some results.

quant-ph↗

Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution

We consider an information reconciliation protocol for quantum key distribution (QKD). In order to correct down the error rate, we suggest a method, which is based on symmetric blind information reconciliation for the low-density parity-check (LDPC) codes. We develop a subsequent verification protocol with the use of $ε$-universal hash functions, which allows verifying the identity between the keys with a certain probability.

quant-ph↗

Quantum-secured data transmission in urban fibre-optic communication lines

Quantum key distribution (QKD) provides theoretic information security in communications based on the laws of quantum physics. In this work, we report an implementation of quantum-secured data transmission in the infrastructure of Sberbank of Russia in standard communication lines in Moscow. The experiment is realized on the basis of already deployed urban fiber-optics communication channels with significant losses. We realize the decoy-state BB84 QKD protocol using the one-way scheme with polarization encoding for generating keys. Quantum-generated keys are then used for continuous key renewal in the hardware devices for establishing a quantum-secured VPN Tunnel between two offices of Sberbank. The hybrid approach used offers possibilities for long-term protection of the transmitted data; it is promising for integrating into the already existing information security infrastructure.

quant-ph↗

Quantum-secured blockchain

Blockchain is a distributed database which is cryptographically protected against malicious modifications. While promising for a wide range of applications, current blockchain platforms rely on digital signatures, which are vulnerable to attacks by means of quantum computers. The same, albeit to a lesser extent, applies to cryptographic hash functions that are used in preparing new blocks, so parties with access to quantum computation would have unfair advantage in procuring mining rewards. Here we propose a possible solution to the quantum era blockchain challenge and report an experimental realization of a quantum-safe blockchain platform that utilizes quantum key distribution across an urban fiber network for information-theoretically secure authentication. These results address important questions about realizability and scalability of quantum-safe blockchains for commercial and governmental applications.

quant-ph↗

Demonstration of a quantum key distribution network in urban fibre-optic communication lines

We report the results of the implementation of a quantum key distribution (QKD) network using standard fibre communication lines in Moscow. The developed QKD network is based on the paradigm of trusted repeaters and allows a common secret key to be generated between users via an intermediate trusted node. The main feature of the network is the integration of the setups using two types of encoding, i.e. polarisation encoding and phase encoding. One of the possible applications of the developed QKD network is the continuous key renewal in existing symmetric encryption devices with a key refresh time of up to 14 s.

quant-ph↗