Search

Quantum tomography is a widely applicable method for reconstructing unknown quantum states and processes. However, its applications in quantum technologies usually also require estimating the difference between prepared and target quantum states with reliable confidence intervals. In this work we suggest a computationally efficient and reliable scheme for determining well-justified error bars for quantum tomography. We approximate the probability distribution of the Hilbert-Schmidt distance between the target state and the estimation, which is given by the linear inversion, by calculating its two moments. We also present a generalization of this approach for quantum process tomography and deriving confidence intervals for affine functions. We benchmark our approach for a number of quantum tomography protocols using both simulation and demonstration with the use of a cloud-accessible quantum processor. The obtained results pave the way for the use of the suggested scheme for the complete characterization of quantum systems of various natures., Comment: 8 pages, 5 figures, 4 tables

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., Comment: 7 pages, 1 figure, 2 tables

We describe a class of "neighboring-blocks" stabilizer quantum error correction codes and demonstrate that such class of codes can be implemented in a resource-efficient manner using a single ancilla and circular near-neighbor qubit connectivity. We propose an implementation for syndrome-measurement circuits for codes from the class and illustrate its workings for cases of 3-qubit repetition code, Laflamme's 5-qubit code, and Shor's 9-qubit code. For 3-qubit repetition code and Laflamme's 5-qubit code suggested scheme has the property that it uses only native two-qubit CNS gates, which potentially reduces the amount of non-correctable errors due to the shorter gate time. Elements of the scheme can be used to implement surface code with near-neighbour connectivity using single ancilla, as demonstrated in an example. We developed efficient decoding procedures for repetition codes and the Laflamme's 5-qubit code using a minimum weight-perfect matching approach to account for the specific order of measurements in our scheme. The analysis of noise levels for which the scheme could show improvements in the fidelity of a stored logical qubit in the 3-qubit repetition code and Laflamme's 5-qubit code cases is provided. We complement our results by realizing the developed scheme for a 3-qubit code using an IBM quantum processor and the Laflamme's 5-qubit code using the state-vector simulator., Comment: 27 pages, 33 figures

We present a continuous monitoring system for intermediate-scale quantum processors that allows extracting estimates of noisy native gate and read-out measurements based on the set of executed quantum circuits and resulting measurement outcomes. In contrast to standard approaches for calibration and benchmarking quantum processors, the executed circuits, which are input to the monitoring system, are assumed to be out of any control. We provide the results of applying our system to the synthetically generated data obtained from a quantum emulator, as well as to the experimental data collected from a publicly accessible cloud-based quantum processor. In the both cases, we demonstrate that the developed approach provides valuable results about inherent noises of emulators/processors. Considering that our approach uses only already accessible data from implemented circuits without the need to run additional algorithms, the monitoring system can complement existing approaches. We expect that our monitoring system can become a useful tool for various quantum computers in the near-term horizon, including publicly accessible cloud-based platforms, and reduce resources that are required for their benchmarking and calibration., Comment: 14 pages, 11 figures, 3 tables

Quantum technologies require methods for preparing and manipulating entangled multiparticle states. However, the problem of determining whether a given quantum state is entangled or separable is known to be an NP-hard problem in general, and even the task of detecting entanglement breakdown for a given class of quantum states is difficult. In this work, we develop an approach for revealing entanglement breakdown using a machine learning technique, which is known as 'learning by confusion'. We consider a family of quantum states, which is parameterized such that there is a single critical value dividing states within this family into separate and entangled. We demonstrate the 'learning by confusion' scheme allows us to determine the critical value. Specifically, we study the performance of the method for the two-qubit, two-qutrit, and two-ququart entangled state. In addition, we investigate the properties of the local depolarization and the generalized amplitude damping channel in the framework of the confusion scheme. Within our approach and setting the parameterization of special trajectories, we obtain an entanglement-breakdown 'phase diagram' of a quantum channel, which indicates regions of entangled (separable) states and the entanglement-breakdown region. Then we extend the way of using the 'learning by confusion' scheme for recognizing whether an arbitrary given state is entangled or separable. We show that the developed method provides correct answers for a variety of states, including entangled states with positive partial transpose. We also present a more practical version of the method, which is suitable for studying entanglement breakdown in noisy intermediate-scale quantum devices. We demonstrate its performance using an available cloud-based IBM quantum processor., Comment: 14 pages, 9 figures, 4 tables

Efficient realization of quantum algorithms is among main challenges on the way towards practical quantum computing. Various libraries and frameworks for quantum software engineering have been developed. Here we present a software package containing implementations of various quantum gates and well-known quantum algorithms using PennyLane library. Additoinally, we used a simplified technique for decomposition of algorithms into a set of gates which are native for trapped-ion quantum processor and realized this technique using PennyLane library. The decomposition is used to analyze resources required for an execution of Shor's algorithm on the level of native operations of trapped-ion quantum computer. Our original contribution is the derivation of coefficients needed for implementation of the decomposition. Templates within the package include all required elements from the quantum part of Shor's algorithm, specifically, efficient modular exponentiation and quantum Fourier transform that can be realized for an arbitrary number of qubits specified by a user. All the qubit operations are decomposed into elementary gates realized in PennyLane library. Templates from the developed package can be used as qubit-operations when defining a QNode., Comment: 20 pages, 9 figures

The problem of finding efficient decompositions of multi-qubit gates is of importance for quantum computing, especially, in application to existing noisy intermediate-scale quantum devices, whose resources are substantially limited. Here we propose a decomposition scheme for a generalized $N$-qubit Toffoli gate with the use of $2N-3$ two-qutrit gates for arbitrary connectivity. The fixed number of the required additional levels (the choice of qutrits is optimal) and the use of the iSWAP gate as a native operation make our approach directly applicable for ongoing experiments with superconducting quantum processors. Specifically, we present a blueprint of the realization of the proposed scheme for the Aspen-9 processor supporting quantum operations with qutrits., Comment: 6 pages, 3 figures, 1 table

In the present work, we propose a generalization of the confidence polytopes approach for quantum state tomography (QST) to the case of quantum process tomography (QPT). Our approach allows obtaining a confidence region in the polytope form for a Choi matrix of an unknown quantum channel based on the measurement results of the corresponding QPT experiment. The method uses the improved version of the expression for confidence levels for the case of several positive operator-valued measures (POVMs). We then demonstrate how confidence polytopes can be employed for calculating confidence intervals for affine functions of quantum states (Choi matrices), such as fidelities and observables mean values, which are used both in QST and QPT settings. As we propose, this problem can be efficiently solved using linear programming tools. We also study the performance and scalability of the developed approach on the basis of simulation and experimental data collected using IBM cloud quantum processor., Comment: 11 pages, 3 figures; proof-of-principle realization of the method is available at https://doi.org/10.5281/zenodo.5752345

Digital signatures are widely used for providing security of communications. At the same time, the security of currently deployed digital signature protocols is based on unproven computational assumptions. An efficient way to ensure an unconditional (information-theoretic) security of communication is to use quantum key distribution (QKD), whose security is based on laws of quantum mechanics. In this work, we develop an unconditionally secure signature scheme that guarantees authenticity and transferability of arbitrary length messages in a QKD network. In the proposed setup, the QKD network consists of two subnetworks: (i) an internal network that includes the signer and with limitation on the number of malicious nodes and (ii) an external network that has no assumptions on the number of malicious nodes. A consequence of the absence of the trust assumption in the external subnetwork is the necessity of assistance from internal subnetwork recipients for the verification of message-signature pairs by external subnetwork recipients. We provide a comprehensive security analysis of the developed scheme, perform an optimization of the scheme parameters with respect to the secret key consumption, and demonstrate that the developed scheme is compatible with the capabilities of currently available QKD devices., Comment: 18 pages, 5 figures

Quantum computing technologies pose a significant threat to the currently employed public-key cryptography protocols. In this paper, we discuss the impact of the quantum threat on public key infrastructures (PKIs), which are used as a part of security systems for protecting production environments. We analyze security issues of existing models with a focus on requirements for a fast transition to post-quantum solutions. Although our primary focus is on the attacks with quantum computing, we also discuss some security issues that are not directly related to the used cryptographic algorithms but are essential for the overall security of the PKI. We attempt to provide a set of security recommendations regarding the PKI from the viewpoints of attacks with quantum computers., Comment: 24 pages, 1 figure

A precise understanding of the influence of a quantum system's environment on its dynamics, which is at the heart of the theory of open quantum systems, is crucial for further progress in the development of controllable large-scale quantum systems. However, existing approaches to account for complex system-environment interaction in the presence of memory effects are either based on heuristic and oversimplified principles or give rise to computational difficulties. In practice, one can leverage on available experimental data and replace first-principles simulations with a data-driven analysis that is often much simpler. Inspired by recent advances in data analysis and machine learning, we propose a data-driven approach to the analysis of the non-Markovian dynamics of open quantum systems. Our method allows, on the one hand, capturing the most important characteristics of open quantum systems such as the effective dimension of the environment and the spectrum of the joint system-environment quantum dynamics, and, on the other hand, reconstructing a predictive model of non-Markovian quantum dynamics, and denoising the measured quantum trajectories. We demonstrate the performance of the proposed approach with various models of open quantum systems, including a qubit coupled with a finite environment, a spin-boson model, and the damped Jaynes-Cummings model.

Quantum cryptography or, more precisely, quantum key distribution (QKD), is one of the advanced areas in the field of quantum technologies. The confidentiality of keys distributed with the use of QKD protocols is guaranteed by the fundamental laws of quantum mechanics. This paper is devoted to the decoy state method, a countermeasure against vulnerabilities caused by the use of coherent states of light for QKD protocols whose security is proved under the assumption of single-photon states. We give a formal security proof of the decoy state method against all possible attacks. We compare two widely known attacks on multiphoton pulses: photon-number splitting and beam splitting. Finally, we discuss the equivalence of polarization and phase coding., Comment: 18 pages, 1 figure; review article

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)., Comment: 6 pages, 3 figures

In the present work, we suggest an approach for describing dynamics of finite-dimensional quantum systems in terms of pseudostochastic maps acting on probability distributions, which are obtained via minimal informationally complete quantum measurements. The suggested method for probability representation of quantum dynamics preserves the tensor product structure, which makes it favourable for the analysis of multi-qubit systems. A key advantage of the suggested approach is that minimal informationally complete positive operator-valued measures (MIC-POVMs) are easier to construct in comparison with their symmetric versions (SIC-POVMs). We establish a correspondence between the standard quantum-mechanical formalism and the MIC-POVM-based probability formalism. Within the latter approach, we derive equations for the unitary von-Neumann evolution and the Markovian dissipative evolution, which is governed by the Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) generator. We apply the MIC-POVM-based probability representation to the digital quantum computing model. In particular, for the case of spin-$1/2$ evolution, we demonstrate identifying a transition of a dissipative quantum dynamics to a completely classical-like stochastic dynamics. One of the most important findings is that the MIC-POVM-based probability representation gives more strict requirements for revealing the non-classical character of dissipative quantum dynamics in comparison with the SIC-POVM-based approach. Our results give a physical interpretation of quantum computations and pave a way for exploring the resources of noisy intermediate-scale quantum (NISQ) devices., Comment: 19 pages, 8 figures, 2 tables

Recent advances in DNA sequencing open prospects to make whole-genome analysis rapid and reliable, which is promising for various applications including personalized medicine. However, existing techniques for {\it de novo} genome assembly, which is used for the analysis of genomic rearrangements, chromosome phasing, and reconstructing genomes without a reference, require solving tasks of high computational complexity. Here we demonstrate a method for solving genome assembly tasks with the use of quantum and quantum-inspired optimization techniques. Within this method, we present experimental results on genome assembly using quantum annealers both for simulated data and the $\phi$X 174 bacteriophage. Our results pave a way for an increase in the efficiency of solving bioinformatics problems with the use of quantum computing and, in particular, quantum annealing. We expect that the new generation of quantum annealing devices would outperform existing techniques for {\it de novo} genome assembly. To the best of our knowledge, this is the first experimental study of de novo genome assembly problems both for real and synthetic data on quantum annealing devices and quantum-inspired techniques., Comment: 9 pages, 4 figures

In this work, we discuss in detail a flaw in the original security proof of the W-OTS${^+}$ variant of the Winternitz one-time signature scheme, which is an important component for various stateless and stateful many-time hash-based digital signature schemes. We update the security proof for the W-OTS${^+}$ scheme and derive the corresponding security level. Our result is of importance for the security analysis of hash-based digital signature schemes., Comment: 16 pages, 1 figure, 1 table

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., Comment: 6 pages, 4 figures

We construct a new protocol for attribute-based encryption with the use of the modification of the standard secret sharing scheme. In the suggested modification of the secret sharing scheme, only one master key for each user is required that is achieved by linearly enlarging public parameters in the access formula. We then use this scheme for designing an attribute-based encryption protocol related to some access structure in terms of attributes. We demonstrate that the universe of possible attributes does not affect the resulting efficiency of the scheme. The security proofs for both constructions are provided., Comment: 15 pages

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., Comment: 6 pages, 3 figures, 2 tables

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., Comment: 7 pages; 3 figures

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., Comment: 16 pages, 5 figures, 2 tables

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., Comment: 11 pages, 5 figures, 1 table; published version

In the present work, a peculiar property of hash-based signatures allowing detection of their forgery event is explored. This property relies on the fact that a successful forgery of a hash-based signature most likely results in a collision with respect to the employed hash function, while the demonstration of this collision could serve as convincing evidence of the forgery. Here we prove that with properly adjusted parameters Lamport and Winternitz one-time signatures schemes could exhibit a forgery detection availability property. This property is of significant importance in the framework of crypto-agility paradigm since the considered forgery detection serves as an alarm that the employed cryptographic hash function becomes insecure to use and the corresponding scheme has to be replaced., Comment: 17 pages, 4 figures

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., Comment: 10 pages, 2 figures; published version

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., Comment: 5 pages, 2 figures, 3 tables

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., Comment: 16 pages, 5 figures, 4 tables

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., Comment: 12 pages, 12 figures

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., Comment: 25 pages

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., Comment: 6 pages, 2 figures

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., Comment: 4 pages, 3 figures

Quantum key distribution (QKD) offers a way for establishing information-theoretically secure communications. An important part of QKD technology is a high-quality random number generator (RNG) for quantum states preparation and for post-processing procedures. In the present work, we consider a novel class of prepare-and-measure QKD protocols, utilizing additional pseudorandomness in the preparation of quantum states. We study one of such protocols and analyze its security against the intercept-resend attack. We demonstrate that, for single-photon sources, the considered protocol gives better secret key rates than the BB84 and the asymmetric BB84 protocol. However, the protocol strongly requires single-photon sources., Comment: 16 pages, 4 figures; comments are welcome

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., Comment: 7 pages, 2 figures; published version

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., Comment: 5 pages, 3 figures

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 $\epsilon$-universal hash functions, which allows verifying the identity between the keys with a certain probability., Comment: 4 pages; 1 figure; published version

Decoy-state quantum key distribution is a standard tool for long-distance quantum communications. An important issue in this field is processing the decoy-state statistics taking into account statistical fluctuations (or "finite-key effects"). In this work, we propose and analyze an option for decoy statistics processing, which is based on the central limit theorem. We discuss such practical issues as an inclusion of the failure probability of the decoy-states statistical estimates in the total failure probability of a QKD protocol and also taking into account the deviations of the binomially distributed random variables used in the estimations from the Gaussian distribution. The results of numerical simulations show that the obtained estimations are quite tight. The proposed technique can be used as a part of post-processing procedures for industrial quantum key distribution systems., Comment: 8 pages, 2 figures; published version

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., Comment: 6 pages, 3 figures; published version

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., Comment: 10 pages, 4 figures; published version

We consider a new type of attack on a coherent quantum key distribution protocol [coherent one-way (COW) protocol]. The main idea of the attack consists in measuring individually the intercepted states and sending the rest of them unchanged. We have calculated the optimum values of the attack parameters for an arbitrary length of a channel length and compared this novel attack with a standard beam-splitting attack., Comment: 6 pages, 2 figures; comments are welcome

We study quantum information properties of a seven-level system realized by a particle in an one-dimensional square-well trap. Features of encodings of seven-level systems in a form of three-qubit or qubit-qutrit systems are discussed. We use the three-qubit encoding of the system in order to investigate subadditivity and strong subadditivity conditions for the thermal state of the particle. The qubit-qutrit encoding is employed to suggest a single qudit algorithm for calculation of parity of a bit string. Obtained results indicate on the potential resource of multilevel systems for realization of quantum information processing., Comment: 6 pages, 3 figures; published version

We present algorithmic solutions aimed on post-processing for industrial quantum key distribution systems with hardware sifting. The main steps of the procedure are error correction, parameter estimation, and privacy amplification. Authentication of a classical public communication channel is also considered., Comment: 5 pages; presented at the 3rd International School and Conference "Saint-Petersburg OPEN 2016" (Saint-Petersburg, March 28-30, 2016)

We present a bidirectional modification of the standard one-qubit teleportation protocol, where both Alice and Bob transfer noisy versions of their qubit states to each other by using single Bell state and auxiliary (trigger) qubits. Three schemes are considered: the first where the actions of parties are governed by two independent quantum random triggers, the second with single random trigger, and the third as a mixture of the first two. We calculate the fidelities of teleportation for all schemes and find a condition on correlation between trigger qubits in the mixed scheme which allows us to overcome the classical fidelity boundary of 2/3. We apply the Choi-Jamiolkowski isomorphism to the quantum channels obtained in order to investigate an interplay between their ability to transfer the information, entanglement-breaking property, and auxiliary classical communication needed to form correlations between trigger qubits. The suggested scheme for bidirectional teleportation can be realized by using current experimental tools., Comment: 8 pages, 4 figures; published version

Teleportation protocol is conventionally treated as a method for quantum state transfer between two spatially separated physical carriers. Recent experimental progress in manipulation with high-dimensional quantum systems opens a new framework for implementation of teleportation protocols. We show that the one-qubit teleportation can be considered as a state transfer between subspaces of the whole Hilbert space of an indivisible eight-dimensional system. We explicitly show all corresponding operations and discuss an alternative way of implementation of similar tasks., Comment: 4 pages, 1 figure, 1 table

Although the general theory macroscopic quantum entanglement of is still in its infancy, consideration of the matter in the framework of action-at-a distance electrodynamics predicts for the random dissipative processes observability of the advanced nonlocal correlations. These correlations were really revealed in our previous experiments with some large-scale heliogeophysical processes as the source ones and the lab detectors as the probe ones. Recently a new experiment has been performing on the base of Baikal Deep Water Neutrino Observatory. The thick water layer is an excellent shield against any local impacts on the detectors. The first annual series 2012/2013 has demonstrated that detector signals respond to the heliogeophysical processes and causal connection of the signals directed downwards: from the Earth surface to the Baikal floor. But this nonlocal connection proved to be in reverse time. In addition advanced nonlocal correlation of the detector signal with the regional source-process: the random component of hydrological activity in the upper layer was revealed and the possibility of its forecast on nonlocal correlations was demonstrated. But the strongest macroscopic nonlocal correlations are observed at extremely low frequencies, that is at periods of several months. Therefore the above results should be verified in a longer experiment. We verify them by data of the second annual series 2013/2014 of the Baikal experiment. All the results have been confirmed, although some quantitative parameters of correlations and time reversal causal links turned out different due to nonstationarity of the source-processes. A new result is displaying of the advanced response of nonlocal correlation detector to the earthquake. This opens up the prospect of the earthquake forecast on the new physical principle, although further confirmation in the next events is certainly needed., Comment: 9 pages, 9 figures

Design of a large-scale quantum computer has paramount importance for science and technologies. We investigate a scheme for realization of quantum algorithms using noncomposite quantum systems, i.e., systems without subsystems. In this framework, $n$ artificially allocated "subsystems" play a role of qubits in $n$-qubits quantum algorithms. With focus on two-qubit quantum algorithms, we demonstrate a realization of the universal set of gates using a $d=5$ single qudit state. Manipulation for an ancillary level in the systems allows effective implementation of operators from ${\rm U}(4)$ group via operators from ${\rm SU}(5)$ group. Using a possible experimental realization of such systems through anharmonic superconducting many-level quantum circuits, we present a blueprint for a single qudit realization of the Deutsch algorithm, which generalizes previously studied realization based on the virtual spin representation [A.R. Kessel et al., Phys. Rev. A 66, 062322 (2002)]., Comment: 6 pages, 4 figures, 1 table; published version

We theoretically study operations with a four-level superconducting circuit as a two-qubit system. Using a mapping on a two-qubit system, we show how to implement iSWAP gates and Hadamard gates through pulses on transitions between particular pairs of energy levels. Our approach allows one to prepare pure two-qubit entangled states with desired form of reduced density matrices of the same purity and, in particular, arbitrary identical reduced states of qubits. We propose using schemes for the Hadamard gate and two-qubit entangled states with identical reduced density matrices in order to verify $\log{N}$ inequalities for Shannon and R\'enyi entropies for the considered noncomposite quantum system., Comment: 7 pages, 3 figures; published version