<?xml version="1.0" encoding="UTF-8"?>
<xml><records><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Charles Dunkl</style></author><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">J.A. Holbrook</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author><author><style face="normal" font="default" size="100%">Karol Życzkowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Numerical shadow and geometry of quantum states</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2011</style></year></dates><secondary-title><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor.</style></secondary-title><pages><style face="normal" font="default" size="100%">335301</style></pages><volume><style face="normal" font="default" size="100%">44</style></volume><number><style face="normal" font="default" size="100%">33</style></number><abstract><style face="normal" font="default" size="100%">The totality of normalised density matrices of order N forms a convex set Q\_N in R^(N^2-1). Working with the flat geometry induced by the Hilbert-Schmidt distance we consider images of orthogonal projections of Q\_N onto a two-plane and show that they are similar to the numerical ranges of matrices of order N. For a matrix A of a order N one defines 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.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1104.2760 IF=1.641(2010);</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Przemysław Głomb</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author><author><style face="normal" font="default" size="100%">Stanisław Kozielski</style></author><author><style face="normal" font="default" size="100%">Urszula Stańczyk</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Eigengestures for natural human computer interface</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2011</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Man-Machine Interactions 2</style></secondary-title><pages><style face="normal" font="default" size="100%">49–56</style></pages><abstract><style face="normal" font="default" size="100%">We present the application of Principal Component Analysis for data acquired during the design of a natural gesture interface. We investigate the concept of an eigengesture for motion capture hand gesture data and present the visualisation of principal components obtained in the course of conducted experiments. We also show the influence of dimensionality reduction on reconstructed gesture data quality.</style></abstract><isbn><style face="normal" font="default" size="100%">978-3-642-23168-1</style></isbn><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin / Heidelberg</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1105.1293</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Ryszard Winiarczyk</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Extending scientiﬁc computing system with structural quantum programming capabilities</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2010</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences - Technical Sciences</style></secondary-title><pages><style face="normal" font="default" size="100%">77–88</style></pages><volume><style face="normal" font="default" size="100%">58</style></volume><number><style face="normal" font="default" size="100%">1</style></number><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1006.1549</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Andrzej Grzywak</style></author><author><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2005</style></year></dates><section><style face="normal" font="default" size="100%">Symulacje gier kwantowych</style></section><publisher><style face="normal" font="default" size="100%">WKŁ</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Numerical simulations of mixed state quantum computation</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2005</style></year></dates><secondary-title><style face="normal" font="default" size="100%">International Journal of Quantum Information</style></secondary-title><volume><style face="normal" font="default" size="100%">3</style></volume><number><style face="normal" font="default" size="100%">1</style></number><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantum Implementation of Parrondo Paradox</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2005</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Fluctuation and Noise Letters</style></secondary-title><pages><style face="normal" font="default" size="100%">L471–L478</style></pages><volume><style face="normal" font="default" size="100%">5</style></volume><number><style face="normal" font="default" size="100%">4</style></number><abstract><style face="normal" font="default" size="100%">We 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.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:quant-ph/0502185</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Jan Sładkowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Noise Effects in Quantum Magic Squares Game</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2008</style></year></dates><secondary-title><style face="normal" font="default" size="100%">International Journal of Quantum Information</style></secondary-title><pages><style face="normal" font="default" size="100%">667</style></pages><volume><style face="normal" font="default" size="100%">06</style></volume><number><style face="normal" font="default" size="100%">Supp</style></number><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:0801.4848</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Ł. Skowronek</style></author><author><style face="normal" font="default" size="100%">Karol Życzkowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Restricted numerical range: A versatile tool in the theory of quantum information</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2010</style></year></dates><secondary-title><style face="normal" font="default" size="100%">J. Math. Phys.</style></secondary-title><pages><style face="normal" font="default" size="100%">102204</style></pages><volume><style face="normal" font="default" size="100%">51</style></volume><number><style face="normal" font="default" size="100%">10</style></number><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:0905.3646 IF=1.291(2010);</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michael Gettrick</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantum walks with memory on cycles</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2014</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Physica A</style></secondary-title><pages><style face="normal" font="default" size="100%">163–170</style></pages><volume><style face="normal" font="default" size="100%">399</style></volume><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">J. Kosik</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">V. Buzek</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantum Parrondo's game with random strategies</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style face="normal" font="default" size="100%">9</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Journal of Modern Optics</style></secondary-title><pages><style face="normal" font="default" size="100%">2275–228</style></pages><volume><style face="normal" font="default" size="100%">54</style></volume><number><style face="normal" font="default" size="100%">13-15</style></number><abstract><style face="normal" font="default" size="100%">We present a quantum implementation of Parrondo's game with randomly switched strategies using (1) a quantum walk as a source of 'randomness' and (2) a completely positive (CP) map as a randomized evolution. The game exhibits the same paradox as in the classical setting where a combination of two losing strategies might result in a winning strategy. We show that the CP-map scheme leads to significantly lower net gain than the quantum-walk scheme.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">D. Markham</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author><author><style face="normal" font="default" size="100%">Karol Życzkowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantum state discrimination: A geometric approach</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2008</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Phys. Rev. A</style></secondary-title><pages><style face="normal" font="default" size="100%">042111</style></pages><volume><style face="normal" font="default" size="100%">77</style></volume><number><style face="normal" font="default" size="100%">4</style></number><abstract><style face="normal" font="default" size="100%">We analyze the problem of finding sets of quantum states that can be deterministically discriminated. From a geometric point of view, this problem is equivalent to that of embedding a simplex of points whose distances are maximal with respect to the Bures distance (or trace distance). We derive upper and lower bounds for the trace distance and for 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.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:0711.4286 IF=2.908(2008);</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Description and visualisation of quantum circuits with XML</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2005</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></secondary-title><volume><style face="normal" font="default" size="100%">17</style></volume><number><style face="normal" font="default" size="100%">4</style></number><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantum algorithm for factorization</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2002</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></secondary-title><volume><style face="normal" font="default" size="100%">14</style></volume><number><style face="normal" font="default" size="100%">2</style></number><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Employing online quantum random number generators for generating truly random quantum states in Mathematica</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2013</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Comput. Phys. Commun.</style></secondary-title><pages><style face="normal" font="default" size="100%">127–128</style></pages><volume><style face="normal" font="default" size="100%">184</style></volume><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Generating and using truly random quantum states in Mathematica</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2012</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Computer Physics Communications</style></secondary-title><pages><style face="normal" font="default" size="100%">118–124</style></pages><volume><style face="normal" font="default" size="100%">183</style></volume><number><style face="normal" font="default" size="100%">1</style></number><abstract><style face="normal" font="default" size="100%">The problem of generating random quantum states is of a great interest from the quantum information theory point of view. In this paper we present a package for Mathematica computing system harnessing a specific piece of hardware, namely Quantis quantum random number generator (QRNG), for investigating statistical properties of quantum states. The 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.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>28</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">High-level Structures for Quantum Computing</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2012</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Synthesis Lectures on Quantum Computing</style></secondary-title><volume><style face="normal" font="default" size="100%">6</style></volume><isbn><style face="normal" font="default" size="100%">1608458512</style></isbn><publisher><style face="normal" font="default" size="100%"/></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Models of quantum computation and quantum programming languages</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2011</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences - Technical Sciences</style></secondary-title><pages><style face="normal" font="default" size="100%">305–324</style></pages><volume><style face="normal" font="default" size="100%">59</style></volume><number><style face="normal" font="default" size="100%">3</style></number><abstract><style face="normal" font="default" size="100%">The goal of this report is to provide an introduction to the basic computational models used in quantum information theory. We various review models of quantum Turing machine, quantum circuits and quantum random access machine (QRAM) along with their classical counterparts. We also provide an introduction to quantum programming languages, which are developed using the QRAM model. We review the syntax of several existing quantum programming languages and discuss their features and limitations.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Singular value decomposition and matrix reorderings in quantum information theory</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style face="normal" font="default" size="100%">9</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">J. Mod. Phys. C</style></secondary-title><pages><style face="normal" font="default" size="100%">897–918</style></pages><volume><style face="normal" font="default" size="100%">22</style></volume><number><style face="normal" font="default" size="100%">9</style></number><abstract><style face="normal" font="default" size="100%">We review Schmidt and Kraus decompositions in the form of singular value decomposition using operations of reshaping, vectorization and reshuffling. We use the introduced notation to 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.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Qubit flip game on a Heisenberg spin chain</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2012</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Quantum Information Processing</style></secondary-title><pages><style face="normal" font="default" size="100%">1571–1583</style></pages><volume><style face="normal" font="default" size="100%">11</style></volume><number><style face="normal" font="default" size="100%">6</style></number><abstract><style face="normal" font="default" size="100%">We study a quantum version of a penny flip game played using control parameters of the Hamiltonian in the Heisenberg model. Moreover, we extend this game by introducing auxiliary spins which can be used to alter the behaviour of the system. We show that a player aware of the complex structure of the system used to implement the game can use this knowledge to gain higher mean payoff.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1108.0642</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">I. Sobota-Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Design-on-demand or how to create a target-oriented social web-site</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2010</style></year></dates><secondary-title><style face="normal" font="default" size="100%">arXiv:1010.4934</style></secondary-title><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Łukasz Pawela</style></author><author><style face="normal" font="default" size="100%">Jan Sładkowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">General model for a entanglement-enhanced composed quantum game on a two-dimensional lattice</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2014</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Fluctuation and Noise Letters</style></secondary-title><volume><style face="normal" font="default" size="100%">13</style></volume><number><style face="normal" font="default" size="100%">2</style></number><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1306.4506</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author><author><style face="normal" font="default" size="100%">Paweł Horodecki</style></author><author><style face="normal" font="default" size="100%">A. Uhlmann</style></author><author><style face="normal" font="default" size="100%">Karol Życzkowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Sub- and super-fidelity as bounds for quantum fidelity</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style face="normal" font="default" size="100%">1</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%"/></secondary-title><pages><style face="normal" font="default" size="100%">0103–0130</style></pages><volume><style face="normal" font="default" size="100%">9</style></volume><number><style face="normal" font="default" size="100%"/></number><abstract><style face="normal" font="default" size="100%">We derive several bounds on fidelity between quantum states. In particular we show that fidelity is bounded from above by a simple to compute quantity we call super–fidelity. It is analogous to another quantity called sub–fidelity. For any two states of a two–dimensional quantum system ($N=2$) all three quantities coincide. We demonstrate that sub– 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.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:0805.2037 IF=2.980(209); IF5=2.402(2010);</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Przemysław Sadowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quantum network exploration with a faulty sense of direction</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2014</style></year></dates><secondary-title><style face="normal" font="default" size="100%"/></secondary-title><pages><style face="normal" font="default" size="100%">1238–1250</style></pages><volume><style face="normal" font="default" size="100%">14</style></volume><number><style face="normal" font="default" size="100%"/></number><abstract><style face="normal" font="default" size="100%">We develop a model which can be used to analyse the scenario of exploring quantum network with a distracted sense of direction. Using this model we analyse the behaviour of quantum mobile agents operating with non-adaptive and adaptive strategies which can be employed in this scenario. We introduce the notion of node visiting suitable for analysing 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.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Łukasz Pawela</style></author><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Przemysław Sadowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Generalized open quantum walks on Apollonian networks</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2015</style></year></dates><secondary-title><style face="normal" font="default" size="100%">PLoS ONE</style></secondary-title><pages><style face="normal" font="default" size="100%">e0130967</style></pages><volume><style face="normal" font="default" size="100%">10</style></volume><number><style face="normal" font="default" size="100%">7</style></number><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1407.1184</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Ł. Skowronek</style></author><author><style face="normal" font="default" size="100%">Man-Duen Choi</style></author><author><style face="normal" font="default" size="100%">Karol Życzkowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Product numerical range in a space with tensor product structure</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2011</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Linear Algebra Appl.</style></secondary-title><pages><style face="normal" font="default" size="100%">327–342</style></pages><volume><style face="normal" font="default" size="100%">434</style></volume><number><style face="normal" font="default" size="100%">1</style></number><abstract><style face="normal" font="default" size="100%">We study operators acting on a tensor product Hilbert space and investigate their product numerical range, product numerical radius and separable numerical range. Concrete bounds for the product numerical range for Hermitian operators are derived. Product numerical range of a non-Hermitian operator forms a subset of the standard numerical range 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.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1008.3482 IF=1.005(2010);</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Probability measure generated by the superfidelity</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2011</style></year></dates><secondary-title><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor.</style></secondary-title><pages><style face="normal" font="default" size="100%">405301</style></pages><volume><style face="normal" font="default" size="100%">44</style></volume><abstract><style face="normal" font="default" size="100%">We study the probability measure on the space of density matrices induced by the metric defined by using superfidelity. We give the formula for the probability density of eigenvalues. We also study some statistical properties of the set of density matrices equipped with the introduced measure and provide a method for generating density matrices according to the introduced measure.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1107.2792 IF=1.641(2010);</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Symbolic integration with respect to the Haar measure on the unitary groups</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2017</style></year><pub-dates><date><style face="normal" font="default" size="100%">02/2017</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences</style></secondary-title><urls><style face="normal" font="default" size="100%">https://doi.org/10.1515/bpasts-2017-0003</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1515/bpasts-2017-0003</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">65</style></volume><issue><style face="normal" font="default" size="100%">1</style></issue><section><style face="normal" font="default" size="100%">21</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1109.4244</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Bound on trace distance based on superfidelity</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2009</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Phys. Rev. A</style></secondary-title><pages><style face="normal" font="default" size="100%">024302</style></pages><volume><style face="normal" font="default" size="100%">79</style></volume><abstract><style face="normal" font="default" size="100%">We 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.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:0811.2323 IF=2.866(2009);</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Charles Dunkl</style></author><author><style face="normal" font="default" size="100%">J.A. Holbrook</style></author><author><style face="normal" font="default" size="100%">Karol Życzkowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Restricted numerical shadow and geometry of quantum entanglement</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2012</style></year></dates><secondary-title><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor.</style></secondary-title><pages><style face="normal" font="default" size="100%">415309</style></pages><volume><style face="normal" font="default" size="100%">45</style></volume><abstract><style face="normal" font="default" size="100%">The restricted numerical range W\_R(A) of an operator A acting on a D-dimensional Hilbert space is defined as a set of all possible expectation values of this operator among pure states which belong to a certain subset R of the of set of pure quantum states of dimension D. One considers for instance the set of real states, or in the case 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&gt; 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.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1201.2524</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Experimentally feasible measures of distance between quantum operations</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2011</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Quantum Information Processing</style></secondary-title><pages><style face="normal" font="default" size="100%">1–12</style></pages><volume><style face="normal" font="default" size="100%">10</style></volume><number><style face="normal" font="default" size="100%">1</style></number><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:0911.0567 IF=2.085(2010);</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>28</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Kwantowe systemy informatyki</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2003</style></year></dates><edition><style face="normal" font="default" size="100%">2</style></edition><isbn><style face="normal" font="default" size="100%">83-89105-46-2</style></isbn><publisher><style face="normal" font="default" size="100%">Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>28</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Sławomir Bugajski</style></author><author><style face="normal" font="default" size="100%">M. Gibas</style></author><author><style face="normal" font="default" size="100%">Ryszard Winiarczyk</style></author><author><style face="normal" font="default" size="100%">Lech Znamirowski</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Sławomir Nowak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Nano i kwantowe systemy informatyki. Wyd.Drugie</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2004</style></year></dates><publisher><style face="normal" font="default" size="100%">Wydawnictwo Politechniki Śląskiej</style></publisher><pub-location><style face="normal" font="default" size="100%">Gliwice</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>28</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></author><author><style face="normal" font="default" size="100%">Jerzy Klamka</style></author><author><style face="normal" font="default" size="100%">Sławomir Bugajski</style></author><author><style face="normal" font="default" size="100%">M. Gibas</style></author><author><style face="normal" font="default" size="100%">Ryszard Winiarczyk</style></author><author><style face="normal" font="default" size="100%">Lech Znamirowski</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Sławomir Nowak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Nano i Kwantowe Systemy Informatyki</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2003</style></year></dates><isbn><style face="normal" font="default" size="100%">83-7335-295-3</style></isbn><publisher><style face="normal" font="default" size="100%">Wydawnictwo Politechniki Śląskiej</style></publisher><pub-location><style face="normal" font="default" size="100%">Gliwice</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ryszard Winiarczyk</style></author><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Kompilator języka QCL QCL2QML</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2007</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Studia Informatica</style></secondary-title><pages><style face="normal" font="default" size="100%">5–18</style></pages><volume><style face="normal" font="default" size="100%">28</style></volume><number><style face="normal" font="default" size="100%">4</style></number><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ryszard Winiarczyk</style></author><author><style face="normal" font="default" size="100%">Piotr Gawron</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Łukasz Pawela</style></author><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Analysis of patent activity in the field of quantum information processing</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2013</style></year></dates><secondary-title><style face="normal" font="default" size="100%">International Journal of Quantum Information</style></secondary-title><pages><style face="normal" font="default" size="100%">1350007</style></pages><volume><style face="normal" font="default" size="100%">11</style></volume><number><style face="normal" font="default" size="100%">1</style></number><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1212.2439</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">P. Zawadzki</style></author><author><style face="normal" font="default" size="100%">Zbigniew Puchała</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Increasing the security of the ping-pong protocol by using many mutually unbiased bases</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2013</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Quantum Information Processing</style></secondary-title><pages><style face="normal" font="default" size="100%">569–576</style></pages><volume><style face="normal" font="default" size="100%">12</style></volume><number><style face="normal" font="default" size="100%">1</style></number><abstract><style face="normal" font="default" size="100%">In this paper we propose an extended version of the ping-pong protocol and study its security. The proposed protocol incorporates the usage of mutually unbiased bases in the control mode. We show that, by increasing the number of bases, it is possible to improve the security of this protocol. We also provide the upper bounds on eavesdropping average non-detection probability and propose a control mode modification that increases the attack detection probability.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">arXiv:1201.3230</style></notes></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">P. Zawadzki</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A general scheme for information interception in the ping pong protocol</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2016</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Advances in Mathematical Physics,</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.1155/2016/3162012</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">3162012</style></pages><volume><style face="normal" font="default" size="100%">2016</style></volume><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Przemysław Sadowski</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Mateusz Ostaszewski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Lively quantum walks on cycles</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2016</style></year></dates><secondary-title><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor.</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.1088/1751-8113/49/37/375302</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">375302</style></pages><volume><style face="normal" font="default" size="100%">49</style></volume><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Glos</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Mateusz Ostaszewski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Limiting properties of stochastic quantum walks on directed graphs</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2018</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Journal of Physics A: Mathematical and Theoretical</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/1703.01792</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1088/1751-8121/aa9a4a</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">51</style></volume><issue><style face="normal" font="default" size="100%">3</style></issue><section><style face="normal" font="default" size="100%">035304</style></section><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Glos</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Mateusz Ostaszewski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">QSWalk. jl: Julia package for quantum stochastic walks analysis</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2019</style></year><pub-dates><date><style face="normal" font="default" size="100%">2019</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Computer Physics Communications</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">doi.org/10.1016/j.cpc.2018.09.001</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">235</style></volume><section><style face="normal" font="default" size="100%">414</style></section><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">G. Sergioli</style></author><author><style face="normal" font="default" size="100%">E. Santucci</style></author><author><style face="normal" font="default" size="100%">L. Didaci</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">R. Giuntini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A quantum-inspired version of the nearest mean classifier</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2018</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Soft Computing</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/s00500-016-2478-2</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">22</style></volume><issue><style face="normal" font="default" size="100%">3</style></issue><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Glos</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Impact of the malicious input data modification on the efficiency of quantum spatial search</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2019</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Quantum Information Processing</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/1802.10041</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/s11128-019-2459-3</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">18</style></volume><section><style face="normal" font="default" size="100%">343</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, we demonstrate that the efficiency of quantum spatial search can be significantly altered by malicious manipulation of the input data in the client–server model. We achieve this by exploiting exceptional configuration effect on Szegedy spatial search and proposing a framework suitable for analysing efficiency of attacks on quantum 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Glos</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The role of quantum correlations in Cop and Robber game</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2019</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Quantum Studies: Mathematics and Foundations</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/1702.07932</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/s40509-017-0148-4</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">6</style></volume><issue><style face="normal" font="default" size="100%">1</style></issue><section><style face="normal" font="default" size="100%">15</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mateusz Ostaszewski</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Przemysław Sadowski</style></author><author><style face="normal" font="default" size="100%">L. Banchi</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Approximation of quantum control correction scheme using deep neural networks</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2019</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Quantum Information Processing</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/s11128-019-2240-7</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">18</style></volume><section><style face="normal" font="default" size="100%">126</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We study the functional relationship between quantum control pulses in the idealized case and the pulses in the presence of an unwanted drift. We show that a class of artificial neural networks called LSTM is able to model this functional relationship with high efficiency, and hence the correction scheme required to counterbalance the effect of the 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mateusz Ostaszewski</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Przemysław Sadowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Geometrical versus time-series representation of data in quantum control learning</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2020</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Journal of Physics A: Mathematical and Theoretical</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.1088/1751-8121/ab8244</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">53</style></volume><issue><style face="normal" font="default" size="100%">19</style></issue><section><style face="normal" font="default" size="100%">195301</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Recently 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ye Ye</style></author><author><style face="normal" font="default" size="100%">Xiao Hang</style></author><author><style face="normal" font="default" size="100%">Jin Koh</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Kang Cheong</style></author><author><style face="normal" font="default" size="100%">Neng Xie</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Ratcheting based on neighboring niches determines lifestyle</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2019</style></year><pub-dates><date><style face="normal" font="default" size="100%">Nov</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Nonlinear Dynamics</style></secondary-title><urls><style face="normal" font="default" size="100%">https://doi.org/10.1007/s11071-019-05290-1</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/s11071-019-05290-1</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">1821–1830</style></pages><volume><style face="normal" font="default" size="100%">98</style></volume><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, a co-evolution method of game dynamics and network structure is adopted to demonstrate that neighboring niches of an individual or population may have great influence in determining lifestyle adoption. The model encompasses network structure evolution, denoted CaseA, and pure games participated in by individuals in the network with 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ye Ye</style></author><author><style face="normal" font="default" size="100%">Xiao Hang</style></author><author><style face="normal" font="default" size="100%">Jin Koh</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Kang Cheong</style></author><author><style face="normal" font="default" size="100%">Neng-gang Xie</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Passive network evolution promotes group welfare in complex networks</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2020</style></year></dates><secondary-title><style face="normal" font="default" size="100%"/></secondary-title><urls><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0960077919304102</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.chaos.2019.109464</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">109464</style></pages><volume><style face="normal" font="default" size="100%">130</style></volume><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The Parrondo’s paradox is a counter-intuitive phenomenon in which individually losing strategies, canonically termed Game&#160;A and Game&#160;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&#160;A, representing a rewiring process on the network, and a two-branch Game&#160;B, representing redistributive interactions between agents. Simulation results indicate that stochastically mixing Action&#160;A and Game&#160;B can produce enhanced, and even winning outcomes, despite Game&#160;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&#160;B.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Artur Frankiewicz</style></author><author><style face="normal" font="default" size="100%">Adam Glos</style></author><author><style face="normal" font="default" size="100%">Krzysztof Grochla</style></author><author><style face="normal" font="default" size="100%">Zbigniew Łaskarzewski</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Konrad Połys</style></author><author><style face="normal" font="default" size="100%">Przemysław Sadowski</style></author><author><style face="normal" font="default" size="100%">Anna Strzoda</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">LP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style face="normal" font="default" size="100%">01/2021</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2010.04553</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/978-3-030-68110-4_14</style></electronic-resource-num><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The LP WAN networks use gateways or base stations to communicate with devices distributed on large distances, up&#160;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 &lt;em&gt;k&lt;/em&gt;-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.&lt;/p&gt;&#13;
</style></abstract><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Özlem Salehi</style></author><author><style face="normal" font="default" size="100%">Adam Glos</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Quantum Information Processing</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2106.09056</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/s11128-021-03405-5</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">21</style></volume><section><style face="normal" font="default" size="100%">67</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Quantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, the problems need to be formulated as unconstrained binary models, taking into account limitation and advantages of quantum devices. In this work, we provide a detailed analysis of the 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Akash Kundu</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Variational certification of quantum devices</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year><pub-dates><date><style face="normal" font="default" size="100%">07/2022</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Quantum Science and Technology</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2011.01879v2</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1088/2058-9565/ac8572</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">7</style></volume><section><style face="normal" font="default" size="100%">045017</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;One of the requirements imposed on the realistic quantum computers is to provide computation results which can be repeated and reproduced. In the situation when one needs to repeat the quantum computation procedure several times, it is crucial that the copies of the quantum devices are similar in the sense of the produced results. In this work, we 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mateusz Żarski</style></author><author><style face="normal" font="default" size="100%">Bartosz Wójcik</style></author><author><style face="normal" font="default" size="100%">Kamil Książek</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Finicky transfer learning—A method of pruning convolutional neural networks for cracks classification on edge devices</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style face="normal" font="default" size="100%">03/2022</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Computer-Aided Civil And Infrastructure Engineering</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.1111/mice.12755</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">37</style></volume><issue><style face="normal" font="default" size="100%">4</style></issue><section><style face="normal" font="default" size="100%">500</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;High demand for computational power significantly limits the possibility of using modern deep learning methods in the environments where one has to deal with devices limited by the performance and the energy constraints. To address this issue, this paper proposes a novel method of combining the pruning and the transfer learning 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ludmila Botelho</style></author><author><style face="normal" font="default" size="100%">Adam Glos</style></author><author><style face="normal" font="default" size="100%">Akash Kundu</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Özlem Salehi</style></author><author><style face="normal" font="default" size="100%">Zoltán Zimborás</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Error mitigation for variational quantum algorithms through mid-circuit measurements</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Physical Review A</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2108.10927</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1103/PhysRevA.105.022441</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">105</style></volume><section><style face="normal" font="default" size="100%">022441</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Noisy 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mateusz Żarski</style></author><author><style face="normal" font="default" size="100%">Bartosz Wójcik</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">KrakN: Transfer Learning framework and dataset for infrastructure thin crack detection</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year><pub-dates><date><style face="normal" font="default" size="100%">12/2021</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">SoftwareX</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2004.12337</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1016/j.softx.2021.100893</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">16</style></volume><section><style face="normal" font="default" size="100%">100893</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Monitoring the technical condition of infrastructure is a crucial element of its maintenance. Although there are many deep learning models intended for this purpose, they are severely limited in their application due to labour-intensive gathering of new datasets and high demand for computing power during model training. To overcome these limiting 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mateusz Żarski</style></author><author><style face="normal" font="default" size="100%">Bartosz Wójcik</style></author><author><style face="normal" font="default" size="100%">Kamil Książek</style></author><author><style face="normal" font="default" size="100%">Marek Salamak</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Advances in applicable deep-learning based defect  detection</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year></dates><secondary-title><style face="normal" font="default" size="100%">2nd Workshop on Engineering  Optimization – WEO 2021</style></secondary-title><urls><style face="normal" font="default" size="100%">http://v4shm.ippt.pan.pl/WEO2021-BookOfAbstracts.pdf</style></urls><isbn><style face="normal" font="default" size="100%">987-83-65550-23-1</style></isbn><publisher><style face="normal" font="default" size="100%">Institute of Fundamental Technological Research of the Polish Academy of Sciences</style></publisher><pub-location><style face="normal" font="default" size="100%">Warsaw</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bartosz Wójcik</style></author><author><style face="normal" font="default" size="100%">Mateusz Żarski</style></author><author><style face="normal" font="default" size="100%">Marek Salamak</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Extracting crack characteristics from RGB-D images</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2021</style></year></dates><secondary-title><style face="normal" font="default" size="100%">2nd Workshop on Engineering  Optimization – WEO 2021</style></secondary-title><urls><style face="normal" font="default" size="100%">http://v4shm.ippt.pan.pl/WEO2021-BookOfAbstracts.pdf</style></urls><isbn><style face="normal" font="default" size="100%">987-83-65550-23-1</style></isbn><publisher><style face="normal" font="default" size="100%">Institute of Fundamental Technological Research of the Polish Academy of Sciences</style></publisher><pub-location><style face="normal" font="default" size="100%">Warsaw</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Constructing games on networks for controlling the inequalities in the capital distribution</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Physica A: Statistical Mechanics and its Applications</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2201.10913</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1016/j.physa.2022.126997</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">594</style></volume><section><style face="normal" font="default" size="100%">126997</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The inequality in capital or resource distribution is among the important phenomena observed in populations. The sources of inequality and methods for controlling it are of practical interest. To study this phenomenon, we introduce a model of interaction between agents in the network designed for the purpose of reducing the inequality in the 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Akash Kundu</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Transparency and enhancement in fast and slow light in q-deformed optomechanical system</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year><pub-dates><date><style face="normal" font="default" size="100%">06/2022</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Annalen der Physik</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2205.15800</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1002/andp.202200026</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">54</style></volume><issue><style face="normal" font="default" size="100%">22</style></issue><section><style face="normal" font="default" size="100%">2200026</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Nonclassical phenomena can be enhanced by introducing &lt;span style="font-size:116%"&gt;&lt;em&gt;q&lt;/em&gt;&lt;/span&gt;-deformation in optomechanical systems. This motivated us to investigate the optical response in a &lt;span style="font-size:116%"&gt;&lt;em&gt;q&lt;/em&gt;&lt;/span&gt;-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 &lt;span style="font-size:116%"&gt;&lt;span style="font-family:mathjax_main"&gt;0&lt;/span&gt;&lt;span style="font-family:mathjax_main"&gt;&lt;&lt;/span&gt;&lt;em&gt;q&lt;/em&gt;&lt;span style="font-family:mathjax_main"&gt;&lt;&lt;/span&gt;&lt;span style="font-family:mathjax_main"&gt;0.5&lt;/span&gt;&lt;/span&gt;, 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 &lt;span style="font-size:116%"&gt;&lt;em&gt;q&lt;/em&gt;&lt;/span&gt;-deformation provides a novel method for manipulating and significantly enhancing optical phenomena not only in arbitrarily deformed optomechanical systems but also in anyon models.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mateusz Żarski</style></author><author><style face="normal" font="default" size="100%">Bartosz Wójcik</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Bartlomiej Blachowski</style></author><author><style face="normal" font="default" size="100%">Mariusz Ostrowski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Computer Vision Based Inspection on Post-Earthquake With UAV Synthetic Dataset</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year><pub-dates><date><style face="normal" font="default" size="100%">10/2022</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">IEEE Access</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2210.05282</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1109/ACCESS.2022.3212918</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">10</style></volume><section><style face="normal" font="default" size="100%">108134</style></section><abstract><style face="normal" font="default" size="100%">&lt;div&gt;The area affected by the earthquake is vast and often difficult to entirely cover, and the earthquake itself is a sudden event that causes multiple defects simultaneously, that cannot be effectively traced using traditional, manual methods. This article presents an innovative approach to the problem of detecting damage after sudden events by using 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.&lt;/div&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Krzysztof Domino</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Will you infect me with your opinion?</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2022</style></year><pub-dates><date><style face="normal" font="default" size="100%">11/2022</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Physica A: Statistical Mechanics and its Applications</style></secondary-title><urls><style face="normal" font="default" size="100%">https://doi.org/10.48550/arXiv.2208.13426</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1016/j.physa.2022.128289</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">608</style></volume><issue><style face="normal" font="default" size="100%">128289</style></issue><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Symbolic quantum programming for supporting applications of quantum computing technologies</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2023</style></year></dates><secondary-title><style face="normal" font="default" size="100%">QP2023 Workshop, Programming'23, </style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2302.09401</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1145/3594671.3594688</style></electronic-resource-num><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The 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.&lt;/p&gt;&#13;
</style></abstract><publisher><style face="normal" font="default" size="100%">Association for Computing Machinery</style></publisher><pub-location><style face="normal" font="default" size="100%">Tokyo, Japan, March 13-17, 2023</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bartosz Wójcik</style></author><author><style face="normal" font="default" size="100%">Mateusz Żarski</style></author><author><style face="normal" font="default" size="100%">Kamil Książek</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Mirosław Skibniewski</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A deep learning method for hard-hat-wearing detection based on head center localization</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2023</style></year><pub-dates><date><style face="normal" font="default" size="100%">10/2023</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences</style></secondary-title><urls><style face="normal" font="default" size="100%">https://journals.pan.pl/dlibra/publication/147340/edition/128931/content</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.24425/bpasts.2023.147340</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">71 (EA)</style></volume><issue><style face="normal" font="default" size="100%">6</style></issue><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Rule switching mechanisms in the Game of Life with synchronous and asynchronous updating policy</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2023</style></year><pub-dates><date><style face="normal" font="default" size="100%">10/2023</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Physica Scripta</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2310.05979</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1088/1402-4896/acfc6c</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">98</style></volume><section><style face="normal" font="default" size="100%">115210</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Robert Glück</style></author><author><style face="normal" font="default" size="100%">Ivan Lanese</style></author><author><style face="normal" font="default" size="100%">Claudio Mezzina</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Iain Phillips</style></author><author><style face="normal" font="default" size="100%">Irek Ulidowski</style></author><author><style face="normal" font="default" size="100%">Germán Vidal</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards a Taxonomy for Reversible Computation Approaches</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2023</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Reversible Computation 2023</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/978-3-031-38100-3_3</style></electronic-resource-num><pages><style face="normal" font="default" size="100%">24–39</style></pages><number><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></number><isbn><style face="normal" font="default" size="100%">9783031381003</style></isbn><publisher><style face="normal" font="default" size="100%">Springer Nature Switzerland</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Akash Kundu</style></author><author><style face="normal" font="default" size="100%">Przemysław Bedełek</style></author><author><style face="normal" font="default" size="100%">Mateusz Ostaszewski</style></author><author><style face="normal" font="default" size="100%">Onur Danaci</style></author><author><style face="normal" font="default" size="100%">Yash Patel</style></author><author><style face="normal" font="default" size="100%">Vedran Dunjko</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Enhancing quantum variational state diagonalization using reinforcement learning techniques</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2024</style></year><pub-dates><date><style face="normal" font="default" size="100%">01/2024</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">New Journal of Physics</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.1088/1367-2630/ad1b7f</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">26</style></volume><section><style face="normal" font="default" size="100%">013034</style></section><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Katarzyna Gawlak</style></author><author><style face="normal" font="default" size="100%">Jarosław Konieczny</style></author><author><style face="normal" font="default" size="100%">Krzysztof Domino</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Statistical analysis of geoinformation data for increasing railway safety</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2025</style></year><pub-dates><date><style face="normal" font="default" size="100%">03/2025</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%"/></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2406.01083</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.jrtpm.2025.100517</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">34</style></volume><issue><style face="normal" font="default" size="100%">100517</style></issue><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Aritra Sarkar</style></author><author><style face="normal" font="default" size="100%">Akash Kundu</style></author><author><style face="normal" font="default" size="100%">Matthew Steinberg</style></author><author><style face="normal" font="default" size="100%">Sibasish Mishra</style></author><author><style face="normal" font="default" size="100%">Sebastiaan Fauquenot</style></author><author><style face="normal" font="default" size="100%">Tamal Acharya</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author><author><style face="normal" font="default" size="100%">Sebastian Feld</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">YAQQ: Yet Another Quantum Quantizer -- Design Space Exploration of Quantum Gate Sets using Novelty Search</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2026</style></year><pub-dates><date><style face="normal" font="default" size="100%">04/2026</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">New Journal of Physics</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2406.17610</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1088/1367-2630/ae5a54</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">28</style></volume><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In 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.&lt;/p&gt;&#13;
</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>28</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Short Lessons on Wolfram Language: Programming, Data Processing, Graphics, Machine Learning, and Quantum Computing with Mathematica </style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2024</style></year></dates><urls><style face="normal" font="default" size="100%">https://open.icm.edu.pl/handle/123456789/24302</style></urls><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This 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.&lt;/p&gt;&#13;
</style></abstract><isbn><style face="normal" font="default" size="100%">978-8366950016</style></isbn><publisher><style face="normal" font="default" size="100%">Quoqa Pubs</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Krzysztof Domino</style></author><author><style face="normal" font="default" size="100%">Arkadiusz Sochan</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Analytical assessment of workers' safety concerning direct and indirect ways of getting infected by dangerous pathogen</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2025</style></year><pub-dates><date><style face="normal" font="default" size="100%">12/2024</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">Journal of Computational Science</style></secondary-title><urls><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.jocs.2024.102509</style></urls><volume><style face="normal" font="default" size="100%">85</style></volume><issue><style face="normal" font="default" size="100%">102509</style></issue><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mateusz Żarski</style></author><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Multi-Step Feature Fusion for Natural Disaster Damage Assessment on Satellite Images</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2024</style></year><pub-dates><date><style face="normal" font="default" size="100%">09/2024</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">IEEE Access</style></secondary-title><electronic-resource-num><style face="normal" font="default" size="100%">10.1109/ACCESS.2024.3459424</style></electronic-resource-num><section><style face="normal" font="default" size="100%">140072 - 140081</style></section><abstract><style face="normal" font="default" size="100%">Quick 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.</style></abstract><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Cooperation in public goods game on square lattices with agents changing interaction groups</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2026</style></year></dates><secondary-title><style face="normal" font="default" size="100%">Physica A: Statistical Mechanics and its Applications</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2510.03772</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1016/j.physa.2026.131613</style></electronic-resource-num><volume><style face="normal" font="default" size="100%">694</style></volume><section><style face="normal" font="default" size="100%">131613</style></section></record><record><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jaroslaw Miszczak</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards Quantum Machine Learning for Assessing the Resilience of Post-quantum Cryptography</style></title></titles><keywords/><dates><year><style face="normal" font="default" size="100%">2026</style></year><pub-dates><date><style face="normal" font="default" size="100%">06/2026</style></date></pub-dates></dates><secondary-title><style face="normal" font="default" size="100%">International Conference on Computational Science (ICCS 2026)</style></secondary-title><urls><style face="normal" font="default" size="100%">https://arxiv.org/abs/2607.13722</style></urls><electronic-resource-num><style face="normal" font="default" size="100%">10.1007/978-3-032-29918-5_3</style></electronic-resource-num><abstract><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span style="-webkit-text-stroke-width:0px;background-color:rgb(255, 255, 255);color:rgb(0, 0, 0);display:inline !important;float:none;font-family:"Lucida Grande", Helvetica, Arial, sans-serif;font-size:13.608px;font-style:normal;font-variant-caps:normal;font-variant-ligatures:normal;font-weight:400;letter-spacing:normal;orphans:2;text-align:start;text-decoration-color:initial;text-decoration-style:initial;text-decoration-thickness:initial;text-indent:0px;text-transform:none;white-space:normal;widows:2;word-spacing:0px;"&gt;The 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.&lt;/span&gt;&lt;/p&gt;</style></abstract><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Hamburg, Germany</style></pub-location></record></records></xml>
