arXiv subjects

A. K. Fedorov

Publications and source records attributed to A. K. Fedorov.

At least 37 records · Page 2Linked to original sources

arXiv2022

Free Fock parafermions in the tight-binding model with dissipation

Parafermions that generalize (Majorana or usual) fermions appear as interacting quasi-particles because of their nature. Although attempts to develop models with free (non-interacting) parafermions have been undertaken, existing proposals require unphysical conditions such as realizing purely non-Hermitian systems. Here we present a way for the realization of free Fock parafermions in the tight-binding model with controlled dissipation of a very simple form. Introducing dissipation transforms an originally non-integrable quantum model to an exactly solvable classical one.

cond-mat.quant-gas↗

arXiv2022

Confidence polytopes for quantum process tomography

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.

quant-ph↗

arXiv2022

Practical quantum multiparty signatures using quantum-key-distribution networks

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.

quant-ph↗

arXiv2021

Proof-of-forgery for hash-based signatures

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.

cs.CR↗

arXiv2021

Optimizing the deployment of quantum key distribution switch-based networks

Quantum key distribution (QKD) networks provide an infrastructure for establishing information-theoretic secure keys between legitimate parties via quantum and authentic classical channels. The deployment of QKD networks in real-world conditions faces several challenges, which are related in particular to the high costs of QKD devices and the condition to provide reasonable secret key rates. In this work, we present a QKD network architecture that provides a significant reduction in the cost of deploying QKD networks by using optical switches and reducing the number of QKD receiver devices, which use single-photon detectors. We describe the corresponding modification of the QKD network protocol. We also provide estimations for a network link of a total of 670 km length consisting of 8 nodes, and demonstrate that the switch-based architecture allows achieving significant resource savings of up to 28%, while the throughput is reduced by 8% only.

quant-ph↗

arXiv2021

Security analysis of the W-OTS$^+$ signature scheme: Updating security bounds

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.

cs.CR↗

arXiv2021

Genome assembly using quantum and quantum-inspired annealing

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 $ϕ$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.

quant-ph↗

arXiv2021

Towards security recommendations for public-key infrastructures for production environments in the post-quantum era

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.

quant-ph↗

arXiv2021

Quantum phase transition of a two-dimensional quadrupolar system

Ensembles with long-range interactions between particles are promising for revealing strong quantum collective effects and many-body phenomena. Here we study the ground-state phase diagram of a two-dimensional Bose system with quadrupolar interactions using a diffusion Monte Carlo technique. We predict a quantum phase transition from a gas to a solid phase. The Lindemann ratio and the condensate fraction at the transition point are $γ=0.269(4)$ and $n_0/n=0.031(4)$, correspondingly. We observe the strong rotonization of the collective excitation branch in the vicinity of the phase transition point. Our results can be probed using state-of-the-art experimental systems of various nature, such as quasi-two-dimensional systems of quadrupolar excitons in transition metal dichalcogenide (TMD) trilayers, quadrupolar molecules, and excitons or Rydberg atoms with quadrupole moments induced by strong magnetic fields.

cond-mat.quant-gas↗

arXiv2021

Security of the decoy state method for quantum key distribution

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.

quant-ph↗

arXiv2021

Learning phase transitions in ferrimagnetic GdFeCo alloys

We present results on the identification of phase transitions in ferrimagnetic GdFeCo alloys using machine learning. The approach for finding phase transitions in the system is based on the `learning by confusion' scheme, which allows one to characterize phase transitions using a universal $W$-shape. By applying the `learning by confusion' scheme, we obtain 2D $W$-a shaped surface that characterizes a triple phase transition point of the GdFeCo alloy. We demonstrate that our results are in the perfect agreement with the procedure of the numerical minimization of the thermodynamical potential, yet our machine-learning-based scheme has the potential to provide a speedup in the task of the phase transition identification.

cond-mat.mtrl-sci↗

arXiv2020

Advanced attribute-based protocol based on the modified secret sharing scheme

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.

cs.CR↗

arXiv2020

Lie-algebraic approach to one-dimensional translationally invariant free-fermionic dissipative systems

We study dissipative translationally invariant free-fermionic theories with quadratic Liouvillians. Using a Lie-algebraic approach, we solve the Lindblad equation and find the density matrix at all times for arbitrary time dependence of the Liouvillian. We then investigate the Liouvillian spectral properties and derive a generic criterion for the closure of the dissipative gap, which is believed to be linked with nonequilibrium dissipative phase transitions. We illustrate our findings with a few exotic examples. Particularly, we show the presence of gapless modes with a linear spectrum for fermions with long-range hopping, which might be related to nonunitary conformal field theories. The predicted effects can be probed in experiments with ultracold atomic and quantum-optical systems using currently available experimental facilities.

quant-ph↗

arXiv2020

Minimal informationally complete measurements for probability representation of quantum dynamics

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.

quant-ph↗

arXiv2020

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↗

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

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↗