• Home
  • Jarosław Adam Miszczak
Jarosław Adam Miszczak

Jarosław Adam Miszczak
Institute of Theoretical and Applied Informatics, Polish Academy of Sciences · Quantum Systems of Informatics

PhD

About

92
Publications
9,475
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
979
Citations
Citations since 2017
30 Research Items
616 Citations
2017201820192020202120222023020406080100120140
2017201820192020202120222023020406080100120140
2017201820192020202120222023020406080100120140
2017201820192020202120222023020406080100120140

Publications

Publications (92)
Article
Opinion formation is one of the most fascinating phenomena observed in human communities, and the ability to predict and to control the dynamics of this process is interesting from the theoretical as well as practical point of view. Although there are many sophisticated models of opinion formation, they often lack the connection with real life data...
Article
Full-text available
The area affected by the earthquake is vast and often difficult to entirely cover, and the earthquake itself is a sudden event that causes multiple defects simultaneously, that cannot be effectively traced using traditional, manual methods. This article presents an innovative approach to the problem of detecting damage after sudden events by using...
Preprint
Full-text available
The area affected by the earthquake is vast and often difficult to entirely cover, and the earthquake itself is a sudden event that causes multiple defects simultaneously, that cannot be effectively traced using traditional, manual methods. This article presents an innovative approach to the problem of detecting damage after sudden events by using...
Preprint
Full-text available
Opinion formation is one of the most fascinating phenomena observed in human communities, and the ability to predict and to control the dynamics of this process is interesting from the theoretical as well as practical point of view. Although there are many sophisticated models of opinion formation, they often lack the connection with real life data...
Article
Full-text available
One of the requirements imposed on the realistic quantum computers is to provide computation results which can be repeated and reproduced. In the situation when one needs to repeat the quantum computation procedure several times, it is crucial that the copies of the quantum devices are similar in the sense of the produced results. In this work, we...
Preprint
Full-text available
Nonclassical phenomena can be enhanced by introducing $q$-deformation in optomechanical systems. This motivated us to investigate the optical response in a $q$-deformed linearly coupled optomechanical system. The system consists of two deformed cavities that are linearly coupled to the motion of mechanical mirrors, and the cavities are coupled to e...
Article
Full-text available
Quantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, the problems need to be formulated as unconstrained binary models, taking into account limitation and advantages of quantum devices. In this work, we provide a detailed analysis of the t...
Article
The inequality in capital or resource distribution is among the important phenomena observed in populations. The sources of inequality and methods for controlling it are of practical interest. To study this phenomenon, we introduce a model of interaction between agents in the network designed for the purpose of reducing the inequality in the distri...
Preprint
Full-text available
The inequality in capital or resource distribution is among the important phenomena observed in populations. The sources of inequality and methods for controlling it are of practical interest. To study this phenomenon, we introduce a model of interaction between agents in the network designed for reducing the inequality in the distribution of capit...
Article
Full-text available
Monitoring the technical condition of infrastructure is a crucial element of its maintenance. Although there are many deep learning models intended for this purpose, they are severely limited in their application due to labour-intensive gathering of new datasets and high demand for computing power during model training. To overcome these limiting f...
Article
High demand for computational power significantly limits the possibility of using modern deep learning methods in the environments where one has to deal with devices limited by the performance and the energy constraints. To address this issue, this paper proposes a novel method of combining the pruning and the transfer learning (TL) techniques for...
Preprint
Full-text available
Noisy Intermediate-Scale Quantum (NISQ) algorithms require novel paradigms of error mitigation. To obtain noise-robust quantum computers, each logical qubit is equipped with hundreds or thousands of physical qubits. However, it is not possible to use memory-consuming techniques for current quantum devices having at most hundreds or at best thousand...
Preprint
Full-text available
In recent years, a lot of attention is paid to deep learning methods in the context of vision-based construction site safety systems, especially regarding personal protective equipment. However, despite all this attention, there is still no reliable way to establish the relationship between workers and their hard hats. To answer this problem a comb...
Preprint
Full-text available
Quantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, the problems need to be formulated as unconstrained binary models, taking into account limitation and advantages of quantum devices. In this work, we provide a detailed analysis of the T...
Chapter
The LP WAN networks use gateways or base stations to communicate with devices distributed on large distances, up to tens of kilometres. The selection of optimal gateway locations in wireless networks should allow providing the complete coverage for a given set of nodes, taking into account the limitations, such as the number of nodes served per acc...
Preprint
Full-text available
One of the requirements imposed on the realistic quantum computers is to provide computation results which can be repeated and reproduced. In the situation when one needs to repeat the quantum computation procedure several times, it is crucial that the copies of the quantum devices are similar in the sense of the produced results. In this work, we...
Preprint
Full-text available
The LP WAN networks use gateways or base stations to communicate with devices distributed on large distances, up to tens of kilometres. The selection of optimal gateway locations in wireless networks should allow providing the complete coverage for a given set of nodes, taking into account the limitations, such as the number of nodes served per acc...
Preprint
Full-text available
Monitoring the technical condition of infrastructure is a crucial element to its maintenance. Currently, the applied methods are outdated, labour intensive and highly inaccurate. At the same time, the latest methods using Artificial Intelligence techniques, despite achieving satisfactory results in the detection of infrastructure damage, are severe...
Article
Full-text available
In this paper, a co-evolution method of game dynamics and network structure is adopted to demonstrate that neighboring niches of an individual or population may have great influence in determining lifestyle adoption. The model encompasses network structure evolution, denoted CaseA, and pure games participated in by individuals in the network with t...
Preprint
The Parrondo's paradox is a counterintuitive phenomenon in which individually losing strategies, canonically termed game A and game B, are combined to produce winning outcomes. In this paper, a co-evolution of game dynamics and network structure is adopted to study adaptability and survivability in multi-agent dynamics. The model includes action A,...
Article
Full-text available
In this paper, we demonstrate that the efficiency of quantum spatial search can be significantly altered by malicious manipulation of the input data in the client–server model. We achieve this by exploiting exceptional configuration effect on Szegedy spatial search and proposing a framework suitable for analysing efficiency of attacks on quantum se...
Article
Full-text available
We study the functional relationship between quantum control pulses in the idealized case and the pulses in the presence of an unwanted drift. We show that a class of artificial neural networks called LSTM is able to model this functional relationship with high efficiency, and hence the correction scheme required to counterbalance the effect of the...
Article
We study the application of machine learning methods based on a geometrical and time-series character of data in the application to quantum control. We demonstrate that recurrent neural networks posses the ability to generalize the correction pulses with respect to the level of noise present in the system. We also show that the utilisation of the g...
Article
Full-text available
We introduce a framework suitable for describing standard classification problems using the mathematical language of quantum states. In particular, we provide a one-to-one correspondence between real objects and pure density operators. This correspondence enables us: (1) to represent the nearest mean classifier (NMC) in terms of quantum objects, (2...
Article
The main results of our work is determining the differences between limiting properties in various models of quantum stochastic walks. In particular, we prove that in the case of strongly connected and a class of weakly connected directed graphs, local environment interaction evolution is relaxing, and in the case of undirected graphs, global envir...
Article
Full-text available
The paper describes QSWALK.JL package for Julia programming language, developed for the purpose of simulating the evolution of open quantum systems. The package enables the study of quantum procedures developed using stochastic quantum walks on arbitrary directed graphs. We provide a detailed description of the implemented functions, along with a n...
Conference Paper
In the presented work, we aim at exploring the possibility of abandoning complex numbers in the representation of quantum states and operations. We demonstrate a simplified version of quantum mechanics in which the states are represented using real numbers only. The main advantage of this approach is that the simulation of the n-dimensional quantum...
Article
Full-text available
We introduce and study quantized versions of Cop and Robber game. We achieve this by using graph-preserving unitary operations, which are the quantum analogue of stochastic operations preserving the graph. We provide the tight bound for the number of operations required to reach the given state. By extending them to controlled operations, we define...
Article
Full-text available
In the presented note we aim at exploring the possibility of abandoning complex numbers in the representation of quantum states and operations. We demonstrate a simplified version of quantum mechanics in which the states are represented using real numbers only. The main advantage of this approach is that the simulation of the $n$-dimensional quantu...
Article
Full-text available
We introduce a framework suitable for describing pattern recognition task using the mathematical language of density matrices. In particular, we provide a one-to-one correspondence between patterns and density operators, represented by mixed states when the uncertainty comes into play. The classification process in the quantum framework is performe...
Article
Full-text available
The existence of an undetectable eavesdropping of dense coded information has been already demonstrated by Pavi\v{c}i\'c for the quantum direct communication based on the ping-pong paradigm. However, a) the explicit scheme of the circuit is only given and no design rules are provided, b) the existence of losses is implicitly assumed, c) the attack...
Article
Full-text available
We introduce a family of quantum walks on cycles parametrized by their liveliness, defined by the ability to execute a long-range move. We investigate the behaviour of the probability distribution and time-averaged probability distribution. We show that the liveliness parameter, controlling the magnitude of the additional long-range move, has a dir...
Article
Full-text available
We provide a complete work-flow, based on the language of quantum information theory, suitable for processing data for the purpose of pattern recognition. The main advantage of the introduced scheme is that it can be easily implemented and applied to process real-world data using modest computation resources. At the same time it can be used to inve...
Article
Full-text available
We introduce the model of generalized open quantum walks on networks using the Transition Operation Matrices formalism. We focus our analysis on the mean first passage time and the average return time in Apollonian networks. These results differ significantly from a classical walk on these networks. We show a comparison of the classical and quantum...
Article
Full-text available
We develop a model which can be used to analyse the scenario of exploring quantum network with a distracted sense of direction. Using this model we analyse the behaviour of quantum mobile agents operating with non-adaptive and adaptive strategies which can be employed in this scenario. We introduce the notion of node visiting suitable for analysing...
Article
Full-text available
We develop a framework which aims to simplify the analysis of quantum states and quantum operations by harnessing the potential of function programming paradigm. We show that the introduced framework allows a seamless manipulation of quantum channels, in particular to convert between different representations of quantum channels, and thus that the...
Article
Full-text available
We introduce a method of analyzing entanglement enhanced quantum games on regular lattices of agents. Our method is valid for setups with periodic and non-periodic boundary conditions. To demonstrate our approach we study two different types games, namely the prisoner's dilemma game and a cooperative Parrondo's game. In both cases we obtain results...
Article
Full-text available
We present a concise introduction of basic concepts in quantum information theory and quantum mechanics prepared as an introduction for a general audience. In our approach the rules of quantum mechanics are presented in a simple form of rules describing the method of constructing quantum objects corresponding to classical objects. As a byproduct of...
Article
Full-text available
We present a package for Mathematica computer algebra system which allows the exploitation of local files as sources of random data. We provide the description of the package and illustrate its usage by showing some examples. We also compare the provided functionality with alternative sources of randomness, namely a built-in pseudo-random generator...
Article
Full-text available
We introduce a general approach for the analysis of a quantum direct communication protocol. The method is based on the investigation of the superoperator acting on a joint system of the communicating parties and the eavesdropper. The introduced method is more versatile than the approaches used so far as it permits to incorporate different noise mo...
Article
We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the obtained results, we discuss the properties of the introduced model and the difference in comparison to the m...
Article
This paper provides an analysis of patent activity in the field of quantum information processing. Data from the PatentScope database from the years 1993-2011 was used. In order to predict the future trends in the number of filed patents time series models were used.
Article
We present a new version of TRQS package for Mathematica computing system. The package allows harnessing quantum random number generators (QRNG) for investigating the statistical properties of quantum states. It implements a number of functions for generating random states. The new version of the package adds the ability to use the on-line quantum...
Book
This book is concerned with the models of quantum computation. Information processing based on the rules of quantum mechanics provides us with new opportunities for developing more efficient algorithms and protocols. However, to harness the power offered by quantum information processing it is essential to control the behavior of quantum mechanical...
Article
Full-text available
In this paper we propose an extended version of the ping-pong protocol and study its security. The proposed protocol incorporates the usage of mutually unbiased bases in the control mode. We show that, by increasing the number of bases, it is possible to improve the security of this protocol. We also provide the upper bounds on eavesdropping averag...
Article
Full-text available
The restricted numerical range $W_R(A)$ of an operator $A$ acting on a $D$-dimensional Hilbert space is defined as a set of all possible expectation values of this operator among pure states which belong to a certain subset $R$ of the of set of pure quantum states of dimension $D$. One considers for instance the set of real states, or in the case o...
Chapter
Classical programmers have found many methods for dealing with the growing complexity of created programs. One of them is the functional approach for creating programming languages.
Chapter
In this chapter we focus on quantum programming languages which are based on the imperative paradigm. The main characteristic of these languages is that they provide an exact description of the computational steps required to execute a quantum procedure.
Chapter
In this chapter we define quantum finite automata—another model of computation used to study quantum computation. Again, as in the case of the Turing machine, we start with the classical version of this model, namely deterministic finite automaton, and subsequently upgrade it. Firstly, by considering nondeterminism and stochastic transitions, and t...
Chapter
The model of a Turing machine is widely used in classical and quantum complexity theory. Despite its simplicity it captures the notion of computability in a universal manner [11, 12]. Thanks to this feature it provides a standard tool for studying the computational complexity of algorithms.
Chapter
Since the main aim of this book is to present the advantages and the limitations of high-level quantum programming languages, we need to explain how these languages are related to the quantum random access machine model (QRAM), which provides a realistic model of computation for describing quantum computing devices. More precisely we would like to...
Chapter
After presenting the basic facts about Turing machines and quantum finite automata we are ready to introduce more user-friendly models of computing devices, namely the Boolean circuit model. This model is widely used in classical computer science, and the quantum version of this model is the de facto standard for describing quantum algorithms and p...
Chapter
The main obstacle for writing quantum programs using the quantum circuits model is its lack of classical elements. Quantum circuits can be used to express quantum data and operations only and do not provide a mechanism which would allow to control the operations on quantum memory using a classical machine. However, in many quantum algorithms the cl...
Chapter
In this chapter we introduce the last model of computation used in the theory of quantum information—quantum programming languages. The goal of this book is to provide a comprehensive introduction to high-level structures used in quantum information theory. For this reason we devote this and the next two chapters to the presentation of quantum prog...
Chapter
In only 100 pages it is impossible to cover so broad and lively developed areas of knowledge. Classical computational models have been developed for more than fifty years now. On the other hand the research in quantum information and quantum computation theory, in the last two decades of the last century, brought us an explosion of new results rela...
Article
We study a quantum version of a penny flip game played using control parameters of the Hamiltonian in the Heisenberg model. Moreover, we extend this game by introducing auxiliary spins which can be used to alter the behaviour of the system. We show that a player aware of the complex structure of the system used to implement the game can use this kn...
Article
Full-text available
We present IntU package for Mathematica computer algebra system. The presented package performs a symbolic integration of polynomial functions over the unitary group with respect to unique normalized Haar measure. We describe a number of special cases which can be used to optimize the calculation speed for some classes of integrals. We also provide...
Article
Full-text available
We study the probability measure on the space of density matrices induced by the metric defined by using superfidelity. We give the formula for the probability density of eigenvalues. We also study some statistical properties of the set of density matrices equipped with the introduced measure and provide a method for generating density matrices acc...
Article
We present the application of Principal Component Analysis for data acquired during the design of a natural gesture interface. We investigate the concept of an eigengesture for motion capture hand gesture data and present the visualisation of principal components obtained in the course of conducted experiments. We also show the influence of dimensi...
Article
Full-text available
The totality of normalised density matrices of order N forms a convex set Q_N in R^(N^2-1). Working with the flat geometry induced by the Hilbert-Schmidt distance we consider images of orthogonal projections of Q_N onto a two-plane and show that they are similar to the numerical ranges of matrices of order N. For a matrix A of a order N one defines...
Article
The problem of generating random quantum states is of a great interest from the quantum information theory point of view. In this paper we present a package for Mathematica computing system harnessing a specific piece of hardware, namely Quantis quantum random number generator (QRNG), for investigating statistical properties of quantum states. The...
Article
Full-text available
We study operators acting on a tensor product Hilbert space and investigate their product numerical range, product numerical radius and separable numerical range. Concrete bounds for the product numerical range for Hermitian operators are derived. Product numerical range of a non-Hermitian operator forms a subset of the standard numerical range con...
Article
The goal of the presented paper is to provide an introduction to the basic computational models used in quantum information theory. We review various models of quantum Turing machine, quantum circuits and quantum random access machine (QRAM) along with their classical counterparts. We also provide an introduction to quantum programming languages, w...
Article
Full-text available
We review Schmidt and Kraus decompositions in the form of singular value decomposition using operations of reshaping, vectorization and reshuffling. We use the introduced notation to analyse the correspondence between quantum states and operations with the help of Jamiolkowski isomorphism. The presented matrix reorderings allow us to obtain simple...
Article
Full-text available
We describe an informal methodology for developing on-line applications, which is, to some extent, complementary to the Web 2.0 aspects of web development. The presented methodology is suitable for developing low-cost and non-cost web sites targeted at medium-sized communities. We present basic building blocks used in the described strategy. To ach...
Article
We present a basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming languages and we use quantum pseudo-code based on QCL quantum programming language to describe them. We also present the implementation of introduced structures in GNU Octave lan...
Article
Full-text available
The goal of this report is to provide an introduction to the basic computational models used in quantum information theory. We various review models of quantum Turing machine, quantum circuits and quantum random access machine (QRAM) along with their classical counterparts. We also provide an introduction to quantum programming languages, which are...
Article
Full-text available
We present two measures of distance between quantum processes based on the superfidelity, introduced recently to provide an upper bound for quantum fidelity. We show that the introduced measures partially fulfill the requirements for distance measure between quantum processes. We also argue that they can be especially useful as diagnostic measures...
Article
Full-text available
Numerical range of a Hermitian operator X is defined as the set of all possible expectation values of this observable among a normalized quantum state. We analyze a modification of this definition in which the expectation value is taken among a certain subset of the set of all quantum states. One considers, for instance, the set of real states,...
Article
Full-text available
We derive several bounds on fidelity between quantum states. In particular we show that fidelity is bounded from above by a simple to compute quantity we call super-fidelity. It is analogous to another quantity called sub-fidelity. For any two states of a two-dimensional quantum system (N=2) all three quantities coincide. We demonstrate that sub- a...
Article
Full-text available
We provide new bound for the trace distance between two quantum states. The lower bound is based on the super-fidelity, which provides the upper bound on quantum fidelity. One of the advantages of the presented bound is that it can be estimated using simple measurement procedure. We also compare this bound with the one provided in terms of fidelity...
Article
Full-text available
We derive several bounds on fidelity between quantum states. In particular we show that fidelity is bounded from above by a simple to compute quantity we call super--fidelity. It is analogous to another quantity called sub--fidelity. For any two states of a two--dimensional quantum system (N=2) all three quantities coincide. We demonstrate that sub...
Article
Full-text available
We analyze the problem of finding sets of quantum states that can be deterministically discriminated. From a geometric point of view, this problem is equivalent to that of embedding a simplex of points whose distances are maximal with respect to the Bures distance (or trace distance). We derive upper and lower bounds for the trace distance and for...
Article
Full-text available
In the article we analyse how noisiness of quantum channels can influence the magic squares quantum pseudo-telepathy game. We show that the probability of success can be used to determine characteristics of quantum channels. Therefore the game deserves more careful study aiming at its implementation.
Article
Full-text available
We present a quantum implementation of Parrondo's game with randomly switched strategies using 1) a quantum walk as a source of ``randomness'' and 2) a completely positive (CP) map as a randomized evolution. The game exhibits the same paradox as in the classical setting where a combination of two losing strategies might result in a winning strategy...
Article
We propose a quantum implementation of a capital-dependent Parrondo's paradox that uses $O(\log_2(n))$ qubits, where $n$ is the number of Parrondo games. We present its implementation in the quantum computer language (QCL) and show simulation results.
Article
We describe the quantum-octave package of functions useful for simulations of quantum algorithms and protocols. The presented package allows one to perform simulations with mixed states. We present numerical implementation of important quantum mechanical operations - partial trace and partial transpose. Those operations are used as building blocks...
Article
Article presents package of functions for GNU Octave computer algebra system. Those functions were designed to perform simple but not necessary efficient simulations of quantum systems, especially quantum computers. The most important feature of this package is the ability to perform calculations with mixed states. We describe application of quantu...
Article
Full-text available
Article presents general formulation of entanglement measures problem in terms of correlation function. Description of entanglement in probabilistic framework allow us to introduce new quantity which describes quantum and classical correlations. This formalism is applied to calculate bipartite and tripartite correlations in two special cases of ent...
Article
Article presents general formulation of entanglement measures problem in terms of correlation function. Description of entanglement in probabilistic framework allow us to introduce new quantity which describes quantum and classical correlations. This formalism is applied to calculate bipartite and tripartite correlations in two special cases of ent...
Article
Streszczenie. W artykule zaprezentowane są podstawy obliczeń kwantowych. Odpowiedniość pomiędzy macierzami unitarnymi a ciągami elementów optycznych pozwala na zademonstrowanie kilku prostych kwantowych bramek logicznych. Przedstawiona jest symulacja optyczna algorytmu Grovera szybkiego wyszukiwania. Summary. The fundamentals of quantum computation...
Article
Article presents fundamental concepts of quantum information processing. Some basic quantum logic gates commonly used in quantum algorithms are introduces. Also rules of construction of these gates with standard optical elements are presented. One of the quantum algorithms – Grover’s search algorithm – is discussed and its simulation is presented.
Article
Full-text available
This article presents an algorithm for fast factorization on quantum computer. Quantum me-chanic introduces to information processing new effects that can be used to solve efficiently problems classical known as hard. Simon algorithm was one of the first proofs that quantum computer has some advantages over classical model of computation. Shor gene...
Article
The problem of generating random quantum states is of a great interest from the quantum in-formation theory point of view. In this paper we present a package for Mathematica computing system harnessing a specific piece of hardware, namely Quantis quantum random number generator (QRNG), for investigating statistical properties of quantum states. The...

Network

Cited By

Projects

Projects (7)
Project
The main goal of the project is to develop theoretical methods suitable for analysing the impact of quantum programme alternation – input data modification or imprecise implementation of the algorithm – on the efficiency of quantum algorithms. Quantum programme is a sequence of quantum operations and the quantum representation of input data which are sent to the quantum processor. In some cases, we can consider quantum programme alternation as an action of a malicious party, and in this scenario, we can understand it as an attack on a quantum processor or quantum program.