<?xml version="1.0" encoding="UTF-8"?>
<xml><records><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></records></xml>
