00303nas a2200097   4500000000100000008004100001100002200042245009600064856003700160490000800197       2026                            d1 aJaroslaw Miszczak00aCooperation in public goods game on square lattices with agents changing interaction groups  uhttps://arxiv.org/abs/2510.037720 v69401434nas a2200109   4500000000100000008004100001260004000042100002200082245009500104856003700199520108800236       2026                            d  c06/2026bSpringeraHamburg, Germany1 aJaroslaw Miszczak00aTowards Quantum Machine Learning for Assessing the Resilience of Post-quantum Cryptography  uhttps://arxiv.org/abs/2607.137223 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.02477nas a2200205   4500000000100000008004100001260001200042100001800054700001600072700002200088700002000110700002500130700001800155700002200173700001900195245011000214856003700324490000700361520190300368       2026                            d  c04/20261 aAritra Sarkar1 aAkash Kundu1 aMatthew Steinberg1 aSibasish Mishra1 aSebastiaan Fauquenot1 aTamal Acharya1 aJaroslaw Miszczak1 aSebastian Feld00aYAQQ: Yet Another Quantum Quantizer -- Design Space Exploration of Quantum Gate Sets using Novelty Search  uhttps://arxiv.org/abs/2406.176100 v283 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.00429nas a2200133   4500000000100000008004100001260001200042100002100054700002100075700002200096245012300118856004700241490000700288       2025                            d  c12/20241 aKrzysztof Domino1 aArkadiusz Sochan1 aJaroslaw Miszczak00aAnalytical assessment of workers' safety concerning direct and indirect ways of getting infected by dangerous pathogen  uhttps://doi.org/10.1016/j.jocs.2024.1025090 v8501371nas a2200157   4500000000100000008004100001260001200042100002100054700002400075700002100099700002200120245007800142856003700220490000700257520094900264       2025                            d  c03/20251 aKatarzyna Gawlak1 aJarosław Konieczny1 aKrzysztof Domino1 aJaroslaw Miszczak00aStatistical analysis of geoinformation data for increasing railway safety  uhttps://arxiv.org/abs/2406.010830 v343 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.01783nas a2200181   4500000000100000008004100001260001200042100001600054700002500070700002400095700001600119700001500135700001800150700002200168245009600190490000700286520130800293       2024                            d  c01/20241 aAkash Kundu1 aPrzemysław Bedełek1 aMateusz Ostaszewski1 aOnur Danaci1 aYash Patel1 aVedran Dunjko1 aJaroslaw Miszczak00aEnhancing quantum variational state diagonalization using reinforcement learning techniques0 v263 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.01536nas a2200109   4500000000100000008004100001260001200042100002000054700002200074245008900096520124100185       2024                            d  c09/20241 aMateusz Żarski1 aJaroslaw Miszczak00aMulti-Step Feature Fusion for Natural Disaster Damage Assessment on Satellite Images3 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.01074nam a2200121   4500000000100000008004100001260001500042100002200057245013700079856005100216520066600267020001900933       2024                            d  bQuoqa Pubs1 aJaroslaw Miszczak00aShort Lessons on Wolfram Language: Programming, Data Processing, Graphics, Machine Learning, and Quantum Computing with Mathematica   uhttps://open.icm.edu.pl/handle/123456789/243023 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-836695001601501nas a2200169   4500000000100000008004100001260001200042100002000054700002000074700002000094700002200114700002600136245009200162856007700254490001200331520098800343       2023                            d  c10/20231 aBartosz Wójcik1 aMateusz Żarski1 aKamil Książek1 aJaroslaw Miszczak1 aMirosław Skibniewski00aA deep learning method for hard-hat-wearing detection based on head center localization  uhttps://journals.pan.pl/dlibra/publication/147340/edition/128931/content0 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.01161nas a2200121   4500000000100000008004100001260001200042100002200054245010000076856003700176490000700213520081900220       2023                            d  c10/20231 aJaroslaw Miszczak00aRule switching mechanisms in the Game of Life with synchronous and asynchronous updating policy  uhttps://arxiv.org/abs/2310.059790 v983 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.01826nas a2200109   4500000000100000008004100001260007300042100002200115245009500137856003700232520144700269       2023                            d  bAssociation for Computing MachineryaTokyo, Japan, March 13-17, 20231 aJaroslaw Miszczak00aSymbolic quantum programming for supporting applications of quantum computing technologies  uhttps://arxiv.org/abs/2302.094013 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.00480nas a2200181   4500000000100000008004100001260003200042100001800074700001600092700002000108700002200128700001800150700001900168700001800187245006300205300001200268020001800280       2023                            d  bSpringer Nature Switzerland1 aRobert Glück1 aIvan Lanese1 aClaudio Mezzina1 aJaroslaw Miszczak1 aIain Phillips1 aIrek Ulidowski1 aGermán Vidal00aTowards a Taxonomy for Reversible Computation Approaches  a24–39  a978303138100301380nas a2200169   4500000000100000008004100001260001200042100002000054700002000074700002200094700002600116700002200142245008300164856003700247490000700284520091900291       2022                            d  c10/20221 aMateusz Żarski1 aBartosz Wójcik1 aJaroslaw Miszczak1 aBartlomiej Blachowski1 aMariusz Ostrowski00aComputer Vision Based Inspection on Post-Earthquake With UAV Synthetic Dataset  uhttps://arxiv.org/abs/2210.052820 v103 aThe 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 an interconnected set of deep machine learning models organized in a single pipeline and allowing for easy modification and swapping models seamlessly. Models in the pipeline were trained with a synthetic dataset and were adapted to be further evaluated and used with unmanned aerial vehicles (UAVs) in real-world conditions. Thanks to the methods presented in the article, it is possible to obtain high accuracy in detecting buildings defects, segmenting constructions into their components and estimating their technical condition based on a single drone flight.01223nas a2200109   4500000000100000008004100001100002200042245009600064856003700160490000800197520090800205       2022                            d1 aJaroslaw Miszczak00aConstructing games on networks for controlling the inequalities in the capital distribution  uhttps://arxiv.org/abs/2201.109130 v5943 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.01848nas a2200169   4500000000100000008004100001100002000042700001400062700001600076700002200092700001800114700002200132245008900154856003700243490000800280520139000288       2022                            d1 aLudmila Botelho1 aAdam Glos1 aAkash Kundu1 aJaroslaw Miszczak1 aÖzlem Salehi1 aZoltán Zimborás00aError mitigation for variational quantum algorithms through mid-circuit measurements  uhttps://arxiv.org/abs/2108.109270 v1053 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.01709nas a2200133   4500000000100000008004100001260001200042100001600054700002200070245009200092856003700184490000700221520134700228       2022                            d  c06/20221 aAkash Kundu1 aJaroslaw Miszczak00aTransparency and enhancement in fast and slow light in q-deformed optomechanical system  uhttps://arxiv.org/abs/2205.158000 v543 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.01346nas a2200133   4500000000100000008004100001100001800042700001400060700002200074245010100096856003700197490000700234520097100241       2022                            d1 aÖzlem Salehi1 aAdam Glos1 aJaroslaw Miszczak00aUnconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization  uhttps://arxiv.org/abs/2106.090560 v213 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.01340nas a2200133   4500000000100000008004100001260001200042100001600054700002200070245004900092856003900141490000600180520102000186       2022                            d  c07/20221 aAkash Kundu1 aJaroslaw Miszczak00aVariational certification of quantum devices  uhttps://arxiv.org/abs/2011.01879v20 v73 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.00315nas a2200121   4500000000100000008004100001260001200042100002100054700002200075245004200097856004600139490000800185       2022                            d  c11/20221 aKrzysztof Domino1 aJaroslaw Miszczak00aWill you infect me with your opinion?  uhttps://doi.org/10.48550/arXiv.2208.134260 v60800538nas a2200157   4500000000100000008004100001260009400042100002000136700002000156700002000176700001800196700002200214245006500236856005700301020002200358       2021                            d  bInstitute of Fundamental Technological Research of the Polish Academy of SciencesaWarsaw1 aMateusz Żarski1 aBartosz Wójcik1 aKamil Książek1 aMarek Salamak1 aJaroslaw Miszczak00aAdvances in applicable deep-learning based defect  detection  uhttp://v4shm.ippt.pan.pl/WEO2021-BookOfAbstracts.pdf  a987-83-65550-23-100496nas a2200145   4500000000100000008004100001260009400042100002000136700002000156700001800176700002200194245005500216856005700271020002200328       2021                            d  bInstitute of Fundamental Technological Research of the Polish Academy of SciencesaWarsaw1 aBartosz Wójcik1 aMateusz Żarski1 aMarek Salamak1 aJaroslaw Miszczak00aExtracting crack characteristics from RGB-D images  uhttp://v4shm.ippt.pan.pl/WEO2021-BookOfAbstracts.pdf  a987-83-65550-23-101578nas a2200145   4500000000100000008004100001260001200042100002000054700002000074700002000094700002200114245012400136490000700260520116500267       2021                            d  c03/20221 aMateusz Żarski1 aBartosz Wójcik1 aKamil Książek1 aJaroslaw Miszczak00aFinicky transfer learning—A method of pruning convolutional neural networks for cracks classification on edge devices0 v373 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.01411nas a2200145   4500000000100000008004100001260001200042100002000054700002000074700002200094245009100116856003700207490000700244520101400251       2021                            d  c12/20211 aMateusz Żarski1 aBartosz Wójcik1 aJaroslaw Miszczak00aKrakN: Transfer Learning framework and dataset for infrastructure thin crack detection  uhttps://arxiv.org/abs/2004.123370 v163 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.01327nas a2200121   4500000000100000008004100001100002400042700002200066700002500088245008600113490000700199520099900206       2020                            d1 aMateusz Ostaszewski1 aJaroslaw Miszczak1 aPrzemysław Sadowski00aGeometrical versus time-series representation of data in quantum control learning0 v533 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.01405nas a2200193   4500000000100000008004100001260002200042100002200064700001400086700002200100700002700122700002200149700001800171700002500189700001700214245008000231856003700311520086300348       2020                            d  c01/2021bSpringer1 aArtur Frankiewicz1 aAdam Glos1 aKrzysztof Grochla1 aZbigniew Łaskarzewski1 aJaroslaw Miszczak1 aKonrad Połys1 aPrzemysław Sadowski1 aAnna Strzoda00aLP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm  uhttps://arxiv.org/abs/2010.045533 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.01620nas a2200193   4500000000100000008004100001100001000042700001400052700001200066700002200078700001600100700001800116245007300134856007100207300001100278490000800289520111500297022001401412       2020                            d1 aYe Ye1 aXiao Hang1 aJin Koh1 aJaroslaw Miszczak1 aKang Cheong1 aNeng-gang Xie00aPassive network evolution promotes group welfare in complex networks  uhttp://www.sciencedirect.com/science/article/pii/S0960077919304102  a1094640 v1303 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-077900897nas a2200133   4500000000100000008004100001100002400042700002200066700002500088700001400113245008200127490000700209520054700216       2019                            d1 aMateusz Ostaszewski1 aJaroslaw Miszczak1 aPrzemysław Sadowski1 aL. Banchi00aApproximation of quantum control correction scheme using deep neural networks0 v183 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.00910nas a2200121   4500000000100000008004100001100001400042700002200056245009600078856003700174490000700211520057000218       2019                            d1 aAdam Glos1 aJaroslaw Miszczak00aImpact of the malicious input data modification on the efficiency of quantum spatial search  uhttps://arxiv.org/abs/1802.100410 v183 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.00309nas a2200121   4500000000100000008004100001260000900042100001400051700002200065700002400087245006800111490000800179       2019                            d  c20191 aAdam Glos1 aJaroslaw Miszczak1 aMateusz Ostaszewski00aQSWalk. jl: Julia package for quantum stochastic walks analysis0 v23501818nas a2200205   4500000000100000008004100001260000800042100001000050700001400060700001200074700002200086700001600108700001300124245006400137856004700201300001600248490000700264520132700271022001401598       2019                            d  cNov1 aYe Ye1 aXiao Hang1 aJin Koh1 aJaroslaw Miszczak1 aKang Cheong1 aNeng Xie00aRatcheting based on neighboring niches determines lifestyle  uhttps://doi.org/10.1007/s11071-019-05290-1  a1821–18300 v983 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-269X01690nas a2200133   4500000000100000008004100001100001400042700002200056245006000078856003700138490000600175520136100181022001401542       2019                            d1 aAdam Glos1 aJaroslaw Miszczak00aThe role of quantum correlations in Cop and Robber game  uhttps://arxiv.org/abs/1702.079320 v63 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-561700329nas a2200133   4500000000100000008004100001100001600042700001600058700001400074700002200088700001600110245006200126490000700188       2018                            d1 aG. Sergioli1 aE. Santucci1 aL. Didaci1 aJaroslaw Miszczak1 aR. Giuntini00aA quantum-inspired version of the nearest mean classifier0 v2200339nas a2200121   4500000000100000008004100001100001400042700002200056700002400078245007100102856003700173490000700210       2018                            d1 aAdam Glos1 aJaroslaw Miszczak1 aMateusz Ostaszewski00aLimiting properties of stochastic quantum walks on directed graphs  uhttps://arxiv.org/abs/1703.017920 v5100768nas a2200133   4500000000100000008004100001260001200042100002200054700002200076245008000098856004500178490000700223520040400230       2017                            d  c02/20171 aZbigniew Puchała1 aJaroslaw Miszczak00aSymbolic integration with respect to the Haar measure on the unitary groups  uhttps://doi.org/10.1515/bpasts-2017-00030 v653 aWe 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.00287nas a2200109   4500000000100000008004100001100001600042700002200058245007600080300001200156490000900168       2016                            d1 aP. Zawadzki1 aJaroslaw Miszczak00aA general scheme for information interception in the ping pong protocol  a31620120 v201600288nas a2200121   4500000000100000008004100001100002500042700002200067700002400089245003500113300001100148490000700159       2016                            d1 aPrzemysław Sadowski1 aJaroslaw Miszczak1 aMateusz Ostaszewski00aLively quantum walks on cycles  a3753020 v4900337nas a2200133   4500000000100000008004100001100001900042700001700061700002200078700002500100245005800125300001300183490000700196       2015                            d1 aŁukasz Pawela1 aPiotr Gawron1 aJaroslaw Miszczak1 aPrzemysław Sadowski00aGeneralized open quantum walks on Apollonian networks  ae01309670 v1000317nas a2200109   4500000000100000008004100001100002200042700001900064700002000083245009700103490000700200       2014                            d1 aJaroslaw Miszczak1 aŁukasz Pawela1 aJan Sładkowski00aGeneral model for a entanglement-enhanced composed quantum game on a two-dimensional lattice0 v1301098nas a2200121   4500000000100000008004100001100002200042700002500064245006500089300001600154490000700170520079900177       2014                            d1 aJaroslaw Miszczak1 aPrzemysław Sadowski00aQuantum network exploration with a faulty sense of direction  a1238–12500 v143 aWe 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 quantum superpositions of states by distinguishing between visiting and attaining a position. We show that without a proper model of adaptiveness, it is not possible for the party representing the distraction in the sense of direction, to obtain the results analogous to the classical case. Moreover, with additional control resources the total number of attained positions is maintained if the number of visited positions is strictly limited.00257nas a2200109   4500000000100000008004100001100002100042700002200063245004000085300001400125490000800139       2014                            d1 aMichael Gettrick1 aJaroslaw Miszczak00aQuantum walks with memory on cycles  a163–1700 v39900415nas a2200157   4500000000100000008004100001100002300042700001700065700002200082700001900104700002200123245007900145300001200224490000700236022001400243       2013                            d1 aRyszard Winiarczyk1 aPiotr Gawron1 aJaroslaw Miszczak1 aŁukasz Pawela1 aZbigniew Puchała00aAnalysis of patent activity in the field of quantum information processing  a13500070 v11  a0219-749900296nas a2200097   4500000000100000008004100001100002200042245011200064300001400176490000800190       2013                            d1 aJaroslaw Miszczak00aEmploying online quantum random number generators for generating truly random quantum states in Mathematica  a127–1280 v18400820nas a2200133   4500000000100000008004100001100001600042700002200058700002200080245009200102300001400194490000700208520047100215       2013                            d1 aP. Zawadzki1 aZbigniew Puchała1 aJaroslaw Miszczak00aIncreasing the security of the ping-pong protocol by using many mutually unbiased bases  a569–5760 v123 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.00892nas a2200121   4500000000100000008004100001100002200042245006800064300001400132490000800146520060200154022001400756       2012                            d1 aJaroslaw Miszczak00aGenerating and using truly random quantum states in Mathematica  a118–1240 v1833 aThe 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 described package implements a number of functions for generating random states, which use Quantis QRNG as a source of randomness. It also provides procedures which can be used in simulations not related directly to quantum information processing.  a0010-465500276nam a2200109   4500000000100000008004100001260003300042100002200075245004800097490000600145020001500151       2012                            d  bMorgan & Claypool Publishers1 aJaroslaw Miszczak00aHigh-level Structures for Quantum Computing0 v6  a160845851200697nas a2200133   4500000000100000008004100001100002200042700001700064700002200081245004700103300001600150490000700166520039000173       2012                            d1 aJaroslaw Miszczak1 aPiotr Gawron1 aZbigniew Puchała00aQubit flip game on a Heisenberg spin chain  a1571–15830 v113 aWe 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 knowledge to gain higher mean payoff.01840nas a2200169   4500000000100000008004100001100002200042700002200064700001700086700001800103700001800121700002200139245006900161300001100230490000700241520142200248       2012                            d1 aZbigniew Puchała1 aJaroslaw Miszczak1 aPiotr Gawron1 aCharles Dunkl1 aJ.A. Holbrook1 aKarol Życzkowski00aRestricted numerical shadow and geometry of quantum entanglement  a4153090 v453 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.00925nas a2200193   4500000000100000008004100001260003400042100001700076700002300093700002200116700002200138700002400160700002500184700002200209245005500231300001200286520041100298020002200709       2011                            d  bSpringeraBerlin / Heidelberg1 aPiotr Gawron1 aPrzemysław Głomb1 aJaroslaw Miszczak1 aZbigniew Puchała1 aTadeusz Czachórski1 aStanisław Kozielski1 aUrszula Stańczyk00aEigengestures for natural human computer interface  a49–563 aWe 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 dimensionality reduction on reconstructed gesture data quality.  a978-3-642-23168-101152nas a2200157   4500000000100000008004100001100002200042700002200064700001700086700002300103245007600126300001100202490000700213520076000220022001400980       2011                            d1 aZbigniew Puchała1 aJaroslaw Miszczak1 aPiotr Gawron1 aBartłomiej Gardas00aExperimentally feasible measures of distance between quantum operations  a1–120 v103 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-075500765nas a2200109   4500000000100000008004100001100002200042245006800064300001400132490000700146520050200153       2011                            d1 aJaroslaw Miszczak00aModels of quantum computation and quantum programming languages  a305–3240 v593 aThe 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 developed using the QRAM model. We review the syntax of several existing quantum programming languages and discuss their features and limitations.01141nas a2200181   4500000000100000008004100001100001800042700001700060700001800077700002200095700002200117700002200139245005200161300001100213490000700224520071400231022001400945       2011                            d1 aCharles Dunkl1 aPiotr Gawron1 aJ.A. Holbrook1 aJaroslaw Miszczak1 aZbigniew Puchała1 aKarol Życzkowski00aNumerical shadow and geometry of quantum states  a3353010 v443 aThe 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 its numerical shadow as a probability distribution supported on its numerical range W(A), induced by the unitarily invariant Fubini-Study measure on the complex projective manifold CP^(N-1). We define generalized, mixed-states shadows of A and demonstrate their usefulness to analyse the structure of the set of quantum states and unitary dynamics therein.  a1751-811300669nas a2200121   4500000000100000008004100001100002200042700002200064245005500086300001100141490000700152520038800159       2011                            d1 aZbigniew Puchała1 aJaroslaw Miszczak00aProbability measure generated by the superfidelity  a4053010 v443 aWe 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 according to the introduced measure.01062nas a2200181   4500000000100000008004100001100002200042700001700064700002200081700001800103700001800121700002200139245006900161300001400230490000800244520061400252022001400866       2011                            d1 aZbigniew Puchała1 aPiotr Gawron1 aJaroslaw Miszczak1 aŁ. Skowronek1 aMan-Duen Choi1 aKarol Życzkowski00aProduct numerical range in a space with tensor product structure  a327–3420 v4343 aWe 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 containing the barycenter of the spectrum. While the latter set is convex, the product range needs not to be convex nor simply connected. The product numerical range of a tensor product is equal to the Minkowski product of numerical ranges of individual factors.  a0024-379500988nas a2200133   4500000000100000008004100001260000600042100002200048245008600070300001400156490000700170520066300177022001400840       2011                            d  c91 aJaroslaw Miszczak00aSingular value decomposition and matrix reorderings in quantum information theory  a897–9180 v223 aWe 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 analyze the correspondence between quantum states and operations with the help of Jamiołkowski isomorphism. The presented matrix reorderings allow us to obtain simple formulae for the composition of quantum channels and partial operations used in quantum information theory. To provide examples of the discussed operations, we utilize a package for the Mathematica computing system implementing basic functions used in the calculations related to quantum information theory.  a0129-183100245nas a2200085   4500000000100000008004100001100002200042700002300064245007200087       2010                            d1 aJaroslaw Miszczak1 aI. Sobota-Miszczak00aDesign-on-demand or how to create a target-oriented social web-site00392nas a2200145   4500000000100000008004100001100001700042700001700059700002200076700002300098245009200121300001200213490000700225022001400232       2010                            d1 aPiotr Gawron1 aJerzy Klamka1 aJaroslaw Miszczak1 aRyszard Winiarczyk00aExtending scientific computing system with structural quantum programming capabilities  a77–880 v58  a0239-752800418nas a2200157   4500000000100000008004100001100001700042700002200059700002200081700001800103700002200121245008600143300001100229490000700240022001300247       2010                            d1 aPiotr Gawron1 aZbigniew Puchała1 aJaroslaw Miszczak1 aŁ. Skowronek1 aKarol Życzkowski00aRestricted numerical range: A versatile tool in the theory of quantum information  a1022040 v51  a0022248800632nas a2200121   4500000000100000008004100001100002200042700002200064245005100086300001100137490000700148520035500155       2009                            d1 aZbigniew Puchała1 aJaroslaw Miszczak00aBound on trace distance based on superfidelity  a0243020 v793 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.01193nas a2200181   4500000000100000008004100001260000600042100002200048700002200070700002100092700001500113700002200128245005900150300001600209490000600225520076600231022001400997       2009                            d  c11 aJaroslaw Miszczak1 aZbigniew Puchała1 aPaweł Horodecki1 aA. Uhlmann1 aKarol Życzkowski00aSub- and super-fidelity as bounds for quantum fidelity  a0103–01300 v93 aWe 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– and super–fidelity are concave functions. We also show that super–fidelity is super–multiplicative while sub–fidelity is sub–multiplicative and design feasible schemes to measure these quantities in an experiment. Super–fidelity can be used to define a distance between quantum states. With respect to this metric the set of quantum states forms a part of a $N^2-1$ dimensional hypersphere.  a1533-714600312nas a2200133   4500000000100000008004100001100001700042700002200059700002000081245004800101300000800149490000700157022001400164       2008                            d1 aPiotr Gawron1 aJaroslaw Miszczak1 aJan Sładkowski00aNoise Effects in Quantum Magic Squares Game  a6670 v06  a0219-749901188nas a2200157   4500000000100000008004100001100001500042700002200057700002200079700002200101245005500123300001100178490000700189520082000196022001401016       2008                            d1 aD. Markham1 aJaroslaw Miszczak1 aZbigniew Puchała1 aKarol Życzkowski00aQuantum state discrimination: A geometric approach  a0421110 v773 aWe 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 the fidelity between two quantum states, which imply bounds for the Bures distance between the unitary orbits of both states. We thus show that, when analyzing minimal and maximal distances between states of fixed spectra, it is sufficient to consider diagonal states only. Hence when optimal discrimination is considered, given freedom up to unitary orbits, it is sufficient to consider diagonal states. This is illustrated geometrically in terms of Weyl chambers.  a1094-162200279nas a2200121   4500000000100000008004100001100002300042700001700065700002200082245003500104300001100139490000700150       2007                            d1 aRyszard Winiarczyk1 aPiotr Gawron1 aJaroslaw Miszczak00aKompilator języka QCL QCL2QML  a5–180 v2800770nas a2200145   4500000000100000008004100001260000600042100001300048700002200061700001300083245005100096300001500147490000700162520045500169       2007                            d  c91 aJ. Kosik1 aJaroslaw Miszczak1 aV. Buzek00aQuantum Parrondo's game with random strategies  a2275–2280 v543 aWe 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. We show that the CP-map scheme leads to significantly lower net gain than the quantum-walk scheme.00220nas a2200085   4500000000100000008004100001100002200042245006300064490000700127       2005                            d1 aJaroslaw Miszczak00aDescription and visualisation of quantum circuits with XML0 v1700246nas a2200097   4500000000100000008004100001100001700042700002200059245006100081490000600142       2005                            d1 aPiotr Gawron1 aJaroslaw Miszczak00aNumerical simulations of mixed state quantum computation0 v300522nas a2200121   4500000000100000008004100001100001700042700002200059245004700081300001600128490000600144520025000150       2005                            d1 aPiotr Gawron1 aJaroslaw Miszczak00aQuantum Implementation of Parrondo Paradox  aL471–L4780 v53 aWe propose a quantum implementation of a capital-dependent Parrondo's paradox that uses O(log2(n)) qubits, where n is the number of Parrondo games. We present its implementation in the quantum computer language (QCL) and show simulation results.00290nas a2200121   4500000000100000008004100001260000900042100001700051700002200068700002000090700002200110245003600132       2005                            d  bWKŁ1 aPiotr Gawron1 aJaroslaw Miszczak1 aAndrzej Grzywak1 aAndrzej Kwiecień00aWysokowydajne sieci komputerowe00472nam a2200169   4500000000100000008004100001260004900042100002000091700001700111700002300128700001300151700002300164700002100187700002200208700002000230245005200250       2004                            d  bWydawnictwo Politechniki ŚląskiejaGliwice1 aStefan Węgrzyn1 aJerzy Klamka1 aSławomir Bugajski1 aM. Gibas1 aRyszard Winiarczyk1 aLech Znamirowski1 aJaroslaw Miszczak1 aSławomir Nowak00aNano i kwantowe systemy informatyki. Wyd.Drugie00387nam a2200145   4500000000100000008004100001260005900042100002000101700001700121700002200138700002400160245003300184250000600217020001800223       2003                            d  bWydawnictwo Pracowni Komputerowej Jacka Skalmierskiego1 aStefan Węgrzyn1 aJerzy Klamka1 aJaroslaw Miszczak1 aTadeusz Czachórski00aKwantowe systemy informatyki  a2  a83-89105-46-200490nam a2200181   4500000000100000008004100001260004900042100002000091700001700111700002300128700001300151700002300164700002100187700002200208700002000230245004000250020001800290       2003                            d  bWydawnictwo Politechniki ŚląskiejaGliwice1 aStefan Węgrzyn1 aJerzy Klamka1 aSławomir Bugajski1 aM. Gibas1 aRyszard Winiarczyk1 aLech Znamirowski1 aJaroslaw Miszczak1 aSławomir Nowak00aNano i Kwantowe Systemy Informatyki  a83-7335-295-300197nas a2200085   4500000000100000008004100001100002200042245004000064490000700104       2002                            d1 aJaroslaw Miszczak00aQuantum algorithm for factorization0 v14