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 some examples of usage of the presented package.
00645nas a2200133 4500000000100000000000100001008004100002100002200043700002200065245005100087300001100138490000700149520035500156 2009 d 1 aZbigniew Puchała 1 aJaroslaw Miszczak 00 aBound on trace distance based on superfidelity a024302 0 v79 3 aWe provide a bound for the trace distance between two quantum states. The lower bound is based on the superfidelity, which provides the upper bound on quantum fidelity. One of the advantages of the presented bound is that it can be estimated using a simple measurement procedure. We also compare this bound with the one provided in terms of fidelity. 01853nas a2200181 4500000000100000000000100001008004100002100002200043700002200065700001700087700001800104700001800122700002200140245006900162300001100231490000700242520142200249 2012 d 1 aZbigniew Puchała 1 aJaroslaw Miszczak 1 aPiotr Gawron 1 aCharles Dunkl 1 aJ.A. Holbrook 1 aKarol Życzkowski 00 aRestricted numerical shadow and geometry of quantum entanglement a415309 0 v45 3 aThe 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 of composite spaces, the set of product states and the set of maximally entangled states. Combining the operator theory with a probabilistic approach we introduce the restricted numerical shadow of A – a normalized probability distribution on the complex plane supported in W\_R(A). Its value at point z in C is equal to the probability that the expectation value is equal to z, where |psi> represents a random quantum state in subset R distributed according to the natural measure on this set, induced by the unitarily invariant Fubini–Study measure. Studying restricted shadows of operators of a fixed size D=N\_A N\_B we analyse the geometry of sets of separable and maximally entangled states of the N\_A x N\_B composite quantum system. Investigating trajectories formed by evolving quantum states projected into the plane of the shadow we study the dynamics of quantum entanglement. A similar analysis extended for operators on D=2^3 dimensional Hilbert space allows us to investigate the structure of the orbits of GHZ and W quantum states of a three–qubit system. 01187nas a2200181 4500000000100000000000100001000000100002008004100003100002200044700002200066700001700088700002300105245007600128300001100204490000700215520076900222022001400991 2011 d 1 aZbigniew Puchała 1 aJaroslaw Miszczak 1 aPiotr Gawron 1 aBartłomiej Gardas 00 aExperimentally feasible measures of distance between quantum operations a1–12 0 v10 3 aWe present two measures of distance between quantum processes which can be measured directly in laboratory without resorting to process tomography. The measures are 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 to get preliminary knowledge about imperfections in an experimental setup. In particular we provide quantum circuit which can be used to measure the superfidelity between quantum processes. We also provide a physical interpretation of the introduced metrics based on the continuity of channel capacity.
a1570-0755 00400nam a2200157 4500000000100000000000100001008004100002260005900043100002000102700001700122700002200139700002400161245003300185250000600218020001800224 2003 d bWydawnictwo Pracowni Komputerowej Jacka Skalmierskiego 1 aStefan Węgrzyn 1 aJerzy Klamka 1 aJaroslaw Miszczak 1 aTadeusz Czachórski 00 aKwantowe systemy informatyki a2 a83-89105-46-2 00485nam a2200181 4500000000100000000000100001008004100002260004900043100002000092700001700112700002300129700001300152700002300165700002100188700002200209700002000231245005200251 2004 d bWydawnictwo Politechniki Śląskiej aGliwice 1 aStefan Węgrzyn 1 aJerzy Klamka 1 aSławomir Bugajski 1 aM. Gibas 1 aRyszard Winiarczyk 1 aLech Znamirowski 1 aJaroslaw Miszczak 1 aSławomir Nowak 00 aNano i kwantowe systemy informatyki. Wyd.Drugie 00503nam a2200193 4500000000100000000000100001008004100002260004900043100002000092700001700112700002300129700001300152700002300165700002100188700002200209700002000231245004000251020001800291 2003 d bWydawnictwo Politechniki Śląskiej aGliwice 1 aStefan Węgrzyn 1 aJerzy Klamka 1 aSławomir Bugajski 1 aM. Gibas 1 aRyszard Winiarczyk 1 aLech Znamirowski 1 aJaroslaw Miszczak 1 aSławomir Nowak 00 aNano i Kwantowe Systemy Informatyki a83-7335-295-3 00305nas a2200145 4500000000100000000000100001000000100002008004100003100002300044700001700067700002200084245003500106300001100141490000700152 2007 d 1 aRyszard Winiarczyk 1 aPiotr Gawron 1 aJaroslaw Miszczak 00 aKompilator języka QCL QCL2QML a5–18 0 v28 00441nas a2200181 4500000000100000000000100001000000100002008004100003100002300044700001700067700002200084700001900106700002200125245007900147300001200226490000700238022001400245 2013 d 1 aRyszard Winiarczyk 1 aPiotr Gawron 1 aJaroslaw Miszczak 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aAnalysis of patent activity in the field of quantum information processing a1350007 0 v11 a0219-7499 00846nas a2200157 4500000000100000000000100001000000100002008004100003100001600044700002200060700002200082245009200104300001400196490000700210520047100217 2013 d 1 aP. Zawadzki 1 aZbigniew Puchała 1 aJaroslaw Miszczak 00 aIncreasing the security of the ping-pong protocol by using many mutually unbiased bases a569–576 0 v12 3 aIn 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 average non-detection probability and propose a control mode modification that increases the attack detection probability. 00300nas a2200121 4500000000100000000000100001008004100002100001600043700002200059245007600081300001200157490000900169 2016 d 1 aP. Zawadzki 1 aJaroslaw Miszczak 00 aA general scheme for information interception in the ping pong protocol a3162012 0 v2016 00301nas a2200133 4500000000100000000000100001008004100002100002500043700002200068700002400090245003500114300001100149490000700160 2016 d 1 aPrzemysław Sadowski 1 aJaroslaw Miszczak 1 aMateusz Ostaszewski 00 aLively quantum walks on cycles a375302 0 v49 00352nas a2200133 4500000000100000000000100001008004100002100001400043700002200057700002400079245007100103856003700174490000700211 2018 d 1 aAdam Glos 1 aJaroslaw Miszczak 1 aMateusz Ostaszewski 00 aLimiting properties of stochastic quantum walks on directed graphs uhttps://arxiv.org/abs/1703.01792 0 v51 00322nas a2200133 4500000000100000000000100001008004100002260000900043100001400052700002200066700002400088245006800112490000800180 2019 d c2019 1 aAdam Glos 1 aJaroslaw Miszczak 1 aMateusz Ostaszewski 00 aQSWalk. jl: Julia package for quantum stochastic walks analysis 0 v235 00342nas a2200145 4500000000100000000000100001008004100002100001600043700001600059700001400075700002200089700001600111245006200127490000700189 2018 d 1 aG. Sergioli 1 aE. Santucci 1 aL. Didaci 1 aJaroslaw Miszczak 1 aR. Giuntini 00 aA quantum-inspired version of the nearest mean classifier 0 v22 00932nas a2200133 4500000000100000000000100001008004100002100001400043700002200057245009600079856003700175490000700212520057900219 2019 d 1 aAdam Glos 1 aJaroslaw Miszczak 00 aImpact of the malicious input data modification on the efficiency of quantum spatial search uhttps://arxiv.org/abs/1802.10041 0 v18 3 aIn 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 search algorithms. We provide the analysis of proposed attacks for different models of random graphs. The obtained results demonstrate that quantum algorithms in general are not secure against input data alteration.
01712nas a2200145 4500000000100000000000100001008004100002100001400043700002200057245006000079856003700139490000600176520137000182022001401552 2019 d 1 aAdam Glos 1 aJaroslaw Miszczak 00 aThe role of quantum correlations in Cop and Robber game uhttps://arxiv.org/abs/1702.07932 0 v6 3 aWe introduce and study quantized versions of Cop and Robber game. We achieve this by using graph-preserving quantum operations, which are the quantum analogues 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 the controlled operations, we define a quantum-controlled Cop and Robber game, which expands the classical Cop and Robber game, as well as the classically controlled quantum Cop and Robber game. In contrast to the typical scheme for introducing quantum games, we assume that both parties can utilise full information about the opponent's strategy. We show that the utilisation of the full knowledge about the opponent's state does not provide the advantage. Moreover, the chances of catching the Robber decrease for classical cop-win graphs. This result does not depend on the chosen model of evolution. On the other hand, the possibility to execute controlled quantum operations allows catching the Robber on almost all classical cop-win graphs. By this, we demonstrate that it is necessary to enrich the structure of correlations between the players' systems to provide a non-trivial quantized Cop and Robber game. Thus the quantum controlled operations offer a significant advantage over the classically controlled quantum operations.
a2196-5617 00919nas a2200145 4500000000100000000000100001008004100002100002400043700002200067700002500089700001400114245008200128490000700210520055600217 2019 d 1 aMateusz Ostaszewski 1 aJaroslaw Miszczak 1 aPrzemysław Sadowski 1 aL. Banchi 00 aApproximation of quantum control correction scheme using deep neural networks 0 v18 3 aWe 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 drift. Our solution allows studying the mapping from quantum control pulses to system dynamics and then analysing the robustness of the latter against local variations in the control profile.
01349nas a2200133 4500000000100000000000100001008004100002100002400043700002200067700002500089245008600114490000700200520100800207 2020 d 1 aMateusz Ostaszewski 1 aJaroslaw Miszczak 1 aPrzemysław Sadowski 00 aGeometrical versus time-series representation of data in quantum control learning 0 v53 3 aRecently machine learning techniques have become popular for analysing physical systems and solving problems occurring in quantum computing. In this paper we focus on using such techniques for finding the sequence of physical operations implementing the given quantum logical operation. In this context we analyse the flexibility of the data representation and compare the applicability of two machine learning approaches based on different representations of data. We demonstrate that the utilization of the geometrical structure of control pulses is sufficient for achieving high-fidelity of the implemented evolution. We also demonstrate that artificial neural networks, unlike geometrical methods, posses the generalization abilities enabling them to generate control pulses for the systems with variable strength of the disturbance. The presented results suggest that in some quantum control scenarios, geometrical data representation and processing is competitive to more complex methods.
01840nas a2200217 4500000000100000000000100001008004100002260000800043100001000051700001400061700001200075700002200087700001600109700001300125245006400138856004700202300001600249490000700265520133600272022001401608 2019 d cNov 1 aYe Ye 1 aXiao Hang 1 aJin Koh 1 aJaroslaw Miszczak 1 aKang Cheong 1 aNeng Xie 00 aRatcheting based on neighboring niches determines lifestyle uhttps://doi.org/10.1007/s11071-019-05290-1 a1821–1830 0 v98 3 aIn 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 two asymmetric branches determining winning and losing states, denoted Case B. The selection between game branches is dependent on the demographic of neighboring niches, and favorable or unfavorable effects from the neighborhood can be made to manifest by setting probabilistic game parameters. Theoretical analysis reveals that losing configurations of Case B, when stochastically mixed with neutral Case A, can result in paradoxical winning scenarios where the network experiences positive gain–-a Parrondo's paradox-like phenomenon has therefore emerged. It is elucidated that agitation from Case A increases the probability of individuals to play the favorable branch of Case B, leading to unexpected gains in two distinct parameter regimes. In the paradoxical regions, our analysis suggests strongly that neighboring niches are the cause for evolution toward social or solitary lifestyle behaviors, and we present important connections to real-world biological life.
a1573-269X 01682nas a2200205 4500000000100000000000100001008004100002100001000043700001400053700001200067700002200079700001600101700001800117245007300135856007100208300001100279490000800290520116400298022001401462 2020 d 1 aYe Ye 1 aXiao Hang 1 aJin Koh 1 aJaroslaw Miszczak 1 aKang Cheong 1 aNeng-gang Xie 00 aPassive network evolution promotes group welfare in complex networks uhttp://www.sciencedirect.com/science/article/pii/S0960077919304102 a109464 0 v130 3 aThe Parrondo’s paradox is a counter-intuitive 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, representing a rewiring process on the network, and a two-branch Game B, representing redistributive interactions between agents. Simulation results indicate that stochastically mixing Action A and Game B can produce enhanced, and even winning outcomes, despite Game B being individually losing. In other words, a Parrondo-type paradox can be achieved, but unlike canonical variants, the source of agitation is provided by passive network evolution instead of an active second game. The underlying paradoxical mechanism is analyzed, revealing that the rewiring process drives a topology shift from initial regular lattices towards scale-free characteristics, and enables exploitative behavior that grants enhanced access to the favourable branch of Game B.
a0960-0779 01441nas a2200205 4500000000100000000000100001008004100002260002200043100002200065700001400087700002200101700002700123700002200150700001800172700002500190700001700215245008000232856003700312520088600349 2020 d c01/2021 bSpringer 1 aArtur Frankiewicz 1 aAdam Glos 1 aKrzysztof Grochla 1 aZbigniew Łaskarzewski 1 aJaroslaw Miszczak 1 aKonrad Połys 1 aPrzemysław Sadowski 1 aAnna Strzoda 00 aLP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm uhttps://arxiv.org/abs/2010.04553 3 aThe 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 access point or required redundancy. In this paper, we describe the problem of selecting the base stations in a network using the concept of k-dominating set. In our model, we include information about the required redundancy and spectral efficiency. We consider the additional requirements on the resulting connections and provide the greedy algorithm for solving the problem. The algorithm is evaluated in randomly generated network topologies and using the coordinates of sample real smart metering networks.
01368nas a2200145 4500000000100000000000100001008004100002100001800043700001400061700002200075245010100097856003700198490000700235520098000242 2022 d 1 aÖzlem Salehi 1 aAdam Glos 1 aJaroslaw Miszczak 00 aUnconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization uhttps://arxiv.org/abs/2106.09056 0 v21 3 aQuantum 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 travelling salesman problem with time windows (TSPTW) in the context of solving it on a quantum computer. We introduce quadratic unconstrained binary optimization and higher-order binary optimization formulations of this problem. We demonstrate the advantages of edge-based and node-based formulations of the TSPTW problem. Additionally, we investigate the experimental realization of the presented methods on a quantum annealing device. The provided results pave the path for utilizing quantum computer for a variety of real-world tasks which can be cast in the form of travelling salesman problem with time windows.
01362nas a2200145 4500000000100000000000100001008004100002260001200043100001600055700002200071245004900093856003900142490000600181520102900187 2022 d c07/2022 1 aAkash Kundu 1 aJaroslaw Miszczak 00 aVariational certification of quantum devices uhttps://arxiv.org/abs/2011.01879v2 0 v7 3 aOne 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 describe a simple procedure based on variational quantum eigensolver which can be utilized to compare quantum devices. The procedure is developed by combining Choi–Jamiołkowski isomorphism with the variational hybrid quantum–classical procedure for matrix diagonalization. We compare the introduced procedure with the scheme based on the standard bounds for the similarity between quantum operations by analysing its action on random quantum channels. We also discuss the sensitivity of the described procedure to the noise, and we provide numerical results demonstrating its feasibility in realistic scenarios by running the procedure on IBM quantum computer.
01600nas a2200157 4500000000100000000000100001008004100002260001200043100002000055700002000075700002000095700002200115245012400137490000700261520117400268 2021 d c03/2022 1 aMateusz Żarski 1 aBartosz Wójcik 1 aKamil Książek 1 aJaroslaw Miszczak 00 aFinicky transfer learning—A method of pruning convolutional neural networks for cracks classification on edge devices 0 v37 3 aHigh 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 techniques for the purpose of delivering solid accuracy while simultaneously lowering the demand for energy and computing power. This method is referred to as \emph{Finicky Transfer Learning} (FTL) as it is finicky during the process of selecting filters from a pre-trained feature extractor to compose a sparser architecture. The proposed filter selection process is based on an original approach utilizing the Jaccard similarity coefficient calculated between the activation maps and the masks obtained by semantic segmentation. This enables the use of CNN, trained previously on a large generic dataset, in a crack classification task. The presented method significantly lowers the inference time while maintaining or even slightly increasing the classification accuracy, enabling real-time operation on single-board computers.
01870nas a2200181 4500000000100000000000100001008004100002100002000043700001400063700001600077700002200093700001800115700002200133245008900155856003700244490000800281520139900289 2022 d 1 aLudmila Botelho 1 aAdam Glos 1 aAkash Kundu 1 aJaroslaw Miszczak 1 aÖzlem Salehi 1 aZoltán Zimborás 00 aError mitigation for variational quantum algorithms through mid-circuit measurements uhttps://arxiv.org/abs/2108.10927 0 v105 3 aNoisy intermediate-scale quantum 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 thousands of physical qubits on their own. For specific problems, valid quantum states have a unique structure as in the case of Fock states and W states where the Hamming weight is fixed, and the evolution takes place in a smaller subspace of the full Hilbert space. With this preknowledge, some errors can be detected during the evolution of the circuit, by filtering the states not obeying the pattern through postselection. In this paper, we present mid-circuit postselection schemes for frequently used encodings such as one-hot, binary, gray, and domain-wall encoding. For the particular subspace of one-hot states, we propose a method that works by compressing the full Hilbert space to a smaller subspace, allowing projecting to the desired subspace without using any ancilla qubits. We demonstrate the effectiveness of the approach for the quantum alternating operator ansatz algorithm. Our method is particularly suitable for the currently available hardware, where measuring and resetting are possible, but classical conditional operators are not.
01433nas a2200157 4500000000100000000000100001008004100002260001200043100002000055700002000075700002200095245009100117856003700208490000700245520102300252 2021 d c12/2021 1 aMateusz Żarski 1 aBartosz Wójcik 1 aJaroslaw Miszczak 00 aKrakN: Transfer Learning framework and dataset for infrastructure thin crack detection uhttps://arxiv.org/abs/2004.12337 0 v16 3 aMonitoring 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 factors we propose a KrakN framework. It enables end-to-end development of unique infrastructure defect detectors on digital images, achieving an accuracy of above 90%. The framework also supports the semi-automatic creation of new datasets and has modest computing power requirements. It can be used to immediately implement deep learning in the process of infrastructure management and, due to its architecture based on transfer learning, allows low metric loss when used across different datasets. We also demonstrate that thanks to its scalability and modular structure, the presented framework is easily modifiable, and can be used in realistic scenarios.
00551nas a2200169 4500000000100000000000100001008004100002260009400043100002000137700002000157700002000177700001800197700002200215245006500237856005700302020002200359 2021 d bInstitute of Fundamental Technological Research of the Polish Academy of Sciences aWarsaw 1 aMateusz Żarski 1 aBartosz Wójcik 1 aKamil Książek 1 aMarek Salamak 1 aJaroslaw Miszczak 00 aAdvances in applicable deep-learning based defect detection uhttp://v4shm.ippt.pan.pl/WEO2021-BookOfAbstracts.pdf a987-83-65550-23-1 00509nas a2200157 4500000000100000000000100001008004100002260009400043100002000137700002000157700001800177700002200195245005500217856005700272020002200329 2021 d bInstitute of Fundamental Technological Research of the Polish Academy of Sciences aWarsaw 1 aBartosz Wójcik 1 aMateusz Żarski 1 aMarek Salamak 1 aJaroslaw Miszczak 00 aExtracting crack characteristics from RGB-D images uhttp://v4shm.ippt.pan.pl/WEO2021-BookOfAbstracts.pdf a987-83-65550-23-1 01245nas a2200121 4500000000100000000000100001008004100002100002200043245009600065856003700161490000800198520091700206 2022 d 1 aJaroslaw Miszczak 00 aConstructing games on networks for controlling the inequalities in the capital distribution uhttps://arxiv.org/abs/2201.10913 0 v594 3 aThe 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 distribution of capital. To achieve the effect of inequality reduction we interpret the outcome of the elementary game played in the network such that the wining the game is translated into the reduction of the inequality. We study different interpretations of the introduced scheme and their impact on the behaviour of agents in the terms of the capital distribution and we provide examples based on the capital dependent Parrondo’s paradox. The results presented in this study provide insight into the mechanics of the inequality formation in the society.
02101nas a2200145 4500000000100000000000100001008004100002260001200043100001600055700002200071245009200093856003700185490000700222520172600229 2022 d c06/2022 1 aAkash Kundu 1 aJaroslaw Miszczak 00 aTransparency and enhancement in fast and slow light in q-deformed optomechanical system uhttps://arxiv.org/abs/2205.15800 0 v54 3 aNonclassical 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 each other by transmission strength parameter. Our study shows that compared to non-deformed cases, the deformed system exhibits more rapid phase transition at the positions of transparency windows, causing stronger and enhanced fast and slow light phenomena. Moreover, in the region 0<q<0.5, the optomechanical system results in gain. Moreover for a fixed deformation of cavities, by tuning the tunnelling strength and optomechanical coupling, one can observe a delay and advancement in probe filed in the order of \textit{milliseconds} and even above milliseconds for fine-tuning of the coupling parameters. Finally, the bridge between mathematical and physical models is built by assuming the deformation to be a primitive root of unity, indicating a class of \textit{anyon} models. Our results demonstrate that q-deformation provides a novel method for manipulating and significantly enhancing optical phenomena not only in arbitrarily deformed optomechanical systems but also in anyon models.
01406nas a2200181 4500000000100000000000100001008004100002260001200043100002000055700002000075700002200095700002600117700002200143245008300165856003700248490000700285520093200292 2022 d c10/2022 1 aMateusz Żarski 1 aBartosz Wójcik 1 aJaroslaw Miszczak 1 aBartlomiej Blachowski 1 aMariusz Ostrowski 00 aComputer Vision Based Inspection on Post-Earthquake With UAV Synthetic Dataset uhttps://arxiv.org/abs/2210.05282 0 v10 3 aThe goal of this paper is to deliver the overview of the current state of the art, to provide experience report on developing quantum software tools, and to outline the perspective for developing quantum programming tools supporting symbolic programming for the needs of quantum computing technologies. The main focus of this paper is on quantum computing technologies, as they can in the most direct way benefit from developing tools enabling the symbolic manipulation of quantum circuits and providing software tools for creating, optimizing, and testing quantum programs. We deliver a short survey of the most popular approaches in the field of quantum software development and we aim at pointing their strengths and weaknesses. This helps to formulate a list of desirable characteristics which should be included in quantum computing frameworks. Next, we describe a software architecture and its preliminary implementation supporting the development of quantum programs using symbolic approach, encouraging the functional programming paradigm, and, at the same, time enabling the integration with high-performance and cloud computing. The described software consists of several packages developed to address different needs, but nevertheless sharing common design concepts. We also outline how the presented approach could be used in tasks in quantum software engineering, namely quantum software testing and quantum circuit construction.
01523nas a2200181 4500000000100000000000100001008004100002260001200043100002000055700002000075700002000095700002200115700002600137245009200163856007700255490001200332520099700344 2023 d c10/2023 1 aBartosz Wójcik 1 aMateusz Żarski 1 aKamil Książek 1 aJaroslaw Miszczak 1 aMirosław Skibniewski 00 aA deep learning method for hard-hat-wearing detection based on head center localization uhttps://journals.pan.pl/dlibra/publication/147340/edition/128931/content 0 v71 (EA) 3 aIn recent years, a lot of attention is paid to deep learning methods in the context of vision-based construction site safety systems. However, there is still more to be done to establish the relationship between supervised construction workers and their essential personal protective equipment, like hard hats. A deep learning method combining object detection, head center localization, and simple rule-based reasoning is proposed in this article. In tests, this solution surpassed the previous methods based on the relative bounding box position of different instances and direct detection of hard hat wearers and non-wearers. Achieving MS COCO style overall AP of 67.5% compared to 66.4% and 66.3% achieved by the approaches mentioned above, with class-specific AP for hard hat non-wearers of 64.1% compared to 63.0% and 60.3%. The results show that using deep learning methods with a humanly interpretable rule-based algorithm is better suited for detecting hard hat non-wearers.
01183nas a2200133 4500000000100000000000100001008004100002260001200043100002200055245010000077856003700177490000700214520082800221 2023 d c10/2023 1 aJaroslaw Miszczak 00 aRule switching mechanisms in the Game of Life with synchronous and asynchronous updating policy uhttps://arxiv.org/abs/2310.05979 0 v98 3 aThe emergence of complex structures in the systems governed by a simple set of rules is among the most fascinating aspects of Nature. The particularly powerful and versatile model suitable for investigating this phenomenon is provided by cellular automata, with the Game of Life being one of the most prominent examples. However, this simplified model can be too limiting in providing a tool for modelling real systems. To address this, we introduce and study an extended version of the Game of Life, with the dynamical process governing the rule selection at each step. We show that the introduced modification significantly alters the behaviour of the game. We also demonstrate that the choice of the synchronization policy can be used to control the trade-off between the stability and the growth in the system.
00506nas a2200205 4500000000100000000000100001000000100002008004100003260003200044100001800076700001600094700002000110700002200130700001800152700001900170700001800189245006300207300001200270020001800282 2023 d bSpringer Nature Switzerland 1 aRobert Glück 1 aIvan Lanese 1 aClaudio Mezzina 1 aJaroslaw Miszczak 1 aIain Phillips 1 aIrek Ulidowski 1 aGermán Vidal 00 aTowards a Taxonomy for Reversible Computation Approaches a24–39 a9783031381003 01805nas a2200193 4500000000100000000000100001008004100002260001200043100001600055700002500071700002400096700001600120700001500136700001800151700002200169245009600191490000700287520131700294 2024 d c01/2024 1 aAkash Kundu 1 aPrzemysław Bedełek 1 aMateusz Ostaszewski 1 aOnur Danaci 1 aYash Patel 1 aVedran Dunjko 1 aJaroslaw Miszczak 00 aEnhancing quantum variational state diagonalization using reinforcement learning techniques 0 v26 3 aThe variational quantum algorithms are crucial for the application of NISQ computers. Such algorithms require short quantum circuits, which are more amenable to implementation on near-term hardware, and many such methods have been developed. One of particular interest is the so-called variational quantum state diagonalization method, which constitutes an important algorithmic subroutine and can be used directly to work with data encoded in quantum states. In particular, it can be applied to discern the features of quantum states, such as entanglement properties of a system, or in quantum machine learning algorithms. In this work, we tackle the problem of designing a very shallow quantum circuit, required in the quantum state diagonalization task, by utilizing reinforcement learning (RL). We use a novel encoding method for the RL-state, a dense reward function, and an $\epsilon$-greedy policy to achieve this. We demonstrate that the circuits proposed by the reinforcement learning methods are shallower than the standard variational quantum state diagonalization algorithm and thus can be used in situations where hardware capabilities limit the depth of quantum circuits. The methods we propose in the paper can be readily adapted to address a wide range of variational quantum algorithms.
01393nas a2200169 4500000000100000000000100001008004100002260001200043100002100055700002400076700002100100700002200121245007800143856003700221490000700258520095800265 2025 d c03/2025 1 aKatarzyna Gawlak 1 aJarosław Konieczny 1 aKrzysztof Domino 1 aJaroslaw Miszczak 00 aStatistical analysis of geoinformation data for increasing railway safety uhttps://arxiv.org/abs/2406.01083 0 v34 3 aThe impact of rail transport on the environment is one of the crucial factors for the sustainable development of this form of mass transport. We present a data-driven analysis of wild animal railway accidents in the region of southern Poland, a step to create the train driver warning system. We built our method by harnessing the Bayesian approach to the statistical analysis of information about the geolocation of the accidents. The implementation of the proposed a model does not require advanced knowledge of data mining and can be applied even in less developed railway systems with small IT support. Furthermore, we have discovered unusual patterns of accidents while considering the number of trains and their speed and time at particular geographical location of the railway network. We test the developed approach using data from southern Poland, compromising wildlife habitats and one of the most urbanised regions in Central Europe.
02499nas a2200217 4500000000100000000000100001008004100002260001200043100001800055700001600073700002200089700002000111700002500131700001800156700002200174700001900196245011000215856003700325490000700362520191200369 2026 d c04/2026 1 aAritra Sarkar 1 aAkash Kundu 1 aMatthew Steinberg 1 aSibasish Mishra 1 aSebastiaan Fauquenot 1 aTamal Acharya 1 aJaroslaw Miszczak 1 aSebastian Feld 00 aYAQQ: Yet Another Quantum Quantizer -- Design Space Exploration of Quantum Gate Sets using Novelty Search uhttps://arxiv.org/abs/2406.17610 0 v28 3 aIn the standard circuit model of quantum computation, the number and quality of the quantum gates composing the circuit influence the runtime and fidelity of the computation. The fidelity of the decomposition of quantum algorithms, represented as unitary matrices, to bounded depth quantum circuits depends strongly on the set of gates available for the decomposition routine. To investigate this dependence, we explore the design space of discrete quantum gate sets and present a software tool for comparative analysis of quantum processing units and control protocols based on their native gates. The evaluation is conditioned on a set of unitary transformations representing target use cases on the quantum processors. The cost function considers three key factors: (i) the statistical distribution of the decomposed circuits' depth, (ii) the statistical distribution of process fidelities for the approximate decomposition, and (iii) the relative novelty of a gate set compared to other gate sets in terms of the aforementioned properties. The developed software, YAQQ (Yet Another Quantum Quantizer), enables the discovery of an optimized set of quantum gates through this tunable joint cost function. To identify these gate sets, we use the novelty search algorithm, circuit decomposition techniques, and stochastic optimization to implement YAQQ within the Qiskit quantum simulator environment. YAQQ exploits reachability tradeoffs conceptually derived from quantum algorithmic information theory. Our results demonstrate the pragmatic application of identifying gate sets that are advantageous to popularly used quantum gate sets in representing quantum algorithms. Consequently, we demonstrate pragmatic use cases of YAQQ in comparing transversal logical gate sets in quantum error correction codes, designing optimal quantum instruction sets, and compiling to specific quantum processors.
01096nam a2200133 4500000000100000000000100001008004100002260001500043100002200058245013700080856005100217520067500268020001900943 2024 d bQuoqa Pubs 1 aJaroslaw Miszczak 00 aShort Lessons on Wolfram Language: Programming, Data Processing, Graphics, Machine Learning, and Quantum Computing with Mathematica uhttps://open.icm.edu.pl/handle/123456789/24302 3 aThis book provides a tutorial on Wolfram Language, the programming language powering the Mathematica computer algebra system. The main purpose of this book is to introduce the basic concepts required to start using Mathematica. The book contains lessons organized around various topics and use cases where the capabilities of Mathematica can be demonstrated. The lessons cover such elements of Wolfram Language as syntax, concepts used in linear algebra, graph theory, functions used to visualize data, and methods of solving equations. The introduced concepts are utilized to provide an overview of the basic elements of machine learning and quantum computing.
a978-8366950016 00442nas a2200145 4500000000100000000000100001008004100002260001200043100002100055700002100076700002200097245012300119856004700242490000700289 2025 d c12/2024 1 aKrzysztof Domino 1 aArkadiusz Sochan 1 aJaroslaw Miszczak 00 aAnalytical assessment of workers' safety concerning direct and indirect ways of getting infected by dangerous pathogen uhttps://doi.org/10.1016/j.jocs.2024.102509 0 v85 01549nas a2200121 4500000000100000000000100001008004100002260001200043100002000055700002200075245008900097520124100186 2024 d c09/2024 1 aMateusz Żarski 1 aJaroslaw Miszczak 00 aMulti-Step Feature Fusion for Natural Disaster Damage Assessment on Satellite Images 3 aQuick and accurate assessment of the damage state of buildings after natural disasters is crucial for undertaking properly targeted rescue and subsequent recovery operations, which can have a major impact on the safety of victims and the cost of disaster recovery. The quality of such a process can be significantly improved by harnessing the potential of machine learning methods in computer vision. This paper presents a novel damage assessment method using an original multi-step feature fusion network for the classification of the damage state of buildings based on pre- and post-disaster large-scale satellite images. We introduce a novel convolutional neural network (CNN) module that performs feature fusion at multiple network levels between pre- and post-disaster images in the horizontal and vertical directions of CNN network. An additional network element – Fuse Module – was proposed to adapt any CNN model to analyze image pairs in the issue of pair classification. We use, open, large-scale datasets (IDA-BD and xView2) to verify, that the proposed method is suitable to improve on existing state-of-the-art architectures. We report over a 3 percentage point increase in the accuracy of the Vision Transformer model. 00303nas a2200097 4500000000100000008004100001100002200042245009600064856003700160490000800197 2026 d 1 aJaroslaw Miszczak 00 aCooperation in public goods game on square lattices with agents changing interaction groups uhttps://arxiv.org/abs/2510.03772 0 v694 01985nas a2200109 4500000000100000008004100001260004000042100002200082245009500104856003700199520163900236 2026 d c06/2026 bSpringer aHamburg, Germany 1 aJaroslaw Miszczak 00 aTowards Quantum Machine Learning for Assessing the Resilience of Post-quantum Cryptography uhttps://arxiv.org/abs/2607.13722 3 aThe potential capabilities of quantum computers motivated the development of cryptographic protocols suitable for securing communication against adversaries with access to large fault-tolerant quantum computers. However, even though current quantum computers are limited in terms of size and precision, they can still be useful for finding loopholes and weaknesses in the post-quantum cryptographic protocols. In this work, we present an attempt to utilize the capabilities of Quantum Generative Adversarial Networks (QGANs), one of the promising architectures used in quantum machine learning, for this purpose. We describe an example application of QGAN architecture for the purpose of loading the probability distribution of the hash-based digital signatures into the memory of a quantum computer. Our results confirm that near-term hybrid quantum-classical methods possess capabilities required for this purpose. The presented approach can be used as a first step in the workflow, enabling the utilization of quantum computing for attacking post-quantum cryptographic primitives.