<?xml version="1.0" encoding="UTF-8"?>
<xml><records><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">D. Augustyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">A red modified weighted moving average for soft real-time application</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Int. J. Appl. Math. Comput. Sci.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">697–707</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The popularity of TCP/IP has resulted in an increase in usage of best-effort networks for real-time communication. Much effort has been spent to ensure quality of service for soft real-time traffic over IP networks. The Internet Engineering Task Force has proposed some architecture components, such as Active Queue Management (AQM). The paper investigates the influence of the weighted moving average on packet waiting time reduction for an AQM mechanism: the RED algorithm. The proposed method for computing the average queue length is based on a difference equation (a recursive equation). Depending on a particular optimality criterion, proper parameters of the modified weighted moving average funtion can be chosen. This change will allow reducing the number of violations of timing constraints and better use of this mechanism for soft real-time transmissions. The optimization problem is solved through simulation performed in OMNeT++ and later verified experimentally on a Linux implementation.</style></ABSTRACT><title><style face="normal" font="default" size="100%">A red modified weighted moving average for soft real-time application</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adrian Kapczyński</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Advanced problems of Internet technologies</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo WSB</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Active Queue Management in Linux based routers</style></SECTION><title><style face="normal" font="default" size="100%">Advanced problems of Internet technologies</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Grzywak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Podstawy Budowy i Oprogramowania Sieci Typu Internet</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wyższa Szkoła Biznesu w Dąbrowie Górniczej</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Aktywne zarządzanie ruchem pakietów dla multimedialnych strumieni danych</style></SECTION><title><style face="normal" font="default" size="100%">Podstawy Budowy i Oprogramowania Sieci Typu Internet</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Flluid flow approximation of time-limited TCP/UDP/XCP streams.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">62</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">217–225</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">This article presents the use of fluid flow approximation to model interactions between a set of TCP, UDP and XCP flows in the enveronment of IP routers using AQM (Active Queue Management) algorithms to control traffic congestion. In contrast to other works, independent UDP and TCP streams are considered and the model allows to start and end data transmissions in TCP, UDP and XCP strams at any time moment. It incorporates several Active Queue Management mechanisms: RED, NLRED, CHOKe.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Flluid flow approximation of time-limited TCP/UDP/XCP streams.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bolesław Pochopień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Grzywak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwa Komunikacji i Łączności</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Badanie mechanizmów kontroli przeciążenia w TCP zaimplementowanych w systemie operacyjnym Linux</style></SECTION><title><style face="normal" font="default" size="100%">Nowe Technologie Sieci Komputerowych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Pikiewicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Rostański</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Internet in the Information Society Computer Systems Architecture and Security</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cielplaka Str. 1c, 41-300 Dąbrowa Górnicza</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Academy of Business in Dabrowa Gornicza</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">AQM algorithms for aggressive network streams.</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-83-62897-40-7</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">In this article we study a model of network transmissions with Active Queue Management in an intermadiate IP router. We use the OMNET++ discrete event simulator to model the different variants of the CHOKe algorithms. We model a system where CHOKe, xCHOKe and gCHOKe are the AQM policy. The obtained results show the behaviour of these algorithms and confirm their advantage over a standard RED algorithm.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Internet in the Information Society Computer Systems Architecture and Security</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analysis of CHOKe-Family Active Queue Management</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">25</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">49–66</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">In the article we study a model of network transmissions with Active Queue Management in an intermediate IP router. We use the OMNET++ discrete event simulator to model the varies variants of the CHOKe algorithms. We model a system where CHOKe, xCHOKe and gCHOKe are the AQM policy. The obtained results shows the behaviour of these algorithms. The paper presents also the implementation of AQM mechanisms in the router based on Linux.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Analysis of CHOKe-Family Active Queue Management</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">E. Helwich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Wójkowska-Mach</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Borszewska-Kornacka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Gadzinowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Kordek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">D. Pawlik</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Szczapa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P.B. Heczko</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">E. Gułczyńska</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Epidemiologia zakażeń noworodków z bardzo małą masą urodzeniową</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Developmental Period Medicine Medycyna Wieku Rozwojowego</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">XVII</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">224–231</style></PAGES><NOTES><style face="normal" font="default" size="100%">Badania Polskiej Sieci Neonatologicznej</style></NOTES><title><style face="normal" font="default" size="100%">Epidemiologia zakażeń noworodków z bardzo małą masą urodzeniową</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences - Technical Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">58</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">77–88</style></PAGES><NOTES><style face="normal" font="default" size="100%">arXiv:1006.1549</style></NOTES><title><style face="normal" font="default" size="100%">Extending scientiﬁc computing system with structural quantum programming capabilities</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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%">Ryszard Winiarczyk</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Noise effects in the quantum search algorithm from the viewpoint of computational complexity</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Applied Mathematics and Computer Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">22</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">493–499</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">We analyse the resilience of the quantum search algorithm in the presence of quantum noise modelled as trace preserving completely positive maps. We study the influence of noise on computational complexity of the quantum search algorithm. We show that only for small amounts of noise the quantum search algorithm is still more efficient than any classical algorithm.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1108.1915</style></NOTES><title><style face="normal" font="default" size="100%">Noise effects in the quantum search algorithm from the viewpoint of computational complexity</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Numerical Model of Tcp in 802.16 Networks Using Fluid Flow Approximation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">First International Conference on Networking and Future Internet 2011 (ICNFI 2011)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Numerical Model of Tcp in 802.16 Networks Using Fluid Flow Approximation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">J. Wójkowska-Mach</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Borszewska-Kornacka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Gadzinowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">E. Gułczyńska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">E. Helwich</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Kordek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">D. Pawlik</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Szczapa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Heczko</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Early-onset Infections of Very-low-birth-weight Infants in Polish Neonatal Intensive Care Units</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The Pediatric Infectious Disease Journal</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">31</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">7</style></NUMBER><PAGES><style face="normal" font="default" size="100%">691–695</style></PAGES><DATE><style face="normal" font="default" size="100%">7</style></DATE><title><style face="normal" font="default" size="100%">Early-onset Infections of Very-low-birth-weight Infants in Polish Neonatal Intensive Care Units</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Grzywak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Wysokowydajne Sieci Komputerowe</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warszawa</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Komunikacji i Łączności, Warszawa</style></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">1</style></VOLUME><SECTION><style face="normal" font="default" size="100%">Operatory gęstości w informatyce kwantowej</style></SECTION><EDITION><style face="normal" font="default" size="100%">1</style></EDITION><ABSTRACT><style face="normal" font="default" size="100%">W pracy przedstawiono model matematyczny układu kwantowego zawierającego n qubitów. Wykorzystując pojęcie iloczynu tensorowego oraz jego własności zdefiniowano operatory gęstości (macierze gęstości), będące alternatywnym opisem stanów czystych i mieszanych układu kwantowego. Operatory gęstości są 2n´2n -wymiarowymi macierzami hermitowskimi (symetrycznymi), dodatnio określonymi. Operatory gęstości możliwiają na podstawie badania śladu macierzy gęstości rozróżnienie czystych i mieszanych stanów kwantowych, oraz stosunkowo łatwe wyznaczenie wartości liczbowej dowolnej obserwabli układu kwantowego. Wszystkie zaprezentowane w pracy rezultaty są uogólnieniem na przypadek dowolnego układu kwantowego złożonego z n-qubitów, rezultatów przedstawionych w pracy [1] dla 1-qubitowych oraz 2-qubitowych układów kwantowych. Przedstawione w pracy rezultaty można uogólnić na przypadek złożonych układów kwantowych będących iloczynami tensorowymi wielowymiarowych kwantowych podukładów składowych.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Wysokowydajne Sieci Komputerowe</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Kwiecień</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gaj</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Stefan Węgrzyn in Memoriam</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Politechniki Śląskiej</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Podstawy infromatyki kwantowej</style></SECTION><ISBN><style face="normal" font="default" size="100%">978-83-7335-955-0</style></ISBN><title><style face="normal" font="default" size="100%">Stefan Węgrzyn in Memoriam</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Stochastic controllability of linear systems with delay in control.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences. Technical Sciences.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">55</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">23–29</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">In the paper finite-dimensional stationary dynamical control systems described by linear stochastic ordinary differential state equations with single point delay in the control are considered. Using notations, theorems and methods taken directly from deterministic controllability problems, necessary and sufficient conditions for different kinds of stochastic relative controllability are formulated and proved. It will be proved that under suitable assumptions relative controllability of a deterministic linear associated dynamical system is equivalent to stochastic relative exact controllability and stochastic relative approximate controllability of the original linear stochastic dynamical system. Some remarks and comments on the existing results for stochastic controllability of linear dynamical systems with delays are also presented. Finally, minimum energy control problem for stochastic dynamical system is formulated and solved.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Stochastic controllability of linear systems with delay in control.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Stochastic controllability of linear systems with state delays.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Applied Mathematics and Computer Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">17</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">5–13</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">In the paper finite-dimensional stationary dynamical control systems described by linear stochastic ordinary differential state equations with single point delay in the state variables are considered. Using theorem and methods taken directly from deterministic controllability problems, necessary and sufficient conditions for different kinds of stochastic relative controllability are formulated and proved. It will be proved that under suitable assumptions relative controllability of a deterministic linear associated dynamical system is equivalent to stochastic relative exact controllability and stochastic relative approximate controllability of the original linear stochastic dynamical system. Some remarks and comments on the existing results for controllability of linear dynamical systems with delays are also presented. Finally, minimum energy control problem for stochastic dynamical system is formulated and solved.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Stochastic controllability of linear systems with state delays.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum search algorithm</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2A</style></NUMBER><PAGES><style face="normal" font="default" size="100%">95–104</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Recently, it was realized that use of the properties of quantum mechanics might speed up certain computations. It now appears that, at least theoretically, quantum computations may be much faster than classical computations for solving certain problems including for example search problems. In the present paper the fundamental Grover’s search algorithm of quantum computation is discussed. Fundamental quantum operators for Grover’s search algorithm are presented. Moreover, several remarks and comments concerning quantum computations are also given.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Quantum search algorithm</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Dwu-osobowa gra kwantowa</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">329–335</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">W ostatnim czasie wykazano, że zastosowanie pewnych wybranych metod mechaniki kwantowej może znacznie przyspieszyć niektóre czasochłonne obliczenia. Teoretycznie, obliczenia kwantowe mogą być przeprowadzane znacznie szybciej niż metodami klasycznymi, czego przykładem jest teoria gier. W artykule przedstawiono definicję statycznej dwu-osobowej gry kwantowej oraz przedyskutowano jej podstawowe własności. Pokazano, między innymi, że statyczna dwo-osobowa gra kwantowa jest reprezentowana przez wektor o współrzędnych zespolonych określony w iloczynie tensorowym dwóch przestrzeni stanów kwantowych. Ponadto przedstawiono uwagi i komentarze dotyczące zagadnień gier kwantowych.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Dwu-osobowa gra kwantowa</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Grochla</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Modelling TCP Connection in WIMAX Network Using Fluid Flow Approximation.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Applications and the Internet</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE Computer Society Press</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">502–507</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The fluid-flow approximation models have been during last few years to analyze the dynamics and stability of TCP/RED connections in wired networks. The model assumes that the fluctuations of parameters of the connections are relatively low. The fluid flow models base on the linearization and use of control theory analysis tools to verify the stability and behavior of the analyzed system. In this article we use some extensions of fluid flow approximation to support time division multiplexing used in WiMAX wireless networks. We describe the modification of fluid flow equations to incorporate the delivery of packets as an on-off source with on and off times modulated by the WiMAX scheduling algorithm. The results of the fluid flow model have been compared to the measurement in a small test bed. We also show how to analyze the stability of the connection using control theory approach.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Modelling TCP Connection in WIMAX Network Using Fluid Flow Approximation.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Tańcula</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%">Examination of robust stability of computer networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Performance Modelling and Evaluation of Heterogeneous Networks</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice, Bałtycka 5</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Institute of Theoretical and Applied Informatics of the Polish Academy o Sciences</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">75–87</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">The thesis presents a nonlinear mathematical model of a computer network with the RED algorithm. The model equations were linearized around the set operating point and next block diagrams of the system presented. Using the methods for examining stability known from the literature, the robust stability of the system has been analysed with slight changes in its parameters. An example of stability examination prepared on the basis of the data for a real computer network has been shown. The results generalise the results known in he literature</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">HET-NETs 2010 Zakopane, January 14th - 16th, 2010</style></NOTES><title><style face="normal" font="default" size="100%">Examination of robust stability of computer networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Tańcula</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Analiza D-stabilności protokołu TCP-DCR.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">33</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3A (107)</style></NUMBER><PAGES><style face="normal" font="default" size="100%">7–18</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Praca zawiera analizę stabilności sieci na podstawie protokołu TCP-DCR, będącego modyfikacją tradycyjnego TCP. Utworzono model matematyczny sieci i opisano go równaniami. Schemat blokowy modelu sieci przekształcono do takiej postaci, aby zbadać jego D-stabilność stosując metodę przestrzeni niepewnych parametrów.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Analiza D-stabilności protokołu TCP-DCR.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Informatyka kwantowa i jej miejsce w informatyce jako dyscyplinie naukowej</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">22</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">11–27</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">W pracy przedstawiono podstawy matematyczne jedno i dwu qubitowych układów kwantowych. Wykorzystano zarówno podejście oparte na opisie wektorowym, jak i podejście bazujące na operatorach gęstości. Wprowadzenie operatorów gęstości umożliwia stosunkowo prostą interpretację wielu istotnych pojęć mechaniki kwantowej.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Informatyka kwantowa i jej miejsce w informatyce jako dyscyplinie naukowej</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Kwantowe systemy informatyki</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2000</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">21</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">15–45</style></PAGES><title><style face="normal" font="default" size="100%">Kwantowe systemy informatyki</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum computing</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2000</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">12</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">235–246</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">In the present studies on quantum computer systems principles of a quantum logic gates and basic elements of quantum computers are described. The fundamental elements of quantum computer and mathematical backgrounds of suitable quantum computation processes are presented. Specially Toffoli quantum gate and Hadamard quantum gate are discussed in details. Mathematical bases and principles of quantum computations are also mentioned. Finally, the role of nuclear magnetic resonance in quantum computations is investigated. Moreover, the extensive list of references is also presented.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Quantum computing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Bugajski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Foundation of quantum computing. Part 2</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">93–106</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">1.“Quantum search algorithm“, Studia Informatica, vol.23, no.2A (48), 2002, str.95-104. 2.„Sterowalność układów dynamicznych typu 2D”, referat, XXXI Ogólnopolska Konferencja Zastosowań Matematyki, Zakopane, 17-24. 09.2002. 3.“Foundation of quantum computing. Part 2”, Archiwum Informatyki Teoretycznej i Stosowanej, tom 14, zeszyt 2, 2002, pp.93-106, (współautorzy: Stefan Węgrzyn, Sławomir Bugajski, 30%). 4.“Controllability and observability of distributed parameter systems. A survey”, Studia z Automatyki i Informatyki, tom 27, 2003, str. 7-19.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Foundation of quantum computing. Part 2</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sławomir Bugajski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Foundations of Quantum Computing. Part 1.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2001</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">97–142</style></PAGES><title><style face="normal" font="default" size="100%">Foundations of Quantum Computing. Part 1.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><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%">Lech Znamirowski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Systems of Informatics of the Direct Materials Production</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">18</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">3–14</style></PAGES><DATE><style face="normal" font="default" size="100%">5</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">The results of researches in the area of nanosystems of informatics, self-replication and self-organization processes are presented. Developing and joining together the gotten results into the integral whole permits in these three mentioned scopes to elaborate the scientific bases for the construction of structure of the algorithms and organization of nanosystems of informatics for the direct material production and object fabrication, and the inspiration of processes of the self-organization of objects.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Systems of Informatics of the Direct Materials Production</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Sławomir Nowak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stefan Węgrzyn</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Lech Znamirowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</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%">Systemy Informatyki Bezpośredniego Wytwarzania Materiałów</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2006</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">ul. Pszczyńska 44, 44-100 Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wyd. Pracowni Komputerowej Jacka Sklamierskiego</style></PUBLISHER><EDITION><style face="normal" font="default" size="100%">1</style></EDITION><ISBN><style face="normal" font="default" size="100%">83-89105-97-7</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">Przedstawione opracowanie wynika z dającej się coraz wyraźniej odczuć potrzeby traktowania i rozwijania informatyki jako ogólnej dziedziny nauki o ruchu i przetwarzaniu informacji wszędzie tam, gdzie ruch i przetwarzanie informacji mają miejsce. Chodzi więc zarówno o różne systemy techniczne, jak i o organizmy biologiczne. Biologiczne systemy informatyki, rozwijające się od miliardów lat, charakteryzują się m.in. tym, że mają w nich miejsce procesy bezpośredniego wytwarzania potrzebnych organizmowi materiałów i produktów. Wzorując się na tym, autorzy niniejszego opracowania podjęli prace nad takimi technicznymi systemami informatyki, w których również mogły być realizowane procesy bezpośredniego wytwarzanie materiałów i produktów. Ponieważ z dotychczasowych naszych prac już obecnie wynika, że taka możliwość istnieje, postanowiliśmy zebrać nasze opracowania w pewną całość, ilustrującą jeden z obecnie podstawowych kierunków rozwojowych w informatyce.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Systemy Informatyki Bezpośredniego Wytwarzania Materiałów</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Pracowni Komputerowej Jacka Skalmierskiego</style></PUBLISHER><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><title><style face="normal" font="default" size="100%">Kwantowe systemy informatyki</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Politechniki Śląskiej</style></PUBLISHER><title><style face="normal" font="default" size="100%">Nano i kwantowe systemy informatyki. Wyd.Drugie</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2003</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Gliwice</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Wydawnictwo Politechniki Śląskiej</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">83-7335-295-3</style></ISBN><title><style face="normal" font="default" size="100%">Nano i Kwantowe Systemy Informatyki</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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%">Lech Znamirowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Winiarczyk</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 and quantum systems of informatics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2004</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">52</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">1–10</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">In the present studies on quantum computer systems principles of a quantum logic gates and basic elements of quantum computers are described. The fundamental elements of quantum computer and mathematical backgrounds of suitable quantum computation processes are presented. Specially Toffoli quantum gate and Hadamard quantum gate are discussed in details. Mathematical bases and principles of quantum computations are also mentioned. Finally, the role of nuclear magnetic resonance in quantum computations is investigated. Moreover, the extensive list of references is also presented.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Nano and quantum systems of informatics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The AQM Dropping Packet Probability Function Based on Non-integer Order PI^αD^β Controller</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Lecture Notes in Electrical Engineering</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">496</style></VOLUME><PAGES><style face="normal" font="default" size="100%">36-48</style></PAGES><SECTION><style face="normal" font="default" size="100%">36</style></SECTION><title><style face="normal" font="default" size="100%">The AQM Dropping Packet Probability Function Based on Non-integer Order PI^αD^β Controller</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">GPU Accelerated Non-integer Order PI^αD^β Controller Used as AQM Mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">860</style></VOLUME><PAGES><style face="normal" font="default" size="100%">286-299</style></PAGES><SECTION><style face="normal" font="default" size="100%">286</style></SECTION><title><style face="normal" font="default" size="100%">GPU Accelerated Non-integer Order PI^αD^β Controller Used as AQM Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The Influence of the Traffic Self-similarity on the Choice of the Non-integer Order PI^α Controller Parameters</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">935</style></VOLUME><PAGES><style face="normal" font="default" size="100%">76-83</style></PAGES><SECTION><style face="normal" font="default" size="100%">76</style></SECTION><title><style face="normal" font="default" size="100%">The Influence of the Traffic Self-similarity on the Choice of the Non-integer Order PI^α Controller Parameters</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The use of a non-integer order PI controller with an active queue management mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Applied Mathematics and Computer Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">26</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">4</style></ISSUE><PAGES><style face="normal" font="default" size="100%">777-789</style></PAGES><title><style face="normal" font="default" size="100%">The use of a non-integer order PI controller with an active queue management mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Self-similarity Traffic and AQM Mechanism Based on Non-integer Order Pi^αD^β Controller</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">718</style></VOLUME><PAGES><style face="normal" font="default" size="100%">336-350</style></PAGES><title><style face="normal" font="default" size="100%">Self-similarity Traffic and AQM Mechanism Based on Non-integer Order Pi^αD^β Controller</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">AQM Mechanism with the Dropping Packet Function Based on the Answer of Several  PIα  Controllers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Communications in Computer and Information Science </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">1039</style></VOLUME><SECTION><style face="normal" font="default" size="100%">400-412</style></SECTION><title><style face="normal" font="default" size="100%">AQM Mechanism with the Dropping Packet Function Based on the Answer of Several  PIα  Controllers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Artur Babiarz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ngoc Nguyen</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ford Gaol</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tzung-Pei Hong</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bogdan Trawiński</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Selected Problems of Controllability of Semilinear Fractional Systems-A Survey</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Intelligent Information and Database Systems</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Cham</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">978-3-030-14799-0</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The following article presents recent results of controllability problem of dynamical systems in infinite and finite-dimensional spaces. Roughly speaking, we describe selected controllability problems of fractional order systems, including approximate controllability and complete controllability.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Selected Problems of Controllability of Semilinear Fractional Systems-A Survey</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion Approximation Model of TCP NewReno Congestion Control Mechanism</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SN Computer Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ISSUE><style face="normal" font="default" size="100%">1:43</style></ISSUE><title><style face="normal" font="default" size="100%">Diffusion Approximation Model of TCP NewReno Congestion Control Mechanism</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%"> AQM mechanism with neuron tuning parameters</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">12th Asian Conference on Intelligent Information and Database Systems, Phuket, Thailand</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">23-26 March 2020</style></DATE><title><style face="normal" font="default" size="100%"> AQM mechanism with neuron tuning parameters</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The IoT Gateway with Active Queue Management</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Applied Mathematics and Computer Science (AMCS)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">31</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><URL><style face="normal" font="default" size="100%"/></URL><title><style face="normal" font="default" size="100%">The IoT Gateway with Active Queue Management</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Controllability of Semilinear Systems with Multiple Variable Delays in Control</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Mathematics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">8</style></VOLUME><PAGES><style face="normal" font="default" size="100%">1955</style></PAGES><DATE><style face="normal" font="default" size="100%">nov</style></DATE><ISBN><style face="normal" font="default" size="100%">9780735412767</style></ISBN><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In the paper semilinear, finite-dimensional, control systems with multiple time variable point delays in admissible controls are considered. Using Rothe's fixed-point theorem, sufficient controllability conditions are formulated. The results of the paper are generalization to many time variable delays in control, of the results published recently.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.mdpi.com/2227-7390/8/11/1955</style></URL><title><style face="normal" font="default" size="100%">Controllability of Semilinear Systems with Multiple Variable Delays in Control</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Artur Babiarz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Czornik</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">On Stabilizability of Discrete Time Systems with Delay in Control</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Intelligent Information and Database Systems</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer International Publishing</style></PUBLISHER><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The paper deals with discrete time-invariant systems with a delay in the control variable. The relations between different types of controllability and stabilizability are presented and discussed. The results are related to asymptotic null controllability, bounded feedback stabilizability and small feedback stabilizability for linear discrete-time systems with delay in control. The main tool employed is the technique of reducing the delayed equation to a delay-free equation. Thanks to this idea the criteria for bounded feedback stabilizability and small feedback stabilizability for the delayed systems are expressed in the appropriate properties of delay-free systems. Main results are analogical of this one proved in [18] for discrete time-invariant delay-free systems and to those from [14] for continuous-time systems. One of the additional result of this paper provides a criterion for controllability of discrete time system with delay in control. An important contribution of this paper is the indication of further generalizations of the obtained results.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">On Stabilizability of Discrete Time Systems with Delay in Control</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Combined diffusion approximation - simulation model of AQM’s transient behaviour</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Communications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">166</style></VOLUME><SECTION><style face="normal" font="default" size="100%">40-48</style></SECTION><DATE><style face="normal" font="default" size="100%">01/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The article introduces an approach combining diffusion approximation and simulation ones. Furthermore, it describes how it can be used to evaluate active queue management (AQM) mechanisms. Based on the obtained queue distributions, the simulation part of the model decides on package losses and modifies the flow intensity sent by the transmitter. The diffusion is used to estimate queue distributions and the goal of the simulation part of the model is to represent the AQM mechanism. On the one hand, the use of the diffusion part considerably accelerates the performance of the whole model. On the other hand, the simulation increases the accuracy of the diffusion part. We apply the model to compare the performance of fractional order PIη controller used in AQM with the performance of RED, a well known active queue management mechanism.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0140366420319940</style></URL><title><style face="normal" font="default" size="100%">Combined diffusion approximation - simulation model of AQM’s transient behaviour</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Diffusion model of a non-integer order PIγ controller with TCP/UDP  streams</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Entropy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><SECTION><style face="normal" font="default" size="100%">619</style></SECTION><DATE><style face="normal" font="default" size="100%">05/2021</style></DATE><title><style face="normal" font="default" size="100%">Diffusion model of a non-integer order PIγ controller with TCP/UDP  streams</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Kulczycki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Józef Korbicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Janusz Kacprzyk</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Controllability of Fractional Linear Systems with Delays in Control</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studies in Systems, Decision and Control</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">307-330</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In the chapter linear, fractional, continuous time, finite-dimensional, dynamical control systems with multiple variable point delays and distributed delay in admissible control described by linear ordinary differential state equations are considered. Using notations, theorems and methods taken directly from functional analysis and linear controllability theory, necessary and sufficient conditions for global relative controllability in a given finite time interval are formulated and proved. The main result of the chapter is to show, that global relative controllability of fractional linear systems with different types of delays in admissible control is equivalent to non-singularity of a suitably defined relative controllability matrix. In the proofs of the main results, methods and concepts taken from the theory of linear bounded operators in Hilbert spaces are used.&#160; Applying a relative controllability matrix for relative controllable systems steering admissible control is proposed, which steers the fractional system from a given initial complete state to the desired final relative state. Some remarks and comments on the existing controllability results for linear fractional dynamical system with delays are also presented.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Controllability of Fractional Linear Systems with Delays in Control</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Controllability of Fractional Linear Systems with Delays</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">25th International Conference on Methods and Models in Automation and Robotics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Controllability of Fractional Linear Systems with Delays</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Kaczorek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Convex linear combination of the controllability pairs for linear systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Control and Cybernetics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">50</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">4</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1-11</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The convex linear combination of the controllabil- ity pairs of linear continuous-time linear systems is defined and its pro-perties are discussed. The main result is obtained using pure algebraic methods. In the illustrative examples different cases of linear convex combinations are analyzed.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Convex linear combination of the controllability pairs for linear systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Sterowalność układów z opóźnieniami</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">49. konferencja „Zastosowania Matematyki”, Zakopane 19-25.09.2021</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">09/2021</style></DATE><URL><style face="normal" font="default" size="100%">https://www.impan.pl/~zakopane/49/Klamka.pdf</style></URL><title><style face="normal" font="default" size="100%">Sterowalność układów z opóźnieniami</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Dariusz Marek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Domański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Szyguła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Czachórski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Approximation Models for the Evaluation of TCP/AQM Networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences, Technical Sciences (BPASTS)</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">70</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">4</style></ISSUE><URL><style face="normal" font="default" size="100%">https://journals.pan.pl/dlibra/publication/141986/edition/123961/content</style></URL><title><style face="normal" font="default" size="100%">Approximation Models for the Evaluation of TCP/AQM Networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Kaczorek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Convex linear combination of the controllability pairs for linear systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Control and Cybernetics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">50</style></VOLUME><SECTION><style face="normal" font="default" size="100%">541</style></SECTION><title><style face="normal" font="default" size="100%">Convex linear combination of the controllability pairs for linear systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Kaczorek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Dzieliński</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Controllability of linear convex combination of linear discrete-time fractional systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences: Technical Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">70</style></VOLUME><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In this paper the controllability properties of the convex linear combination of fractional, linear, discrete-time systems are characterized and investigated. The notions of linear convex combination and controllability in the context of fractional-order systems are recalled. Then, the controllability property of such a linear combination of discrete-time, linear fractional systems is proven. Further, the reduction of an infinite problem of transition matrix derivation is reduced to a finite one, which greatly simplifies the numerical burden of the controllability issue. Examples of controllable and uncontrollable, single-input, linear systems are presented. The possibility of extension of the considerations to multi-input systems is shown.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">http://journals.pan.pl/Content/124861/PDF/2928_BPASTS_2022_70_5.pdf</style></URL><title><style face="normal" font="default" size="100%">Controllability of linear convex combination of linear discrete-time fractional systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Relative Exact Controllability of Fractional Linear Systems with Delays in Control</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In the paper linear, fractional, continuous time, infinite-dimensional, stationary dynamical control systems with multiple variable point delays in admissible control described by state equations are considered. Using notations, theorems and methods taken directly from functional analysis and linear controllability theory, necessary and sufficient conditions for global relative exact controllability in a given finite time interval are formulated and proved. The main result of the paper is to show, that global relative exact controllability of fractional linear systems with different types of delays in admissible control is equivalent to invertibility of suitably defined relative exact controllability operator. In the proof of main result, methods taken from the theory of linear bounded operators in Hilbert spaces are used. Some remarks and comments on the existing controllability results for linear fractional dynamical system with delays are also presented.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Relative Exact Controllability of Fractional Linear Systems with Delays in Control</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Katarzyna Filus</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Joanna Domańska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Evaluating Convolutional Neural Networks via measuring similarity of their first-layer filters and Gabor filters</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">32nd International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Evaluating Convolutional Neural Networks via measuring similarity of their first-layer filters and Gabor filters</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Kaczorek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Dzieliński</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Descriptor continuous- and discrete-time linear systems with zero transfer matrices</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences. TECHNICAL SCIENCES</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">73(2)</style></VOLUME><SECTION><style face="normal" font="default" size="100%">e152710</style></SECTION><DATE><style face="normal" font="default" size="100%">03/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, necessary and sufficient conditions for zeroing of the transfer matrices of descriptor continuous-time and discrete-time&lt;br /&gt;&#13;
linear systems are established. The conditions are illustrated by simple numerical examples of the descriptor continuous-time and discrete-time&lt;br /&gt;&#13;
linear systems. Also some remarks on the systems with delays in control are given.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;&#160;&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Descriptor continuous- and discrete-time linear systems with zero transfer matrices</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tadeusz Kaczorek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Klamka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Dzieliński</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">CONTROLLABILITY AND OBSERVABILITY OF THE DESCRIPTOR LINEAR SYSTEMS  REDUCED TO THE STANDARD ONES BY FEEDBACKS</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Acta Mechanica et Automatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">18/1</style></VOLUME><SECTION><style face="normal" font="default" size="100%">119</style></SECTION><DATE><style face="normal" font="default" size="100%">2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Abstract: In this paper, a new method for the reduction of the descriptor linear systems to standards ones is presented and verified. The method uses a state and/or state derivative feedback of output and output derivative feedback in order to transform the descriptor system into a standard one. The controllability and observability properties of the original descriptor as well as transformed standard systems are proved. Simple numerical examples illustrate the theorems introduced. Key words: controllability and observability, descriptor linear systems, state feedback, state derivative feedback, standard linear system&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">CONTROLLABILITY AND OBSERVABILITY OF THE DESCRIPTOR LINEAR SYSTEMS  REDUCED TO THE STANDARD ONES BY FEEDBACKS</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">A. Tillmanns</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Weber</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Błachowicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Kammermeier</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Textile Magnets as Base for Micromagnetic Simulations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">ECCM 2010 IV European Conference on Computational Mechanics Palais des Congrès, Paris, France, May 16-21, 2010</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Textile Magnets as Base for Micromagnetic Simulations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Andy Chia</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna Górecka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">K. Tan</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Kurzyński</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Paterek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dagomir Kaszlikowski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Coherent chemical kinetics as quantum walks I: Reaction operators for radical pairs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review E</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">93</style></VOLUME><SECTION><style face="normal" font="default" size="100%">032407</style></SECTION><NOTES><style face="normal" font="default" size="100%">arXiv:1506.04213</style></NOTES><title><style face="normal" font="default" size="100%">Coherent chemical kinetics as quantum walks I: Reaction operators for radical pairs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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%">Łukasz Pawela</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%">Real numerical shadow and generalized B-splines</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Linear Algebra and its Applications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">479</style></VOLUME><PAGES><style face="normal" font="default" size="100%">12–51</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;arXiv:1409.4941&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1409.4941</style></NOTES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.laa.2015.03.029</style></URL><title><style face="normal" font="default" size="100%">Real numerical shadow and generalized B-splines</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Gawron</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Kurzyk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Decoherence effects in the quantum qubit flip game using Markovian approximation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3</style></ISSUE><NUMBER><style face="normal" font="default" size="100%">665-682</style></NUMBER><SECTION><style face="normal" font="default" size="100%">665</style></SECTION><NOTES><style face="normal" font="default" size="100%">arXiv:1306.5957</style></NOTES><title><style face="normal" font="default" size="100%">Decoherence effects in the quantum qubit flip game using Markovian approximation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Fluctuation and Noise Letters</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><NOTES><style face="normal" font="default" size="100%">arXiv:1306.4506</style></NOTES><title><style face="normal" font="default" size="100%">General model for a entanglement-enhanced composed quantum game on a two-dimensional lattice</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">P. Kościelniak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Mazur</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Henek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Kwoka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Szuber</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">XPS and AFM studies of surface chemistry and morphology of In2O3 ultrathin films deposited by rheotaxial growth and vacuum oxidation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Thin solid films</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">520</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">927–931</style></PAGES><title><style face="normal" font="default" size="100%">XPS and AFM studies of surface chemistry and morphology of In2O3 ultrathin films deposited by rheotaxial growth and vacuum oxidation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Control parameters for the quantum Deutsch algorithm</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">193–200</style></PAGES><title><style face="normal" font="default" size="100%">Control parameters for the quantum Deutsch algorithm</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">PLoS ONE</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">10</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">7</style></NUMBER><PAGES><style face="normal" font="default" size="100%">e0130967</style></PAGES><NOTES><style face="normal" font="default" size="100%">arXiv:1407.1184</style></NOTES><title><style face="normal" font="default" size="100%">Generalized open quantum walks on Apollonian networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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%">Zbigniew Puchała</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%">Enhancing pseudo-telepathy in the Magic Square game</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">PLOS ONE</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">8</style></VOLUME><PAGES><style face="normal" font="default" size="100%">e64694</style></PAGES><NOTES><style face="normal" font="default" size="100%">arXiv:1211.1213</style></NOTES><title><style face="normal" font="default" size="100%">Enhancing pseudo-telepathy in the Magic Square game</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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%">Quantum Prisoner's Dilemma game on hypergraph networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physica A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">392</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">910–917</style></PAGES><NOTES><style face="normal" font="default" size="100%">arXiv:1202.5934</style></NOTES><title><style face="normal" font="default" size="100%">Quantum Prisoner's Dilemma game on hypergraph networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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%">Cooperative quantum Parrondo's games</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physica D</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">256</style></VOLUME><PAGES><style face="normal" font="default" size="100%">51–57</style></PAGES><NOTES><style face="normal" font="default" size="100%">arXiv:1207.6954</style></NOTES><title><style face="normal" font="default" size="100%">Cooperative quantum Parrondo's games</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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%">Quantifying channels output similarity with applications to quantum control</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">15</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">4</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1455</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In this work we aim at quantifying quantum channel output similarity. In order to achieve this, we introduce the notion of quantum channel superfidelity, which gives us an upper bound on the quantum channel fidelity. This quantity is expressed in a clear form using the Kraus representation of a quantum channel. As examples, we show potential applications of this quantity in the quantum control field.&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1412.8694</style></NOTES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/s11128-015-1238-z</style></URL><title><style face="normal" font="default" size="100%">Quantifying channels output similarity with applications to quantum control</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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%">Quantum control robust with respect to coupling with an external environment</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">437–446</style></PAGES><NOTES><style face="normal" font="default" size="100%">arXiv:1306.6826</style></NOTES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/s11128-014-0879-7</style></URL><title><style face="normal" font="default" size="100%">Quantum control robust with respect to coupling with an external environment</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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%">Quantum control with spectral constraints</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><PAGES><style face="normal" font="default" size="100%">227–237</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Various constraints concerning control fields can be imposed in the realistic implementations of quantum control systems. One of the most important is the restriction on the frequency spectrum of acceptable control parameters. It is important to consider the limitations of experimental equipment when trying to find appropriate control parameters. Therefore, in this paper we present a general method of obtaining a piecewise-constant controls, which are robust with respect to spectral constraints. We consider here a Heisenberg spin chain, however the method can be applied to a system with more general interactions. To model experimental restrictions we apply an ideal low-pass filter to numerically obtained control pulses. The usage of the proposed method has negligible impact on the control quality as opposed to the standard approach, which does not take into account spectral limitations.&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1204.6557</style></NOTES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/s11128-013-0644-3</style></URL><title><style face="normal" font="default" size="100%">Quantum control with spectral constraints</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</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%">Various methods of optimizing control pulses for quantum systems with decoherence</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">15</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">5</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1937</style></SECTION><NOTES><style face="normal" font="default" size="100%">arXiv:1310.2109, DOI: 10.1007/s11128-016-1242-y</style></NOTES><title><style face="normal" font="default" size="100%">Various methods of optimizing control pulses for quantum systems with decoherence</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</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%">Distinguishability of generic quantum states</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">93</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">06</style></ISSUE><SECTION><style face="normal" font="default" size="100%">062112</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Properties of random mixed states of order N distributed uniformly with respect to the Hilbert-Schmidt measure are investigated. We show that for large N, due to the concentration of measure, the trace distance between two random states tends to a fixed number D&#160;=1/4+1/π, which yields the Helstrom bound on their distinguishability. To arrive at this result we apply free random calculus and derive the symmetrized Marchenko–Pastur distribution, which is shown to describe numerical data for the model of two coupled quantum kicked tops. Asymptotic values for the fidelity, Bures and transmission distances between two random states are obtained. Analogous results for quantum relative entropy and Chernoff quantity provide other bounds on the distinguishablity of both states in a multiple measurement setup due to the quantum Sanov theorem.&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1507.05123</style></NOTES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1103/PhysRevA.93.062112</style></URL><title><style face="normal" font="default" size="100%">Distinguishability of generic quantum states</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Przemysław Sadowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Central limit theorem for reducible and irreducible open quantum walks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">15</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">7</style></ISSUE><SECTION><style face="normal" font="default" size="100%">2725</style></SECTION><NOTES><style face="normal" font="default" size="100%">arXiv:1412.5086</style></NOTES><title><style face="normal" font="default" size="100%">Central limit theorem for reducible and irreducible open quantum walks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tomasz Błachowicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrea Ehrmann</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Tillmanns</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">P. Stebliński</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Magnetization reversal in magnetic half-balls influenced by shape perturbations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Applied Physics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">108</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">12</style></NUMBER><PAGES><style face="normal" font="default" size="100%">123906</style></PAGES><title><style face="normal" font="default" size="100%">Magnetization reversal in magnetic half-balls influenced by shape perturbations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Quantum Information</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">11</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">1350007</style></PAGES><NOTES><style face="normal" font="default" size="100%">arXiv:1212.2439</style></NOTES><title><style face="normal" font="default" size="100%">Analysis of patent activity in the field of quantum information processing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Gawron</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Relativistic Quantum Pseudo-telepathy</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Acta Physica Polonica B</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">47</style></VOLUME><PAGES><style face="normal" font="default" size="100%">1147</style></PAGES><title><style face="normal" font="default" size="100%">Relativistic Quantum Pseudo-telepathy</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Gawron</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><AUTHOR><style face="normal" font="default" size="100%">Jacek Szklarski</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%">Wybory samorządowe 2014 w poszukiwaniu anomalii statystycznych</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Electoral Studies</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">30</style></VOLUME><PAGES><style face="normal" font="default" size="100%">534–545</style></PAGES><title><style face="normal" font="default" size="100%">Wybory samorządowe 2014 w poszukiwaniu anomalii statystycznych</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum games on evolving random networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physica A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">458</style></VOLUME><PAGES><style face="normal" font="default" size="100%">179–188</style></PAGES><title><style face="normal" font="default" size="100%">Quantum games on evolving random networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ion Nechita</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</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%">Almost all quantum channels are equidistant</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Mathematical Physics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">59</style></VOLUME><PAGES><style face="normal" font="default" size="100%">052201</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In this work we analyze properties of generic quantum channels in the case of large system size. We use the random matrix theory and free probability to show that the distance between two independent random channels tends to a constant value as the dimension of the system grows larger. As a measure of the distance we use the diamond norm. In the case of a flat Hilbert-Schmidt distribution on quantum channels, we obtain that the distance converges to &lt;span style="font-size:129%"&gt;1/2&lt;em&gt;+2/π&lt;/em&gt;&lt;/span&gt;. Furthermore, we show that for a random state &lt;span style="font-size:129%"&gt;&lt;em&gt;ρ&lt;/em&gt;&lt;/span&gt; acting on a bipartite Hilbert space $H_A \otimes H_B$, sampled from the Hilbert-Schmidt distribution, the reduced states $Tr_A\rho$ and $Tr_B \rho$ are arbitrarily close to the maximally mixed state. This implies that, for large dimensions, the state &lt;span style="font-size:129%"&gt;&lt;em&gt;ρ&lt;/em&gt;&lt;/span&gt; may be interpreted as a Jamio{\l}kowski state of a unital map.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1063/1.5019322</style></URL><title><style face="normal" font="default" size="100%">Almost all quantum channels are equidistant</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Domino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Glos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Ostaszewski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</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%">Properties of quantum stochastic walks from the asymptotic scaling exponent</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information and Computation</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">18</style></VOLUME><ISSUE><style face="normal" font="default" size="100%"/></ISSUE><SECTION><style face="normal" font="default" size="100%">0181-0199</style></SECTION><URL><style face="normal" font="default" size="100%">https://doi.org/10.26421/QIC18.3-4</style></URL><title><style face="normal" font="default" size="100%">Properties of quantum stochastic walks from the asymptotic scaling exponent</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Domino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gawron</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Efficient computation of higher order cumulant tensors</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SIAM J. SCI. COMPUT.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">40</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3</style></ISSUE><PAGES><style face="normal" font="default" size="100%">A1610</style></PAGES><SECTION><style face="normal" font="default" size="100%">A1590</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, we introduce a novel algorithm for calculating arbitrary order&lt;br /&gt;&#13;
cumulants of multidimensional data. Since the d'th order&lt;br /&gt;&#13;
cumulant can be presented in the form of an d-dimensional tensor, the&lt;br /&gt;&#13;
algorithm is presented using tensor operations. The algorithm provided in the&lt;br /&gt;&#13;
paper takes advantage of super-symmetry of cumulant and moment tensors.&lt;br /&gt;&#13;
We show that the proposed algorithm considerably reduces the computational&lt;br /&gt;&#13;
complexity and the computational memory requirement of cumulant calculation as&lt;br /&gt;&#13;
compared with existing algorithms. For the sizes of interest, the&lt;br /&gt;&#13;
reduction is of the order of d! compared to the naive algorithm.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://epubs.siam.org/doi/abs/10.1137/17M1149365</style></URL><title><style face="normal" font="default" size="100%">Efficient computation of higher order cumulant tensors</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Dariusz Kurzyk</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%">Conditional entropic uncertainty relations for Tsallis entropies</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">17</style></VOLUME><PAGES><style face="normal" font="default" size="100%">193</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The entropic uncertainty relations are a very active field of scientific inquiry. Their applications include quantum cryptography and studies of quantum phenomena such as correlations and non-locality. In this work we find state-independent entropic uncertainty relations in terms of the Tsallis entropies for states with a fixed amount of entanglement. Our main result is stated as Theorem. Taking the special case of von Neumann entropy and utilizing the concavity of conditional von Neumann entropies, we extend our result to mixed states. Finally we provide a lower bound on the amount of extractable key in a quantum cryptographic scenario.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/s11128-018-1955-1</style></URL><title><style face="normal" font="default" size="100%">Conditional entropic uncertainty relations for Tsallis entropies</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Dariusz Kurzyk</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%">Unconditional Security of a K-State Quantum Key Distribution Protocol</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">17</style></VOLUME><PAGES><style face="normal" font="default" size="100%">228</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Quantum key distribution protocols constitute an important part of quantum cryptography, where the security of sensitive information arises from the laws of physics. In this paper we introduce a new family of key distribution protocols and we compare its key with the well-known protocols such as BB84, PBC0 and generation rate to the well-known protocols such as BB84, PBC0 and R04. We also state the security analysis of these protocols based on the entanglement distillation and CSS codes techniques.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/s11128-018-1998-3</style></URL><title><style face="normal" font="default" size="100%">Unconditional Security of a K-State Quantum Key Distribution Protocol</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Krawiec</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Strategies for optimal single-shot discrimination of quantum measurements</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">98</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">4</style></ISSUE><SECTION><style face="normal" font="default" size="100%">042103</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In this work we study the problem of single-shot discrimination of von Neumann measurements. We associate each measurement with a measure-and-prepare channel. There are two possible approaches to this problem. The first one, which is simple, does not utilize entanglement. We focus only on discrimination of classical probability distribution, which are outputs of the channels. We find necessary and sufficient criterion for perfect discrimination in this case. A more advanced approach requires the usage and entanglement. We quantify the distance of the two measurements in terms of the diamond norm (called sometimes the completely bounded trace norm). We provide an exact expression for the optimal probability of correct distinction and relate it to the discrimination of unitary channels. We also state a necessary and sufficient condition for perfect discrimination and a semidefinite program which checks this condition. Our main result, however, is a cone program which calculates the distance of these measurements and hence provides an upper bound on the probability of their correct distinction. As a by-product the program also finds a strategy (input state) which achieves this bound. Finally, we provide a full description for the cases of Fourier matrices and mirror isometries.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/1804.05856</style></URL><title><style face="normal" font="default" size="100%">Strategies for optimal single-shot discrimination of quantum measurements</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Gawron</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Kurzyk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">QuantumInformation.jl—a Julia package for numerical computation in quantum information theory</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">PLoS One</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">12</style></ISSUE><SECTION><style face="normal" font="default" size="100%">e0209358</style></SECTION><DATE><style face="normal" font="default" size="100%">12/2018</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1371/journal.pone.0209358</style></URL><title><style face="normal" font="default" size="100%">QuantumInformation.jl—a Julia package for numerical computation in quantum information theory</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Przemysław Sadowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paulina Lewandowska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum walks on hypergraphs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Theoretical Physics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">58</style></VOLUME><SECTION><style face="normal" font="default" size="100%">3382</style></SECTION><DATE><style face="normal" font="default" size="100%">2019</style></DATE><title><style face="normal" font="default" size="100%">Quantum walks on hypergraphs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Krawiec</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Oszmaniec</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Multiple-shot and unambiguous discrimination of von Neumann measurements</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">5</style></VOLUME><SECTION><style face="normal" font="default" size="100%">425</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We present an in-depth study of the problem of discrimination of von Neumann measurements in finite-dimensional Hilbert spaces. Specifically, we consider two scenarios: unambiguous and multiple-shot discrimination. In the first scenario we give the general expressions for the optimal discrimination probabilities with and without the assistance of entanglement. In the case of multiple-shot discrimination, we focus on discrimination of measurements with the assistance of entanglement. Interestingly, we prove that in this setting all pairs of distinct von Neumann measurements can be distinguished perfectly (i.e. with the unit success probability) using only a finite number of queries. We also show that in this scenario queering the measurements \emph{in parallel} gives the optimal strategy and hence any possible adaptive methods do not offer any advantage over the parallel scheme. Finally, we show that typical pairs of Haar-random von Neumann measurements can be perfectly distinguished with only two queries.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://quantum-journal.org/papers/q-2021-04-06-425/pdf/</style></URL><title><style face="normal" font="default" size="100%">Multiple-shot and unambiguous discrimination of von Neumann measurements</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paulina Lewandowska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Perturbation of the numerical range of unitary matrices</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computational Science - ICCS 2020</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In this work we show how to approach the problem of manimulating the numerical range of a unitary matrix. This task has farreaching impact on the study of discrimination of quantum measurements. We achieve the aforementioned manipulation by introducing&lt;br /&gt;&#13;
a method which allows us to find a unitary matrix whose numerical range contains the origin where at the same time the distance between&lt;br /&gt;&#13;
unitary matrix and its perturbation is relative small in given metric.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;&#160;&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2002.05553</style></URL><title><style face="normal" font="default" size="100%">Perturbation of the numerical range of unitary matrices</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Paulina Lewandowska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Optimal representation of quantum channels</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computational Science - ICCS 2020</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This work shows an approach to reduce the dimensionality of matrix representations of quantum channels. It is achieved by finding a&lt;br /&gt;&#13;
base of the cone of positive semidefinite matrices which represent quantum channels. Next, this is implemented in the Julia programming&lt;br /&gt;&#13;
language as a part of the QuantumInformation.jl package.&lt;/p&gt;&#13;
&#13;
&lt;p&gt;&#160;&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2002.05507</style></URL><title><style face="normal" font="default" size="100%">Optimal representation of quantum channels</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Krawiec</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%">Discrimination of POVMs with rank-one effects</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">19</style></VOLUME><SECTION><style face="normal" font="default" size="100%">428</style></SECTION><title><style face="normal" font="default" size="100%">Discrimination of POVMs with rank-one effects</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Glos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Krawiec</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Asymptotic entropy of the Gibbs state of complex networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">11</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><SECTION><style face="normal" font="default" size="100%">311</style></SECTION><URL><style face="normal" font="default" size="100%">https://www.nature.com/articles/s41598-020-78626-2#citeas</style></URL><title><style face="normal" font="default" size="100%">Asymptotic entropy of the Gibbs state of complex networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Paulina Lewandowska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Krawiec</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</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%">On the optimal certification of von Neumann measurements</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">11</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1-16</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Certification and validation of sources producing quantum states and measurement devices are a necessary step of quantum technology. Certification of quantum measurements is entwined with quantum hypotheses testing, however, we are allowed to prepare an input state and the final measurement. In this report, we begin with studying the two-point certification of pure quantum states and unitary channels to later use them to prove our main result, which is the certification of von Neumann measurements in single-shot and parallel scenarios. In particular, in all the above-mentioned scenarios we characterize the optimal probability of the type II error given some fixed statistical significance. We also state the conditions when two quantum objects cannot be distinguished perfectly but still can be certified. Moreover, we show the connection between the certification of quantum channels and the notion of&#160;q-numerical range.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">On the optimal certification of von Neumann measurements</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ion Nechita</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><AUTHOR><style face="normal" font="default" size="100%">Karol Życzkowski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Generating random quantum channels</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Mathematical Physics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">62</style></VOLUME><SECTION><style face="normal" font="default" size="100%">062201</style></SECTION><DATE><style face="normal" font="default" size="100%">07/2021</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1063/5.0038838</style></URL><title><style face="normal" font="default" size="100%">Generating random quantum channels</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Krawiec</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%">Excluding false negative error in certification of quantum channels</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">11</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><SECTION><style face="normal" font="default" size="100%">21716 </style></SECTION><DATE><style face="normal" font="default" size="100%">11/2021</style></DATE><URL><style face="normal" font="default" size="100%">https://www.nature.com/articles/s41598-021-00444-x.pdf</style></URL><title><style face="normal" font="default" size="100%">Excluding false negative error in certification of quantum channels</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Dariusz Kurzyk</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%">Relating entropies of quantum channels</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Entropy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">8</style></ISSUE><SECTION><style face="normal" font="default" size="100%">1028</style></SECTION><title><style face="normal" font="default" size="100%">Relating entropies of quantum channels</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tomasz Śmierzchalski</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><AUTHOR><style face="normal" font="default" size="100%">Tomasz Trzciński</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%">Post-Error Correction for Quantum Annealing Processor using Reinforcement Learning</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Conference on Computational Science (ICCS 2022): Lecture Notes in Computer Science </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><SECTION><style face="normal" font="default" size="100%">261–268</style></SECTION><DATE><style face="normal" font="default" size="100%">07/2022</style></DATE><URL><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-031-08760-8_22</style></URL><title><style face="normal" font="default" size="100%">Post-Error Correction for Quantum Annealing Processor using Reinforcement Learning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Paulina Lewandowska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</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%">Storage and retrieval of von Neumann measurements</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">106</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">5</style></ISSUE><SECTION><style face="normal" font="default" size="100%">052423</style></SECTION><DATE><style face="normal" font="default" size="100%">10/2022</style></DATE><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2204.03029</style></URL><title><style face="normal" font="default" size="100%">Storage and retrieval of von Neumann measurements</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</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%">On the probabilistic quantum error correction</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Transactions on Information Theory</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">69</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">7</style></ISSUE><SECTION><style face="normal" font="default" size="100%">4620-4640</style></SECTION><DATE><style face="normal" font="default" size="100%">07/2023</style></DATE><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2206.05232</style></URL><title><style face="normal" font="default" size="100%">On the probabilistic quantum error correction</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Konrad Jałowiecki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Omnisolver: an extensible interface to Ising spin glass solvers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SoftwareX</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><SECTION><style face="normal" font="default" size="100%">101559</style></SECTION><URL><style face="normal" font="default" size="100%">https://www.softxjournal.com/article/S2352-7110(23)00255-8/fulltext</style></URL><title><style face="normal" font="default" size="100%">Omnisolver: an extensible interface to Ising spin glass solvers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Paulina Lewandowska</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%">Strategies for single-shot discrimination of process matrices</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">13</style></VOLUME><SECTION><style face="normal" font="default" size="100%">3046</style></SECTION><DATE><style face="normal" font="default" size="100%">02/2023</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1038/s41598-023-30191-0</style></URL><title><style face="normal" font="default" size="100%">Strategies for single-shot discrimination of process matrices</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Krawiec</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%">Discrimination and certification of unknown quantum measurements</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">8</style></VOLUME><SECTION><style face="normal" font="default" size="100%">1269</style></SECTION><DATE><style face="normal" font="default" size="100%">02/2024</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt;We study the discrimination of von Neumann measurement in the scenario&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; when we are given a reference measurement and some other measurement. The aim of&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; the discrimination is to determine whether the other measurement is the same as the&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; first one. We consider the cases when the reference measurement is given without the&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; classical description and when its classical description is known. Both cases are studied&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; in the symmetric and asymmetric discrimination setups. Moreover, we provide optimal&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; certification schemes enabling us to certify a known quantum measurement against the&lt;/span&gt;&lt;span style="font-family:sans-serif; font-size:14.944px"&gt; unknown one.&lt;/span&gt;&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.22331/q-2024-02-29-1269</style></URL><title><style face="normal" font="default" size="100%">Discrimination and certification of unknown quantum measurements</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Konrad Jałowiecki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paulina Lewandowska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">PyQBench: a Python library for benchmarking gate-based quantum computers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SoftwareX</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">24</style></VOLUME><SECTION><style face="normal" font="default" size="100%">101558</style></SECTION><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2304.00045</style></URL><title><style face="normal" font="default" size="100%">PyQBench: a Python library for benchmarking gate-based quantum computers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Karol Życzkowski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Matrix logistic map: fractal spectral distributions and transfer of chaos</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Chaos: An Interdisciplinary Journal of Nonlinear Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">36</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3</style></ISSUE><SECTION><style face="normal" font="default" size="100%">033139</style></SECTION><DATE><style face="normal" font="default" size="100%">03/2026</style></DATE><title><style face="normal" font="default" size="100%">Matrix logistic map: fractal spectral distributions and transfer of chaos</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Fereshte Shahbeigi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Christopher Chubb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kamil Korzekwa</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum-embeddable stochastic matrices</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">8</style></VOLUME><SECTION><style face="normal" font="default" size="100%">1404</style></SECTION><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2305.17163</style></URL><title><style face="normal" font="default" size="100%">Quantum-embeddable stochastic matrices</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tomasz Śmierzchalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Pawłowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Przybysz</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><AUTHOR><style face="normal" font="default" size="100%">Mátyás Koniorczyk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Domino</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Hybrid quantum-classical computation for automatic guided vehicles scheduling</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><SECTION><style face="normal" font="default" size="100%">21809</style></SECTION><DATE><style face="normal" font="default" size="100%">09/2014</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Motivated by recent efforts to develop quantum computing for practical, industrial-scale challenges, we demonstrate the effectiveness of state-of-the-art hybrid (not necessarily quantum) solvers in addressing the business-centric optimization problem of scheduling Automatic Guided Vehicles (AGVs). Some solvers can already leverage noisy intermediate-scale quantum (NISQ) devices. In our study, we utilize D-Wave hybrid solvers that implement classical heuristics with potential assistance from a quantum processing unit. This hybrid methodology performs comparably to existing classical solvers. However, due to the proprietary nature of the software, the precise contribution of quantum computation remains unclear. Our analysis focuses on a practical, business-oriented scenario: scheduling AGVs within a factory constrained by limited space, simulating a realistic production setting. Our approach maps a realistic AGVs problem onto one reminiscent of railway scheduling and demonstrates that the AGVs problem is better suited to quantum computing than its railway counterpart, the latter being denser in terms of the average number of constraints per variable. The main idea here is to highlight the potential usefulness of a hybrid approach for handling AGVs scheduling problems of practical sizes. We show that a scenario involving up to 21 AGVs, significant due to possible deadlocks, can be efficiently addressed by a hybrid solver in seconds.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://rdcu.be/dUkwi</style></URL><title><style face="normal" font="default" size="100%">Hybrid quantum-classical computation for automatic guided vehicles scheduling</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Sadowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konrad Jałowiecki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Orphee Faucoz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pierre-Marie Brunet</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Piotr Gawron</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Matthijs Van Waveren</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mickaël Savinaud</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Guillaume Pasero</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Veronique Defonte</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Hyper-Spectral Image Classification Using Adiabatic Quantum Computation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IGARSS 2023 - 2023 IEEE International Geoscience and Remote Sensing Symposium</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Hyper-Spectral Image Classification Using Adiabatic Quantum Computation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Matthijs Van Waveren</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mickaël Savinaud</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Guillaume Pasero</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Veronique Defonte</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pierre-Marie Brunet</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Orphee Faucoz</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><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Comparison of Quantum Neural Network Algorithms For Earth Observation Data Classification</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IGARSS 2023 - 2023 IEEE International Geoscience and Remote Sensing Symposium</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">Comparison of Quantum Neural Network Algorithms For Earth Observation Data Classification</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mateusz Stępniak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kamil Hendzel</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</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%">Local certification of unitary operations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><SECTION><style face="normal" font="default" size="100%">26588</style></SECTION><title><style face="normal" font="default" size="100%">Local certification of unitary operations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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 Sadowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Matthijs Van Waveren</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Clément Forray</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Guillaume Pasero</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mickaël Savinaud</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pierre-Marie Brunet</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Orphee Faucoz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">What Could be Achieved with a Million Qubits Quantum Annealer in Remote Sensing?</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IGARSS 2024-2024 IEEE International Geoscience and Remote Sensing Symposium</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%">What Could be Achieved with a Million Qubits Quantum Annealer in Remote Sensing?</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marcin Markiewicz</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%">Single-shot comparison of random quantum channels and measurements</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In this work we provide an efficiency analysis of the problem of discrimination of two randomly chosen unknown quantum operations in the single-shot regime. We provide tight bounds for the success probability of such a protocol for arbitrary quantum channels and generalized measurements.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.nature.com/articles/s41598-026-70695-z</style></URL><title><style face="normal" font="default" size="100%">Single-shot comparison of random quantum channels and measurements</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jakub Pawłowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jan Tuziemski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paweł Tarasiuk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Artur Przybysz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Robert Adamski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kamil Hendzel</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</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%"> VeloxQ: A Fast and Efficient QUBO Solver</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">arXiv:2501.19221</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><title><style face="normal" font="default" size="100%"> VeloxQ: A Fast and Efficient QUBO Solver</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Przemysław Sekuła</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Romaszewski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Cholewa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum-aware Transformer model for state classification</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Conference on Computational Science 2025</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Entanglement is a fundamental feature of quantum mechanics, playing a crucial role in quantum information processing. However, classifying entangled states, particularly in the mixed-state regime, remains a challenging problem, especially as system dimensions increase. In this work, we focus on bipartite quantum states and present a data-driven approach to entanglement classification using transformer-based neural networks. Our dataset consists of a diverse set of bipartite states, including pure separable states, Werner entangled states, general entangled states, and maximally entangled states. We pretrain the transformer in an unsupervised fashion by masking elements of vectorized Hermitian matrix representations of quantum states, allowing the model to learn structural properties of quantum density matrices. This approach enables the model to generalize entanglement characteristics across different classes of states. Once trained, our method achieves near-perfect classification accuracy, effectively distinguishing between separable and entangled states. Compared to previous Machine Learning, our method successfully adapts transformers for quantum state analysis, demonstrating their ability to systematically identify entanglement in bipartite systems. These results highlight the potential of modern machine learning techniques in automating entanglement detection and classification, bridging the gap between quantum information theory and artificial intelligence.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://link.springer.com/chapter/10.1007/978-3-031-97570-7_15</style></URL><title><style face="normal" font="default" size="100%">Quantum-aware Transformer model for state classification</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>15</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum Probabilistic Error Correction Method</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><PLACE_PUBLISHED><style face="normal" font="default" size="100%">United States of America</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><SECTION><style face="normal" font="default" size="100%">US 12,299,539 B2</style></SECTION><DATE><style face="normal" font="default" size="100%">05/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;A quantum computer implemented probabilistic error correction method for use with quantum circuits with a noise channel N(X) that has a Choi rank not greater than two, such as N(X)=N0XN0†+N1XN1†. The method comprising steps of: encoding a first qubit into an encoded state ?ψ , putting a second qubit into an arbitrary fixed state ?d1 , implementing two qubit unitary operation UE on the first qubit and the second qubit to obtain an encoded state UE(?ψ ^?d1 ), and after the encoded state is affected by the noise N(X), implementing two qubit unitary operation UD, followed by measuring the second qubit in the {?d2 , ?d2⊥ } basis measurement to obtain a classical label i∈{0,1}, next preparing a third qubit in the arbitrary fixed state ?d3 , and implementing two qubit unitary operation VD on the first qubit and the third qubit, followed by measuring the third qubit in the {?d4 , ?d4⊥ } basis measurement to obtain a classical label j∈{0,1}, and when (i,j)=(0,0) accepting as an output δexp a decoded state of the first qubit, and when (i,j)≠(0,0) rejecting the output δexp of a decoded state of the first qubit.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Quantum Probabilistic Error Correction Method</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tomasz Śmierzchalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna Dziubyna</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konrad Jałowiecki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zakaria Mzaouali</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marek Rams</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">SpinGlassPEPS.jl: Tensor-network package for Ising-like optimization on quasi-two-dimensional graphs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SoftwareX</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">31</style></VOLUME><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;This work introduces SpinGlassPEPS.jl, a software package implemented in Julia, designed to find low-energy configurations of generalized Potts models, including Ising and QUBO problems, utilizing heuristic tensor network contraction algorithms on quasi-2D geometries. In particular, the package employs the Projected Entangled-Pairs States to approximate the Boltzmann distribution corresponding to the model’s cost function. This enables an efficient branch-and-bound search (within the probability space) that exploits the locality of the underlying problem’s topology. As a result, our software enables the discovery of low-energy configurations for problems on quasi-2D graphs, particularly those relevant to modern quantum annealing devices. The modular architecture of SpinGlassPEPS.jl supports various contraction schemes and hardware acceleration.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S2352711025002249</style></URL><title><style face="normal" font="default" size="100%">SpinGlassPEPS.jl: Tensor-network package for Ising-like optimization on quasi-two-dimensional graphs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jakub Pawlowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pawel Tarasiuk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jan Tuziemski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</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%">Toward quantum scaling advantage in approximate optimization</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review Applied</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">26</style></VOLUME><SECTION><style face="normal" font="default" size="100%">014024</style></SECTION><DATE><style face="normal" font="default" size="100%"> 08/07/2026</style></DATE><TYPE_OF_WORK><style face="normal" font="default" size="100%">Regular Article - Editors' Suggestion</style></TYPE_OF_WORK><URL><style face="normal" font="default" size="100%">https://journals.aps.org/prapplied/abstract/10.1103/qcws-8kgm</style></URL><title><style face="normal" font="default" size="100%">Toward quantum scaling advantage in approximate optimization</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jan Tuziemski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Pawłowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paweł Tarasiuk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</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%">Limits of quantum run-time advantage</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review Applied</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%"> 25</style></VOLUME><SECTION><style face="normal" font="default" size="100%">044084 </style></SECTION><DATE><style face="normal" font="default" size="100%">29/04/2026</style></DATE><TYPE_OF_WORK><style face="normal" font="default" size="100%">Regular Article</style></TYPE_OF_WORK><SHORT_TITLE><style face="normal" font="default" size="100%">Recent quantum runtime (dis)advantages</style></SHORT_TITLE><ALTERNATE_TITLE><style face="normal" font="default" size="100%">Arxiv</style></ALTERNATE_TITLE><ORIGINAL_PUB><style face="normal" font="default" size="100%">https://arxiv.org/abs/2510.06337</style></ORIGINAL_PUB><URL><style face="normal" font="default" size="100%">https://journals.aps.org/prapplied/abstract/10.1103/gpsf-pn1x</style></URL><title><style face="normal" font="default" size="100%">Limits of quantum run-time advantage</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jakub Pawlowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paweł Tarasiuk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jan Tuziemski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</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%">Simulated Bifurcation Quantum Annealing</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">arxiv:2604.01050v1</style></SECONDARY_TITLE><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2604.01050v1</style></URL><title><style face="normal" font="default" size="100%">Simulated Bifurcation Quantum Annealing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Bílek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paulina Lewandowska</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%">Noise Resilience of Quantum Key Distribution Protocols Secured Against Independent Attacks With One-Way Communication</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">arXiv:2607.11857</style></SECONDARY_TITLE><PAGES><style face="normal" font="default" size="100%">19</style></PAGES><DATE><style face="normal" font="default" size="100%">07/10/2026</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">We investigate the resilience to noise of single-qubit quantum key distribution (QKD) protocols in the scenario of security against independent eavesdropping attacks and key distillation based on one-way classical communication. To this end, we introduce a noise-based metric that quantifies the efficiency of QKD protocols. Within this framework, we analyze the maximal noise levels that allow Alice and Bob to asymptotically establish a secure secret key. Using this assumption, we compare the noise tolerance of general single-qubit QKD protocols, in particular the BB84, B92, E91, and six-state protocols. Our main result determines the noise level threshold for QKD allowing one to distill an asymptotically secure secret key. Additionally, we demonstrate that the six-state protocol achieves the greatest resistance to noise while simultaneously yielding a higher post-selection efficiency than the other analyzed single-qubit protocols, confirming its robustness within the considered security model. Finally, we perform an analysis of the proposed noise-based metric and the conventional quantum bit error rate (QBER) metric.</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2607.11857</style></URL><title><style face="normal" font="default" size="100%">Noise Resilience of Quantum Key Distribution Protocols Secured Against Independent Attacks With One-Way Communication</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ludmiła Marcinkowska</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marcin Markiewicz</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%">Asymptotic distinguishability of Haar-averaged measurement models</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">arXiv:2605.31168</style></SECONDARY_TITLE><PAGES><style face="normal" font="default" size="100%">49</style></PAGES><DATE><style face="normal" font="default" size="100%">05/29/2026</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">We study discrimination problems generated by the same basic Haar-random measurement mechanism at two observational levels. First, we derive an explicit expression for the type-II error in the task of discriminating a Haar-random measure-and-prepare channel from the identity channel I, using a coherence-sensitive entangled tester. Second, after passing to the induced classical measurement records, we compare two random measurement models: one induced by a single collective unitary of the form U^⊗(n₁+n₂) with U ∈ U(d), and another induced by independent local unitaries U₁^⊗n₁ ⊗ U₂^⊗n₂. For the associated Haar-averaged aggregate histogram laws, in which the block of origin of each count is not retained, we obtain closed-form formulas and quantify their discrepancy through the total variation distance. We derive asymptotic expressions in the fixed-N, large-d regime, the fixed-d, large-N regime, the sparse joint-scaling regime N = o(√d), and the critical scaling regime N/√d → c. We also identify the block-resolved pair-of-histograms law, showing that the aggregate total variation distance is a coarse-grained lower bound on the distinguishability available when block labels are retained.</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2605.31168</style></URL><title><style face="normal" font="default" size="100%">Asymptotic distinguishability of Haar-averaged measurement models</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><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%">IntegrateUnitary.jl: A Julia package for symbolic integration over Haar measures</style></TITLE></TITLES><KEYWORDS><KEYWORD><style face="normal" font="default" size="100%">Symbolic integration; Haar measure; Weingarten calculus; Julia programming language; quantum information</style></KEYWORD></KEYWORDS><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">arXiv:2605.23830</style></SECONDARY_TITLE><DATE><style face="normal" font="default" size="100%">06/2026</style></DATE><TYPE_OF_WORK><style face="normal" font="default" size="100%">Manuscript submitted to ACM</style></TYPE_OF_WORK><KEYWORD><style face="normal" font="default" size="100%"/></KEYWORD><ABSTRACT><style face="normal" font="default" size="100%">Symbolic integration over the Haar measure of compact groups is a computational cornerstone in quantum information science and random matrix theory. We present IntegrateUnitary.jl, a comprehensive Julia package for computing exact expectations of polynomial functions over a wide range of compact groups (U(d), O(d), Sp(d), and SU(d) for balanced polynomials), circular and Gaussian ensembles, Ginibre ensembles, permutation groups, random pure states, and unitary t-designs. The package provides a fully open-source implementation of the Weingarten calculus and Wick contractions with broad symbolic-d support for entry-wise and trace-polynomial integrals, while selected workflows currently require concrete integer dimensions (including higher pure trace moments |tr(U)|^2k for k &gt; 1 and HCIZ with SymbolicMatrix inputs, and direct matrix-valued integration of SymbolicMatrix/SymbolicMatrixProduct expressions), automatic asymptotic expansions, a high-level symbolic trace interface that reconstructs Weingarten graphs from index-free expressions, and a bridge to ITensors.jl for tensor network averaging. We discuss the underlying algorithms, including the Murnaghan-Nakayama rule and symplectic-orthogonal duality, and demonstrate that the package efficiently handles high-degree moments and quantum information metrics.</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2605.23830</style></URL><title><style face="normal" font="default" size="100%">IntegrateUnitary.jl: A Julia package for symbolic integration over Haar measures</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Parrondo paradox in quantum image encryption</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">arXiv:2508.16382</style></SECONDARY_TITLE><PAGES><style face="normal" font="default" size="100%">10</style></PAGES><DATE><style face="normal" font="default" size="100%">01/02/2026</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">We present a quantum image encryption protocol that harnesses discrete-time quantum walks (DTQWs) on cycles and explicitly examines the role of the Parrondo paradox in security. Using the NEQR representation, a DTQW-generated probability mask is transformed into a quantum key image and applied via CNOT to encrypt grayscale images. We adopt an efficient circuit realization of DTQWs based on QFT-diagonalization and coin-conditioned phase layers, yielding low depth for N = 2^n positions and t steps. On 64 × 64 benchmark images, the scheme suppresses adjacent-pixel correlations to near zero after encryption (e.g., |C_H|, |C_V|, |C_D| ≈ 10⁻²), produces nearly uniform histograms, and achieves high ciphertext entropy close to the 8-bit ideal. Differential analyses further indicate strong diffusion and confusion: NPCR exceeds 99% and UACI is around 30%, consistent with robust sensitivity to small plaintext changes. Crucially, we investigate the impact of the Parrondo paradox on encryption quality and demonstrate that our fully unitary protocol remains robust even in paradoxical regimes. We show that while the paradox can introduce biases in simpler measurement-based schemes, our integrated approach which incorporates spatial diffusion and position-color entanglement, effectively leverages the complex interference patterns of the Parrondo walk to enhance substitution, maintaining high entropy and low correlations. Our results provide a performant DTQW-based quantum image cipher and confirm the suitability of paradoxical dynamics for secure quantum image processing. We discuss implications for hardware implementations and extensions to higher-dimensional walks.</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2508.16382</style></URL><title><style face="normal" font="default" size="100%">Parrondo paradox in quantum image encryption</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Leonard Sikorski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Karol Horodecki</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Limitations on quantum key repeaters for all key correlated states</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">arXiv:2206.00993</style></SECONDARY_TITLE><DATE><style face="normal" font="default" size="100%">09/03/2026</style></DATE><TYPE_OF_WORK><style face="normal" font="default" size="100%">preprint / manuskrypt</style></TYPE_OF_WORK><ABSTRACT><style face="normal" font="default" size="100%">Quantum key repeater is the backbone of the future Quantum Internet. It is an open problem to determine, for an arbitrary mixed bipartite state shared between the stations of a quantum key repeater, how much key can be generated between its two end-nodes. We place a novel bound on the quantum key repeater rate, which uses the relative entropy distance from, in general, entangled quantum states. It allows us to generalize bounds on key repeaters of M. Christandl and R. Ferrara [Phys. Rev. Lett. 119, 220506]. As in the latter article, we consider a scenario used for measurement-device-independent quantum cryptography. The derived bound, although not tighter, holds for a more general class of states, thereby avoiding the NP-hard separability problem. We show that the repeated key of the broad class of key correlated states can exceed twice the one-way distillable entanglement by at most the max-relative entropy of entanglement of its attacked version. We also provide a non-trivial upper bound on the amount of private randomness of a generic independent bit — a state containing one bit of ideal private randomness.</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2206.00993</style></URL><title><style face="normal" font="default" size="100%">Limitations on quantum key repeaters for all key correlated states</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marcin Markiewicz</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%">Choi-level twirling of quantum channels: finite constructions and non-compact transformations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Physics A: Mathematical and Theoretical</style></SECONDARY_TITLE><PAGES><style face="normal" font="default" size="100%">15</style></PAGES><DATE><style face="normal" font="default" size="100%">25/02/2026</style></DATE><TYPE_OF_WORK><style face="normal" font="default" size="100%">artykuł w czasopiśmie</style></TYPE_OF_WORK><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Twirling, i.e. averaging over symmetry actions, is a standard tool for reducing quantum states and channels to a symmetry-invariant form. We study channel twirling from the perspective of the channel–state duality and provide a constructive Choi-level description of the averaging map induced by arbitrary input/output representations. Our main technical result concerns the collective setting: for π &lt;sup&gt;in&lt;/sup&gt;(U) = U &lt;sup&gt;⊗t&lt;/sup&gt;&lt;sub&gt;&lt;sup&gt;in&lt;/sup&gt;&lt;/sub&gt; and π &lt;sup&gt;out&lt;/sup&gt;(U) = U &lt;sup&gt;⊗t&lt;/sup&gt;&lt;sub&gt;&lt;sup&gt;out&lt;/sup&gt;&lt;/sub&gt; , we introduce a partial-transpose reduction that removes the contragredient action and converts the mixed (walled Brauer) channel twirl into an ordinary Schur–Weyl twirl of the partially transposed Choi operator under U &lt;sup&gt;⊗(t&lt;/sup&gt;&lt;sub&gt;&lt;sup&gt;in&lt;/sup&gt;&lt;/sub&gt;&lt;sup&gt;+t&lt;/sup&gt;&lt;sub&gt;&lt;sup&gt;out&lt;/sup&gt;&lt;/sub&gt;&lt;sup&gt;)&lt;/sup&gt; , enabling explicit permutation-based formulas without constructing walled Brauer idempotents or mixed Schur transforms. Beyond compact symmetries, we extend channel twirling to reductive, generally non-unitary groups via Cartan decomposition and obtain an invariant-sector decomposition of the averaged Choi operator with weights determined solely by the Abelian Cartan component. Finally, we provide two finite realizations of channel averaging: a “dual” implementation as a convex mixture of unitary-1-design channels acting on invariant sectors, and a design-like reconstruction showing that weighted group t-designs induce channel t-designs for t = t&lt;sub&gt;in&lt;/sub&gt; + t&lt;sub&gt;out&lt;/sub&gt;.&lt;/p&gt;</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2512.23586</style></URL><title><style face="normal" font="default" size="100%">Choi-level twirling of quantum channels: finite constructions and non-compact transformations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Konrad Jałowiecki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Pawłowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Omnisolver: An extensible interface to Ising spin–glass and QUBO solvers – a numerically stabilized, distributed GPU exhaustive-search plugin</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SoftwareX</style></SECONDARY_TITLE><VOLUME><style face="normal" font="default" size="100%">36</style></VOLUME><SECTION><style face="normal" font="default" size="100%">103031</style></SECTION><URL><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S2352711026005224</style></URL><title><style face="normal" font="default" size="100%">Omnisolver: An extensible interface to Ising spin–glass and QUBO solvers – a numerically stabilized, distributed GPU exhaustive-search plugin</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Pawela</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%">Version 2.0.1 - SpinGlassPEPS.jl: Tensor-network package for Ising-like optimization on quasi-two-dimensional graphs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SoftwareX</style></SECONDARY_TITLE><VOLUME><style face="normal" font="default" size="100%">36</style></VOLUME><SECTION><style face="normal" font="default" size="100%">103027</style></SECTION><URL><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S2352711026005182</style></URL><title><style face="normal" font="default" size="100%">Version 2.0.1 - SpinGlassPEPS.jl: Tensor-network package for Ising-like optimization on quasi-two-dimensional graphs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marcin Markiewicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Anna de Rosier</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Wiesław Laskowski</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 noise generated by local random Hamiltonians</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">95</style></VOLUME><SECTION><style face="normal" font="default" size="100%">032333</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We investigate the impact of a local random unitary noise on multipartite quantum states of arbitrary dimension. We follow the dynamical approach, in which the single-particle unitaries are generated by local random Hamiltonians. Assuming short evolution time we derive an upper bound on the fidelity between an initial and the final state transformed by this type of noise. This result is based on averaging the Tamm-Mandelstam bound and holds for a wide class of distributions of random Hamiltonians fulfilling specific symmetry conditions. It is showed that the sensitivity of a given pure quantum state to the discussed type of noise depends only on the properties of a single-particle and bipartite reduced states.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1103/PhysRevA.95.032333</style></URL><title><style face="normal" font="default" size="100%">Quantum noise generated by local random Hamiltonians</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marcin Markiewicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adrian Kolodziejski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Adam Rutkowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Tylec</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Wieslaw Laskowski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Unified approach to geometric and positive-map-based non-linear entanglement identifiers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">97</style></VOLUME><PAGES><style face="normal" font="default" size="100%">042339</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Detecting quantumness of correlations (especially entanglement) is a very hard task even in the simplest case, i.e., two-partite quantum systems. Here we provide an analysis of whether there exists a relation between two of the most popular types of entanglement identifiers: the first one based on positive maps and not directly applicable in the laboratory and the second one a geometric entanglement identifier which is based on specific Hermiticity-preserving maps. We show a profound relation between those two types of entanglement criteria. Hereunder we have proposed a general framework of nonlinear functional entanglement identifiers which allows us to construct experimentally friendly entanglement criteria.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1103/PhysRevA.97.042339</style></URL><title><style face="normal" font="default" size="100%">Unified approach to geometric and positive-map-based non-linear entanglement identifiers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Paweł Błasiak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marcin Markiewicz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Identical particles as a genuine non-local resource</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">npj Quantum Information </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">11</style></VOLUME><SECTION><style face="normal" font="default" size="100%">171</style></SECTION><DATE><style face="normal" font="default" size="100%">11/2025</style></DATE><title><style face="normal" font="default" size="100%">Identical particles as a genuine non-local resource</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jay Lawrence</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marcin Markiewicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marek Żukowski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Comment on Aurélien Drezet’s Defense of Relational Quantum Mechanics.</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Foundations of Physics </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">54</style></VOLUME><SECTION><style face="normal" font="default" size="100%">45</style></SECTION><DATE><style face="normal" font="default" size="100%">07/2024</style></DATE><title><style face="normal" font="default" size="100%">Comment on Aurélien Drezet’s Defense of Relational Quantum Mechanics.</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marek Żukowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marcin Markiewicz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Against (unitary) interpretation (of quantum mechanics): removing the metaphysical load</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><SECONDARY_TITLE><style face="normal" font="default" size="100%">arXiv:2409.17061 [quant-ph]</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><DATE><style face="normal" font="default" size="100%">09/2024</style></DATE><title><style face="normal" font="default" size="100%">Against (unitary) interpretation (of quantum mechanics): removing the metaphysical load</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marcin Markiewicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konrad Schlichtholz</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Unitary operator bases as universal averaging sets</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><SECONDARY_TITLE><style face="normal" font="default" size="100%">arXiv:2503.17091 [quant-ph]</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We provide a generalization of the idea of unitary designs to cover finite averaging over much more general operations on quantum states. Namely, we construct finite averaging sets for averaging quantum states over arbitrary reductive Lie groups, on condition that the averaging is performed uniformly over the compact component of the group. Our construction comprises probabilistic mixtures of unitary 1-designs on specific operator subspaces. Provided construction is very general, competitive in the size of the averaging set when compared to other known constructions, and can be efficiently implemented in the quantum circuit model of computation.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Unitary operator bases as universal averaging sets</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jay Lawrence</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marcin Markiewicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marek Żukowski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Relational quantum mechanics is still incompatible with quantum mechanics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">European Journal for Philosophy of Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">15</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">1</style></ISSUE><SECTION><style face="normal" font="default" size="100%">16</style></SECTION><DATE><style face="normal" font="default" size="100%">03/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We showed in a recent article (Lawrence et al. &lt;a href="https://link.springer.com/article/10.1007/s13194-025-00639-3#ref-CR3" id="ref-link-section-d73323868e391" title="Lawrence, J., Markiewicz, M., &amp; Żukowski, M. (2023). Relative Facts of Relational Quantum Mechanics are Incompatible with Quantum Mechanics. Quantum, 7, 1015. &#13;
                  https://doi.org/10.22331/q-2023-05-23-1015&#13;
                  &#13;
                "&gt;2023&lt;/a&gt;. &lt;em&gt;Quantum, 7&lt;/em&gt;, 1015), that relative facts (outcomes), a central concept in Relational Quantum Mechanics, are inconsistent with Quantum Mechanics. We proved this by constructing a Wigner-Friend type sequential measurement scenario on a Greenberger-Horne-Zeilinger (GHZ) state of three qubits, and making the following assumption: “if an interpretation of quantum theory introduces some conceptualization of outcomes of a measurement, then probabilities of these outcomes must follow the quantum predictions as given by the Born rule.” Our work has been criticized by Cavalcanti et al. (&lt;a href="https://link.springer.com/article/10.1007/s13194-025-00639-3#ref-CR2" id="ref-link-section-d73323868e397" title="Cavalcanti, E. G., Di Biagio, A., &amp; Rovelli, C. (2023). On the consistency of relative facts. European Journal for Philosophy of Science., 13(4), 55. &#13;
                  https://doi.org/10.1007/s13194-023-00551-8&#13;
                  &#13;
                . &#13;
                  arXiv:2305.07343&#13;
                  &#13;
                "&gt;2023&lt;/a&gt;. &lt;em&gt;European Journal for Philosophy of Science, 13&lt;/em&gt;(4),55). In this note we show that their critique, based on their own reformulation of our argument, does not apply to our paper. It also raises questions of principle which are not answered within the framework of Relational Quantum Mechanics.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">Relational quantum mechanics is still incompatible with quantum mechanics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">44</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">33</style></NUMBER><PAGES><style face="normal" font="default" size="100%">335301</style></PAGES><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><NOTES><style face="normal" font="default" size="100%">arXiv:1104.2760 IF=1.641(2010);</style></NOTES><title><style face="normal" font="default" size="100%">Numerical shadow and geometry of quantum states</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Man-Machine Interactions 2</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Berlin / Heidelberg</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><PAGES><style face="normal" font="default" size="100%">49–56</style></PAGES><ISBN><style face="normal" font="default" size="100%">978-3-642-23168-1</style></ISBN><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><NOTES><style face="normal" font="default" size="100%">arXiv:1105.1293</style></NOTES><title><style face="normal" font="default" size="100%">Eigengestures for natural human computer interface</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">WKŁ</style></PUBLISHER><SECTION><style face="normal" font="default" size="100%">Symulacje gier kwantowych</style></SECTION><title><style face="normal" font="default" size="100%">Wysokowydajne sieci komputerowe</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Quantum Information</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">3</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><title><style face="normal" font="default" size="100%">Numerical simulations of mixed state quantum computation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Fluctuation and Noise Letters</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">5</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">L471–L478</style></PAGES><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><NOTES><style face="normal" font="default" size="100%">arXiv:quant-ph/0502185</style></NOTES><title><style face="normal" font="default" size="100%">Quantum Implementation of Parrondo Paradox</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Quantum Information</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">06</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">Supp</style></NUMBER><PAGES><style face="normal" font="default" size="100%">667</style></PAGES><NOTES><style face="normal" font="default" size="100%">arXiv:0801.4848</style></NOTES><title><style face="normal" font="default" size="100%">Noise Effects in Quantum Magic Squares Game</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Math. Phys.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">51</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">10</style></NUMBER><PAGES><style face="normal" font="default" size="100%">102204</style></PAGES><NOTES><style face="normal" font="default" size="100%">arXiv:0905.3646 IF=1.291(2010);</style></NOTES><title><style face="normal" font="default" size="100%">Restricted numerical range: A versatile tool in the theory of quantum information</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physica A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">399</style></VOLUME><PAGES><style face="normal" font="default" size="100%">163–170</style></PAGES><title><style face="normal" font="default" size="100%">Quantum walks with memory on cycles</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Modern Optics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">54</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">13-15</style></NUMBER><PAGES><style face="normal" font="default" size="100%">2275–228</style></PAGES><DATE><style face="normal" font="default" size="100%">9</style></DATE><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><title><style face="normal" font="default" size="100%">Quantum Parrondo's game with random strategies</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">77</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">042111</style></PAGES><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><NOTES><style face="normal" font="default" size="100%">arXiv:0711.4286 IF=2.908(2008);</style></NOTES><title><style face="normal" font="default" size="100%">Quantum state discrimination: A geometric approach</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">17</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><title><style face="normal" font="default" size="100%">Description and visualisation of quantum circuits with XML</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2002</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Archiwum Informatyki Teoretycznej i Stosowanej</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><title><style face="normal" font="default" size="100%">Quantum algorithm for factorization</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Comput. Phys. Commun.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">184</style></VOLUME><PAGES><style face="normal" font="default" size="100%">127–128</style></PAGES><title><style face="normal" font="default" size="100%">Employing online quantum random number generators for generating truly random quantum states in Mathematica</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Physics Communications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">183</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">118–124</style></PAGES><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><title><style face="normal" font="default" size="100%">Generating and using truly random quantum states in Mathematica</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Synthesis Lectures on Quantum Computing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%"/></PUBLISHER><VOLUME><style face="normal" font="default" size="100%">6</style></VOLUME><ISBN><style face="normal" font="default" size="100%">1608458512</style></ISBN><title><style face="normal" font="default" size="100%">High-level Structures for Quantum Computing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences - Technical Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">59</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">305–324</style></PAGES><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><title><style face="normal" font="default" size="100%">Models of quantum computation and quantum programming languages</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Mod. Phys. C</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">22</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">9</style></NUMBER><PAGES><style face="normal" font="default" size="100%">897–918</style></PAGES><DATE><style face="normal" font="default" size="100%">9</style></DATE><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><title><style face="normal" font="default" size="100%">Singular value decomposition and matrix reorderings in quantum information theory</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">11</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">6</style></NUMBER><PAGES><style face="normal" font="default" size="100%">1571–1583</style></PAGES><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><NOTES><style face="normal" font="default" size="100%">arXiv:1108.0642</style></NOTES><title><style face="normal" font="default" size="100%">Qubit flip game on a Heisenberg spin chain</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><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><title><style face="normal" font="default" size="100%">Design-on-demand or how to create a target-oriented social web-site</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2009</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">9</style></VOLUME><NUMBER><style face="normal" font="default" size="100%"/></NUMBER><PAGES><style face="normal" font="default" size="100%">0103–0130</style></PAGES><DATE><style face="normal" font="default" size="100%">1</style></DATE><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><NOTES><style face="normal" font="default" size="100%">arXiv:0805.2037 IF=2.980(209); IF5=2.402(2010);</style></NOTES><title><style face="normal" font="default" size="100%">Sub- and super-fidelity as bounds for quantum fidelity</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><NUMBER><style face="normal" font="default" size="100%"/></NUMBER><PAGES><style face="normal" font="default" size="100%">1238–1250</style></PAGES><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><title><style face="normal" font="default" size="100%">Quantum network exploration with a faulty sense of direction</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Linear Algebra Appl.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">434</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">327–342</style></PAGES><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><NOTES><style face="normal" font="default" size="100%">arXiv:1008.3482 IF=1.005(2010);</style></NOTES><title><style face="normal" font="default" size="100%">Product numerical range in a space with tensor product structure</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">44</style></VOLUME><PAGES><style face="normal" font="default" size="100%">405301</style></PAGES><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><NOTES><style face="normal" font="default" size="100%">arXiv:1107.2792 IF=1.641(2010);</style></NOTES><title><style face="normal" font="default" size="100%">Probability measure generated by the superfidelity</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><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><DATE><style face="normal" font="default" size="100%">02/2017</style></DATE><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><NOTES><style face="normal" font="default" size="100%">arXiv:1109.4244</style></NOTES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1515/bpasts-2017-0003</style></URL><title><style face="normal" font="default" size="100%">Symbolic integration with respect to the Haar measure on the unitary groups</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2009</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">79</style></VOLUME><PAGES><style face="normal" font="default" size="100%">024302</style></PAGES><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><NOTES><style face="normal" font="default" size="100%">arXiv:0811.2323 IF=2.866(2009);</style></NOTES><title><style face="normal" font="default" size="100%">Bound on trace distance based on superfidelity</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">45</style></VOLUME><PAGES><style face="normal" font="default" size="100%">415309</style></PAGES><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><NOTES><style face="normal" font="default" size="100%">arXiv:1201.2524</style></NOTES><title><style face="normal" font="default" size="100%">Restricted numerical shadow and geometry of quantum entanglement</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">10</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">1–12</style></PAGES><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><NOTES><style face="normal" font="default" size="100%">arXiv:0911.0567 IF=2.085(2010);</style></NOTES><title><style face="normal" font="default" size="100%">Experimentally feasible measures of distance between quantum operations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Studia Informatica</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">28</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">4</style></NUMBER><PAGES><style face="normal" font="default" size="100%">5–18</style></PAGES><title><style face="normal" font="default" size="100%">Kompilator języka QCL QCL2QML</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">12</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">569–576</style></PAGES><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><NOTES><style face="normal" font="default" size="100%">arXiv:1201.3230</style></NOTES><title><style face="normal" font="default" size="100%">Increasing the security of the ping-pong protocol by using many mutually unbiased bases</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Advances in Mathematical Physics,</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2016</style></VOLUME><PAGES><style face="normal" font="default" size="100%">3162012</style></PAGES><title><style face="normal" font="default" size="100%">A general scheme for information interception in the ping pong protocol</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">49</style></VOLUME><PAGES><style face="normal" font="default" size="100%">375302</style></PAGES><title><style face="normal" font="default" size="100%">Lively quantum walks on cycles</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Physics A: Mathematical and Theoretical</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/1703.01792</style></URL><title><style face="normal" font="default" size="100%">Limiting properties of stochastic quantum walks on directed graphs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer Physics Communications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">235</style></VOLUME><SECTION><style face="normal" font="default" size="100%">414</style></SECTION><DATE><style face="normal" font="default" size="100%">2019</style></DATE><title><style face="normal" font="default" size="100%">QSWalk. jl: Julia package for quantum stochastic walks analysis</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Soft Computing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">22</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">3</style></ISSUE><title><style face="normal" font="default" size="100%">A quantum-inspired version of the nearest mean classifier</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/1802.10041</style></URL><title><style face="normal" font="default" size="100%">Impact of the malicious input data modification on the efficiency of quantum spatial search</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Studies: Mathematics and Foundations</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/1702.07932</style></URL><title><style face="normal" font="default" size="100%">The role of quantum correlations in Cop and Robber game</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><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><title><style face="normal" font="default" size="100%">Approximation of quantum control correction scheme using deep neural networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Physics A: Mathematical and Theoretical</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><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><title><style face="normal" font="default" size="100%">Geometrical versus time-series representation of data in quantum control learning</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Nonlinear Dynamics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">98</style></VOLUME><PAGES><style face="normal" font="default" size="100%">1821–1830</style></PAGES><DATE><style face="normal" font="default" size="100%">Nov</style></DATE><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><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/s11071-019-05290-1</style></URL><title><style face="normal" font="default" size="100%">Ratcheting based on neighboring niches determines lifestyle</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">130</style></VOLUME><PAGES><style face="normal" font="default" size="100%">109464</style></PAGES><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><URL><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0960077919304102</style></URL><title><style face="normal" font="default" size="100%">Passive network evolution promotes group welfare in complex networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">01/2021</style></DATE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2010.04553</style></URL><title><style face="normal" font="default" size="100%">LP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2106.09056</style></URL><title><style face="normal" font="default" size="100%">Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Science and Technology</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">7</style></VOLUME><SECTION><style face="normal" font="default" size="100%">045017</style></SECTION><DATE><style face="normal" font="default" size="100%">07/2022</style></DATE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2011.01879v2</style></URL><title><style face="normal" font="default" size="100%">Variational certification of quantum devices</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Computer-Aided Civil And Infrastructure Engineering</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><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><DATE><style face="normal" font="default" size="100%">03/2022</style></DATE><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><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></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2108.10927</style></URL><title><style face="normal" font="default" size="100%">Error mitigation for variational quantum algorithms through mid-circuit measurements</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">SoftwareX</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">16</style></VOLUME><SECTION><style face="normal" font="default" size="100%">100893</style></SECTION><DATE><style face="normal" font="default" size="100%">12/2021</style></DATE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2004.12337</style></URL><title><style face="normal" font="default" size="100%">KrakN: Transfer Learning framework and dataset for infrastructure thin crack detection</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2nd Workshop on Engineering  Optimization – WEO 2021</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warsaw</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Institute of Fundamental Technological Research of the Polish Academy of Sciences</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">987-83-65550-23-1</style></ISBN><URL><style face="normal" font="default" size="100%">http://v4shm.ippt.pan.pl/WEO2021-BookOfAbstracts.pdf</style></URL><title><style face="normal" font="default" size="100%">Advances in applicable deep-learning based defect  detection</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2nd Workshop on Engineering  Optimization – WEO 2021</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Warsaw</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Institute of Fundamental Technological Research of the Polish Academy of Sciences</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">987-83-65550-23-1</style></ISBN><URL><style face="normal" font="default" size="100%">http://v4shm.ippt.pan.pl/WEO2021-BookOfAbstracts.pdf</style></URL><title><style face="normal" font="default" size="100%">Extracting crack characteristics from RGB-D images</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physica A: Statistical Mechanics and its Applications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2201.10913</style></URL><title><style face="normal" font="default" size="100%">Constructing games on networks for controlling the inequalities in the capital distribution</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Annalen der Physik</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><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><DATE><style face="normal" font="default" size="100%">06/2022</style></DATE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2205.15800</style></URL><title><style face="normal" font="default" size="100%">Transparency and enhancement in fast and slow light in q-deformed optomechanical system</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Access</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">10</style></VOLUME><SECTION><style face="normal" font="default" size="100%">108134</style></SECTION><DATE><style face="normal" font="default" size="100%">10/2022</style></DATE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2210.05282</style></URL><title><style face="normal" font="default" size="100%">Computer Vision Based Inspection on Post-Earthquake With UAV Synthetic Dataset</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physica A: Statistical Mechanics and its Applications</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">608</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">128289</style></ISSUE><DATE><style face="normal" font="default" size="100%">11/2022</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.48550/arXiv.2208.13426</style></URL><title><style face="normal" font="default" size="100%">Will you infect me with your opinion?</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">QP2023 Workshop, Programming'23, </style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Tokyo, Japan, March 13-17, 2023</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Association for Computing Machinery</style></PUBLISHER><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2302.09401</style></URL><title><style face="normal" font="default" size="100%">Symbolic quantum programming for supporting applications of quantum computing technologies</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Bulletin of the Polish Academy of Sciences Technical Sciences</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">71 (EA)</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">6</style></ISSUE><DATE><style face="normal" font="default" size="100%">10/2023</style></DATE><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><URL><style face="normal" font="default" size="100%">https://journals.pan.pl/dlibra/publication/147340/edition/128931/content</style></URL><title><style face="normal" font="default" size="100%">A deep learning method for hard-hat-wearing detection based on head center localization</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physica Scripta</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">98</style></VOLUME><SECTION><style face="normal" font="default" size="100%">115210</style></SECTION><DATE><style face="normal" font="default" size="100%">10/2023</style></DATE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2310.05979</style></URL><title><style face="normal" font="default" size="100%">Rule switching mechanisms in the Game of Life with synchronous and asynchronous updating policy</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>7</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Reversible Computation 2023</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Springer Nature Switzerland</style></PUBLISHER><NUMBER><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></NUMBER><PAGES><style face="normal" font="default" size="100%">24–39</style></PAGES><ISBN><style face="normal" font="default" size="100%">9783031381003</style></ISBN><title><style face="normal" font="default" size="100%">Towards a Taxonomy for Reversible Computation Approaches</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">New Journal of Physics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">26</style></VOLUME><SECTION><style face="normal" font="default" size="100%">013034</style></SECTION><DATE><style face="normal" font="default" size="100%">01/2024</style></DATE><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><title><style face="normal" font="default" size="100%">Enhancing quantum variational state diagonalization using reinforcement learning techniques</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">34</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">100517</style></ISSUE><DATE><style face="normal" font="default" size="100%">03/2025</style></DATE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2406.01083</style></URL><title><style face="normal" font="default" size="100%">Statistical analysis of geoinformation data for increasing railway safety</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">New Journal of Physics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">28</style></VOLUME><DATE><style face="normal" font="default" size="100%">04/2026</style></DATE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2406.17610</style></URL><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></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>9</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">Quoqa Pubs</style></PUBLISHER><ISBN><style face="normal" font="default" size="100%">978-8366950016</style></ISBN><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><URL><style face="normal" font="default" size="100%">https://open.icm.edu.pl/handle/123456789/24302</style></URL><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></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Computational Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">85</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">102509</style></ISSUE><DATE><style face="normal" font="default" size="100%">12/2024</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.jocs.2024.102509</style></URL><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></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Access</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><SECTION><style face="normal" font="default" size="100%">140072 - 140081</style></SECTION><DATE><style face="normal" font="default" size="100%">09/2024</style></DATE><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><title><style face="normal" font="default" size="100%">Multi-Step Feature Fusion for Natural Disaster Damage Assessment on Satellite Images</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physica A: Statistical Mechanics and its Applications</style></SECONDARY_TITLE><VOLUME><style face="normal" font="default" size="100%">694</style></VOLUME><SECTION><style face="normal" font="default" size="100%">131613</style></SECTION><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2510.03772</style></URL><title><style face="normal" font="default" size="100%">Cooperation in public goods game on square lattices with agents changing interaction groups</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_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/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Conference on Computational Science (ICCS 2026)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Hamburg, Germany</style></PLACE_PUBLISHED><PUBLISHER><style face="normal" font="default" size="100%">Springer</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">06/2026</style></DATE><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><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2607.13722</style></URL><title><style face="normal" font="default" size="100%">Towards Quantum Machine Learning for Assessing the Resilience of Post-quantum Cryptography</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</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%">Notes on the Riccati operator equation in open quantum systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Math. Phys</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">53</style></VOLUME><PAGES><style face="normal" font="default" size="100%">012106</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Recent problem [B. Gardas, J. Math. Phys. {bf 52}, 042104 (2011)] concerning an antilinear solution of the Riccati equation is solved. We also exemplify that a simplification of the Riccati equation, even under reasonable assumptions, can lead to a not equivalent equation.&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1111.4380 IF=1.291(2010); 5IF=1.210(2010);</style></NOTES><title><style face="normal" font="default" size="100%">Notes on the Riccati operator equation in open quantum systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</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%">Stationary states of two-level open quantum systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">44</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">21</style></NUMBER><PAGES><style face="normal" font="default" size="100%">215306</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;A problem of finding stationary states of open quantum systems is addressed. We focus our attention on a generic type of open system: a qubit coupled to its environment. We apply the theory of block operator matrices and find stationary states of two-level open quantum systems under certain conditions applied on both the qubit and the surrounding.&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1006.3328 IF=1.641(2010);</style></NOTES><title><style face="normal" font="default" size="100%">Stationary states of two-level open quantum systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jakub Czartowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konrad Szymański</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Yan Fyodorov</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%">Separability gap and large deviation entanglement criterion</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">100</style></VOLUME><PAGES><style face="normal" font="default" size="100%">042326</style></PAGES><URL><style face="normal" font="default" size="100%">https://journals.aps.org/pra/abstract/10.1103/PhysRevA.100.042326</style></URL><title><style face="normal" font="default" size="100%">Separability gap and large deviation entanglement criterion</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marek Rams</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jacek Dziarmaga</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum neural networks to simulate many-body quantum systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. B</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">98</style></VOLUME><PAGES><style face="normal" font="default" size="100%">184304</style></PAGES><DATE><style face="normal" font="default" size="100%">Nov</style></DATE><URL><style face="normal" font="default" size="100%">https://link.aps.org/doi/10.1103/PhysRevB.98.184304</style></URL><title><style face="normal" font="default" size="100%">Quantum neural networks to simulate many-body quantum systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jacek Dziarmaga</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Wojciech Zurek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Dynamics of the quantum phase transition in the one-dimensional Bose-Hubbard model: Excitations and correlations induced by a quench</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2017</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. B</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">95</style></VOLUME><PAGES><style face="normal" font="default" size="100%">104306</style></PAGES><DATE><style face="normal" font="default" size="100%">Mar</style></DATE><URL><style face="normal" font="default" size="100%">https://link.aps.org/doi/10.1103/PhysRevB.95.104306</style></URL><title><style face="normal" font="default" size="100%">Dynamics of the quantum phase transition in the one-dimensional Bose-Hubbard model: Excitations and correlations induced by a quench</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jacek Dziarmaga</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Wojciech Zurek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michael Zwolak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Defects in Quantum Computers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sci. Rep</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">8</style></VOLUME><PAGES><style face="normal" font="default" size="100%">4539</style></PAGES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1038/s41598-018-22763-2</style></URL><title><style face="normal" font="default" size="100%">Defects in Quantum Computers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">S. Deffner</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum fluctuation theorem for error diagnostics in quantum annealers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sci. Rep</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">8</style></VOLUME><PAGES><style face="normal" font="default" size="100%">17191</style></PAGES><title><style face="normal" font="default" size="100%">Quantum fluctuation theorem for error diagnostics in quantum annealers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Ptok</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Counting defects in quantum computers with Graphics Processing Units</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Comput. Phys</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">366</style></VOLUME><PAGES><style face="normal" font="default" size="100%">320 - 326</style></PAGES><URL><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0021999118302304</style></URL><title><style face="normal" font="default" size="100%">Counting defects in quantum computers with Graphics Processing Units</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Thermodynamic universality of quantum Carnot engines</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. E</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">92</style></VOLUME><PAGES><style face="normal" font="default" size="100%">042126</style></PAGES><DATE><style face="normal" font="default" size="100%">Oct</style></DATE><URL><style face="normal" font="default" size="100%">https://link.aps.org/doi/10.1103/PhysRevE.92.042126</style></URL><title><style face="normal" font="default" size="100%">Thermodynamic universality of quantum Carnot engines</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Anna Francuz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jacek Dziarmaga</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Wojciech Zurek</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Space and time renormalization in phase transition dynamics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. B</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">93</style></VOLUME><PAGES><style face="normal" font="default" size="100%">075134</style></PAGES><DATE><style face="normal" font="default" size="100%">Feb</style></DATE><URL><style face="normal" font="default" size="100%">http://link.aps.org/doi/10.1103/PhysRevB.93.075134</style></URL><title><style face="normal" font="default" size="100%">Space and time renormalization in phase transition dynamics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">S. Deffner</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Saxena</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Non-hermitian quantum thermodynamics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sci. Rep</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">6</style></VOLUME><PAGES><style face="normal" font="default" size="100%">23408</style></PAGES><title><style face="normal" font="default" size="100%">Non-hermitian quantum thermodynamics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Exact reduced dynamics for a qubit in a precessing magnetic field and in contact with a heat bath</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">82</style></VOLUME><PAGES><style face="normal" font="default" size="100%">042115</style></PAGES><DATE><style face="normal" font="default" size="100%">Oct</style></DATE><URL><style face="normal" font="default" size="100%">https://link.aps.org/doi/10.1103/PhysRevA.82.042115</style></URL><title><style face="normal" font="default" size="100%">Exact reduced dynamics for a qubit in a precessing magnetic field and in contact with a heat bath</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Riccati equation and the problem of decoherence</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2010</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Math. Phys.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">51</style></VOLUME><PAGES><style face="normal" font="default" size="100%">062103</style></PAGES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1063/1.3442364</style></URL><title><style face="normal" font="default" size="100%">Riccati equation and the problem of decoherence</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Avadh Saxena</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Repeatability of measurements: Non-Hermitian observables and quantum Coriolis force</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">94</style></VOLUME><PAGES><style face="normal" font="default" size="100%">022121</style></PAGES><DATE><style face="normal" font="default" size="100%">Aug</style></DATE><URL><style face="normal" font="default" size="100%">https://link.aps.org/doi/10.1103/PhysRevA.94.022121</style></URL><title><style face="normal" font="default" size="100%">Repeatability of measurements: Non-Hermitian observables and quantum Coriolis force</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Avadh Saxena</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">PT-symmetric slowing down of decoherence</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">94</style></VOLUME><PAGES><style face="normal" font="default" size="100%">040101</style></PAGES><DATE><style face="normal" font="default" size="100%">Oct</style></DATE><URL><style face="normal" font="default" size="100%">https://link.aps.org/doi/10.1103/PhysRevA.94.040101</style></URL><title><style face="normal" font="default" size="100%">PT-symmetric slowing down of decoherence</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Michał Januszewski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Ptok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dawid Crivelli</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%">GPU-based acceleration of free energy calculations in solid state physics</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Comput. Phys. Comm</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">192</style></VOLUME><PAGES><style face="normal" font="default" size="100%">220 - 227</style></PAGES><URL><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0010465515000697</style></URL><title><style face="normal" font="default" size="100%">GPU-based acceleration of free energy calculations in solid state physics</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Łuczka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Ptok</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">J. Dajka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Energetics of an rf SQUID Coupled to Two Thermal Reservoirs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">PLoS One</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">10</style></VOLUME><PAGES><style face="normal" font="default" size="100%">1-10</style></PAGES><DATE><style face="normal" font="default" size="100%">12</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1371/journal.pone.0143912</style></URL><title><style face="normal" font="default" size="100%">Energetics of an rf SQUID Coupled to Two Thermal Reservoirs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Konrad Jałowiecki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marek Rams</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%">Brute-forcing spin-glass problems with CUDA</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Comput. Phys. Commun</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">260</style></VOLUME><SECTION><style face="normal" font="default" size="100%">107728</style></SECTION><DATE><style face="normal" font="default" size="100%">11/2020</style></DATE><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/1904.03621</style></URL><title><style face="normal" font="default" size="100%">Brute-forcing spin-glass problems with CUDA</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">A. Więckowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">S. Deffner</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%">Disorder-assisted graph coloring on quantum annealers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">100</style></VOLUME><SECTION><style face="normal" font="default" size="100%">062304</style></SECTION><DATE><style face="normal" font="default" size="100%">12/2019</style></DATE><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/1903.07056</style></URL><title><style face="normal" font="default" size="100%">Disorder-assisted graph coloring on quantum annealers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Dajka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Reply to Comment on `Initial states of qubit–environment models leading to conserved quantities'</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">47</style></VOLUME><PAGES><style face="normal" font="default" size="100%">168002</style></PAGES><DATE><style face="normal" font="default" size="100%">apr</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1088%2F1751-8113%2F47%2F16%2F168002</style></URL><title><style face="normal" font="default" size="100%">Reply to Comment on `Initial states of qubit–environment models leading to conserved quantities'</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Dajka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Reply to “Comment on: ‘Multi-photon Rabi model: Generalized parity and its applications’ [Phys. Lett. A 377 (2013) 3205]” [Phys. Lett. A 378 (2014) 1969]</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Lett. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">378</style></VOLUME><PAGES><style face="normal" font="default" size="100%">1970</style></PAGES><URL><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0375960114004241</style></URL><title><style face="normal" font="default" size="100%">Reply to “Comment on: ‘Multi-photon Rabi model: Generalized parity and its applications’ [Phys. Lett. A 377 (2013) 3205]” [Phys. Lett. A 378 (2014) 1969]</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Dajka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">New symmetry in the Rabi model</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">46</style></VOLUME><PAGES><style face="normal" font="default" size="100%">265302</style></PAGES><DATE><style face="normal" font="default" size="100%">jun</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1088%2F1751-8113%2F46%2F26%2F265302</style></URL><title><style face="normal" font="default" size="100%">New symmetry in the Rabi model</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Dajka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Initial states of qubit–environment models leading to conserved quantities</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">46</style></VOLUME><PAGES><style face="normal" font="default" size="100%">235301</style></PAGES><DATE><style face="normal" font="default" size="100%">may</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1088%2F1751-8113%2F46%2F23%2F235301</style></URL><title><style face="normal" font="default" size="100%">Initial states of qubit–environment models leading to conserved quantities</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jerzy Dajka</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Łuczka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Relation Between Purity of an Open Qubit Dynamics and Its Initial Correlation with an Environment</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Int. J. Theor. Phys</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">52</style></VOLUME><PAGES><style face="normal" font="default" size="100%">1148–1159</style></PAGES><DATE><style face="normal" font="default" size="100%">Apr</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/s10773-012-1430-1</style></URL><title><style face="normal" font="default" size="100%">Relation Between Purity of an Open Qubit Dynamics and Its Initial Correlation with an Environment</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jerzy Dajka</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Multi-photon Rabi model: Generalized parity and its applications</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Lett. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">377</style></VOLUME><PAGES><style face="normal" font="default" size="100%">3205 - 3208</style></PAGES><URL><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0375960113009432</style></URL><title><style face="normal" font="default" size="100%">Multi-photon Rabi model: Generalized parity and its applications</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Riccati equation and the problem of decoherence II: Symmetry and the solution of the Riccati equation</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Math. Phys</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">52</style></VOLUME><PAGES><style face="normal" font="default" size="100%">042104</style></PAGES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1063/1.3574889</style></URL><title><style face="normal" font="default" size="100%">Riccati equation and the problem of decoherence II: Symmetry and the solution of the Riccati equation</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Exact solution of the Schrödinger equation with the spin-boson Hamiltonian</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">44</style></VOLUME><PAGES><style face="normal" font="default" size="100%">195301</style></PAGES><DATE><style face="normal" font="default" size="100%">apr</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1088%2F1751-8113%2F44%2F19%2F195301</style></URL><title><style face="normal" font="default" size="100%">Exact solution of the Schrödinger equation with the spin-boson Hamiltonian</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Domino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mátyás Koniorczyk</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Krawiec</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konrad Jałowiecki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</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%">Quantum annealing in the NISQ era: railway conflict management</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Entropy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">25</style></VOLUME><SECTION><style face="normal" font="default" size="100%">191</style></SECTION><DATE><style face="normal" font="default" size="100%">01/2023</style></DATE><title><style face="normal" font="default" size="100%">Quantum annealing in the NISQ era: railway conflict management</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Konrad Jałowiecki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Andrzej Więckowski</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%">Parallel in time dynamics with quantum annealers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2020</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Sci. Rep</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">10</style></VOLUME><SECTION><style face="normal" font="default" size="100%">13534</style></SECTION><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/1909.04929</style></URL><title><style face="normal" font="default" size="100%">Parallel in time dynamics with quantum annealers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Marek Rams</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Masoud Mohseni</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Daniel Eppens</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Konrad Jałowiecki</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%">Approximate optimization, sampling, and spin-glass droplet discovery with tensor networks</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. E</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">104</style></VOLUME><DATE><style face="normal" font="default" size="100%">Aug</style></DATE><URL><style face="normal" font="default" size="100%">https://link.aps.org/doi/10.1103/PhysRevE.104.025308</style></URL><title><style face="normal" font="default" size="100%">Approximate optimization, sampling, and spin-glass droplet discovery with tensor networks</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Artur Soriani</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pierre Naze</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marcus Bonancca</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The three phases of quantum annealing: fast, slow, and very slow</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">105</style></VOLUME><SECTION><style face="normal" font="default" size="100%">042423</style></SECTION><title><style face="normal" font="default" size="100%">The three phases of quantum annealing: fast, slow, and very slow</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Artur Soriani</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Pierre Nazé</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marcus Bonança</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Assessing performance of quantum annealing with non-linear driving</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">105</style></VOLUME><SECTION><style face="normal" font="default" size="100%">052442</style></SECTION><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2203.17009</style></URL><title><style face="normal" font="default" size="100%">Assessing performance of quantum annealing with non-linear driving</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Tomasz Śmierzchalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zakaria Mzaouali</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</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%">Efficiency Optimization in Quantum Computing: Balancing Thermodynamics and Computational Performance</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">14</style></VOLUME><SECTION><style face="normal" font="default" size="100%">4555</style></SECTION><URL><style face="normal" font="default" size="100%">https://www.nature.com/articles/s41598-024-55314-z</style></URL><title><style face="normal" font="default" size="100%">Efficiency Optimization in Quantum Computing: Balancing Thermodynamics and Computational Performance</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Devjyoti Tripathy</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Akram Touil</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum information scrambling in two-dimensional Bose–Hubbard lattices</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Chaos: An Interdisciplinary Journal of Nonlinear Science</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">34</style></VOLUME><DATE><style face="normal" font="default" size="100%">04</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;It is a well-understood fact that the transport of excitations throughout a lattice is intimately governed by the underlying structures. Hence, it is only natural to recognize that the dispersion of information also has to depend on the lattice geometry. In the present work, we demonstrate that two-dimensional lattices described by the Bose–Hubbard model exhibit information scrambling for systems as little as two hexagons. However, we also find that the out-of-time-ordered correlator (OTOC) shows the exponential decay characteristic for quantum chaos only for a judicious choice of local observables. More generally, the OTOC is better described by Gaussian-exponential convolutions, which alludes to the close similarity of information scrambling and decoherence theory.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1063/5.0199335</style></URL><title><style face="normal" font="default" size="100%">Quantum information scrambling in two-dimensional Bose–Hubbard lattices</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Domino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Emery Doucet</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Reece Robertson</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">On the Baltimore Light RailLink into the quantum future</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Scientific Reports</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">15</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">29576</style></ISSUE><DATE><style face="normal" font="default" size="100%">08/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In the current era of noisy intermediate-scale quantum (NISQ) technology, quantum devices present new avenues for addressing complex, real-world challenges including potentially NP-hard optimization problems. This work aims to showcase how the inherent noise in NISQ devices can be leveraged to solve such real-world problems effectively. Utilizing a D-Wave quantum annealer and IonQ's gate-based NISQ computers, we generate and analyze solutions for managing train traffic under stochastic disturbances. Our case study focuses on the Baltimore Light RailLink, which embodies the characteristics of both tramway and railway networks. We explore the feasibility of using NISQ technology to model the stochastic nature of disruptions in these transportation systems. Our research marks the inaugural application of both quantum computing paradigms to tramway and railway rescheduling, highlighting the potential of quantum noise as a beneficial resource in complex optimization scenarios.&lt;/p&gt;&#13;
</style></ABSTRACT><title><style face="normal" font="default" size="100%">On the Baltimore Light RailLink into the quantum future</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Khadija Hawary</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mohamed Azzouz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Morad Baz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zakaria Mzaouali</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Navigating the phase diagram of quantum many-body systems in phase space</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review E</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">110</style></VOLUME><SECTION><style face="normal" font="default" size="100%">014120</style></SECTION><DATE><style face="normal" font="default" size="100%">12 July, 2024</style></DATE><TYPE_OF_WORK><style face="normal" font="default" size="100%">Regular Article</style></TYPE_OF_WORK><URL><style face="normal" font="default" size="100%">https://link.aps.org/doi/10.1103/PhysRevE.110.014120</style></URL><title><style face="normal" font="default" size="100%">Navigating the phase diagram of quantum many-body systems in phase space</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>31</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Reece Robertson</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Emery Doucet</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zakaria Mzaouali</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Domino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Simon's Period Finding on a Quantum Annealer</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">2025 IEEE International Conference on Quantum Computing and Engineering (QCE)</style></SECONDARY_TITLE><PLACE_PUBLISHED><style face="normal" font="default" size="100%">Albuquerque, USA</style></PLACE_PUBLISHED><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><PUBLISHER><style face="normal" font="default" size="100%">IEEE International Conference on Quantum Computing and Engineering (QCE25)</style></PUBLISHER><DATE><style face="normal" font="default" size="100%">12/2025</style></DATE><URL><style face="normal" font="default" size="100%">https://ieeexplore.ieee.org/document/11250344</style></URL><title><style face="normal" font="default" size="100%">Simon's Period Finding on a Quantum Annealer</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Anna Dziubyna</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Śmierzchalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marek Rams</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Masoud Mohseni</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Limitations of tensor-network approaches for optimization and sampling: A comparison to quantum and classical Ising machines</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review Applied</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">23</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">5</style></ISSUE><DATE><style face="normal" font="default" size="100%">05/2025</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Optimization problems pose challenges across various fields. In recent years, quantum annealers have emerged as a promising platform for tackling such challenges. Here, to provide an additional perspective, we develop a heuristic tensor-network-based algorithm to reveal the low-energy spectra of Ising spin-glass systems with interaction graphs relevant to present-day quantum annealers. Our deterministic approach combines a branch-and-bound search strategy with an approximate calculation of marginals via tensor-network contractions. Its application to quasi-two-dimensional lattices with large unit cells of up to 24 spins, realized in current quantum annealing processors, requires a dedicated approach that uses sparse structures in the tensor-network representation and GPU hardware acceleration. We benchmark our approach on random problems defined on Pegasus and Zephyr graphs with up to a few thousand spins, comparing it against the D-Wave Advantage quantum annealer and the simulated bifurcation algorithm, with the latter representing an emerging class of classical Ising solvers. In addition to examining the quality of the best solutions, we compare the diversity of low-energy states sampled by all the solvers. For the largest considered independent and identically distributed problems with over 5000 spins, the state-of-the-art tensor-network approaches lead to solutions that are 0.1% to 1% worse than the best solutions obtained by Ising machines while being 2 orders of magnitude slower. We attribute these results to approximate contraction failures. For embedded tile planting instances, our approach reaches approximately 0.1% from the planted ground state, a factor of 3 better than the Ising solvers. While all three methods can output diverse low-energy solutions—e.g., differing by at least a quarter of spins with energy error below 1%—our deterministic branch-and-bound approach finds sets of a few such states at most. In contrast, both Ising machines prove capable of sampling sets of thousands of such solutions.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://link.aps.org/doi/10.1103/PhysRevApplied.23.054049</style></URL><title><style face="normal" font="default" size="100%">Limitations of tensor-network approaches for optimization and sampling: A comparison to quantum and classical Ising machines</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Subhajit Sarkar</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Gabriela Wójtowicz</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marek Rams</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michael Zwolak</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Approaching the scaling limit of transport through lattices with dephasing</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2025</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">The Journal of Chemical Physics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">163</style></VOLUME><DATE><style face="normal" font="default" size="100%">09</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We examine the stationary-state equations for lattices with generalized Markovian dephasing and relaxation. When the Hamiltonian is quadratic, the single-particle correlation matrix has a closed system of equations even in the presence of these two processes. The resulting equations have a vectorized form related to, but distinct from, Lyapunov’s equation. We present an efficient solution that helps to achieve the scaling limit, e.g., of the current decay with lattice length. As an example, we study the super-diffusive-to-diffusive transition in a lattice with long-range hopping and dephasing. The approach enables calculations with up to 104 sites, representing an increase of 10 to 40 times over prior studies. This enables a more precise extraction of the diffusion exponent, enhances agreement with theoretical results, and supports the presence of a phase transition. There is a wide range of problems that have Markovian relaxation, noise, and driving. They include quantum networks for machine-learning-based classification and extended reservoir approaches for transport. The results here will be useful for these classes of problems.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1063/5.0283282</style></URL><title><style face="normal" font="default" size="100%">Approaching the scaling limit of transport through lattices with dephasing</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Philipp Hanussek</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Jakub Pawłowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zakaria Mzaouali</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%">Quantum-inspired dynamical models on quantum and classical annealers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review Applied</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">25</style></VOLUME><SECTION><style face="normal" font="default" size="100%">044055 </style></SECTION><DATE><style face="normal" font="default" size="100%">21/04/2026</style></DATE><TYPE_OF_WORK><style face="normal" font="default" size="100%">Regular Article</style></TYPE_OF_WORK><URL><style face="normal" font="default" size="100%">https://journals.aps.org/prapplied/abstract/10.1103/rrf3-jm5m</style></URL><title><style face="normal" font="default" size="100%">Quantum-inspired dynamical models on quantum and classical annealers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Emery Doucet</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zakaria Mzaouali</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Reece Robertson</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Domino</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Thermodynamic significance of QUBO encoding on quantum annealers</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">New Journal of Physics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><ISSUE><style face="normal" font="default" size="100%">28 </style></ISSUE><PAGES><style face="normal" font="default" size="100%">054512</style></PAGES><DATE><style face="normal" font="default" size="100%">05/2026</style></DATE><title><style face="normal" font="default" size="100%">Thermodynamic significance of QUBO encoding on quantum annealers</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Jakub Pawlowski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Tomasz Śmierzchalski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Fengping Jin</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Bartłomiej Gardas</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Sebastian Deffner</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zakaria Mzaouali</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Quantum annealers as programmable thermal machines</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2026</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">arxiv:2608.04564</style></SECONDARY_TITLE><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/2608.04564</style></URL><title><style face="normal" font="default" size="100%">Quantum annealers as programmable thermal machines</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Radosław Adamczak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Rafał Latała</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%">Asymptotic entropic uncertainty relations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2016</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Math. Phys. </style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">57</style></VOLUME><SECTION><style face="normal" font="default" size="100%">032204</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Entropic uncertainty relations are analyzed for the case of N-dimensional Hilbert space and two orthogonal measurements performed in two generic bases, related by a Haar random unitary matrix U. We derive estimations for the average norms of truncations of U of a given size, which allow us to study state-independent lower bounds for the sum of two entropies describing the measurements outcomes. In particular, we show that the Maassen–Uffink bound asymptotically behaves as lnN−lnlnN−ln2, while the strong entropic majorization relation yields a nearly optimal bound, lnN−const. Analogous results are also obtained for a more general case of several orthogonal measurements performed in generic bases.&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1412.7065v1</style></NOTES><URL><style face="normal" font="default" size="100%">http://dx.doi.org/10.1063/1.4944425</style></URL><title><style face="normal" font="default" size="100%">Asymptotic entropic uncertainty relations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_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%">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 shadows: measures and densities on the numerical range</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2011</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Linear Algebra Appl.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">434</style></VOLUME><PAGES><style face="normal" font="default" size="100%">2042–2080</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">For any operator M acting on an N-dimensional Hilbert space H\_N we introduce its numerical shadow, which is a probability measure on the complex plane supported by the numerical range of M. The shadow of M at point z is defined as the probability that the inner product (Mu,u) is equal to z, where u stands for a random complex vector from H\_N, satisfying ||u||=1. In the case of N=2 the numerical shadow of a non-normal operator can be interpreted as a shadow of a hollow sphere projected on a plane. A similar interpretation is provided also for higher dimensions. For a hermitian M its numerical shadow forms a probability distribution on the real axis which is shown to be a one dimensional B-spline. In the case of a normal M the numerical shadow corresponds to a shadow of a transparent solid simplex in R^{N-1} onto the complex plane. Numerical shadow is found explicitly for Jordan matrices J\_N, direct sums of matrices and in all cases where the shadow is rotation invariant. Results concerning the moments of shadow measures play an important role. A general technique to study numerical shadow via the Cartesian decomposition is described, and a link of the numerical shadow of an operator to its higher-rank numerical range is emphasized.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1010.4189 IF=1.005(2010);</style></NOTES><title><style face="normal" font="default" size="100%">Numerical shadows: measures and densities on the numerical range</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">M. Enríquez</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%">Minimal Renyi-Ingarden-Urbanik entropy of multipartite quantum states</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Entropy</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">17</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">7</style></NUMBER><PAGES><style face="normal" font="default" size="100%">5063–5084</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We study the entanglement of a pure state of a composite quantum system consisting of several subsystems with d levels each. It can be described by the R'enyi-Ingarden-Urbanik entropy Sq of a decomposition of the state in a product basis, minimized over all local unitary transformations. In the case q=0 this quantity becomes a function of the rank of the tensor representing the state, while in the limit q→∞ the entropy becomes related to the overlap with the closest separable state and the geometric measure of entanglement. For any bipartite system the entropy S1 coincides with the standard entanglement entropy. We analyze the distribution of the minimal entropy for random states of three and four-qubit systems. In the former case the distributions of 3-tangle is studied and some of its moments are evaluated, while in the latter case we analyze the distribution of the hyperdeterminant. The behavior of the maximum overlap of a three-qudit system with the closest separable state is also investigated in the asymptotic limit.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.3390/e17075063</style></URL><title><style face="normal" font="default" size="100%">Minimal Renyi-Ingarden-Urbanik entropy of multipartite quantum states</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Piotr Gawron</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Dariusz Kurzyk</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%">A model for quantum queue</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">International Journal of Quantum Information</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">11</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">1350023</style></PAGES><NOTES><style face="normal" font="default" size="100%">arXiv:1210.8339</style></NOTES><title><style face="normal" font="default" size="100%">A model for quantum queue</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Przemysław Głomb</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Arkadiusz Sochan</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Context selection for efficient bit modeling of contourlet transform coefficients</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2007</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Theoretical and Applied Informatics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">19</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">2</style></NUMBER><PAGES><style face="normal" font="default" size="100%">135–146</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Contourlet transform is named as one possible successor to the wavelet transform as a tool for representation of image information. It has better properties in representation of edge information, which make it suitable for designing image compression systems. It is not clear, however, how to exploit the statistical structure of the coefficients generated by this transform in effective compression algorithm. In this work, authors propose a general, nonparametric method to achieve context map, thus allowing for efficient application of EBCOT/JPEG 2000 bit modeling and encoding approach to contourlet transformed images. The article presents the derivation of the method and experiments performed on a publicly available image set. Keywords: contourlet transform, coefficient bit modeling, context estimation</style></ABSTRACT><title><style face="normal" font="default" size="100%">Context selection for efficient bit modeling of contourlet transform coefficients</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">A. Lakshminarayan</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%">Diagonal unitary entangling gates and contradiagonal quantum states</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">90</style></VOLUME><PAGES><style face="normal" font="default" size="100%">032303</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Nonlocal properties of an ensemble of diagonal random unitary matrices of order N2 are investigated. The average Schmidt strength of such a bipartite diagonal quantum gate is shown to scale as logN, in contrast to the logN2 behavior characteristic to random unitary gates. Entangling power of a diagonal gate U is related to the von Neumann entropy of an auxiliary quantum state ρ=AA†/N2, where the square matrix A is obtained by reshaping the vector of diagonal elements of U of length N2 into a square matrix of order N. This fact provides a motivation to study the ensemble of non-hermitian unimodular matrices A, with all entries of the same modulus and random phases and the ensemble of quantum states ρ, such that all their diagonal entries are equal to 1/N. Such a state is contradiagonal with respect to the computational basis, in sense that among all unitary equivalent states it maximizes the entropy copied to the environment due to the coarse graining process. The first four moments of the squared singular values of the unimodular ensemble are derived, based on which we conjecture a connection to a recently studied combinatorial object called the&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1407.1169 doi:10.1103/PhysRevA.90.032303</style></NOTES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1103/PhysRevA.90.032303</style></URL><title><style face="normal" font="default" size="100%">Diagonal unitary entangling gates and contradiagonal quantum states</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Local controllability of quantum systems</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">12</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">459–466</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">We give a criterion that is sufficient for controllability of multipartite quantum systems. We generalize the graph infection criterion to the quantum systems that cannot be described with the use of a graph theory. We introduce the notation of hypergraphs and reformulate the infection property in this setting. The introduced criterion has a topological nature and therefore it is not connected to any particular experimental realization of quantum information processing.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1203.4056</style></NOTES><title><style face="normal" font="default" size="100%">Local controllability of quantum systems</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Proof of Grabiner's theorem on non-colliding particles</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Probability and Mathematical Statistics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">25</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">1</style></NUMBER><PAGES><style face="normal" font="default" size="100%">129–132</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">A detail proof of Grabiner's theorem [1] on the exact asymptotics of the time to collision for n independent Brownian motions is given.</style></ABSTRACT><title><style face="normal" font="default" size="100%">Proof of Grabiner's theorem on non-colliding particles</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">A. Jencova</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Sedlak</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Ziman</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Exploring boundaries of quantum convex structures: Special role of unitary processes</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">92</style></VOLUME><PAGES><style face="normal" font="default" size="100%">012304</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We address the question of finding the most effective convex decompositions into boundary elements (so-called boundariness) for sets of quantum states, observables and channels. First we show that in general convex sets the boundariness essentially coincides with the question of the most distinguishable element, thus, providing an operational meaning for this concept. Unexpectedly, we discovered that for any interior point of the set of channels the optimal decomposition necessarily contains a unitary channel. In other words, for any given channel the best distinguishable one is some unitary channel. Further, we prove that boundariness is sub-multiplicative under composition of systems and explicitly evaluate its maximal value that is attained only for the most mixed elements of the considered convex structures.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1103/PhysRevA.92.012304</style></URL><title><style face="normal" font="default" size="100%">Exploring boundaries of quantum convex structures: Special role of unitary processes</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Rolski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The exact asymptotic of the collision time tail distribution for independent Brownian particles with different drifts</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2008</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Probability Theory and Related Fields</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">3-4</style></VOLUME><PAGES><style face="normal" font="default" size="100%">595–617</style></PAGES><DATE><style face="normal" font="default" size="100%">11</style></DATE><NOTES><style face="normal" font="default" size="100%">arXiv:0704.0215 IF=1.569(2008);</style></NOTES><title><style face="normal" font="default" size="100%">The exact asymptotic of the collision time tail distribution for independent Brownian particles with different drifts</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">T. Rolski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">The exact asymptotic of the time to collision</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2005</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Electronic Journal of Probability</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">10</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">40</style></NUMBER><PAGES><style face="normal" font="default" size="100%">1359–1380</style></PAGES><DATE><style face="normal" font="default" size="100%">11</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">Abstract In this note we consider the time of the collision $tau$ for $n$ independent copies of Markov processes $X^1_t,. . .,X^n_t$, each starting from $x_i$,where $x_1 t) = t^{-n(n-1)/4}(Ch(x)+o(1)),$ where $C$ is known and $h(x)$ is the Vandermonde determinant. From the proof one can see that the result also holds for $X_t$ being the Brownian motion or the Poisson process. An application to skew standard Young tableaux is given.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">IF=0.676(2006);</style></NOTES><title><style face="normal" font="default" size="100%">The exact asymptotic of the time to collision</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ł. Rudnicki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">K. Chabuda</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">M. Paraniak</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%">Certainty relations, mutual entanglement and non-displacable manifolds</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2015</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">92</style></VOLUME><PAGES><style face="normal" font="default" size="100%">032109</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;{We derive explicit bounds for the average entropy characterizing measurements of a pure quantum state of size N in L orthogonal bases. Lower bounds lead to novel entropic uncertainty relations, while upper bounds allow us to formulate universal certainty relations. For L=2 the maximal average entropy saturates at logN as there exists a mutually coherent state, but certainty relations are shown to be nontrivial for L≥3 measurements. In the case of a prime power dimension&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1103/PhysRevA.92.032109</style></URL><title><style face="normal" font="default" size="100%">Certainty relations, mutual entanglement and non-displacable manifolds</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ł. Rudnicki</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%">Majorization entropic uncertainty relations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">46</style></VOLUME><PAGES><style face="normal" font="default" size="100%">272002</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Entropic uncertainty relations in a finite dimensional Hilbert space are investigated. Making use of the majorization technique we derive explicit lower bounds for the sum of Renyi entropies describing probability distributions associated with a given pure state expanded in eigenbases of two observables. The bounds obtained are expressed in terms of the largest singular values of submatrices of the unitary rotation matrix. For a generic unitary matrix of size N = 5 the bound obtained is stronger than the one of Maassen and Uffink (MU) with probability larger than 98%, and this ratio increases with N. We show also that the bounds investigated are invariant for unitary matrices equivalent up to dephasing and permutation and derive a classical analogue of the MU uncertainty relation formulated for stochastic transition matrices.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1304.7755</style></NOTES><title><style face="normal" font="default" size="100%">Majorization entropic uncertainty relations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Wojciech Roga</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ł. Rudnicki</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%">Entropic trade-off relations for quantum operations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2013</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">87</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">3</style></NUMBER><PAGES><style face="normal" font="default" size="100%">032308</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Spectral properties of an arbitrary matrix can be characterized by the entropy of its rescaled singular values. Any quantum operation can be described by the associated dynamical matrix or by the corresponding superoperator. The entropy of the dynamical matrix describes the degree of decoherence introduced by the map, while the entropy of the superoperator characterizes the a priori knowledge of the receiver of the outcome of a quantum channel Φ. We prove that for any map acting on an N-dimensional quantum system the sum of both entropies is not smaller than lnN. For any bistochastic map this lower bound reads 2lnN. We investigate also the corresponding Rényi entropies, providing an upper bound for their sum, and analyze the entanglement of the bi-partite quantum state associated with the channel.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1206.2536 doi: 10.1103/PhysRevA.87.032308</style></NOTES><title><style face="normal" font="default" size="100%">Entropic trade-off relations for quantum operations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ł. Rudnicki</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%">Karol Życzkowski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Constructive entanglement test from triangle inequality</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">J. Phys. A: Math. Theor.</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">47</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">42</style></NUMBER><PAGES><style face="normal" font="default" size="100%">424035</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We derive a simple lower bound on the geometric measure of entanglement for mixed quantum states in the case of a general multipartite system. The main ingredient of the presented derivation is the triangle inequality applied to the root infidelity distance in the space of density matrices. The obtained bound leads to entanglement criteria with a straightforward interpretation. The proposed criteria provide an experimentally accessible, powerful entanglement test. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to '50 years of Bell's theorem'.&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1211.2306</style></NOTES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1088/1751-8113/47/42/424035</style></URL><title><style face="normal" font="default" size="100%">Constructive entanglement test from triangle inequality</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ł. Rudnicki</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%">Karol Życzkowski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Collectibility for Mixed Quantum States</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2012</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">86</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">6</style></NUMBER><PAGES><style face="normal" font="default" size="100%">062329</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">Bounds analogous to entropic uncertainty relations allow one to design practical tests to detect quantum entanglement by a collective measurement performed on several copies of the state analyzed. This approach, initially worked out for pure states only [ Phys. Rev. Lett. 107 150502 (2011)], is extended here for mixed quantum states. We define collectibility for any mixed states of a multipartite system. Deriving bounds for collectibility for positive partially transposed states of given purity provides insight into the structure of entangled quantum states. In the case of two qubits the application of complementary measurements and coincidence based detections leads to a test of entanglement of pseudopure states.</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1211.0573 doi:10.1103/PhysRevA.86.062329</style></NOTES><title><style face="normal" font="default" size="100%">Collectibility for Mixed Quantum States</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Ł. Rudnicki</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%">Strong Majorization Entropic Uncertainty Relations</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2014</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Phys. Rev. A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">89</style></VOLUME><NUMBER><style face="normal" font="default" size="100%">5</style></NUMBER><PAGES><style face="normal" font="default" size="100%">052115</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We analyze entropic uncertainty relations in a finite dimensional Hilbert space and derive several strong bounds for the sum of two entropies obtained in projective measurements with respect to any two orthogonal bases. We improve the recent bounds by Coles and Piani [ArXiv:1307.4265], which are known to be stronger than the well known result of Maassen and Uffink. Furthermore, we find a novel bound based on majorization techniques, which also happens to be stronger than the recent results involving largest singular values of submatrices of the unitary matrix connecting both bases. The firsts set of new bounds give better results for unitary matrices close to the Fourier matrix, while the second one works better in the opposite sectors. Some results derived admit generalization to arbitrary mixed states and the bounds are increased by the von Neumann entropy of the measured state&lt;/p&gt;&#13;
</style></ABSTRACT><NOTES><style face="normal" font="default" size="100%">arXiv:1402.0129</style></NOTES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1103/PhysRevA.89.052115</style></URL><title><style face="normal" font="default" size="100%">Strong Majorization Entropic Uncertainty Relations</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Łukasz Rudnicki</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%">Gauge invariant information concerning quantum channels</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">2</style></VOLUME><PAGES><style face="normal" font="default" size="100%">60</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Motivated by the gate set tomography we study quantum channels from the perspective of information which is invariant with respect to the gauge realized through similarity of matrices representing channel superoperators. We thus use the complex spectrum of the superoperator to provide necessary conditions relevant for complete positivity of qubit channels and to express various metrics such as average gate fidelity.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.22331/q-2018-04-11-60</style></URL><title><style face="normal" font="default" size="100%">Gauge invariant information concerning quantum channels</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Adam Glos</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Krawiec</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Ryszard Kukulski</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%">Vertices cannot be hidden from quantum spatial search for almost all random graphs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">17</style></VOLUME><PAGES><style face="normal" font="default" size="100%">81</style></PAGES><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/s11128-018-1844-7</style></URL><title><style face="normal" font="default" size="100%">Vertices cannot be hidden from quantum spatial search for almost all random graphs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Rudnicki</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Aleksandra Krawiec</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%">Majorization uncertainty relations for mixed quantum states</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Physics A: Mathematical and Theoretical</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">51</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">17</style></ISSUE><SECTION><style face="normal" font="default" size="100%">175306</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Majorization uncertainty relations are generalized for an arbitrary mixed quantum state &lt;span style="font-size:129%"&gt;&lt;em&gt;ρ&lt;/em&gt;&lt;/span&gt; of a finite size &lt;span style="font-size:129%"&gt;&lt;em&gt;N&lt;/em&gt;&lt;/span&gt;. In particular, a lower bound for the sum of two entropies characterizing probability distributions corresponding to measurements with respect to arbitrary two orthogonal bases is derived in terms of the spectrum of &lt;span style="font-size:129%"&gt;&lt;em&gt;ρ&lt;/em&gt;&lt;/span&gt; and the entries of a unitary matrix &lt;span style="font-size:129%"&gt;&lt;em&gt;U&lt;/em&gt;&lt;/span&gt; relating both bases. The obtained results can also be formulated for two measurements performed on a single subsystem of a bipartite system described by a pure state, and consequently expressed as uncertainty relation for the sum of conditional entropies.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1088/1751-8121/aab66c</style></URL><title><style face="normal" font="default" size="100%">Majorization uncertainty relations for mixed quantum states</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Kamil Korzekwa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Czachórski</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%">Coherifying quantum channels</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2018</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">New Journal of Physics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">20</style></VOLUME><PAGES><style face="normal" font="default" size="100%">043028</style></PAGES><DATE><style face="normal" font="default" size="100%">04/2018</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Is it always possible to explain random stochastic transitions between states of a finite-dimensional system as arising from the deterministic quantum evolution of the system? If not, then what is the minimal amount of randomness required by quantum theory to explain a given stochastic process? Here, we address this problem by studying possible coherifications of a quantum channel $\Phi$, i.e., we look for channels $\Phi^{\mathcal{C}}$ that induce the same classical transitions $T$, but are "more coherent". To quantify the coherence of a channel $\Phi$ we measure the coherence of the corresponding Jamio{\l}kowski state $J_{\Phi}$. We show that the classical transition matrix $T$ can be coherified to reversible unitary dynamics if and only if $T$ is unistochastic. Otherwise the Jamio{\l}kowski state $J_\Phi^{\mathcal{C}}$ of the optimally coherified channel is mixed, and the dynamics must necessarily be irreversible. To asses the extent to which an optimal process $\Phi^{\mathcal{C}}$ is indeterministic we find explicit bounds on the entropy and purity of $J_\Phi^{\mathcal{C}}$, and relate the latter to the unitarity of $\Phi^{\mathcal{C}}$. We also find optimal coherifications for several classes of channels, including all one-qubit channels. Finally, we provide a non-optimal coherification procedure that works for an arbitrary channel $\Phi$ and reduces its rank (the minimal number of required Kraus operators) from $d^2$ to $d$.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1088/1367-2630/aaaff3</style></URL><title><style face="normal" font="default" size="100%">Coherifying quantum channels</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Michał Oszmaniec</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Filip Maciejewski</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%">Simulating all quantum measurements using only projective measurements and postselection</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">100</style></VOLUME><PAGES><style face="normal" font="default" size="100%">012351</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;Implementation of generalized quantum measurements is often experimentally demanding, as it requires performing a projective measurement on a system of interest extended by the ancilla. We report an alternative scheme for implementing generalized measurements that uses solely: (a) classical randomness and post-processing, (b) projective measurements on a relevant quantum system and (c) postselection on non-observing certain outcomes. The method implements arbitrary quantum measurement in d dimensional system with success probability 1/d. It is optimal in the sense that for any dimensionn d there exist measurements for which the success probability cannot be higher. We apply our results to bound the relative power of projective and generalised measurements for unambiguous state discrimination. Finally, we test our scheme experimentally on IBM quantum processor. Interestingly, due to noise involved in the implementation of entangling gates, the quality with which our scheme implements generalized qubit measurements is higher than the one obtained with the standard construction using the auxiliary system.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/1807.08449v1</style></URL><title><style face="normal" font="default" size="100%">Simulating all quantum measurements using only projective measurements and postselection</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Kamil Korzekwa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Stanisław Czachórski</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%">Distinguishing classically indistinguishable states and channels</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"> Journal of Physics A: Mathematical and Theoretical</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">52</style></VOLUME><PAGES><style face="normal" font="default" size="100%">475303</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We investigate an original family of quantum distinguishability problems, where the goal is to perfectly distinguish between &lt;span style="font-size:129%"&gt;&lt;em&gt;M&lt;/em&gt;&lt;/span&gt; quantum states that become identical under a completely decohering map. Similarly, we study distinguishability of &lt;span style="font-size:129%"&gt;&lt;em&gt;M&lt;/em&gt;&lt;/span&gt; quantum channels that cannot be distinguished when one is restricted to decohered input and output states. The studied problems arise naturally in the presence of a superselection rule, allow one to quantify the amount of information that can be encoded in phase degrees of freedom (coherences), and are related to time-energy uncertainty relation. We present a collection of results on both necessary and sufficient conditions for the existence of &lt;span style="font-size:129%"&gt;&lt;em&gt;M&lt;/em&gt;&lt;/span&gt; perfectly distinguishable states (channels) that are classically indistinguishable.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/1812.09083</style></URL><title><style face="normal" font="default" size="100%">Distinguishing classically indistinguishable states and channels</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Łukasz Rudnicki</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%">Pauli semigroups and unistochastic quantum channels</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2019</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physics Letters A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">383</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">20</style></ISSUE><PAGES><style face="normal" font="default" size="100%">2376-2381</style></PAGES><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We adopt the perspective of similarity equivalence, in gate set tomography called the gauge, to analyze various properties of quantum operations belonging to a semigroup, &lt;span style="font-size:122%"&gt;&lt;span style="font-family:stixgeneral"&gt;Φ&lt;/span&gt;&lt;span style="font-family:stixgeneral"&gt;=&lt;/span&gt;&lt;em&gt;e&lt;/em&gt;&lt;em&gt;^{Lt}&lt;/em&gt;&lt;/span&gt;,and therefore given through the Lindblad operator. We first observe that the non unital part of the channel decouples from the time evolution. Focusing on unital operations we restrict our attention to the single-qubit case, showing that the semigroup embedded inside the tetrahedron of Pauli channels is bounded by the surface composed of product probability vectors and includes the identity map together with the maximally depolarizing channel. Consequently, every member of the Pauli semigroup is unitarily equivalent to a unistochastic map, describing a coupling with one-qubit environment initially in the maximally mixed state, determined by a unitary matrix of order four.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://arxiv.org/abs/1903.12448</style></URL><title><style face="normal" font="default" size="100%">Pauli semigroups and unistochastic quantum channels</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Kamil Korzekwa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Marco Tomamichel</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%">Encoding classical information into quantum resources</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Transactions on Information Theory</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">68</style></VOLUME><ISSUE><style face="normal" font="default" size="100%">7</style></ISSUE><SECTION><style face="normal" font="default" size="100%">4518 - 4530</style></SECTION><DATE><style face="normal" font="default" size="100%">03/2022 </style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We introduce and analyse the problem of encoding classical information into different resources of a quantum state. More precisely, we consider a general class of communication scenarios characterised by encoding operations that commute with a unique resource destroying map and leave free states invariant. Our motivating example is given by encoding information into coherences of a quantum system with respect to a fixed basis (with unitaries diagonal in that basis as encodings and the decoherence channel as a resource destroying map), but the generality of the framework allows us to explore applications ranging from super-dense coding to thermodynamics. For any state, we find that the number of messages that can be encoded into it using such operations in a one-shot scenario is upper-bounded in terms of the information spectrum relative entropy between the given state and its version with erased resources. Furthermore, if the resource destroying map is a twirling channel over some unitary group, we find matching one-shot lower-bounds as well. In the asymptotic setting where we encode into many copies of the resource state, our bounds yield an operational interpretation of resource monotones such as the relative entropy of coherence and its corresponding relative entropy variance.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://dx.doi.org/10.1109/TIT.2022.3157440</style></URL><title><style face="normal" font="default" size="100%">Encoding classical information into quantum resources</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Fereshte Shahbeigi</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">David Amaro-Alcalá</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Karol Życzkowski</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Log-Convex set of Lindblad semigroups acting on N -level system</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Mathematical Physics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">62</style></VOLUME><SECTION><style face="normal" font="default" size="100%">072105</style></SECTION><DATE><style face="normal" font="default" size="100%">07/2021</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1063/5.0009745</style></URL><title><style face="normal" font="default" size="100%">Log-Convex set of Lindblad semigroups acting on N -level system</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Grzegorz Rajchel-Mieldzioć</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kamil Korzekwa</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%">Algebraic and geometric structures inside the Birkhoff polytope</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Journal of Mathematical Physics</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">63</style></VOLUME><SECTION><style face="normal" font="default" size="100%">012202</style></SECTION><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;The Birkhoff polytope Bd consisting of all bistochastic matrices of order d assists researchers from many areas, including combinatorics, statistical physics and quantum information. Its subset Ud of unistochastic matrices, determined by squared moduli of unitary matrices, is of a particular importance for quantum theory as classical dynamical systems described by unistochastic transition matrices can be quantised. In order to investigate the problem of unistochasticity we introduce the set Ld of bracelet matrices that forms a subset of Bd , but a superset of Ud . We prove that for every dimension d this set contains the set of factorisable bistochastic matrices Fd and is closed under matrix multiplication by elements of Fd. Moreover, we prove that both Ld and Fd are star-shaped with respect to the flat matrix. We also analyse the set of d × d unistochastic matrices arising from circulant unitary matrices, and show that their spectra lie inside d-hypocycloids on the complex plane. Finally, applying our results to small dimensions, we fully characterise the set of circulant unistochastic matrices of order d ≤ 4, and prove that such matrices form a monoid for d = 3.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1063/5.0046581</style></URL><title><style face="normal" font="default" size="100%">Algebraic and geometric structures inside the Birkhoff polytope</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kamil Korzekwa</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Roberto Salazar</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Paweł Horodecki</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%">Dephasing superchannels</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2021</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Physical Review A</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">104</style></VOLUME><SECTION><style face="normal" font="default" size="100%">052611</style></SECTION><DATE><style face="normal" font="default" size="100%">11/2021</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We characterise a class of environmental noises that decrease coherent properties of quantum channels by introducing and analysing the properties of dephasing superchannels. These are defined as superchannels that affect only non-classical properties of a quantum channel &lt;em&gt;E&lt;/em&gt;, i.e., they leave invariant the transition probabilities induced by &lt;em&gt;E&lt;/em&gt; in the distinguished basis. We prove that such superchannels ΞC form a particular subclass of Schur-product supermaps that act on the Jamiolkowski state J(&lt;em&gt;E&lt;/em&gt;) of a channel &lt;em&gt;E&lt;/em&gt; via a Schur product, J′=J∘C. We also find physical realizations of general ΞC through a pre- and post-processing employing dephasing channels with memory, and show that memory plays a non-trivial role for quantum systems of dimension d&gt;2. Moreover, we prove that coherence generating power of a general quantum channel is a monotone under dephasing superchannels. Finally, we analyse the effect dephasing noise can have on a quantum channel &lt;em&gt;E&lt;/em&gt; by investigating the number of distinguishable channels that &lt;em&gt;E&lt;/em&gt; can be mapped to by a family of dephasing superchannels. More precisely, we upper bound this number in terms of hypothesis testing channel divergence between &lt;em&gt;E&lt;/em&gt; and its fully dephased version, and also relate it to the robustness of coherence of &lt;em&gt;E&lt;/em&gt;.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1103/PhysRevA.104.052611</style></URL><title><style face="normal" font="default" size="100%">Dephasing superchannels</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Krzysztof Domino</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Mátyás Koniorczyk</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%">Statistical quality assessment of Ising-based annealer outputs</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum Information Processing</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">21</style></VOLUME><SECTION><style face="normal" font="default" size="100%">228</style></SECTION><DATE><style face="normal" font="default" size="100%">08/2022</style></DATE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1007/s11128-022-03623-5</style></URL><title><style face="normal" font="default" size="100%">Statistical quality assessment of Ising-based annealer outputs</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Koorosh Sadri</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Fereshte Shahbeigi</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%">Accessible maps in a group of classical or quantum channels</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2022</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%"/></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">29</style></VOLUME><SECTION><style face="normal" font="default" size="100%">2250002</style></SECTION><DATE><style face="normal" font="default" size="100%">08/2022</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;We study the problem of accessibility in a set of classical and quantum channels admitting a group structure. Group properties of the set of channels, and the structure of the closure of the analyzed group &lt;em&gt;G&lt;/em&gt; plays a pivotal role in this regard. The set of all convex combinations of the group elements contains a subset of channels that are accessible by a dynamical semigroup. We demonstrate that accessible channels are determined by probability vectors of weights of a convex combination of the group elements, which depend neither on the dimension of the space on which the channels act, nor on the specific representation of the group. Investigating geometric properties of the set &lt;em&gt;A&lt;/em&gt; of accessible maps we show that this set is non-convex, but it enjoys the star-shape property with respect to the uniform mixture of all elements of the group. We demonstrate that the set &lt;em&gt;A&lt;/em&gt; covers a positive volume in the polytope of all convex combinations of the elements of the group.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.1142/S1230161222500020</style></URL><title><style face="normal" font="default" size="100%">Accessible maps in a group of classical or quantum channels</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Filip Maciejewski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Oszmaniec</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Exploring Quantum Average-Case Distances: Proofs, properties, and examples</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">IEEE Transactions on Information Theory</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><URL><style face="normal" font="default" size="100%">https://doi.org/10.1109/TIT.2023.3250100</style></URL><title><style face="normal" font="default" size="100%">Exploring Quantum Average-Case Distances: Proofs, properties, and examples</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Filip Maciejewski</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Michał Oszmaniec</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Operational Quantum Average-Case Distances</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2023</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">7</style></VOLUME><SECTION><style face="normal" font="default" size="100%">1106</style></SECTION><URL><style face="normal" font="default" size="100%">https://doi.org/10.22331/q-2023-09-11-1106</style></URL><title><style face="normal" font="default" size="100%">Operational Quantum Average-Case Distances</style></title></RECORD><RECORD><source-app name="Bibcite" version="8.x">Drupal-Bibcite</source-app><REFERENCE_TYPE>0</REFERENCE_TYPE><CONTRIBUTORS><AUTHORS><AUTHOR><style face="normal" font="default" size="100%">Hanna Wojewódka-Ściążko</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Zbigniew Puchała</style></AUTHOR><AUTHOR><style face="normal" font="default" size="100%">Kamil Korzekwa</style></AUTHOR></AUTHORS></CONTRIBUTORS><TITLES><TITLE><style face="normal" font="default" size="100%">Resource engines</style></TITLE></TITLES><KEYWORDS/><DATES/><AUTHORS><style face="normal" font="default" size="100%"/></AUTHORS><YEAR><style face="normal" font="default" size="100%">2024</style></YEAR><SECONDARY_TITLE><style face="normal" font="default" size="100%">Quantum</style></SECONDARY_TITLE><LANGUAGE><style face="normal" font="default" size="100%">eng</style></LANGUAGE><VOLUME><style face="normal" font="default" size="100%">8</style></VOLUME><SECTION><style face="normal" font="default" size="100%">1222</style></SECTION><DATE><style face="normal" font="default" size="100%">07/24</style></DATE><ABSTRACT><style face="normal" font="default" size="100%">&lt;p&gt;In this paper we aim to push the analogy between thermodynamics and quantum resource theories one step further. Previous inspirations were based on thermodynamic considerations concerning scenarios with a single heat bath, neglecting an important part of thermodynamics that studies heat engines operating between two baths at different temperatures. Here, we investigate the performance of resource engines, which replace the access to two heat baths at different temperatures with two arbitrary constraints on state transformations. The idea is to imitate the action of a two--stroke heat engine, where the system is sent to two agents (Alice and Bob) in turns, and they can transform it using their constrained sets of free operations. We raise and address several questions, including whether or not a resource engine can generate a full set of quantum operations or all possible state transformations, and how many strokes are needed for that. We also explain how the resource engine picture provides a natural way to fuse two or more resource theories, and we discuss in detail the fusion of two resource theories of thermodynamics with two different temperatures, and two resource theories of coherence with respect to two different bases.&lt;/p&gt;&#13;
</style></ABSTRACT><URL><style face="normal" font="default" size="100%">https://doi.org/10.22331/q-2024-01-10-1222</style></URL><title><style face="normal" font="default" size="100%">Resource engines</style></title></RECORD></records></xml>
