The following article presents recent results of controllability problem of dynamical systems in infinite and finite-dimensional spaces. Roughly speaking, we describe selected controllability problems of fractional order systems, including approximate controllability and complete controllability.
a978-3-030-14799-0 00385nas a2200145 4500000000100000000000100001008004100002100001900043700002100062700002400083700001700107700001900124700001800143245007800161 2020 d 1 aAdam Domański 1 aJoanna Domańska 1 aTadeusz Czachórski 1 aJerzy Klamka 1 aJakub Szyguła 1 aDariusz Marek 00 aDiffusion Approximation Model of TCP NewReno Congestion Control Mechanism 00389nas a2200157 4500000000100000000000100001008004100002260002100043100001900064700001900083700002100102700002400123700001800147700001700165245004900182 2020 d c23-26 March 2020 1 aJakub Szyguła 1 aAdam Domański 1 aJoanna Domańska 1 aTadeusz Czachórski 1 aDariusz Marek 1 aJerzy Klamka 00 a AQM mechanism with neuron tuning parameters 00445nas a2200169 4500000000100000000000100001008004100002100001900043700001900062700002100081700002400102700001700126700001800143245004900161856005800210490000700268 2021 d 1 aJakub Szyguła 1 aAdam Domański 1 aJoanna Domańska 1 aTadeusz Czachórski 1 aJerzy Klamka 1 aDariusz Marek 00 aThe IoT Gateway with Active Queue Management uhttps://www.amcs.uz.zgora.pl/?action=paper&paper=1598 0 v31 00776nas a2200169 4500000000100000000000100001008004100002260000800043100001700051245008300068856004500151300000900196490000600205520036300211022001400574020001800588 2020 d cnov 1 aJerzy Klamka 00 aControllability of Semilinear Systems with Multiple Variable Delays in Control uhttps://www.mdpi.com/2227-7390/8/11/1955 a1955 0 v8 3 aIn the paper semilinear, finite-dimensional, control systems with multiple time variable point delays in admissible controls are considered. Using Rothe's fixed-point theorem, sufficient controllability conditions are formulated. The results of the paper are generalization to many time variable delays in control, of the results published recently.
a2227-7390 a9780735412767 01455nas a2200145 4500000000100000000000100001008004100002260003800043100001800081700001700099700001700116245007000133520108400203022002201287 2020 d bSpringer International Publishing 1 aArtur Babiarz 1 aAdam Czornik 1 aJerzy Klamka 00 aOn Stabilizability of Discrete Time Systems with Delay in Control 3 aThe paper deals with discrete time-invariant systems with a delay in the control variable. The relations between different types of controllability and stabilizability are presented and discussed. The results are related to asymptotic null controllability, bounded feedback stabilizability and small feedback stabilizability for linear discrete-time systems with delay in control. The main tool employed is the technique of reducing the delayed equation to a delay-free equation. Thanks to this idea the criteria for bounded feedback stabilizability and small feedback stabilizability for the delayed systems are expressed in the appropriate properties of delay-free systems. Main results are analogical of this one proved in [18] for discrete time-invariant delay-free systems and to those from [14] for continuous-time systems. One of the additional result of this paper provides a criterion for controllability of discrete time system with delay in control. An important contribution of this paper is the indication of further generalizations of the obtained results.
a978-3-030-41964-6 01417nas a2200205 4500000000100000000000100001008004100002260001200043100001800055700001900073700002100092700002400113700001700137700001900154245008700173856007100260490000800331520085800339022001401197 2021 d c01/2021 1 aDariusz Marek 1 aAdam Domański 1 aJoanna Domańska 1 aTadeusz Czachórski 1 aJerzy Klamka 1 aJakub Szyguła 00 aCombined diffusion approximation - simulation model of AQM’s transient behaviour uhttp://www.sciencedirect.com/science/article/pii/S0140366420319940 0 v166 3 aThe article introduces an approach combining diffusion approximation and simulation ones. Furthermore, it describes how it can be used to evaluate active queue management (AQM) mechanisms. Based on the obtained queue distributions, the simulation part of the model decides on package losses and modifies the flow intensity sent by the transmitter. The diffusion is used to estimate queue distributions and the goal of the simulation part of the model is to represent the AQM mechanism. On the one hand, the use of the diffusion part considerably accelerates the performance of the whole model. On the other hand, the simulation increases the accuracy of the diffusion part. We apply the model to compare the performance of fractional order PIη controller used in AQM with the performance of RED, a well known active queue management mechanism.
a0140-3664 00431nas a2200169 4500000000100000000000100001008004100002260001200043100001800055700001900073700002100092700001900113700002400132700001700156245008100173490000700254 2021 d c05/2021 1 aDariusz Marek 1 aAdam Domański 1 aJoanna Domańska 1 aJakub Szyguła 1 aTadeusz Czachórski 1 aJerzy Klamka 00 aDiffusion model of a non-integer order PIγ controller with TCP/UDP streams 0 v23 01636nas a2200157 4500000000100000000000100001008004100002260001300043100001700056700002000073700001900093700002000112245007200132300001200204520126200216 2021 d bSpringer 1 aJerzy Klamka 1 aPiotr Kulczycki 1 aJózef Korbicz 1 aJanusz Kacprzyk 00 aControllability of Fractional Linear Systems with Delays in Control a307-330 3 aIn the chapter linear, fractional, continuous time, finite-dimensional, dynamical control systems with multiple variable point delays and distributed delay in admissible control described by linear ordinary differential state equations are considered. Using notations, theorems and methods taken directly from functional analysis and linear controllability theory, necessary and sufficient conditions for global relative controllability in a given finite time interval are formulated and proved. The main result of the chapter is to show, that global relative controllability of fractional linear systems with different types of delays in admissible control is equivalent to non-singularity of a suitably defined relative controllability matrix. In the proofs of the main results, methods and concepts taken from the theory of linear bounded operators in Hilbert spaces are used. Applying a relative controllability matrix for relative controllable systems steering admissible control is proposed, which steers the fractional system from a given initial complete state to the desired final relative state. Some remarks and comments on the existing controllability results for linear fractional dynamical system with delays are also presented.
00207nas a2200085 4500000000100000000000100001008004100002100001700043245006100060 2021 d 1 aJerzy Klamka 00 aControllability of Fractional Linear Systems with Delays 00596nas a2200121 4500000000100000000000100001008004100002100002100043700001700064245007800081490000700159520030800166 2021 d 1 aTadeusz Kaczorek 1 aJerzy Klamka 00 aConvex linear combination of the controllability pairs for linear systems 0 v50 3 aThe convex linear combination of the controllabil- ity pairs of linear continuous-time linear systems is defined and its pro-perties are discussed. The main result is obtained using pure algebraic methods. In the illustrative examples different cases of linear convex combinations are analyzed.
00277nas a2200109 4500000000100000000000100001008004100002260001200043100001700055245004600072856004900118 2021 d c09/2021 1 aJerzy Klamka 00 aSterowalność układów z opóźnieniami uhttps://www.impan.pl/~zakopane/49/Klamka.pdf 00511nas a2200181 4500000000100000000000100001008004100002100001800043700001900061700002100080700001900101700002400120700001700144700002000161245006400181856007700245490000700322 2022 d 1 aDariusz Marek 1 aAdam Domański 1 aJoanna Domańska 1 aJakub Szyguła 1 aTadeusz Czachórski 1 aJerzy Klamka 1 aKatarzyna Filus 00 aApproximation Models for the Evaluation of TCP/AQM Networks uhttps://journals.pan.pl/dlibra/publication/141986/edition/123961/content 0 v70 00302nas a2200121 4500000000100000000000100001008004100002100001700043700002100060245007800081490000700159022001400166 2021 d 1 aJerzy Klamka 1 aTadeusz Kaczorek 00 aConvex linear combination of the controllability pairs for linear systems 0 v50 a0324-8569 01186nas a2200145 4500000000100000000000100001008004100002100002100043700001700064700002400081245009200105856007200197490000700269520076400276 2022 d 1 aTadeusz Kaczorek 1 aJerzy Klamka 1 aAndrzej Dzieliński 00 aControllability of linear convex combination of linear discrete-time fractional systems uhttp://journals.pan.pl/Content/124861/PDF/2928_BPASTS_2022_70_5.pdf 0 v70 3 aIn this paper the controllability properties of the convex linear combination of fractional, linear, discrete-time systems are characterized and investigated. The notions of linear convex combination and controllability in the context of fractional-order systems are recalled. Then, the controllability property of such a linear combination of discrete-time, linear fractional systems is proven. Further, the reduction of an infinite problem of transition matrix derivation is reduced to a finite one, which greatly simplifies the numerical burden of the controllability issue. Examples of controllable and uncontrollable, single-input, linear systems are presented. The possibility of extension of the considerations to multi-input systems is shown.
01230nas a2200097 4500000000100000000000100001008004100002100001700043245008700060520098500147 2023 d 1 aJerzy Klamka 00 aRelative Exact Controllability of Fractional Linear Systems with Delays in Control 3 aIn the paper linear, fractional, continuous time, infinite-dimensional, stationary dynamical control systems with multiple variable point delays in admissible control described by state equations are considered. Using notations, theorems and methods taken directly from functional analysis and linear controllability theory, necessary and sufficient conditions for global relative exact controllability in a given finite time interval are formulated and proved. The main result of the paper is to show, that global relative exact controllability of fractional linear systems with different types of delays in admissible control is equivalent to invertibility of suitably defined relative exact controllability operator. In the proof of main result, methods taken from the theory of linear bounded operators in Hilbert spaces are used. Some remarks and comments on the existing controllability results for linear fractional dynamical system with delays are also presented.
00328nas a2200109 4500000000100000000000100001008004100002100002000043700002100063700001700084245011700101 2024 d 1 aKatarzyna Filus 1 aJoanna Domańska 1 aJerzy Klamka 00 aEvaluating Convolutional Neural Networks via measuring similarity of their first-layer filters and Gabor filters 00768nas a2200145 4500000000100000000000100001008004100002260001200043100002100055700001700076700002400093245008800117490001000205520040700215 2025 d c03/2025 1 aTadeusz Kaczorek 1 aJerzy Klamka 1 aAndrzej Dzieliński 00 aDescriptor continuous- and discrete-time linear systems with zero transfer matrices 0 v73(2) 3 aIn this paper, necessary and sufficient conditions for zeroing of the transfer matrices of descriptor continuous-time and discrete-time
linear systems are established. The conditions are illustrated by simple numerical examples of the descriptor continuous-time and discrete-time
linear systems. Also some remarks on the systems with delays in control are given.
01022nas a2200145 4500000000100000000000100001008004100002260000900043100002100052700001700073700002400090245011400114490000900228520063900237 2024 d c2024 1 aTadeusz Kaczorek 1 aJerzy Klamka 1 aAndrzej Dzieliński 00 aCONTROLLABILITY AND OBSERVABILITY OF THE DESCRIPTOR LINEAR SYSTEMS REDUCED TO THE STANDARD ONES BY FEEDBACKS 0 v18/1 3 a
Abstract: In this paper, a new method for the reduction of the descriptor linear systems to standards ones is presented and verified. The method uses a state and/or state derivative feedback of output and output derivative feedback in order to transform the descriptor system into a standard one. The controllability and observability properties of the original descriptor as well as transformed standard systems are proved. Simple numerical examples illustrate the theorems introduced. Key words: controllability and observability, descriptor linear systems, state feedback, state derivative feedback, standard linear system
00326nas a2200133 4500000000100000000000100001008004100002100001700043700001300060700002300073700001900096700001900115245005800134 2010 d 1 aA. Tillmanns 1 aM. Weber 1 aTomasz Błachowicz 1 aŁukasz Pawela 1 aT. Kammermeier 00 aTextile Magnets as Base for Micromagnetic Simulations 00435nas a2200169 4500000000100000000000100001008004100002100001400043700001800057700001900075700001100094700002100105700001900126700002500145245008800170490000700258 2016 d 1 aAndy Chia 1 aAnna Górecka 1 aŁukasz Pawela 1 aK. Tan 1 aPiotr Kurzyński 1 aTomasz Paterek 1 aDagomir Kaszlikowski 00 aCoherent chemical kinetics as quantum walks I: Reaction operators for radical pairs 0 v93 00470nas a2200181 4500000000100000000000100001008004100002100001800043700001700061700001900078700002200097700002200119245005200141856004600193300001200239490000800251520002900259 2015 d 1 aCharles Dunkl 1 aPiotr Gawron 1 aŁukasz Pawela 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aReal numerical shadow and generalized B-splines uhttps://doi.org/10.1016/j.laa.2015.03.029 a12–51 0 v479 3 aarXiv:1409.4941
00325nas a2200133 4500000000100000000000100001000000100002008004100003100001700044700001900061700001900080245008500099490000700184 2014 d 1 aPiotr Gawron 1 aDariusz Kurzyk 1 aŁukasz Pawela 00 aDecoherence effects in the quantum qubit flip game using Markovian approximation 0 v13 00343nas a2200133 4500000000100000000000100001000000100002008004100003100002200044700001900066700002000085245009700105490000700202 2014 d 1 aJaroslaw Miszczak 1 aŁukasz Pawela 1 aJan Sładkowski 00 aGeneral model for a entanglement-enhanced composed quantum game on a two-dimensional lattice 0 v13 00477nas a2200181 4500000000100000000000100001000000100002008004100003100002000044700001300064700001300077700001300090700001900103700001400122245013700136300001400273490000800287 2011 d 1 aP. Kościelniak 1 aJ. Mazur 1 aJ. Henek 1 aM. Kwoka 1 aŁukasz Pawela 1 aJ. Szuber 00 aXPS and AFM studies of surface chemistry and morphology of In2O3 ultrathin films deposited by rheotaxial growth and vacuum oxidation a927–931 0 v520 00289nas a2200133 4500000000100000000000100001000000100002008004100003100001900044245005700063300001400120490000700134022001400141 2011 d 1 aŁukasz Pawela 00 aControl parameters for the quantum Deutsch algorithm a193–200 0 v23 a1896-5334 00363nas a2200157 4500000000100000000000100001000000100002008004100003100001900044700001700063700002200080700002500102245005800127300001300185490000700198 2015 d 1 aŁukasz Pawela 1 aPiotr Gawron 1 aJaroslaw Miszczak 1 aPrzemysław Sadowski 00 aGeneralized open quantum walks on Apollonian networks ae0130967 0 v10 00340nas a2200145 4500000000100000000000100001008004100002100001900043700001700062700002200079700002000101245005600121300001100177490000600188 2013 d 1 aŁukasz Pawela 1 aPiotr Gawron 1 aZbigniew Puchała 1 aJan Sładkowski 00 aEnhancing pseudo-telepathy in the Magic Square game ae64694 0 v8 00298nas a2200133 4500000000100000000000100001000000100002008004100003100001900044700002000063245005900083300001400142490000800156 2013 d 1 aŁukasz Pawela 1 aJan Sładkowski 00 aQuantum Prisoner's Dilemma game on hypergraph networks a910–917 0 v392 00265nas a2200121 4500000000100000000000100001008004100002100001900043700002000062245004100082300001200123490000800135 2013 d 1 aŁukasz Pawela 1 aJan Sładkowski 00 aCooperative quantum Parrondo's games a51–57 0 v256 00768nas a2200133 4500000000100000000000100001008004100002100001900043700002200062245008000084856004600164490000700210520041700217 2016 d 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aQuantifying channels output similarity with applications to quantum control uhttps://doi.org/10.1007/s11128-015-1238-z 0 v15 3 aIn 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.
00379nas a2200145 4500000000100000000000100001000000100002008004100003100001900044700002200063245008100085856004600166300001400212490000700226 2015 d 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aQuantum control robust with respect to coupling with an external environment uhttps://doi.org/10.1007/s11128-014-0879-7 a437–446 0 v14 01256nas a2200145 4500000000100000000000100001008004100002100001900043700002200062245004600084856004600130300001400176490000700190520091300197 2014 d 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aQuantum control with spectral constraints uhttps://doi.org/10.1007/s11128-013-0644-3 a227–237 0 v13 3 aVarious 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.
00316nas a2200121 4500000000100000000000100001008004100002100001900043700002500062245008600087490000700173022001400180 2016 d 1 aŁukasz Pawela 1 aPrzemysław Sadowski 00 aVarious methods of optimizing control pulses for quantum systems with decoherence 0 v15 a1310.2109 01220nas a2200145 4500000000100000000000100001008004100002100002200043700001900065700002200084245004900106856004700155490000700202520086500209 2016 d 1 aZbigniew Puchała 1 aŁukasz Pawela 1 aKarol Życzkowski 00 aDistinguishability of generic quantum states uhttps://doi.org/10.1103/PhysRevA.93.062112 0 v93 3 aProperties 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 =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.
00279nas a2200109 4500000000100000000000100001008004100002100002500043700001900068245007500087490000700162 2016 d 1 aPrzemysław Sadowski 1 aŁukasz Pawela 00 aCentral limit theorem for reducible and irreducible open quantum walks 0 v15 00414nas a2200169 4500000000100000000000100001000000100002008004100003100002300044700001900067700001700086700001900103700001900122245008400141300001100225490000800236 2010 d 1 aTomasz Błachowicz 1 aAndrea Ehrmann 1 aA. Tillmanns 1 aP. Stebliński 1 aŁukasz Pawela 00 aMagnetization reversal in magnetic half-balls influenced by shape perturbations a123906 0 v108 00441nas a2200181 4500000000100000000000100001000000100002008004100003100002300044700001700067700002200084700001900106700002200125245007900147300001200226490000700238022001400245 2013 d 1 aRyszard Winiarczyk 1 aPiotr Gawron 1 aJaroslaw Miszczak 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aAnalysis of patent activity in the field of quantum information processing a1350007 0 v11 a0219-7499 00296nas a2200133 4500000000100000000000100001008004100002100001700043700001900060245004200079300000900121490000700130022002500137 2016 d 1 aPiotr Gawron 1 aŁukasz Pawela 00 aRelativistic Quantum Pseudo-telepathy a1147 0 v47 a0587-4254, 1509-5770 00390nas a2200157 4500000000100000000000100001008004100002100001700043700001900060700002200079700002000101700002200121245006800143300001400211490000700225 2015 d 1 aPiotr Gawron 1 aŁukasz Pawela 1 aZbigniew Puchała 1 aJacek Szklarski 1 aKarol Życzkowski 00 aWybory samorządowe 2014 w poszukiwaniu anomalii statystycznych a534–545 0 v30 00240nas a2200109 4500000000100000000000100001008004100002100001900043245004600062300001400108490000800122 2016 d 1 aŁukasz Pawela 00 aQuantum games on evolving random networks a179–188 0 v458 01373nas a2200169 4500000000100000000000100001008004100002100001600043700002200059700001900081700002200100245004800122856003800170300001100208490000700219520097700226 2018 d 1 aIon Nechita 1 aZbigniew Puchała 1 aŁukasz Pawela 1 aKarol Życzkowski 00 aAlmost all quantum channels are equidistant uhttps://doi.org/10.1063/1.5019322 a052201 0 v59 3 aIn 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 1/2+2/π. Furthermore, we show that for a random state ρ 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 ρ may be interpreted as a Jamio{\l}kowski state of a unital map.
00430nas a2200157 4500000000100000000000100001008004100002100002100043700001400064700002400078700001900102700002500121245008000146856003900226490000700265 2018 d 1 aKrzysztof Domino 1 aAdam Glos 1 aMateusz Ostaszewski 1 aŁukasz Pawela 1 aPrzemysław Sadowski 00 aProperties of quantum stochastic walks from the asymptotic scaling exponent uhttps://doi.org/10.26421/QIC18.3-4 0 v18 01097nas a2200157 4500000000100000000000100001008004100002100002100043700001700064700001900081245005900100856005400159300001000213490000700223520070900230 2018 d 1 aKrzysztof Domino 1 aPiotr Gawron 1 aŁukasz Pawela 00 aEfficient computation of higher order cumulant tensors uhttps://epubs.siam.org/doi/abs/10.1137/17M1149365 aA1610 0 v40 3 aIn this paper, we introduce a novel algorithm for calculating arbitrary order
cumulants of multidimensional data. Since the d'th order
cumulant can be presented in the form of an d-dimensional tensor, the
algorithm is presented using tensor operations. The algorithm provided in the
paper takes advantage of super-symmetry of cumulant and moment tensors.
We show that the proposed algorithm considerably reduces the computational
complexity and the computational memory requirement of cumulant calculation as
compared with existing algorithms. For the sizes of interest, the
reduction is of the order of d! compared to the naive algorithm.
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.
00913nas a2200157 4500000000100000000000100001008004100002100001900043700001900062700002200081245007400103856004600177300000800223490000700231520051700238 2018 d 1 aDariusz Kurzyk 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aUnconditional Security of a K-State Quantum Key Distribution Protocol uhttps://doi.org/10.1007/s11128-018-1998-3 a228 0 v17 3 aQuantum 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.
01717nas a2200157 4500000000100000000000100001008004100002100002200043700001900065700002300084700002100107245007800128856003700206490000700243520130900250 2018 d 1 aZbigniew Puchała 1 aŁukasz Pawela 1 aAleksandra Krawiec 1 aRyszard Kukulski 00 aStrategies for optimal single-shot discrimination of quantum measurements uhttps://arxiv.org/abs/1804.05856 0 v98 3 aIn 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.
00412nas a2200145 4500000000100000000000100001008004100002260001200043100001700055700001900072700001900091245010000110856004900210490000700259 2018 d c12/2018 1 aPiotr Gawron 1 aDariusz Kurzyk 1 aŁukasz Pawela 00 aQuantumInformation.jl—a Julia package for numerical computation in quantum information theory uhttps://doi.org/10.1371/journal.pone.0209358 0 v13 00327nas a2200145 4500000000100000000000100001008004100002260000900043100002500052700001900077700002400096700002100120245003300141490000700174 2019 d c2019 1 aPrzemysław Sadowski 1 aŁukasz Pawela 1 aPaulina Lewandowska 1 aRyszard Kukulski 00 aQuantum walks on hypergraphs 0 v58 01498nas a2200169 4500000000100000000000100001008004100002100002200043700001900065700002300084700002100107700002200128245007700150856006100227490000600288520103400294 2021 d 1 aZbigniew Puchała 1 aŁukasz Pawela 1 aAleksandra Krawiec 1 aRyszard Kukulski 1 aMichał Oszmaniec 00 aMultiple-shot and unambiguous discrimination of von Neumann measurements uhttps://quantum-journal.org/papers/q-2021-04-06-425/pdf/ 0 v5 3 aWe 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.
00842nas a2200133 4500000000100000000000100001008004100002100002100043700002400064700001900088245006000107856003700167520050400204 2020 d 1 aRyszard Kukulski 1 aPaulina Lewandowska 1 aŁukasz Pawela 00 aPerturbation of the numerical range of unitary matrices uhttps://arxiv.org/abs/2002.05553 3 aIn 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
a method which allows us to find a unitary matrix whose numerical range contains the origin where at the same time the distance between
unitary matrix and its perturbation is relative small in given metric.
00694nas a2200133 4500000000100000000000100001008004100002100002400043700002100067700001900088245004700107856003700154520036900191 2020 d 1 aPaulina Lewandowska 1 aRyszard Kukulski 1 aŁukasz Pawela 00 aOptimal representation of quantum channels uhttps://arxiv.org/abs/2002.05507 3 a
This work shows an approach to reduce the dimensionality of matrix representations of quantum channels. It is achieved by finding a
base of the cone of positive semidefinite matrices which represent quantum channels. Next, this is implemented in the Julia programming
language as a part of the QuantumInformation.jl package.
00286nas a2200121 4500000000100000000000100001008004100002100002300043700001900066700002200085245005000107490000700157 2020 d 1 aAleksandra Krawiec 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aDiscrimination of POVMs with rank-one effects 0 v19 00397nas a2200145 4500000000100000000000100001008004100002100001400043700002300057700001900080245006200099856006200161490000700223022002100230 2021 d 1 aAdam Glos 1 aAleksandra Krawiec 1 aŁukasz Pawela 00 aAsymptotic entropy of the Gibbs state of complex networks uhttps://www.nature.com/articles/s41598-020-78626-2#citeas 0 v11 aarXiv:2003.08411 01326nas a2200157 4500000000100000000000100001008004100002100002400043700002300067700002100090700001900111700002200130245006100152490000700213520094800220 2021 d 1 aPaulina Lewandowska 1 aAleksandra Krawiec 1 aRyszard Kukulski 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aOn the optimal certification of von Neumann measurements 0 v11 3 a
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 q-numerical range.
00409nas a2200169 4500000000100000000000100001008004100002260001200043100002100055700001600076700001900092700002200111700002200133245003900155856003800194490000700232 2021 d c07/2021 1 aRyszard Kukulski 1 aIon Nechita 1 aŁukasz Pawela 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aGenerating random quantum channels uhttps://doi.org/10.1063/5.0038838 0 v62 00403nas a2200145 4500000000100000000000100001008004100002260001200043100002300055700001900078700002200097245007200119856005900191490000700250 2021 d c11/2021 1 aAleksandra Krawiec 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aExcluding false negative error in certification of quantum channels uhttps://www.nature.com/articles/s41598-021-00444-x.pdf 0 v11 00275nas a2200121 4500000000100000000000100001008004100002100001900043700001900062700002200081245004300103490000700146 2021 d 1 aDariusz Kurzyk 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aRelating entropies of quantum channels 0 v23 00479nas a2200157 4500000000100000000000100001008004100002260001200043100002600055700001900081700002200100700002200122700002300144245008700167856006700254 2022 d c07/2022 1 aTomasz Śmierzchalski 1 aŁukasz Pawela 1 aZbigniew Puchała 1 aTomasz Trzciński 1 aBartłomiej Gardas 00 aPost-Error Correction for Quantum Annealing Processor using Reinforcement Learning uhttps://link.springer.com/chapter/10.1007/978-3-031-08760-8_22 00398nas a2200157 4500000000100000000000100001008004100002260001200043100002400055700002100079700001900100700002200119245005400141856003700195490000800232 2022 d c10/2022 1 aPaulina Lewandowska 1 aRyszard Kukulski 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aStorage and retrieval of von Neumann measurements uhttps://arxiv.org/abs/2204.03029 0 v106 00383nas a2200157 4500000000100000000000100001008004100002260001200043100002100055700001900076700002200095245005000117856003700167490000700204022001400211 2023 d c07/2023 1 aRyszard Kukulski 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aOn the probabilistic quantum error correction uhttps://arxiv.org/abs/2206.05232 0 v69 a1557-9654 00354nas a2200121 4500000000100000000000100001008004100002100002300043700001900066245006800085856007200153490000700225 2023 d 1 aKonrad Jałowiecki 1 aŁukasz Pawela 00 aOmnisolver: an extensible interface to Ising spin glass solvers uhttps://www.softxjournal.com/article/S2352-7110(23)00255-8/fulltext 0 v24 00386nas a2200145 4500000000100000000000100001008004100002260001200043100002400055700001900079700002200098245006600120856004700186490000700233 2023 d c02/2023 1 aPaulina Lewandowska 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aStrategies for single-shot discrimination of process matrices uhttps://doi.org/10.1038/s41598-023-30191-0 0 v13 01543nas a2200169 4500000000100000000000100001008004100002260001200043100002300055700001900078700002200097245006900119856004700188490000600235520111800241022001401359 2024 d c02/2024 1 aAleksandra Krawiec 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aDiscrimination and certification of unknown quantum measurements uhttps://doi.org/10.22331/q-2024-02-29-1269 0 v8 3 aWe study the discrimination of von Neumann measurement in the scenario when we are given a reference measurement and some other measurement. The aim of the discrimination is to determine whether the other measurement is the same as the first one. We consider the cases when the reference measurement is given without the classical description and when its classical description is known. Both cases are studied in the symmetric and asymmetric discrimination setups. Moreover, we provide optimal certification schemes enabling us to certify a known quantum measurement against the unknown one.
a2521-327X 00364nas a2200133 4500000000100000000000100001008004100002100002300043700002400066700001900090245007700109856003700186490000700223 2023 d 1 aKonrad Jałowiecki 1 aPaulina Lewandowska 1 aŁukasz Pawela 00 aPyQBench: a Python library for benchmarking gate-based quantum computers uhttps://arxiv.org/abs/2304.00045 0 v24 00304nas a2200121 4500000000100000000000100001008004100002260001200043100001900055700002300074245007800097490000700175 2026 d c03/2026 1 aŁukasz Pawela 1 aKarol Życzkowski 00 aMatrix logistic map: fractal spectral distributions and transfer of chaos 0 v36 00391nas a2200157 4500000000100000000000100001008004100002100002300043700002200066700002100088700001900109700001900128245004300147856003700190490000600227 2024 d 1 aFereshte Shahbeigi 1 aChristopher Chubb 1 aRyszard Kukulski 1 aŁukasz Pawela 1 aKamil Korzekwa 00 aQuantum-embeddable stochastic matrices uhttps://arxiv.org/abs/2305.17163 0 v8 02064nas a2200229 4500000000100000000000100001008004100002260001200043100002600055700002100081700001900102700001900121700002200140700002400162700002300186700002200209700002100231245008200252856002600334490000700360520146700367 2024 d c09/2014 1 aTomasz Śmierzchalski 1 aJakub Pawłowski 1 aArtur Przybysz 1 aŁukasz Pawela 1 aZbigniew Puchała 1 aMátyás Koniorczyk 1 aBartłomiej Gardas 1 aSebastian Deffner 1 aKrzysztof Domino 00 aHybrid quantum-classical computation for automatic guided vehicles scheduling uhttps://rdcu.be/dUkwi 0 v14 3 aMotivated 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.
00633nas a2200229 4500000000100000000000100001008004100002100002300043700002300066700002500089700002200114700002300136700001900159700001800178700002400196700001700220700002500237700002200262700002100284700002200305245007600327 2023 d 1 aBartłomiej Gardas 1 aPrzemysław Głomb 1 aPrzemysław Sadowski 1 aZbigniew Puchała 1 aKonrad Jałowiecki 1 aŁukasz Pawela 1 aOrphee Faucoz 1 aPierre-Marie Brunet 1 aPiotr Gawron 1 aMatthijs Van Waveren 1 aMickaël Savinaud 1 aGuillaume Pasero 1 aVeronique Defonte 00 aHyper-Spectral Image Classification Using Adiabatic Quantum Computation 00544nas a2200193 4500000000100000000000100001008004100002100002500043700002200068700002100090700002200111700002400133700001800157700001700175700002300192700002200215700001900237245009400256 2023 d 1 aMatthijs Van Waveren 1 aMickaël Savinaud 1 aGuillaume Pasero 1 aVeronique Defonte 1 aPierre-Marie Brunet 1 aOrphee Faucoz 1 aPiotr Gawron 1 aBartłomiej Gardas 1 aZbigniew Puchała 1 aŁukasz Pawela 00 aComparison of Quantum Neural Network Algorithms For Earth Observation Data Classification 00379nas a2200157 4500000000100000000000100001008004100002100002100043700002200064700001800086700001900104700002300123700002200146245004600168490000700214 2024 d 1 aRyszard Kukulski 1 aMateusz Stępniak 1 aKamil Hendzel 1 aŁukasz Pawela 1 aBartłomiej Gardas 1 aZbigniew Puchała 00 aLocal certification of unitary operations 0 v14 00605nas a2200217 4500000000100000000000100001008004100002100001700043700002500060700002300085700002300108700002500131700002000156700002100176700002200197700002400219700001800243700002200261700001900283245008500302 2024 d 1 aPiotr Gawron 1 aPrzemysław Sadowski 1 aPrzemysław Głomb 1 aBartłomiej Gardas 1 aMatthijs Van Waveren 1 aClément Forray 1 aGuillaume Pasero 1 aMickaël Savinaud 1 aPierre-Marie Brunet 1 aOrphee Faucoz 1 aZbigniew Puchała 1 aŁukasz Pawela 00 aWhat Could be Achieved with a Million Qubits Quantum Annealer in Remote Sensing? 00694nas a2200145 4500000000100000000000100001008004100002100002200043700001900065700002200084245007100106856005500177520030200232022001400534 2026 d 1 aMarcin Markiewicz 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aSingle-shot comparison of random quantum channels and measurements uhttps://www.nature.com/articles/s41598-026-70695-z 3 aIn 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.
a2045-2322 00416nas a2200169 4500000000100000000000100001008004100002100002100043700001800064700002000082700001900102700001900121700001800140700001900158700002300177245004600200 2025 d 1 aJakub Pawłowski 1 aJan Tuziemski 1 aPaweł Tarasiuk 1 aArtur Przybysz 1 aRobert Adamski 1 aKamil Hendzel 1 aŁukasz Pawela 1 aBartłomiej Gardas 00 a VeloxQ: A Fast and Efficient QUBO Solver 01940nas a2200157 4500000000100000000000100001008004100002100002400043700002400067700002300091700002000114700001900134245006100153856006700214520150100281 2025 d 1 aPrzemysław Sekuła 1 aMichał Romaszewski 1 aPrzemysław Głomb 1 aMichał Cholewa 1 aŁukasz Pawela 00 aQuantum-aware Transformer model for state classification uhttps://link.springer.com/chapter/10.1007/978-3-031-97570-7_15 3 aEntanglement 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.
01509nas a2200145 4500000000100000000000100001008004100002260003800043100002200081700002100103700001900124245005000143520114900193022002101342 2025 d c05/2025 aUnited States of America 1 aZbigniew Puchała 1 aRyszard Kukulski 1 aŁukasz Pawela 00 aQuantum Probabilistic Error Correction Method 3 aA 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.
aUS 12,299,539 B2 01466nas a2200205 4500000000100000000000100001008004100002100002600043700001800069700002300087700002100110700001900131700002300150700001500173245010500188856007200293490000700365520087400372022001401246 2025 d 1 aTomasz Śmierzchalski 1 aAnna Dziubyna 1 aKonrad Jałowiecki 1 aZakaria Mzaouali 1 aŁukasz Pawela 1 aBartłomiej Gardas 1 aMarek Rams 00 aSpinGlassPEPS.jl: Tensor-network package for Ising-like optimization on quasi-two-dimensional graphs uhttps://www.sciencedirect.com/science/article/pii/S2352711025002249 0 v31 3 aThis 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.
a2352-7110 00466nas a2200169 4500000000100000000000100001008004100002260001600043100002000059700001900079700001800098700001900116700002300135245006500158856006600223490000700289 2026 d c 08/07/2026 1 aJakub Pawlowski 1 aPawel Tarasiuk 1 aJan Tuziemski 1 aŁukasz Pawela 1 aBartłomiej Gardas 00 aToward quantum scaling advantage in approximate optimization uhttps://journals.aps.org/prapplied/abstract/10.1103/qcws-8kgm 0 v26 00444nas a2200169 4500000000100000000000100001008004100002260001500043100001800058700002100076700002000097700001900117700002300136245004100159856006600200490000800266 2026 d c29/04/2026 1 aJan Tuziemski 1 aJakub Pawłowski 1 aPaweł Tarasiuk 1 aŁukasz Pawela 1 aBartłomiej Gardas 00 aLimits of quantum run-time advantage uhttps://journals.aps.org/prapplied/abstract/10.1103/gpsf-pn1x 0 v 25 00359nas a2200133 4500000000100000008004100001100002000042700002000062700001800082700001900100700002300119245004400142856003900186 2026 d 1 aJakub Pawlowski 1 aPaweł Tarasiuk 1 aJan Tuziemski 1 aŁukasz Pawela 1 aBartłomiej Gardas 00 aSimulated Bifurcation Quantum Annealing uhttps://arxiv.org/abs/2604.01050v1 01633nas a2200169 4500000000100000008004100001260001500042100001600057700002100073700002400094700001900118700002200137245012200159856003700281300000700318520113800325 2026 d c07/10/2026 1 aAdam Bílek 1 aRyszard Kukulski 1 aPaulina Lewandowska 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aNoise Resilience of Quantum Key Distribution Protocols Secured Against Independent Attacks With One-Way Communication uhttps://arxiv.org/abs/2607.11857 a19 3 aWe 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. 01652nas a2200157 4500000000100000008004100001260001500042100002600057700001900083700002200102700002200124245007000146856003700216300000700253520123400260 2026 d c05/29/2026 1 aLudmiła Marcinkowska 1 aŁukasz Pawela 1 aMarcin Markiewicz 1 aZbigniew Puchała 00 aAsymptotic distinguishability of Haar-averaged measurement models uhttps://arxiv.org/abs/2605.31168 a49 3 aWe 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. 01790nas a2200133 4500000000100000008004100001260001200042653010900054100001900163700002200182245008500204856003700289520133000326 2026 d c06/2026 10 aSymbolic integration; Haar measure; Weingarten calculus; Julia programming language; quantum information 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aIntegrateUnitary.jl: A Julia package for symbolic integration over Haar measures uhttps://arxiv.org/abs/2605.23830 3 aSymbolic 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 > 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. 01981nas a2200121 4500000000100000008004100001260001500042100001900057245004900076856003700125300000700162520169000169 2026 d c01/02/2026 1 aŁukasz Pawela 00 aParrondo paradox in quantum image encryption uhttps://arxiv.org/abs/2508.16382 a10 3 aWe 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. 01493nas a2200133 4500000000100000008004100001260001500042100002100057700001900078700002000097245007100117856003700188520113400225 2026 d c09/03/2026 1 aLeonard Sikorski 1 aŁukasz Pawela 1 aKarol Horodecki 00 aLimitations on quantum key repeaters for all key correlated states uhttps://arxiv.org/abs/2206.00993 3 aQuantum 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. 02013nas a2200157 4500000000100000008004100001260001500042100002200057700001900079700002200098245009800120856003700218300000700255520155200262022004101814 2026 d c25/02/2026 1 aMarcin Markiewicz 1 aŁukasz Pawela 1 aZbigniew Puchała 00 aChoi-level twirling of quantum channels: finite constructions and non-compact transformations uhttps://arxiv.org/abs/2512.23586 a15 3 aTwirling, 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 π in(U) = U ⊗tin and π out(U) = U ⊗tout , 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 ⊗(tin+tout) , 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 = tin + tout.
a1751-8121 (online), 1751-8113 (druk) 00517nas a2200145 4500000000100000008004100001100002300042700002100065700002300086700001900109245015000128856007200278490000700350022001400357 2026 d 1 aKonrad Jałowiecki 1 aJakub Pawłowski 1 aBartłomiej Gardas 1 aŁukasz Pawela 00 aOmnisolver: An extensible interface to Ising spin–glass and QUBO solvers – a numerically stabilized, distributed GPU exhaustive-search plugin uhttps://www.sciencedirect.com/science/article/pii/S2352711026005224 0 v36 a2352-7110 00420nas a2200121 4500000000100000008004100001100001900042700002300061245012100084856007200205490000700277022001400284 2026 d 1 aŁukasz Pawela 1 aBartłomiej Gardas 00 aVersion 2.0.1 - SpinGlassPEPS.jl: Tensor-network package for Ising-like optimization on quasi-two-dimensional graphs uhttps://www.sciencedirect.com/science/article/pii/S2352711026005182 0 v36 a2352-7110 01165nas a2200169 4500000000100000000000100001008004100002100002200043700002200065700001900087700002300106700002200129245005700151856004700208490000700255520073300262 2017 d 1 aMarcin Markiewicz 1 aZbigniew Puchała 1 aAnna de Rosier 1 aWiesław Laskowski 1 aKarol Życzkowski 00 aQuantum noise generated by local random Hamiltonians uhttps://doi.org/10.1103/PhysRevA.95.032333 0 v95 3 aWe investigate the impact of a local random unitary noise on multipartite quantum states of arbitrary dimension. We follow the dynamical approach, in which the single-particle unitaries are generated by local random Hamiltonians. Assuming short evolution time we derive an upper bound on the fidelity between an initial and the final state transformed by this type of noise. This result is based on averaging the Tamm-Mandelstam bound and holds for a wide class of distributions of random Hamiltonians fulfilling specific symmetry conditions. It is showed that the sensitivity of a given pure quantum state to the discussed type of noise depends only on the properties of a single-particle and bipartite reduced states.
01254nas a2200193 4500000000100000000000100001008004100002100002200043700002400065700002200089700001900111700001700130700002200147245009300169856004700262300001100309490000700320520073300327 2018 d 1 aMarcin Markiewicz 1 aAdrian Kolodziejski 1 aZbigniew Puchała 1 aAdam Rutkowski 1 aTomasz Tylec 1 aWieslaw Laskowski 00 aUnified approach to geometric and positive-map-based non-linear entanglement identifiers uhttps://doi.org/10.1103/PhysRevA.97.042339 a042339 0 v97 3 aDetecting quantumness of correlations (especially entanglement) is a very hard task even in the simplest case, i.e., two-partite quantum systems. Here we provide an analysis of whether there exists a relation between two of the most popular types of entanglement identifiers: the first one based on positive maps and not directly applicable in the laboratory and the second one a geometric entanglement identifier which is based on specific Hermiticity-preserving maps. We show a profound relation between those two types of entanglement criteria. Hereunder we have proposed a general framework of nonlinear functional entanglement identifiers which allows us to construct experimentally friendly entanglement criteria.
00282nas a2200121 4500000000100000000000100001008004100002260001200043100002000055700002200075245005600097490000700153 2025 d c11/2025 1 aPaweł Błasiak 1 aMarcin Markiewicz 00 aIdentical particles as a genuine non-local resource 0 v11 00332nas a2200133 4500000000100000000000100001008004100002260001200043100001700055700002200072700002000094245007700114490000700191 2024 d c07/2024 1 aJay Lawrence 1 aMarcin Markiewicz 1 aMarek Żukowski 00 aComment on Aurélien Drezet’s Defense of Relational Quantum Mechanics. 0 v54 00299nas a2200109 4500000000100000000000100001008004100002260001200043100002000055700002200075245009200097 d c09/2024 1 aMarek Żukowski 1 aMarcin Markiewicz 00 aAgainst (unitary) interpretation (of quantum mechanics): removing the metaphysical load 00921nas a2200109 4500000000100000000000100001008004100002100002200043700002400065245005500089520066700144 d 1 aMarcin Markiewicz 1 aKonrad Schlichtholz 00 aUnitary operator bases as universal averaging sets 3 aWe provide a generalization of the idea of unitary designs to cover finite averaging over much more general operations on quantum states. Namely, we construct finite averaging sets for averaging quantum states over arbitrary reductive Lie groups, on condition that the averaging is performed uniformly over the compact component of the group. Our construction comprises probabilistic mixtures of unitary 1-designs on specific operator subspaces. Provided construction is very general, competitive in the size of the averaging set when compared to other known constructions, and can be efficiently implemented in the quantum circuit model of computation.
02162nas a2200145 4500000000100000000000100001008004100002260001200043100001700055700002200072700002000094245007800114490000700192520181700199 2025 d c03/2025 1 aJay Lawrence 1 aMarcin Markiewicz 1 aMarek Żukowski 00 aRelational quantum mechanics is still incompatible with quantum mechanics 0 v15 3 aWe showed in a recent article (Lawrence et al. 2023. Quantum, 7, 1015), that relative facts (outcomes), a central concept in Relational Quantum Mechanics, are inconsistent with Quantum Mechanics. We proved this by constructing a Wigner-Friend type sequential measurement scenario on a Greenberger-Horne-Zeilinger (GHZ) state of three qubits, and making the following assumption: “if an interpretation of quantum theory introduces some conceptualization of outcomes of a measurement, then probabilities of these outcomes must follow the quantum predictions as given by the Born rule.” Our work has been criticized by Cavalcanti et al. (2023. European Journal for Philosophy of Science, 13(4),55). In this note we show that their critique, based on their own reformulation of our argument, does not apply to our paper. It also raises questions of principle which are not answered within the framework of Relational Quantum Mechanics.
01167nas a2200205 4500000000100000000000100001000000100002008004100003100001800044700001700062700001800079700002200097700002200119700002200141245005200163300001100215490000700226520071400233022001400947 2011 d 1 aCharles Dunkl 1 aPiotr Gawron 1 aJ.A. Holbrook 1 aJaroslaw Miszczak 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aNumerical shadow and geometry of quantum states a335301 0 v44 3 aThe totality of normalised density matrices of order N forms a convex set Q\_N in R^(N^2-1). Working with the flat geometry induced by the Hilbert-Schmidt distance we consider images of orthogonal projections of Q\_N onto a two-plane and show that they are similar to the numerical ranges of matrices of order N. For a matrix A of a order N one defines its numerical shadow as a probability distribution supported on its numerical range W(A), induced by the unitarily invariant Fubini-Study measure on the complex projective manifold CP^(N-1). We define generalized, mixed-states shadows of A and demonstrate their usefulness to analyse the structure of the set of quantum states and unitary dynamics therein. a1751-8113 00938nas a2200205 4500000000100000000000100001008004100002260003400043100001700077700002300094700002200117700002200139700002400161700002500185700002200210245005500232300001200287520041100299020002200710 2011 d bSpringer aBerlin / Heidelberg 1 aPiotr Gawron 1 aPrzemysław Głomb 1 aJaroslaw Miszczak 1 aZbigniew Puchała 1 aTadeusz Czachórski 1 aStanisław Kozielski 1 aUrszula Stańczyk 00 aEigengestures for natural human computer interface a49–56 3 aWe present the application of Principal Component Analysis for data acquired during the design of a natural gesture interface. We investigate the concept of an eigengesture for motion capture hand gesture data and present the visualisation of principal components obtained in the course of conducted experiments. We also show the influence of dimensionality reduction on reconstructed gesture data quality. a978-3-642-23168-1 00303nas a2200133 4500000000100000000000100001008004100002260000900043100001700052700002200069700002000091700002200111245003600133 2005 d bWKŁ 1 aPiotr Gawron 1 aJaroslaw Miszczak 1 aAndrzej Grzywak 1 aAndrzej Kwiecień 00 aWysokowydajne sieci komputerowe 00272nas a2200121 4500000000100000000000100001000000100002008004100003100001700044700002200061245006100083490000600144 2005 d 1 aPiotr Gawron 1 aJaroslaw Miszczak 00 aNumerical simulations of mixed state quantum computation 0 v3 00548nas a2200145 4500000000100000000000100001000000100002008004100003100001700044700002200061245004700083300001600130490000600146520025000152 2005 d 1 aPiotr Gawron 1 aJaroslaw Miszczak 00 aQuantum Implementation of Parrondo Paradox aL471–L478 0 v5 3 aWe propose a quantum implementation of a capital-dependent Parrondo's paradox that uses O(log2(n)) qubits, where n is the number of Parrondo games. We present its implementation in the quantum computer language (QCL) and show simulation results. 00338nas a2200157 4500000000100000000000100001000000100002008004100003100001700044700002200061700002000083245004800103300000800151490000700159022001400166 2008 d 1 aPiotr Gawron 1 aJaroslaw Miszczak 1 aJan Sładkowski 00 aNoise Effects in Quantum Magic Squares Game a667 0 v06 a0219-7499 00444nas a2200181 4500000000100000000000100001000000100002008004100003100001700044700002200061700002200083700001800105700002200123245008600145300001100231490000700242022001300249 2010 d 1 aPiotr Gawron 1 aZbigniew Puchała 1 aJaroslaw Miszczak 1 aŁ. Skowronek 1 aKarol Życzkowski 00 aRestricted numerical range: A versatile tool in the theory of quantum information a102204 0 v51 a00222488 00270nas a2200121 4500000000100000000000100001008004100002100002100043700002200064245004000086300001400126490000800140 2014 d 1 aMichael Gettrick 1 aJaroslaw Miszczak 00 aQuantum walks with memory on cycles a163–170 0 v399 00796nas a2200169 4500000000100000000000100001000000100002008004100003260000600044100001300050700002200063700001300085245005100098300001500149490000700164520045500171 2007 d c9 1 aJ. Kosik 1 aJaroslaw Miszczak 1 aV. Buzek 00 aQuantum Parrondo's game with random strategies a2275–228 0 v54 3 aWe present a quantum implementation of Parrondo's game with randomly switched strategies using (1) a quantum walk as a source of 'randomness' and (2) a completely positive (CP) map as a randomized evolution. The game exhibits the same paradox as in the classical setting where a combination of two losing strategies might result in a winning strategy. We show that the CP-map scheme leads to significantly lower net gain than the quantum-walk scheme. 01214nas a2200181 4500000000100000000000100001000000100002008004100003100001500044700002200059700002200081700002200103245005500125300001100180490000700191520082000198022001401018 2008 d 1 aD. Markham 1 aJaroslaw Miszczak 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aQuantum state discrimination: A geometric approach a042111 0 v77 3 aWe analyze the problem of finding sets of quantum states that can be deterministically discriminated. From a geometric point of view, this problem is equivalent to that of embedding a simplex of points whose distances are maximal with respect to the Bures distance (or trace distance). We derive upper and lower bounds for the trace distance and for the fidelity between two quantum states, which imply bounds for the Bures distance between the unitary orbits of both states. We thus show that, when analyzing minimal and maximal distances between states of fixed spectra, it is sufficient to consider diagonal states only. Hence when optimal discrimination is considered, given freedom up to unitary orbits, it is sufficient to consider diagonal states. This is illustrated geometrically in terms of Weyl chambers. a1094-1622 00246nas a2200109 4500000000100000000000100001000000100002008004100003100002200044245006300066490000700129 2005 d 1 aJaroslaw Miszczak 00 aDescription and visualisation of quantum circuits with XML 0 v17 00223nas a2200109 4500000000100000000000100001000000100002008004100003100002200044245004000066490000700106 2002 d 1 aJaroslaw Miszczak 00 aQuantum algorithm for factorization 0 v14 00309nas a2200109 4500000000100000000000100001008004100002100002200043245011200065300001400177490000800191 2013 d 1 aJaroslaw Miszczak 00 aEmploying online quantum random number generators for generating truly random quantum states in Mathematica a127–128 0 v184 00918nas a2200145 4500000000100000000000100001000000100002008004100003100002200044245006800066300001400134490000800148520060200156022001400758 2012 d 1 aJaroslaw Miszczak 00 aGenerating and using truly random quantum states in Mathematica a118–124 0 v183 3 aThe problem of generating random quantum states is of a great interest from the quantum information theory point of view. In this paper we present a package for Mathematica computing system harnessing a specific piece of hardware, namely Quantis quantum random number generator (QRNG), for investigating statistical properties of quantum states. The described package implements a number of functions for generating random states, which use Quantis QRNG as a source of randomness. It also provides procedures which can be used in simulations not related directly to quantum information processing. a0010-4655 00289nam a2200121 4500000000100000000000100001008004100002260003300043100002200076245004800098490000600146020001500152 2012 d bMorgan & Claypool Publishers 1 aJaroslaw Miszczak 00 aHigh-level Structures for Quantum Computing 0 v6 a1608458512 00791nas a2200133 4500000000100000000000100001000000100002008004100003100002200044245006800066300001400134490000700148520050200155 2011 d 1 aJaroslaw Miszczak 00 aModels of quantum computation and quantum programming languages a305–324 0 v59 3 aThe goal of this report is to provide an introduction to the basic computational models used in quantum information theory. We various review models of quantum Turing machine, quantum circuits and quantum random access machine (QRAM) along with their classical counterparts. We also provide an introduction to quantum programming languages, which are developed using the QRAM model. We review the syntax of several existing quantum programming languages and discuss their features and limitations. 01014nas a2200157 4500000000100000000000100001000000100002008004100003260000600044100002200050245008600072300001400158490000700172520066300179022001400842 2011 d c9 1 aJaroslaw Miszczak 00 aSingular value decomposition and matrix reorderings in quantum information theory a897–918 0 v22 3 aWe review Schmidt and Kraus decompositions in the form of singular value decomposition using operations of reshaping, vectorization and reshuffling. We use the introduced notation to analyze the correspondence between quantum states and operations with the help of Jamiołkowski isomorphism. The presented matrix reorderings allow us to obtain simple formulae for the composition of quantum channels and partial operations used in quantum information theory. To provide examples of the discussed operations, we utilize a package for the Mathematica computing system implementing basic functions used in the calculations related to quantum information theory. a0129-1831 00723nas a2200157 4500000000100000000000100001000000100002008004100003100002200044700001700066700002200083245004700105300001600152490000700168520039000175 2012 d 1 aJaroslaw Miszczak 1 aPiotr Gawron 1 aZbigniew Puchała 00 aQubit flip game on a Heisenberg spin chain a1571–1583 0 v11 3 aWe study a quantum version of a penny flip game played using control parameters of the Hamiltonian in the Heisenberg model. Moreover, we extend this game by introducing auxiliary spins which can be used to alter the behaviour of the system. We show that a player aware of the complex structure of the system used to implement the game can use this knowledge to gain higher mean payoff. 00258nas a2200097 4500000000100000000000100001008004100002100002200043700002300065245007200088 2010 d 1 aJaroslaw Miszczak 1 aI. Sobota-Miszczak 00 aDesign-on-demand or how to create a target-oriented social web-site 01219nas a2200205 4500000000100000000000100001000000100002008004100003260000600044100002200050700002200072700002100094700001500115700002200130245005900152300001600211490000600227520076600233022001400999 2009 d c1 1 aJaroslaw Miszczak 1 aZbigniew Puchała 1 aPaweł Horodecki 1 aA. Uhlmann 1 aKarol Życzkowski 00 aSub- and super-fidelity as bounds for quantum fidelity a0103–0130 0 v9 3 aWe derive several bounds on fidelity between quantum states. In particular we show that fidelity is bounded from above by a simple to compute quantity we call super–fidelity. It is analogous to another quantity called sub–fidelity. For any two states of a two–dimensional quantum system ($N=2$) all three quantities coincide. We demonstrate that sub– and super–fidelity are concave functions. We also show that super–fidelity is super–multiplicative while sub–fidelity is sub–multiplicative and design feasible schemes to measure these quantities in an experiment. Super–fidelity can be used to define a distance between quantum states. With respect to this metric the set of quantum states forms a part of a $N^2-1$ dimensional hypersphere. a1533-7146 01124nas a2200145 4500000000100000000000100001000000100002008004100003100002200044700002500066245006500091300001600156490000700172520079900179 2014 d 1 aJaroslaw Miszczak 1 aPrzemysław Sadowski 00 aQuantum network exploration with a faulty sense of direction a1238–1250 0 v14 3 aWe develop a model which can be used to analyse the scenario of exploring quantum network with a distracted sense of direction. Using this model we analyse the behaviour of quantum mobile agents operating with non-adaptive and adaptive strategies which can be employed in this scenario. We introduce the notion of node visiting suitable for analysing quantum superpositions of states by distinguishing between visiting and attaining a position. We show that without a proper model of adaptiveness, it is not possible for the party representing the distraction in the sense of direction, to obtain the results analogous to the classical case. Moreover, with additional control resources the total number of attained positions is maintained if the number of visited positions is strictly limited. 01088nas a2200205 4500000000100000000000100001000000100002008004100003100002200044700001700066700002200083700001800105700001800123700002200141245006900163300001400232490000800246520061400254022001400868 2011 d 1 aZbigniew Puchała 1 aPiotr Gawron 1 aJaroslaw Miszczak 1 aŁ. Skowronek 1 aMan-Duen Choi 1 aKarol Życzkowski 00 aProduct numerical range in a space with tensor product structure a327–342 0 v434 3 aWe study operators acting on a tensor product Hilbert space and investigate their product numerical range, product numerical radius and separable numerical range. Concrete bounds for the product numerical range for Hermitian operators are derived. Product numerical range of a non-Hermitian operator forms a subset of the standard numerical range containing the barycenter of the spectrum. While the latter set is convex, the product range needs not to be convex nor simply connected. The product numerical range of a tensor product is equal to the Minkowski product of numerical ranges of individual factors. a0024-3795 00682nas a2200133 4500000000100000000000100001008004100002100002200043700002200065245005500087300001100142490000700153520038800160 2011 d 1 aZbigniew Puchała 1 aJaroslaw Miszczak 00 aProbability measure generated by the superfidelity a405301 0 v44 3 aWe study the probability measure on the space of density matrices induced by the metric defined by using superfidelity. We give the formula for the probability density of eigenvalues. We also study some statistical properties of the set of density matrices equipped with the introduced measure and provide a method for generating density matrices according to the introduced measure. 00790nas a2200145 4500000000100000000000100001008004100002260001200043100002200055700002200077245008000099856004500179490000700224520041300231 2017 d c02/2017 1 aZbigniew Puchała 1 aJaroslaw Miszczak 00 aSymbolic integration with respect to the Haar measure on the unitary groups uhttps://doi.org/10.1515/bpasts-2017-0003 0 v65 3 aWe present IntU package for Mathematica computer algebra system. The presented package performs a symbolic integration of polynomial functions over the unitary group with respect to unique normalized Haar measure. We describe a number of special cases which can be used to optimize the calculation speed for some classes of integrals. We also provide some examples of usage of the presented package.
00645nas a2200133 4500000000100000000000100001008004100002100002200043700002200065245005100087300001100138490000700149520035500156 2009 d 1 aZbigniew Puchała 1 aJaroslaw Miszczak 00 aBound on trace distance based on superfidelity a024302 0 v79 3 aWe provide a bound for the trace distance between two quantum states. The lower bound is based on the superfidelity, which provides the upper bound on quantum fidelity. One of the advantages of the presented bound is that it can be estimated using a simple measurement procedure. We also compare this bound with the one provided in terms of fidelity. 01853nas a2200181 4500000000100000000000100001008004100002100002200043700002200065700001700087700001800104700001800122700002200140245006900162300001100231490000700242520142200249 2012 d 1 aZbigniew Puchała 1 aJaroslaw Miszczak 1 aPiotr Gawron 1 aCharles Dunkl 1 aJ.A. Holbrook 1 aKarol Życzkowski 00 aRestricted numerical shadow and geometry of quantum entanglement a415309 0 v45 3 aThe restricted numerical range W\_R(A) of an operator A acting on a D-dimensional Hilbert space is defined as a set of all possible expectation values of this operator among pure states which belong to a certain subset R of the of set of pure quantum states of dimension D. One considers for instance the set of real states, or in the case of composite spaces, the set of product states and the set of maximally entangled states. Combining the operator theory with a probabilistic approach we introduce the restricted numerical shadow of A – a normalized probability distribution on the complex plane supported in W\_R(A). Its value at point z in C is equal to the probability that the expectation value is equal to z, where |psi> represents a random quantum state in subset R distributed according to the natural measure on this set, induced by the unitarily invariant Fubini–Study measure. Studying restricted shadows of operators of a fixed size D=N\_A N\_B we analyse the geometry of sets of separable and maximally entangled states of the N\_A x N\_B composite quantum system. Investigating trajectories formed by evolving quantum states projected into the plane of the shadow we study the dynamics of quantum entanglement. A similar analysis extended for operators on D=2^3 dimensional Hilbert space allows us to investigate the structure of the orbits of GHZ and W quantum states of a three–qubit system. 01187nas a2200181 4500000000100000000000100001000000100002008004100003100002200044700002200066700001700088700002300105245007600128300001100204490000700215520076900222022001400991 2011 d 1 aZbigniew Puchała 1 aJaroslaw Miszczak 1 aPiotr Gawron 1 aBartłomiej Gardas 00 aExperimentally feasible measures of distance between quantum operations a1–12 0 v10 3 aWe present two measures of distance between quantum processes which can be measured directly in laboratory without resorting to process tomography. The measures are based on the superfidelity, introduced recently to provide an upper bound for quantum fidelity. We show that the introduced measures partially fulfill the requirements for distance measure between quantum processes. We also argue that they can be especially useful as diagnostic measures to get preliminary knowledge about imperfections in an experimental setup. In particular we provide quantum circuit which can be used to measure the superfidelity between quantum processes. We also provide a physical interpretation of the introduced metrics based on the continuity of channel capacity.
a1570-0755 00305nas a2200145 4500000000100000000000100001000000100002008004100003100002300044700001700067700002200084245003500106300001100141490000700152 2007 d 1 aRyszard Winiarczyk 1 aPiotr Gawron 1 aJaroslaw Miszczak 00 aKompilator języka QCL QCL2QML a5–18 0 v28 00846nas a2200157 4500000000100000000000100001000000100002008004100003100001600044700002200060700002200082245009200104300001400196490000700210520047100217 2013 d 1 aP. Zawadzki 1 aZbigniew Puchała 1 aJaroslaw Miszczak 00 aIncreasing the security of the ping-pong protocol by using many mutually unbiased bases a569–576 0 v12 3 aIn this paper we propose an extended version of the ping-pong protocol and study its security. The proposed protocol incorporates the usage of mutually unbiased bases in the control mode. We show that, by increasing the number of bases, it is possible to improve the security of this protocol. We also provide the upper bounds on eavesdropping average non-detection probability and propose a control mode modification that increases the attack detection probability. 00300nas a2200121 4500000000100000000000100001008004100002100001600043700002200059245007600081300001200157490000900169 2016 d 1 aP. Zawadzki 1 aJaroslaw Miszczak 00 aA general scheme for information interception in the ping pong protocol a3162012 0 v2016 00301nas a2200133 4500000000100000000000100001008004100002100002500043700002200068700002400090245003500114300001100149490000700160 2016 d 1 aPrzemysław Sadowski 1 aJaroslaw Miszczak 1 aMateusz Ostaszewski 00 aLively quantum walks on cycles a375302 0 v49 00352nas a2200133 4500000000100000000000100001008004100002100001400043700002200057700002400079245007100103856003700174490000700211 2018 d 1 aAdam Glos 1 aJaroslaw Miszczak 1 aMateusz Ostaszewski 00 aLimiting properties of stochastic quantum walks on directed graphs uhttps://arxiv.org/abs/1703.01792 0 v51 00322nas a2200133 4500000000100000000000100001008004100002260000900043100001400052700002200066700002400088245006800112490000800180 2019 d c2019 1 aAdam Glos 1 aJaroslaw Miszczak 1 aMateusz Ostaszewski 00 aQSWalk. jl: Julia package for quantum stochastic walks analysis 0 v235 00342nas a2200145 4500000000100000000000100001008004100002100001600043700001600059700001400075700002200089700001600111245006200127490000700189 2018 d 1 aG. Sergioli 1 aE. Santucci 1 aL. Didaci 1 aJaroslaw Miszczak 1 aR. Giuntini 00 aA quantum-inspired version of the nearest mean classifier 0 v22 00932nas a2200133 4500000000100000000000100001008004100002100001400043700002200057245009600079856003700175490000700212520057900219 2019 d 1 aAdam Glos 1 aJaroslaw Miszczak 00 aImpact of the malicious input data modification on the efficiency of quantum spatial search uhttps://arxiv.org/abs/1802.10041 0 v18 3 aIn this paper, we demonstrate that the efficiency of quantum spatial search can be significantly altered by malicious manipulation of the input data in the client–server model. We achieve this by exploiting exceptional configuration effect on Szegedy spatial search and proposing a framework suitable for analysing efficiency of attacks on quantum search algorithms. We provide the analysis of proposed attacks for different models of random graphs. The obtained results demonstrate that quantum algorithms in general are not secure against input data alteration.
01712nas a2200145 4500000000100000000000100001008004100002100001400043700002200057245006000079856003700139490000600176520137000182022001401552 2019 d 1 aAdam Glos 1 aJaroslaw Miszczak 00 aThe role of quantum correlations in Cop and Robber game uhttps://arxiv.org/abs/1702.07932 0 v6 3 aWe introduce and study quantized versions of Cop and Robber game. We achieve this by using graph-preserving quantum operations, which are the quantum analogues of stochastic operations preserving the graph. We provide the tight bound for the number of operations required to reach the given state. By extending them to the controlled operations, we define a quantum-controlled Cop and Robber game, which expands the classical Cop and Robber game, as well as the classically controlled quantum Cop and Robber game. In contrast to the typical scheme for introducing quantum games, we assume that both parties can utilise full information about the opponent's strategy. We show that the utilisation of the full knowledge about the opponent's state does not provide the advantage. Moreover, the chances of catching the Robber decrease for classical cop-win graphs. This result does not depend on the chosen model of evolution. On the other hand, the possibility to execute controlled quantum operations allows catching the Robber on almost all classical cop-win graphs. By this, we demonstrate that it is necessary to enrich the structure of correlations between the players' systems to provide a non-trivial quantized Cop and Robber game. Thus the quantum controlled operations offer a significant advantage over the classically controlled quantum operations.
a2196-5617 00919nas a2200145 4500000000100000000000100001008004100002100002400043700002200067700002500089700001400114245008200128490000700210520055600217 2019 d 1 aMateusz Ostaszewski 1 aJaroslaw Miszczak 1 aPrzemysław Sadowski 1 aL. Banchi 00 aApproximation of quantum control correction scheme using deep neural networks 0 v18 3 aWe study the functional relationship between quantum control pulses in the idealized case and the pulses in the presence of an unwanted drift. We show that a class of artificial neural networks called LSTM is able to model this functional relationship with high efficiency, and hence the correction scheme required to counterbalance the effect of the drift. Our solution allows studying the mapping from quantum control pulses to system dynamics and then analysing the robustness of the latter against local variations in the control profile.
01349nas a2200133 4500000000100000000000100001008004100002100002400043700002200067700002500089245008600114490000700200520100800207 2020 d 1 aMateusz Ostaszewski 1 aJaroslaw Miszczak 1 aPrzemysław Sadowski 00 aGeometrical versus time-series representation of data in quantum control learning 0 v53 3 aRecently machine learning techniques have become popular for analysing physical systems and solving problems occurring in quantum computing. In this paper we focus on using such techniques for finding the sequence of physical operations implementing the given quantum logical operation. In this context we analyse the flexibility of the data representation and compare the applicability of two machine learning approaches based on different representations of data. We demonstrate that the utilization of the geometrical structure of control pulses is sufficient for achieving high-fidelity of the implemented evolution. We also demonstrate that artificial neural networks, unlike geometrical methods, posses the generalization abilities enabling them to generate control pulses for the systems with variable strength of the disturbance. The presented results suggest that in some quantum control scenarios, geometrical data representation and processing is competitive to more complex methods.
01840nas a2200217 4500000000100000000000100001008004100002260000800043100001000051700001400061700001200075700002200087700001600109700001300125245006400138856004700202300001600249490000700265520133600272022001401608 2019 d cNov 1 aYe Ye 1 aXiao Hang 1 aJin Koh 1 aJaroslaw Miszczak 1 aKang Cheong 1 aNeng Xie 00 aRatcheting based on neighboring niches determines lifestyle uhttps://doi.org/10.1007/s11071-019-05290-1 a1821–1830 0 v98 3 aIn this paper, a co-evolution method of game dynamics and network structure is adopted to demonstrate that neighboring niches of an individual or population may have great influence in determining lifestyle adoption. The model encompasses network structure evolution, denoted CaseA, and pure games participated in by individuals in the network with two asymmetric branches determining winning and losing states, denoted Case B. The selection between game branches is dependent on the demographic of neighboring niches, and favorable or unfavorable effects from the neighborhood can be made to manifest by setting probabilistic game parameters. Theoretical analysis reveals that losing configurations of Case B, when stochastically mixed with neutral Case A, can result in paradoxical winning scenarios where the network experiences positive gain–-a Parrondo's paradox-like phenomenon has therefore emerged. It is elucidated that agitation from Case A increases the probability of individuals to play the favorable branch of Case B, leading to unexpected gains in two distinct parameter regimes. In the paradoxical regions, our analysis suggests strongly that neighboring niches are the cause for evolution toward social or solitary lifestyle behaviors, and we present important connections to real-world biological life.
a1573-269X 01682nas a2200205 4500000000100000000000100001008004100002100001000043700001400053700001200067700002200079700001600101700001800117245007300135856007100208300001100279490000800290520116400298022001401462 2020 d 1 aYe Ye 1 aXiao Hang 1 aJin Koh 1 aJaroslaw Miszczak 1 aKang Cheong 1 aNeng-gang Xie 00 aPassive network evolution promotes group welfare in complex networks uhttp://www.sciencedirect.com/science/article/pii/S0960077919304102 a109464 0 v130 3 aThe Parrondo’s paradox is a counter-intuitive phenomenon in which individually losing strategies, canonically termed Game A and Game B, are combined to produce winning outcomes. In this paper, a co-evolution of game dynamics and network structure is adopted to study adaptability and survivability in multi-agent dynamics. The model includes Action A, representing a rewiring process on the network, and a two-branch Game B, representing redistributive interactions between agents. Simulation results indicate that stochastically mixing Action A and Game B can produce enhanced, and even winning outcomes, despite Game B being individually losing. In other words, a Parrondo-type paradox can be achieved, but unlike canonical variants, the source of agitation is provided by passive network evolution instead of an active second game. The underlying paradoxical mechanism is analyzed, revealing that the rewiring process drives a topology shift from initial regular lattices towards scale-free characteristics, and enables exploitative behavior that grants enhanced access to the favourable branch of Game B.
a0960-0779 01441nas a2200205 4500000000100000000000100001008004100002260002200043100002200065700001400087700002200101700002700123700002200150700001800172700002500190700001700215245008000232856003700312520088600349 2020 d c01/2021 bSpringer 1 aArtur Frankiewicz 1 aAdam Glos 1 aKrzysztof Grochla 1 aZbigniew Łaskarzewski 1 aJaroslaw Miszczak 1 aKonrad Połys 1 aPrzemysław Sadowski 1 aAnna Strzoda 00 aLP WAN Gateway Location Selection Using Modified K-Dominating Set Algorithm uhttps://arxiv.org/abs/2010.04553 3 aThe LP WAN networks use gateways or base stations to communicate with devices distributed on large distances, up to tens of kilometres. The selection of optimal gateway locations in wireless networks should allow providing the complete coverage for a given set of nodes, taking into account the limitations, such as the number of nodes served per access point or required redundancy. In this paper, we describe the problem of selecting the base stations in a network using the concept of k-dominating set. In our model, we include information about the required redundancy and spectral efficiency. We consider the additional requirements on the resulting connections and provide the greedy algorithm for solving the problem. The algorithm is evaluated in randomly generated network topologies and using the coordinates of sample real smart metering networks.
01368nas a2200145 4500000000100000000000100001008004100002100001800043700001400061700002200075245010100097856003700198490000700235520098000242 2022 d 1 aÖzlem Salehi 1 aAdam Glos 1 aJaroslaw Miszczak 00 aUnconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization uhttps://arxiv.org/abs/2106.09056 0 v21 3 aQuantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, the problems need to be formulated as unconstrained binary models, taking into account limitation and advantages of quantum devices. In this work, we provide a detailed analysis of the travelling salesman problem with time windows (TSPTW) in the context of solving it on a quantum computer. We introduce quadratic unconstrained binary optimization and higher-order binary optimization formulations of this problem. We demonstrate the advantages of edge-based and node-based formulations of the TSPTW problem. Additionally, we investigate the experimental realization of the presented methods on a quantum annealing device. The provided results pave the path for utilizing quantum computer for a variety of real-world tasks which can be cast in the form of travelling salesman problem with time windows.
01362nas a2200145 4500000000100000000000100001008004100002260001200043100001600055700002200071245004900093856003900142490000600181520102900187 2022 d c07/2022 1 aAkash Kundu 1 aJaroslaw Miszczak 00 aVariational certification of quantum devices uhttps://arxiv.org/abs/2011.01879v2 0 v7 3 aOne of the requirements imposed on the realistic quantum computers is to provide computation results which can be repeated and reproduced. In the situation when one needs to repeat the quantum computation procedure several times, it is crucial that the copies of the quantum devices are similar in the sense of the produced results. In this work, we describe a simple procedure based on variational quantum eigensolver which can be utilized to compare quantum devices. The procedure is developed by combining Choi–Jamiołkowski isomorphism with the variational hybrid quantum–classical procedure for matrix diagonalization. We compare the introduced procedure with the scheme based on the standard bounds for the similarity between quantum operations by analysing its action on random quantum channels. We also discuss the sensitivity of the described procedure to the noise, and we provide numerical results demonstrating its feasibility in realistic scenarios by running the procedure on IBM quantum computer.
01600nas a2200157 4500000000100000000000100001008004100002260001200043100002000055700002000075700002000095700002200115245012400137490000700261520117400268 2021 d c03/2022 1 aMateusz Żarski 1 aBartosz Wójcik 1 aKamil Książek 1 aJaroslaw Miszczak 00 aFinicky transfer learning—A method of pruning convolutional neural networks for cracks classification on edge devices 0 v37 3 aHigh demand for computational power significantly limits the possibility of using modern deep learning methods in the environments where one has to deal with devices limited by the performance and the energy constraints. To address this issue, this paper proposes a novel method of combining the pruning and the transfer learning techniques for the purpose of delivering solid accuracy while simultaneously lowering the demand for energy and computing power. This method is referred to as \emph{Finicky Transfer Learning} (FTL) as it is finicky during the process of selecting filters from a pre-trained feature extractor to compose a sparser architecture. The proposed filter selection process is based on an original approach utilizing the Jaccard similarity coefficient calculated between the activation maps and the masks obtained by semantic segmentation. This enables the use of CNN, trained previously on a large generic dataset, in a crack classification task. The presented method significantly lowers the inference time while maintaining or even slightly increasing the classification accuracy, enabling real-time operation on single-board computers.
01870nas a2200181 4500000000100000000000100001008004100002100002000043700001400063700001600077700002200093700001800115700002200133245008900155856003700244490000800281520139900289 2022 d 1 aLudmila Botelho 1 aAdam Glos 1 aAkash Kundu 1 aJaroslaw Miszczak 1 aÖzlem Salehi 1 aZoltán Zimborás 00 aError mitigation for variational quantum algorithms through mid-circuit measurements uhttps://arxiv.org/abs/2108.10927 0 v105 3 aNoisy intermediate-scale quantum algorithms require novel paradigms of error mitigation. To obtain noise-robust quantum computers, each logical qubit is equipped with hundreds or thousands of physical qubits. However, it is not possible to use memory-consuming techniques for current quantum devices having at most hundreds or thousands of physical qubits on their own. For specific problems, valid quantum states have a unique structure as in the case of Fock states and W states where the Hamming weight is fixed, and the evolution takes place in a smaller subspace of the full Hilbert space. With this preknowledge, some errors can be detected during the evolution of the circuit, by filtering the states not obeying the pattern through postselection. In this paper, we present mid-circuit postselection schemes for frequently used encodings such as one-hot, binary, gray, and domain-wall encoding. For the particular subspace of one-hot states, we propose a method that works by compressing the full Hilbert space to a smaller subspace, allowing projecting to the desired subspace without using any ancilla qubits. We demonstrate the effectiveness of the approach for the quantum alternating operator ansatz algorithm. Our method is particularly suitable for the currently available hardware, where measuring and resetting are possible, but classical conditional operators are not.
01433nas a2200157 4500000000100000000000100001008004100002260001200043100002000055700002000075700002200095245009100117856003700208490000700245520102300252 2021 d c12/2021 1 aMateusz Żarski 1 aBartosz Wójcik 1 aJaroslaw Miszczak 00 aKrakN: Transfer Learning framework and dataset for infrastructure thin crack detection uhttps://arxiv.org/abs/2004.12337 0 v16 3 aMonitoring the technical condition of infrastructure is a crucial element of its maintenance. Although there are many deep learning models intended for this purpose, they are severely limited in their application due to labour-intensive gathering of new datasets and high demand for computing power during model training. To overcome these limiting factors we propose a KrakN framework. It enables end-to-end development of unique infrastructure defect detectors on digital images, achieving an accuracy of above 90%. The framework also supports the semi-automatic creation of new datasets and has modest computing power requirements. It can be used to immediately implement deep learning in the process of infrastructure management and, due to its architecture based on transfer learning, allows low metric loss when used across different datasets. We also demonstrate that thanks to its scalability and modular structure, the presented framework is easily modifiable, and can be used in realistic scenarios.
00551nas a2200169 4500000000100000000000100001008004100002260009400043100002000137700002000157700002000177700001800197700002200215245006500237856005700302020002200359 2021 d bInstitute of Fundamental Technological Research of the Polish Academy of Sciences aWarsaw 1 aMateusz Żarski 1 aBartosz Wójcik 1 aKamil Książek 1 aMarek Salamak 1 aJaroslaw Miszczak 00 aAdvances in applicable deep-learning based defect detection uhttp://v4shm.ippt.pan.pl/WEO2021-BookOfAbstracts.pdf a987-83-65550-23-1 00509nas a2200157 4500000000100000000000100001008004100002260009400043100002000137700002000157700001800177700002200195245005500217856005700272020002200329 2021 d bInstitute of Fundamental Technological Research of the Polish Academy of Sciences aWarsaw 1 aBartosz Wójcik 1 aMateusz Żarski 1 aMarek Salamak 1 aJaroslaw Miszczak 00 aExtracting crack characteristics from RGB-D images uhttp://v4shm.ippt.pan.pl/WEO2021-BookOfAbstracts.pdf a987-83-65550-23-1 01245nas a2200121 4500000000100000000000100001008004100002100002200043245009600065856003700161490000800198520091700206 2022 d 1 aJaroslaw Miszczak 00 aConstructing games on networks for controlling the inequalities in the capital distribution uhttps://arxiv.org/abs/2201.10913 0 v594 3 aThe inequality in capital or resource distribution is among the important phenomena observed in populations. The sources of inequality and methods for controlling it are of practical interest. To study this phenomenon, we introduce a model of interaction between agents in the network designed for the purpose of reducing the inequality in the distribution of capital. To achieve the effect of inequality reduction we interpret the outcome of the elementary game played in the network such that the wining the game is translated into the reduction of the inequality. We study different interpretations of the introduced scheme and their impact on the behaviour of agents in the terms of the capital distribution and we provide examples based on the capital dependent Parrondo’s paradox. The results presented in this study provide insight into the mechanics of the inequality formation in the society.
02101nas a2200145 4500000000100000000000100001008004100002260001200043100001600055700002200071245009200093856003700185490000700222520172600229 2022 d c06/2022 1 aAkash Kundu 1 aJaroslaw Miszczak 00 aTransparency and enhancement in fast and slow light in q-deformed optomechanical system uhttps://arxiv.org/abs/2205.15800 0 v54 3 aNonclassical phenomena can be enhanced by introducing q-deformation in optomechanical systems. This motivated us to investigate the optical response in a q-deformed linearly coupled optomechanical system. The system consists of two deformed cavities that are linearly coupled to the motion of mechanical mirrors, and the cavities are coupled to each other by transmission strength parameter. Our study shows that compared to non-deformed cases, the deformed system exhibits more rapid phase transition at the positions of transparency windows, causing stronger and enhanced fast and slow light phenomena. Moreover, in the region 0<q<0.5, the optomechanical system results in gain. Moreover for a fixed deformation of cavities, by tuning the tunnelling strength and optomechanical coupling, one can observe a delay and advancement in probe filed in the order of \textit{milliseconds} and even above milliseconds for fine-tuning of the coupling parameters. Finally, the bridge between mathematical and physical models is built by assuming the deformation to be a primitive root of unity, indicating a class of \textit{anyon} models. Our results demonstrate that q-deformation provides a novel method for manipulating and significantly enhancing optical phenomena not only in arbitrarily deformed optomechanical systems but also in anyon models.
01406nas a2200181 4500000000100000000000100001008004100002260001200043100002000055700002000075700002200095700002600117700002200143245008300165856003700248490000700285520093200292 2022 d c10/2022 1 aMateusz Żarski 1 aBartosz Wójcik 1 aJaroslaw Miszczak 1 aBartlomiej Blachowski 1 aMariusz Ostrowski 00 aComputer Vision Based Inspection on Post-Earthquake With UAV Synthetic Dataset uhttps://arxiv.org/abs/2210.05282 0 v10 3 aThe goal of this paper is to deliver the overview of the current state of the art, to provide experience report on developing quantum software tools, and to outline the perspective for developing quantum programming tools supporting symbolic programming for the needs of quantum computing technologies. The main focus of this paper is on quantum computing technologies, as they can in the most direct way benefit from developing tools enabling the symbolic manipulation of quantum circuits and providing software tools for creating, optimizing, and testing quantum programs. We deliver a short survey of the most popular approaches in the field of quantum software development and we aim at pointing their strengths and weaknesses. This helps to formulate a list of desirable characteristics which should be included in quantum computing frameworks. Next, we describe a software architecture and its preliminary implementation supporting the development of quantum programs using symbolic approach, encouraging the functional programming paradigm, and, at the same, time enabling the integration with high-performance and cloud computing. The described software consists of several packages developed to address different needs, but nevertheless sharing common design concepts. We also outline how the presented approach could be used in tasks in quantum software engineering, namely quantum software testing and quantum circuit construction.
01523nas a2200181 4500000000100000000000100001008004100002260001200043100002000055700002000075700002000095700002200115700002600137245009200163856007700255490001200332520099700344 2023 d c10/2023 1 aBartosz Wójcik 1 aMateusz Żarski 1 aKamil Książek 1 aJaroslaw Miszczak 1 aMirosław Skibniewski 00 aA deep learning method for hard-hat-wearing detection based on head center localization uhttps://journals.pan.pl/dlibra/publication/147340/edition/128931/content 0 v71 (EA) 3 aIn recent years, a lot of attention is paid to deep learning methods in the context of vision-based construction site safety systems. However, there is still more to be done to establish the relationship between supervised construction workers and their essential personal protective equipment, like hard hats. A deep learning method combining object detection, head center localization, and simple rule-based reasoning is proposed in this article. In tests, this solution surpassed the previous methods based on the relative bounding box position of different instances and direct detection of hard hat wearers and non-wearers. Achieving MS COCO style overall AP of 67.5% compared to 66.4% and 66.3% achieved by the approaches mentioned above, with class-specific AP for hard hat non-wearers of 64.1% compared to 63.0% and 60.3%. The results show that using deep learning methods with a humanly interpretable rule-based algorithm is better suited for detecting hard hat non-wearers.
01183nas a2200133 4500000000100000000000100001008004100002260001200043100002200055245010000077856003700177490000700214520082800221 2023 d c10/2023 1 aJaroslaw Miszczak 00 aRule switching mechanisms in the Game of Life with synchronous and asynchronous updating policy uhttps://arxiv.org/abs/2310.05979 0 v98 3 aThe emergence of complex structures in the systems governed by a simple set of rules is among the most fascinating aspects of Nature. The particularly powerful and versatile model suitable for investigating this phenomenon is provided by cellular automata, with the Game of Life being one of the most prominent examples. However, this simplified model can be too limiting in providing a tool for modelling real systems. To address this, we introduce and study an extended version of the Game of Life, with the dynamical process governing the rule selection at each step. We show that the introduced modification significantly alters the behaviour of the game. We also demonstrate that the choice of the synchronization policy can be used to control the trade-off between the stability and the growth in the system.
00506nas a2200205 4500000000100000000000100001000000100002008004100003260003200044100001800076700001600094700002000110700002200130700001800152700001900170700001800189245006300207300001200270020001800282 2023 d bSpringer Nature Switzerland 1 aRobert Glück 1 aIvan Lanese 1 aClaudio Mezzina 1 aJaroslaw Miszczak 1 aIain Phillips 1 aIrek Ulidowski 1 aGermán Vidal 00 aTowards a Taxonomy for Reversible Computation Approaches a24–39 a9783031381003 01805nas a2200193 4500000000100000000000100001008004100002260001200043100001600055700002500071700002400096700001600120700001500136700001800151700002200169245009600191490000700287520131700294 2024 d c01/2024 1 aAkash Kundu 1 aPrzemysław Bedełek 1 aMateusz Ostaszewski 1 aOnur Danaci 1 aYash Patel 1 aVedran Dunjko 1 aJaroslaw Miszczak 00 aEnhancing quantum variational state diagonalization using reinforcement learning techniques 0 v26 3 aThe variational quantum algorithms are crucial for the application of NISQ computers. Such algorithms require short quantum circuits, which are more amenable to implementation on near-term hardware, and many such methods have been developed. One of particular interest is the so-called variational quantum state diagonalization method, which constitutes an important algorithmic subroutine and can be used directly to work with data encoded in quantum states. In particular, it can be applied to discern the features of quantum states, such as entanglement properties of a system, or in quantum machine learning algorithms. In this work, we tackle the problem of designing a very shallow quantum circuit, required in the quantum state diagonalization task, by utilizing reinforcement learning (RL). We use a novel encoding method for the RL-state, a dense reward function, and an $\epsilon$-greedy policy to achieve this. We demonstrate that the circuits proposed by the reinforcement learning methods are shallower than the standard variational quantum state diagonalization algorithm and thus can be used in situations where hardware capabilities limit the depth of quantum circuits. The methods we propose in the paper can be readily adapted to address a wide range of variational quantum algorithms.
01393nas a2200169 4500000000100000000000100001008004100002260001200043100002100055700002400076700002100100700002200121245007800143856003700221490000700258520095800265 2025 d c03/2025 1 aKatarzyna Gawlak 1 aJarosław Konieczny 1 aKrzysztof Domino 1 aJaroslaw Miszczak 00 aStatistical analysis of geoinformation data for increasing railway safety uhttps://arxiv.org/abs/2406.01083 0 v34 3 aThe impact of rail transport on the environment is one of the crucial factors for the sustainable development of this form of mass transport. We present a data-driven analysis of wild animal railway accidents in the region of southern Poland, a step to create the train driver warning system. We built our method by harnessing the Bayesian approach to the statistical analysis of information about the geolocation of the accidents. The implementation of the proposed a model does not require advanced knowledge of data mining and can be applied even in less developed railway systems with small IT support. Furthermore, we have discovered unusual patterns of accidents while considering the number of trains and their speed and time at particular geographical location of the railway network. We test the developed approach using data from southern Poland, compromising wildlife habitats and one of the most urbanised regions in Central Europe.
02499nas a2200217 4500000000100000000000100001008004100002260001200043100001800055700001600073700002200089700002000111700002500131700001800156700002200174700001900196245011000215856003700325490000700362520191200369 2026 d c04/2026 1 aAritra Sarkar 1 aAkash Kundu 1 aMatthew Steinberg 1 aSibasish Mishra 1 aSebastiaan Fauquenot 1 aTamal Acharya 1 aJaroslaw Miszczak 1 aSebastian Feld 00 aYAQQ: Yet Another Quantum Quantizer -- Design Space Exploration of Quantum Gate Sets using Novelty Search uhttps://arxiv.org/abs/2406.17610 0 v28 3 aIn the standard circuit model of quantum computation, the number and quality of the quantum gates composing the circuit influence the runtime and fidelity of the computation. The fidelity of the decomposition of quantum algorithms, represented as unitary matrices, to bounded depth quantum circuits depends strongly on the set of gates available for the decomposition routine. To investigate this dependence, we explore the design space of discrete quantum gate sets and present a software tool for comparative analysis of quantum processing units and control protocols based on their native gates. The evaluation is conditioned on a set of unitary transformations representing target use cases on the quantum processors. The cost function considers three key factors: (i) the statistical distribution of the decomposed circuits' depth, (ii) the statistical distribution of process fidelities for the approximate decomposition, and (iii) the relative novelty of a gate set compared to other gate sets in terms of the aforementioned properties. The developed software, YAQQ (Yet Another Quantum Quantizer), enables the discovery of an optimized set of quantum gates through this tunable joint cost function. To identify these gate sets, we use the novelty search algorithm, circuit decomposition techniques, and stochastic optimization to implement YAQQ within the Qiskit quantum simulator environment. YAQQ exploits reachability tradeoffs conceptually derived from quantum algorithmic information theory. Our results demonstrate the pragmatic application of identifying gate sets that are advantageous to popularly used quantum gate sets in representing quantum algorithms. Consequently, we demonstrate pragmatic use cases of YAQQ in comparing transversal logical gate sets in quantum error correction codes, designing optimal quantum instruction sets, and compiling to specific quantum processors.
01096nam a2200133 4500000000100000000000100001008004100002260001500043100002200058245013700080856005100217520067500268020001900943 2024 d bQuoqa Pubs 1 aJaroslaw Miszczak 00 aShort Lessons on Wolfram Language: Programming, Data Processing, Graphics, Machine Learning, and Quantum Computing with Mathematica uhttps://open.icm.edu.pl/handle/123456789/24302 3 aThis book provides a tutorial on Wolfram Language, the programming language powering the Mathematica computer algebra system. The main purpose of this book is to introduce the basic concepts required to start using Mathematica. The book contains lessons organized around various topics and use cases where the capabilities of Mathematica can be demonstrated. The lessons cover such elements of Wolfram Language as syntax, concepts used in linear algebra, graph theory, functions used to visualize data, and methods of solving equations. The introduced concepts are utilized to provide an overview of the basic elements of machine learning and quantum computing.
a978-8366950016 00442nas a2200145 4500000000100000000000100001008004100002260001200043100002100055700002100076700002200097245012300119856004700242490000700289 2025 d c12/2024 1 aKrzysztof Domino 1 aArkadiusz Sochan 1 aJaroslaw Miszczak 00 aAnalytical assessment of workers' safety concerning direct and indirect ways of getting infected by dangerous pathogen uhttps://doi.org/10.1016/j.jocs.2024.102509 0 v85 01549nas a2200121 4500000000100000000000100001008004100002260001200043100002000055700002200075245008900097520124100186 2024 d c09/2024 1 aMateusz Żarski 1 aJaroslaw Miszczak 00 aMulti-Step Feature Fusion for Natural Disaster Damage Assessment on Satellite Images 3 aQuick and accurate assessment of the damage state of buildings after natural disasters is crucial for undertaking properly targeted rescue and subsequent recovery operations, which can have a major impact on the safety of victims and the cost of disaster recovery. The quality of such a process can be significantly improved by harnessing the potential of machine learning methods in computer vision. This paper presents a novel damage assessment method using an original multi-step feature fusion network for the classification of the damage state of buildings based on pre- and post-disaster large-scale satellite images. We introduce a novel convolutional neural network (CNN) module that performs feature fusion at multiple network levels between pre- and post-disaster images in the horizontal and vertical directions of CNN network. An additional network element – Fuse Module – was proposed to adapt any CNN model to analyze image pairs in the issue of pair classification. We use, open, large-scale datasets (IDA-BD and xView2) to verify, that the proposed method is suitable to improve on existing state-of-the-art architectures. We report over a 3 percentage point increase in the accuracy of the Vision Transformer model. 00303nas a2200097 4500000000100000008004100001100002200042245009600064856003700160490000800197 2026 d 1 aJaroslaw Miszczak 00 aCooperation in public goods game on square lattices with agents changing interaction groups uhttps://arxiv.org/abs/2510.03772 0 v694 01985nas a2200109 4500000000100000008004100001260004000042100002200082245009500104856003700199520163900236 2026 d c06/2026 bSpringer aHamburg, Germany 1 aJaroslaw Miszczak 00 aTowards Quantum Machine Learning for Assessing the Resilience of Post-quantum Cryptography uhttps://arxiv.org/abs/2607.13722 3 aThe potential capabilities of quantum computers motivated the development of cryptographic protocols suitable for securing communication against adversaries with access to large fault-tolerant quantum computers. However, even though current quantum computers are limited in terms of size and precision, they can still be useful for finding loopholes and weaknesses in the post-quantum cryptographic protocols. In this work, we present an attempt to utilize the capabilities of Quantum Generative Adversarial Networks (QGANs), one of the promising architectures used in quantum machine learning, for this purpose. We describe an example application of QGAN architecture for the purpose of loading the probability distribution of the hash-based digital signatures into the memory of a quantum computer. Our results confirm that near-term hybrid quantum-classical methods possess capabilities required for this purpose. The presented approach can be used as a first step in the workflow, enabling the utilization of quantum computing for attacking post-quantum cryptographic primitives.
00594nas a2200133 4500000000100000000000100001008004100002100002300043700002200066245006700088300001100155490000700166520028700173 2012 d 1 aBartłomiej Gardas 1 aZbigniew Puchała 00 aNotes on the Riccati operator equation in open quantum systems a012106 0 v53 3 aRecent problem [B. Gardas, J. Math. Phys. {bf 52}, 042104 (2011)] concerning an antilinear solution of the Riccati equation is solved. We also exemplify that a simplification of the Riccati equation, even under reasonable assumptions, can lead to a not equivalent equation.
00672nas a2200145 4500000000100000000000100001000000100002008004100003100002300044700002200067245005600089300001100145490000700156520036300163 2011 d 1 aBartłomiej Gardas 1 aZbigniew Puchała 00 aStationary states of two-level open quantum systems a215306 0 v44 3 aA problem of finding stationary states of open quantum systems is addressed. We focus our attention on a generic type of open system: a qubit coupled to its environment. We apply the theory of block operator matrices and find stationary states of two-level open quantum systems under certain conditions applied on both the qubit and the surrounding.
00471nas a2200169 4500000000100000000000100001008004100002100002100043700002200064700002300086700001700109700002200126245006400148856007000212300001100282490000800293 2019 d 1 aJakub Czartowski 1 aKonrad Szymański 1 aBartłomiej Gardas 1 aYan Fyodorov 1 aKarol Życzkowski 00 aSeparability gap and large deviation entanglement criterion uhttps://journals.aps.org/pra/abstract/10.1103/PhysRevA.100.042326 a042326 0 v100 00407nas a2200157 4500000000100000000000100001008004100002260000800043100002300051700001500074700002000089245006600109856005600175300001100231490000700242 2018 d cNov 1 aBartłomiej Gardas 1 aMarek Rams 1 aJacek Dziarmaga 00 aQuantum neural networks to simulate many-body quantum systems uhttps://link.aps.org/doi/10.1103/PhysRevB.98.184304 a184304 0 v98 00482nas a2200157 4500000000100000000000100001008004100002260000800043100002300051700002000074700001900094245013700113856005600250300001100306490000700317 2017 d cMar 1 aBartłomiej Gardas 1 aJacek Dziarmaga 1 aWojciech Zurek 00 aDynamics of the quantum phase transition in the one-dimensional Bose-Hubbard model: Excitations and correlations induced by a quench uhttps://link.aps.org/doi/10.1103/PhysRevB.95.104306 a104306 0 v95 00377nas a2200157 4500000000100000000000100001008004100002100002300043700002000066700001900086700001900105245003300124856004700157300000900204490000600213 2018 d 1 aBartłomiej Gardas 1 aJacek Dziarmaga 1 aWojciech Zurek 1 aMichael Zwolak 00 aDefects in Quantum Computers uhttps://doi.org/10.1038/s41598-018-22763-2 a4539 0 v8 00294nas a2200121 4500000000100000000000100001008004100002100002300043700001500066245007500081300001000156490000600166 2018 d 1 aBartłomiej Gardas 1 aS. Deffner 00 aQuantum fluctuation theorem for error diagnostics in quantum annealers a17191 0 v8 00409nas a2200145 4500000000100000000000100001008004100002100002300043700001700066245007300083856007100156300001400227490000800241022001400249 2018 d 1 aBartłomiej Gardas 1 aAndrzej Ptok 00 aCounting defects in quantum computers with Graphics Processing Units uhttp://www.sciencedirect.com/science/article/pii/S0021999118302304 a320 - 326 0 v366 a0021-9991 00373nas a2200145 4500000000100000000000100001008004100002260000800043100002300051700002200074245005700096856005600153300001100209490000700220 2015 d cOct 1 aBartłomiej Gardas 1 aSebastian Deffner 00 aThermodynamic universality of quantum Carnot engines uhttps://link.aps.org/doi/10.1103/PhysRevE.92.042126 a042126 0 v92 00437nas a2200169 4500000000100000000000100001008004100002260000800043100001700051700002000068700002300088700001900111245006400130856005500194300001100249490000700260 2016 d cFeb 1 aAnna Francuz 1 aJacek Dziarmaga 1 aBartłomiej Gardas 1 aWojciech Zurek 00 aSpace and time renormalization in phase transition dynamics uhttp://link.aps.org/doi/10.1103/PhysRevB.93.075134 a075134 0 v93 00286nas a2200133 4500000000100000000000100001008004100002100002300043700001500066700001400081245004100095300001000136490000600146 2016 d 1 aBartłomiej Gardas 1 aS. Deffner 1 aA. Saxena 00 aNon-hermitian quantum thermodynamics a23408 0 v6 00384nas a2200133 4500000000100000000000100001008004100002260000800043100002300051245010200074856005600176300001100232490000700243 2010 d cOct 1 aBartłomiej Gardas 00 aExact reduced dynamics for a qubit in a precessing magnetic field and in contact with a heat bath uhttps://link.aps.org/doi/10.1103/PhysRevA.82.042115 a042115 0 v82 00296nas a2200121 4500000000100000000000100001008004100002100002300043245005200066856003800118300001100156490000700167 2010 d 1 aBartłomiej Gardas 00 aRiccati equation and the problem of decoherence uhttps://doi.org/10.1063/1.3442364 a062103 0 v51 00433nas a2200157 4500000000100000000000100001008004100002260000800043100002300051700002200074700001700096245008800113856005600201300001100257490000700268 2016 d cAug 1 aBartłomiej Gardas 1 aSebastian Deffner 1 aAvadh Saxena 00 aRepeatability of measurements: Non-Hermitian observables and quantum Coriolis force uhttps://link.aps.org/doi/10.1103/PhysRevA.94.022121 a022121 0 v94 00390nas a2200157 4500000000100000000000100001008004100002260000800043100002300051700002200074700001700096245004500113856005600158300001100214490000700225 2016 d cOct 1 aBartłomiej Gardas 1 aSebastian Deffner 1 aAvadh Saxena 00 aPT-symmetric slowing down of decoherence uhttps://link.aps.org/doi/10.1103/PhysRevA.94.040101 a040101 0 v94 00481nas a2200169 4500000000100000000000100001008004100002100002400043700001700067700001900084700002300103245007800126856007100204300001400275490000800289022001400297 2015 d 1 aMichał Januszewski 1 aAndrzej Ptok 1 aDawid Crivelli 1 aBartłomiej Gardas 00 aGPU-based acceleration of free energy calculations in solid state physics uhttp://www.sciencedirect.com/science/article/pii/S0010465515000697 a220 - 227 0 v192 a0010-4655 00412nas a2200169 4500000000100000000000100001008004100002260000700043100002300050700001500073700001200088700001300100245006400113856004900177300000900226490000700235 2015 d c12 1 aBartłomiej Gardas 1 aJ. Łuczka 1 aA. Ptok 1 aJ. Dajka 00 aEnergetics of an rf SQUID Coupled to Two Thermal Reservoirs uhttps://doi.org/10.1371/journal.pone.0143912 a1-10 0 v10 00381nas a2200157 4500000000100000000000100001008004100002260001200043100002300055700001500078700002300093245004800116856003700164490000800201022001400209 2021 d c11/2020 1 aKonrad Jałowiecki 1 aMarek Rams 1 aBartłomiej Gardas 00 aBrute-forcing spin-glass problems with CUDA uhttps://arxiv.org/abs/1904.03621 0 v260 a0010-4655 00361nas a2200145 4500000000100000000000100001008004100002260001200043100001900055700001500074700002300089245005800112856003700170490000800207 2019 d c12/2019 1 aA. Więckowski 1 aS. Deffner 1 aBartłomiej Gardas 00 aDisorder-assisted graph coloring on quantum annealers uhttps://arxiv.org/abs/1903.07056 0 v100 00416nas a2200145 4500000000100000000000100001008004100002260000800043100002300051700001600074245010300090856005900193300001100252490000700263 2014 d capr 1 aBartłomiej Gardas 1 aJerzy Dajka 00 aReply to Comment on `Initial states of qubit–environment models leading to conserved quantities' uhttps://doi.org/10.1088%2F1751-8113%2F47%2F16%2F168002 a168002 0 v47 00496nas a2200145 4500000000100000000000100001008004100002100002300043700001600066245016600082856007100248300000900319490000800328022001400336 2014 d 1 aBartłomiej Gardas 1 aJerzy Dajka 00 aReply to “Comment on: ‘Multi-photon Rabi model: Generalized parity and its applications’ [Phys. Lett. A 377 (2013) 3205]” [Phys. Lett. A 378 (2014) 1969] uhttp://www.sciencedirect.com/science/article/pii/S0375960114004241 a1970 0 v378 a0375-9601 00348nas a2200145 4500000000100000000000100001008004100002260000800043100002300051700001600074245003500090856005900125300001100184490000700195 2013 d cjun 1 aBartłomiej Gardas 1 aJerzy Dajka 00 aNew symmetry in the Rabi model uhttps://doi.org/10.1088%2F1751-8113%2F46%2F26%2F265302 a265302 0 v46 00394nas a2200145 4500000000100000000000100001008004100002260000800043100002300051700001600074245008100090856005900171300001100230490000700241 2013 d cmay 1 aBartłomiej Gardas 1 aJerzy Dajka 00 aInitial states of qubit–environment models leading to conserved quantities uhttps://doi.org/10.1088%2F1751-8113%2F46%2F23%2F235301 a235301 0 v46 00463nas a2200169 4500000000100000000000100001008004100002260000800043100001600051700002300067700001800090245010200108856004600210300001600256490000700272022001400279 2013 d cApr 1 aJerzy Dajka 1 aBartłomiej Gardas 1 aJerzy Łuczka 00 aRelation Between Purity of an Open Qubit Dynamics and Its Initial Correlation with an Environment uhttps://doi.org/10.1007/s10773-012-1430-1 a1148–1159 0 v52 a1572-9575 00406nas a2200145 4500000000100000000000100001008004100002100002300043700001600066245006900082856007100151300001600222490000800238022001400246 2013 d 1 aBartłomiej Gardas 1 aJerzy Dajka 00 aMulti-photon Rabi model: Generalized parity and its applications uhttp://www.sciencedirect.com/science/article/pii/S0375960113009432 a3205 - 3208 0 v377 a0375-9601 00350nas a2200121 4500000000100000000000100001008004100002100002300043245010600066856003800172300001100210490000700221 2011 d 1 aBartłomiej Gardas 00 aRiccati equation and the problem of decoherence II: Symmetry and the solution of the Riccati equation uhttps://doi.org/10.1063/1.3574889 a042104 0 v52 00365nas a2200133 4500000000100000000000100001008004100002260000800043100002300051245008000074856005900154300001100213490000700224 2011 d capr 1 aBartłomiej Gardas 00 aExact solution of the Schrödinger equation with the spin-boson Hamiltonian uhttps://doi.org/10.1088%2F1751-8113%2F44%2F19%2F195301 a195301 0 v44 00434nas a2200169 4500000000100000000000100001008004100002260001200043100002100055700002400076700002200100700002300122700002200145700002300167245006700190490000700257 2023 d c01/2023 1 aKrzysztof Domino 1 aMátyás Koniorczyk 1 aKrzysztof Krawiec 1 aKonrad Jałowiecki 1 aSebastian Deffner 1 aBartłomiej Gardas 00 aQuantum annealing in the NISQ era: railway conflict management 0 v25 00399nas a2200157 4500000000100000000000100001008004100002100002300043700002400066700001700090700002300107245005300130856003700183490000700220022001400227 2020 d 1 aKonrad Jałowiecki 1 aAndrzej Więckowski 1 aPiotr Gawron 1 aBartłomiej Gardas 00 aParallel in time dynamics with quantum annealers uhttps://arxiv.org/abs/1909.04929 0 v10 a2045-2322 00478nas a2200169 4500000000100000000000100001008004100002260000800043100001500051700001900066700001800085700002300103700002300126245009400149856005700243490000800300 2021 d cAug 1 aMarek Rams 1 aMasoud Mohseni 1 aDaniel Eppens 1 aKonrad Jałowiecki 1 aBartłomiej Gardas 00 aApproximate optimization, sampling, and spin-glass droplet discovery with tensor networks uhttps://link.aps.org/doi/10.1103/PhysRevE.104.025308 0 v104 00365nas a2200145 4500000000100000000000100001008004100002100001800043700001600061700002000077700002300097700002200120245006900142490000800211 2022 d 1 aArtur Soriani 1 aPierre Naze 1 aMarcus Bonancca 1 aBartłomiej Gardas 1 aSebastian Deffner 00 aThe three phases of quantum annealing: fast, slow, and very slow 0 v105 00417nas a2200157 4500000000100000000000100001008004100002100001800043700001700061700002000078700002300098700002200121245007100143856003700214490000800251 2022 d 1 aArtur Soriani 1 aPierre Nazé 1 aMarcus Bonança 1 aBartłomiej Gardas 1 aSebastian Deffner 00 aAssessing performance of quantum annealing with non-linear driving uhttps://arxiv.org/abs/2203.17009 0 v105 00448nas a2200145 4500000000100000000000100001008004100002100002600043700002100069700002200090700002300112245010500135856005500240490000700295 2024 d 1 aTomasz Śmierzchalski 1 aZakaria Mzaouali 1 aSebastian Deffner 1 aBartłomiej Gardas 00 aEfficiency Optimization in Quantum Computing: Balancing Thermodynamics and Computational Performance uhttps://www.nature.com/articles/s41598-024-55314-z 0 v14 01245nas a2200181 4500000000100000000000100001008004100002260000700043100002200050700001600072700002300088700002200111245007800133856003800211490000700249520079300256022001401049 2024 d c04 1 aDevjyoti Tripathy 1 aAkram Touil 1 aBartłomiej Gardas 1 aSebastian Deffner 00 aQuantum information scrambling in two-dimensional Bose–Hubbard lattices uhttps://doi.org/10.1063/5.0199335 0 v34 3 aIt is a well-understood fact that the transport of excitations throughout a lattice is intimately governed by the underlying structures. Hence, it is only natural to recognize that the dispersion of information also has to depend on the lattice geometry. In the present work, we demonstrate that two-dimensional lattices described by the Bose–Hubbard model exhibit information scrambling for systems as little as two hexagons. However, we also find that the out-of-time-ordered correlator (OTOC) shows the exponential decay characteristic for quantum chaos only for a judicious choice of local observables. More generally, the OTOC is better described by Gaussian-exponential convolutions, which alludes to the close similarity of information scrambling and decoherence theory.
a1054-1500 01395nas a2200169 4500000000100000000000100001008004100002260001200043100002100055700001700076700002000093700002300113700002200136245006000158490000700218520100000225 2025 d c08/2025 1 aKrzysztof Domino 1 aEmery Doucet 1 aReece Robertson 1 aBartłomiej Gardas 1 aSebastian Deffner 00 aOn the Baltimore Light RailLink into the quantum future 0 v15 3 aIn the current era of noisy intermediate-scale quantum (NISQ) technology, quantum devices present new avenues for addressing complex, real-world challenges including potentially NP-hard optimization problems. This work aims to showcase how the inherent noise in NISQ devices can be leveraged to solve such real-world problems effectively. Utilizing a D-Wave quantum annealer and IonQ's gate-based NISQ computers, we generate and analyze solutions for managing train traffic under stochastic disturbances. Our case study focuses on the Baltimore Light RailLink, which embodies the characteristics of both tramway and railway networks. We explore the feasibility of using NISQ technology to model the stochastic nature of disruptions in these transportation systems. Our research marks the inaugural application of both quantum computing paradigms to tramway and railway rescheduling, highlighting the potential of quantum noise as a beneficial resource in complex optimization scenarios.
00503nas a2200181 4500000000100000000000100001008004100002260001800043100001900061700001900080700001400099700002200113700002300135700002100158245007700179856005700256490000800313 2024 d c12 July, 2024 1 aKhadija Hawary 1 aMohamed Azzouz 1 aMorad Baz 1 aSebastian Deffner 1 aBartłomiej Gardas 1 aZakaria Mzaouali 00 aNavigating the phase diagram of quantum many-body systems in phase space uhttps://link.aps.org/doi/10.1103/PhysRevE.110.014120 0 v110 00542nas a2200169 4500000000100000000000100001008004100002260010600043100002000149700001700169700002100186700002100207700002300228700002200251245004900273856005000322 2025 d c12/2025 bIEEE International Conference on Quantum Computing and Engineering (QCE25) aAlbuquerque, USA 1 aReece Robertson 1 aEmery Doucet 1 aZakaria Mzaouali 1 aKrzysztof Domino 1 aBartłomiej Gardas 1 aSebastian Deffner 00 aSimon's Period Finding on a Quantum Annealer uhttps://ieeexplore.ieee.org/document/11250344 02601nas a2200181 4500000000100000000000100001008004100002260001200043100001800055700002600073700002300099700001500122700001900137245012900156856006200285490000700347520206500354 2025 d c05/2025 1 aAnna Dziubyna 1 aTomasz Śmierzchalski 1 aBartłomiej Gardas 1 aMarek Rams 1 aMasoud Mohseni 00 aLimitations of tensor-network approaches for optimization and sampling: A comparison to quantum and classical Ising machines uhttps://link.aps.org/doi/10.1103/PhysRevApplied.23.054049 0 v23 3 aOptimization problems pose challenges across various fields. In recent years, quantum annealers have emerged as a promising platform for tackling such challenges. Here, to provide an additional perspective, we develop a heuristic tensor-network-based algorithm to reveal the low-energy spectra of Ising spin-glass systems with interaction graphs relevant to present-day quantum annealers. Our deterministic approach combines a branch-and-bound search strategy with an approximate calculation of marginals via tensor-network contractions. Its application to quasi-two-dimensional lattices with large unit cells of up to 24 spins, realized in current quantum annealing processors, requires a dedicated approach that uses sparse structures in the tensor-network representation and GPU hardware acceleration. We benchmark our approach on random problems defined on Pegasus and Zephyr graphs with up to a few thousand spins, comparing it against the D-Wave Advantage quantum annealer and the simulated bifurcation algorithm, with the latter representing an emerging class of classical Ising solvers. In addition to examining the quality of the best solutions, we compare the diversity of low-energy states sampled by all the solvers. For the largest considered independent and identically distributed problems with over 5000 spins, the state-of-the-art tensor-network approaches lead to solutions that are 0.1% to 1% worse than the best solutions obtained by Ising machines while being 2 orders of magnitude slower. We attribute these results to approximate contraction failures. For embedded tile planting instances, our approach reaches approximately 0.1% from the planted ground state, a factor of 3 better than the Ising solvers. While all three methods can output diverse low-energy solutions—e.g., differing by at least a quarter of spins with energy error below 1%—our deterministic branch-and-bound approach finds sets of a few such states at most. In contrast, both Ising machines prove capable of sampling sets of thousands of such solutions.
01649nas a2200193 4500000000100000000000100001008004100002260000700043100002000050700002400070700002300094700001500117700001900132245007900151856003800230490000800268520116500276022001401441 2025 d c09 1 aSubhajit Sarkar 1 aGabriela Wójtowicz 1 aBartłomiej Gardas 1 aMarek Rams 1 aMichael Zwolak 00 aApproaching the scaling limit of transport through lattices with dephasing uhttps://doi.org/10.1063/5.0283282 0 v163 3 aWe examine the stationary-state equations for lattices with generalized Markovian dephasing and relaxation. When the Hamiltonian is quadratic, the single-particle correlation matrix has a closed system of equations even in the presence of these two processes. The resulting equations have a vectorized form related to, but distinct from, Lyapunov’s equation. We present an efficient solution that helps to achieve the scaling limit, e.g., of the current decay with lattice length. As an example, we study the super-diffusive-to-diffusive transition in a lattice with long-range hopping and dephasing. The approach enables calculations with up to 104 sites, representing an increase of 10 to 40 times over prior studies. This enables a more precise extraction of the diffusion exponent, enhances agreement with theoretical results, and supports the presence of a phase transition. There is a wide range of problems that have Markovian relaxation, noise, and driving. They include quantum networks for machine-learning-based classification and extended reservoir approaches for transport. The results here will be useful for these classes of problems.
a0021-9606 00448nas a2200157 4500000000100000000000100001008004100002260001500043100002100058700002100079700002100100700002300121245007300144856006600217490000700283 2026 d c21/04/2026 1 aPhilipp Hanussek 1 aJakub Pawłowski 1 aZakaria Mzaouali 1 aBartłomiej Gardas 00 aQuantum-inspired dynamical models on quantum and classical annealers uhttps://journals.aps.org/prapplied/abstract/10.1103/rrf3-jm5m 0 v25 00429nas a2200169 4500000000100000000000100001008004100002260001200043100001700055700002100072700002000093700002300113700002200136700002100158245006900179300001100248 2026 d c05/2026 1 aEmery Doucet 1 aZakaria Mzaouali 1 aReece Robertson 1 aBartłomiej Gardas 1 aSebastian Deffner 1 aKrzysztof Domino 00 aThermodynamic significance of QUBO encoding on quantum annealers a054512 00409nas a2200145 4500000000100000008004100001100002000042700002600062700001700088700002300105700002200128700002100150245005500171856003700226 2026 d 1 aJakub Pawlowski 1 aTomasz Śmierzchalski 1 aFengping Jin 1 aBartłomiej Gardas 1 aSebastian Deffner 1 aZakaria Mzaouali 00 aQuantum annealers as programmable thermal machines uhttps://arxiv.org/abs/2608.04564 01106nas a2200157 4500000000100000000000100001008004100002100002300043700001900066700002200085700002200107245004600129856004000175490000700215520072600222 2016 d 1 aRadosław Adamczak 1 aRafał Latała 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aAsymptotic entropic uncertainty relations uhttp://dx.doi.org/10.1063/1.4944425 0 v57 3 aEntropic uncertainty relations are analyzed for the case of N-dimensional Hilbert space and two orthogonal measurements performed in two generic bases, related by a Haar random unitary matrix U. We derive estimations for the average norms of truncations of U of a given size, which allow us to study state-independent lower bounds for the sum of two entropies describing the measurements outcomes. In particular, we show that the Maassen–Uffink bound asymptotically behaves as lnN−lnlnN−ln2, while the strong entropic majorization relation yields a nearly optimal bound, lnN−const. Analogous results are also obtained for a more general case of several orthogonal measurements performed in generic bases.
01687nas a2200181 4500000000100000000000100001008004100002100001800043700001700061700001800078700002200096700002200118245006900140300001600209490000800225520125800233022001401491 2011 d 1 aCharles Dunkl 1 aPiotr Gawron 1 aJ.A. Holbrook 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aNumerical shadows: measures and densities on the numerical range a2042–2080 0 v434 3 aFor any operator M acting on an N-dimensional Hilbert space H\_N we introduce its numerical shadow, which is a probability measure on the complex plane supported by the numerical range of M. The shadow of M at point z is defined as the probability that the inner product (Mu,u) is equal to z, where u stands for a random complex vector from H\_N, satisfying ||u||=1. In the case of N=2 the numerical shadow of a non-normal operator can be interpreted as a shadow of a hollow sphere projected on a plane. A similar interpretation is provided also for higher dimensions. For a hermitian M its numerical shadow forms a probability distribution on the real axis which is shown to be a one dimensional B-spline. In the case of a normal M the numerical shadow corresponds to a shadow of a transparent solid simplex in R^{N-1} onto the complex plane. Numerical shadow is found explicitly for Jordan matrices J\_N, direct sums of matrices and in all cases where the shadow is rotation invariant. Results concerning the moments of shadow measures play an important role. A general technique to study numerical shadow via the Cartesian decomposition is described, and a link of the numerical shadow of an operator to its higher-rank numerical range is emphasized. a0024-3795 01465nas a2200169 4500000000100000000000100001000000100002008004100003100001700044700002200061700002200083245007400105856003800179300001600217490000700233520105500240 2015 d 1 aM. Enríquez 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aMinimal Renyi-Ingarden-Urbanik entropy of multipartite quantum states uhttps://doi.org/10.3390/e17075063 a5063–5084 0 v17 3 aWe study the entanglement of a pure state of a composite quantum system consisting of several subsystems with d levels each. It can be described by the R'enyi-Ingarden-Urbanik entropy Sq of a decomposition of the state in a product basis, minimized over all local unitary transformations. In the case q=0 this quantity becomes a function of the rank of the tensor representing the state, while in the limit q→∞ the entropy becomes related to the overlap with the closest separable state and the geometric measure of entanglement. For any bipartite system the entropy S1 coincides with the standard entanglement entropy. We analyze the distribution of the minimal entropy for random states of three and four-qubit systems. In the former case the distributions of 3-tangle is studied and some of its moments are evaluated, while in the latter case we analyze the distribution of the hyperdeterminant. The behavior of the maximum overlap of a three-qudit system with the closest separable state is also investigated in the asymptotic limit.
00323nas a2200157 4500000000100000000000100001000000100002008004100003100001700044700001900061700002200080245003000102300001200132490000700144022001400151 2013 d 1 aPiotr Gawron 1 aDariusz Kurzyk 1 aZbigniew Puchała 00 aA model for quantum queue a1350023 0 v11 a0219-7499 01225nas a2200169 4500000000100000000000100001000000100002008004100003100002300044700002200067700002100089245008600110300001400196490000700210520081700217022002101034 2007 d 1 aPrzemysław Głomb 1 aZbigniew Puchała 1 aArkadiusz Sochan 00 aContext selection for efficient bit modeling of contourlet transform coefficients a135–146 0 v19 3 aContourlet transform is named as one possible successor to the wavelet transform as a tool for representation of image information. It has better properties in representation of edge information, which make it suitable for designing image compression systems. It is not clear, however, how to exploit the statistical structure of the coefficients generated by this transform in effective compression algorithm. In this work, authors propose a general, nonparametric method to achieve context map, thus allowing for efficient application of EBCOT/JPEG 2000 bit modeling and encoding approach to contourlet transformed images. The article presents the derivation of the method and experiments performed on a publicly available image set. Keywords: contourlet transform, coefficient bit modeling, context estimation aISSN 1896–5334 01585nas a2200157 4500000000100000000000100001008004100002100002200043700002200065700002200087245007200109856004700181300001100228490000700239520118100246 2014 d 1 aA. Lakshminarayan 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aDiagonal unitary entangling gates and contradiagonal quantum states uhttps://doi.org/10.1103/PhysRevA.90.032303 a032303 0 v90 3 aNonlocal properties of an ensemble of diagonal random unitary matrices of order N2 are investigated. The average Schmidt strength of such a bipartite diagonal quantum gate is shown to scale as logN, in contrast to the logN2 behavior characteristic to random unitary gates. Entangling power of a diagonal gate U is related to the von Neumann entropy of an auxiliary quantum state ρ=AA†/N2, where the square matrix A is obtained by reshaping the vector of diagonal elements of U of length N2 into a square matrix of order N. This fact provides a motivation to study the ensemble of non-hermitian unimodular matrices A, with all entries of the same modulus and random phases and the ensemble of quantum states ρ, such that all their diagonal entries are equal to 1/N. Such a state is contradiagonal with respect to the computational basis, in sense that among all unitary equivalent states it maximizes the entropy copied to the environment due to the coarse graining process. The first four moments of the squared singular values of the unimodular ensemble are derived, based on which we conjecture a connection to a recently studied combinatorial object called the
00745nas a2200133 4500000000100000000000100001000000100002008004100003100002200044245004500066300001400111490000700125520047900132 2013 d 1 aZbigniew Puchała 00 aLocal controllability of quantum systems a459–466 0 v12 3 aWe give a criterion that is sufficient for controllability of multipartite quantum systems. We generalize the graph infection criterion to the quantum systems that cannot be described with the use of a graph theory. We introduce the notation of hypergraphs and reformulate the infection property in this setting. The introduced criterion has a topological nature and therefore it is not connected to any particular experimental realization of quantum information processing. 00420nas a2200133 4500000000100000000000100001000000100002008004100003100002200044245005900066300001400125490000700139520014000146 2005 d 1 aZbigniew Puchała 00 aProof of Grabiner's theorem on non-colliding particles a129–132 0 v25 3 aA detail proof of Grabiner's theorem [1] on the exact asymptotics of the time to collision for n independent Brownian motions is given. 01268nas a2200169 4500000000100000000000100001008004100002100002200043700001500065700001400080700001300094245008900107856004700196300001100243490000700254520083700261 2015 d 1 aZbigniew Puchała 1 aA. Jencova 1 aM. Sedlak 1 aM. Ziman 00 aExploring boundaries of quantum convex structures: Special role of unitary processes uhttps://doi.org/10.1103/PhysRevA.92.012304 a012304 0 v92 3 aWe address the question of finding the most effective convex decompositions into boundary elements (so-called boundariness) for sets of quantum states, observables and channels. First we show that in general convex sets the boundariness essentially coincides with the question of the most distinguishable element, thus, providing an operational meaning for this concept. Unexpectedly, we discovered that for any interior point of the set of channels the optimal decomposition necessarily contains a unitary channel. In other words, for any given channel the best distinguishable one is some unitary channel. Further, we prove that boundariness is sub-multiplicative under composition of systems and explicitly evaluate its maximal value that is attained only for the most mixed elements of the considered convex structures.
00364nas a2200133 4500000000100000000000100001008004100002260000700043100002200050700001400072245012200086300001400208490000800222 2008 d c11 1 aZbigniew Puchała 1 aT. Rolski 00 aThe exact asymptotic of the collision time tail distribution for independent Brownian particles with different drifts a595–617 0 v3-4 00758nas a2200157 4500000000100000000000100001000000100002008004100003260000700044100002200051700001400073245005000087300001600137490000700153520044000160 2005 d c11 1 aZbigniew Puchała 1 aT. Rolski 00 aThe exact asymptotic of the time to collision a1359–1380 0 v10 3 aAbstract In this note we consider the time of the collision $tau$ for $n$ independent copies of Markov processes $X^1_t,. . .,X^n_t$, each starting from $x_i$,where $x_1 t) = t^{-n(n-1)/4}(Ch(x)+o(1)),$ where $C$ is known and $h(x)$ is the Vandermonde determinant. From the proof one can see that the result also holds for $X_t$ being the Brownian motion or the Poisson process. An application to skew standard Young tableaux is given. 00948nas a2200181 4500000000100000000000100001008004100002100002200043700001700065700001500082700001600097700002200113245007500135856004700210300001100257490000700268520049100275 2015 d 1 aZbigniew Puchała 1 aŁ. Rudnicki 1 aK. Chabuda 1 aM. Paraniak 1 aKarol Życzkowski 00 aCertainty relations, mutual entanglement and non-displacable manifolds uhttps://doi.org/10.1103/PhysRevA.92.032109 a032109 0 v92 3 a{We derive explicit bounds for the average entropy characterizing measurements of a pure quantum state of size N in L orthogonal bases. Lower bounds lead to novel entropic uncertainty relations, while upper bounds allow us to formulate universal certainty relations. For L=2 the maximal average entropy saturates at logN as there exists a mutually coherent state, but certainty relations are shown to be nontrivial for L≥3 measurements. In the case of a prime power dimension
01158nas a2200145 4500000000100000000000100001008004100002100002200043700001700065700002200082245004800104300001100152490000700163520084200170 2013 d 1 aZbigniew Puchała 1 aŁ. Rudnicki 1 aKarol Życzkowski 00 aMajorization entropic uncertainty relations a272002 0 v46 3 aEntropic uncertainty relations in a finite dimensional Hilbert space are investigated. Making use of the majorization technique we derive explicit lower bounds for the sum of Renyi entropies describing probability distributions associated with a given pure state expanded in eigenbases of two observables. The bounds obtained are expressed in terms of the largest singular values of submatrices of the unitary rotation matrix. For a generic unitary matrix of size N = 5 the bound obtained is stronger than the one of Maassen and Uffink (MU) with probability larger than 98%, and this ratio increases with N. We show also that the bounds investigated are invariant for unitary matrices equivalent up to dephasing and permutation and derive a classical analogue of the MU uncertainty relation formulated for stochastic transition matrices. 01182nas a2200169 4500000000100000000000100001000000100002008004100003100001800044700002200062700001700084700002200101245005600123300001100179490000700190520081500197 2013 d 1 aWojciech Roga 1 aZbigniew Puchała 1 aŁ. Rudnicki 1 aKarol Życzkowski 00 aEntropic trade-off relations for quantum operations a032308 0 v87 3 aSpectral properties of an arbitrary matrix can be characterized by the entropy of its rescaled singular values. Any quantum operation can be described by the associated dynamical matrix or by the corresponding superoperator. The entropy of the dynamical matrix describes the degree of decoherence introduced by the map, while the entropy of the superoperator characterizes the a priori knowledge of the receiver of the outcome of a quantum channel Φ. We prove that for any map acting on an N-dimensional quantum system the sum of both entropies is not smaller than lnN. For any bistochastic map this lower bound reads 2lnN. We investigate also the corresponding Rényi entropies, providing an upper bound for their sum, and analyze the entanglement of the bi-partite quantum state associated with the channel. 01054nas a2200181 4500000000100000000000100001000000100002008004100003100001700044700002200061700002100083700002200104245006000126856005100186300001100237490000700248520061700255 2014 d 1 aŁ. Rudnicki 1 aZbigniew Puchała 1 aPaweł Horodecki 1 aKarol Życzkowski 00 aConstructive entanglement test from triangle inequality uhttps://doi.org/10.1088/1751-8113/47/42/424035 a424035 0 v47 3 aWe derive a simple lower bound on the geometric measure of entanglement for mixed quantum states in the case of a general multipartite system. The main ingredient of the presented derivation is the triangle inequality applied to the root infidelity distance in the space of density matrices. The obtained bound leads to entanglement criteria with a straightforward interpretation. The proposed criteria provide an experimentally accessible, powerful entanglement test. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to '50 years of Bell's theorem'.
01086nas a2200169 4500000000100000000000100001000000100002008004100003100001700044700002200061700002100083700002200104245004400126300001100170490000700181520072800188 2012 d 1 aŁ. Rudnicki 1 aZbigniew Puchała 1 aPaweł Horodecki 1 aKarol Życzkowski 00 aCollectibility for Mixed Quantum States a062329 0 v86 3 aBounds analogous to entropic uncertainty relations allow one to design practical tests to detect quantum entanglement by a collective measurement performed on several copies of the state analyzed. This approach, initially worked out for pure states only [ Phys. Rev. Lett. 107 150502 (2011)], is extended here for mixed quantum states. We define collectibility for any mixed states of a multipartite system. Deriving bounds for collectibility for positive partially transposed states of given purity provides insight into the structure of entangled quantum states. In the case of two qubits the application of complementary measurements and coincidence based detections leads to a test of entanglement of pseudopure states. 01301nas a2200169 4500000000100000000000100001000000100002008004100003100001700044700002200061700002200083245005500105856004700160300001100207490000700218520090600225 2014 d 1 aŁ. Rudnicki 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aStrong Majorization Entropic Uncertainty Relations uhttps://doi.org/10.1103/PhysRevA.89.052115 a052115 0 v89 3 aWe analyze entropic uncertainty relations in a finite dimensional Hilbert space and derive several strong bounds for the sum of two entropies obtained in projective measurements with respect to any two orthogonal bases. We improve the recent bounds by Coles and Piani [ArXiv:1307.4265], which are known to be stronger than the well known result of Maassen and Uffink. Furthermore, we find a novel bound based on majorization techniques, which also happens to be stronger than the recent results involving largest singular values of submatrices of the unitary matrix connecting both bases. The firsts set of new bounds give better results for unitary matrices close to the Fourier matrix, while the second one works better in the opposite sectors. Some results derived admit generalization to arbitrary mixed states and the bounds are increased by the von Neumann entropy of the measured state
00817nas a2200157 4500000000100000000000100001008004100002100002100043700002200064700002200086245006000108856004500168300000700213490000600220520043300226 2018 d 1 aŁukasz Rudnicki 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aGauge invariant information concerning quantum channels uhttps://doi.org/10.22331/q-2018-04-11-60 a60 0 v2 3 aMotivated by the gate set tomography we study quantum channels from the perspective of information which is invariant with respect to the gauge realized through similarity of matrices representing channel superoperators. We thus use the complex spectrum of the superoperator to provide necessary conditions relevant for complete positivity of qubit channels and to express various metrics such as average gate fidelity.
00428nas a2200157 4500000000100000000000100001008004100002100001400043700002300057700002100080700002200101245008700123856004600210300000700256490000700263 2018 d 1 aAdam Glos 1 aAleksandra Krawiec 1 aRyszard Kukulski 1 aZbigniew Puchała 00 aVertices cannot be hidden from quantum spatial search for almost all random graphs uhttps://doi.org/10.1007/s11128-018-1844-7 a81 0 v17 01221nas a2200157 4500000000100000000000100001008004100002100002200043700002100065700002300086700002200109245006400131856004500195490000700240520081600247 2018 d 1 aZbigniew Puchała 1 aŁukasz Rudnicki 1 aAleksandra Krawiec 1 aKarol Życzkowski 00 aMajorization uncertainty relations for mixed quantum states uhttps://doi.org/10.1088/1751-8121/aab66c 0 v51 3 aMajorization uncertainty relations are generalized for an arbitrary mixed quantum state ρ of a finite size N. In particular, a lower bound for the sum of two entropies characterizing probability distributions corresponding to measurements with respect to arbitrary two orthogonal bases is derived in terms of the spectrum of ρ and the entries of a unitary matrix U relating both bases. The obtained results can also be formulated for two measurements performed on a single subsystem of a bipartite system described by a pure state, and consequently expressed as uncertainty relation for the sum of conditional entropies.
01890nas a2200181 4500000000100000000000100001008004100002260001200043100001900055700002700074700002200101700002200123245003300145856004500178300001100223490000700234520146700241 2018 d c04/2018 1 aKamil Korzekwa 1 aStanisław Czachórski 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aCoherifying quantum channels uhttps://doi.org/10.1088/1367-2630/aaaff3 a043028 0 v20 3 aIs it always possible to explain random stochastic transitions between states of a finite-dimensional system as arising from the deterministic quantum evolution of the system? If not, then what is the minimal amount of randomness required by quantum theory to explain a given stochastic process? Here, we address this problem by studying possible coherifications of a quantum channel $\Phi$, i.e., we look for channels $\Phi^{\mathcal{C}}$ that induce the same classical transitions $T$, but are "more coherent". To quantify the coherence of a channel $\Phi$ we measure the coherence of the corresponding Jamio{\l}kowski state $J_{\Phi}$. We show that the classical transition matrix $T$ can be coherified to reversible unitary dynamics if and only if $T$ is unistochastic. Otherwise the Jamio{\l}kowski state $J_\Phi^{\mathcal{C}}$ of the optimally coherified channel is mixed, and the dynamics must necessarily be irreversible. To asses the extent to which an optimal process $\Phi^{\mathcal{C}}$ is indeterministic we find explicit bounds on the entropy and purity of $J_\Phi^{\mathcal{C}}$, and relate the latter to the unitarity of $\Phi^{\mathcal{C}}$. We also find optimal coherifications for several classes of channels, including all one-qubit channels. Finally, we provide a non-optimal coherification procedure that works for an arbitrary channel $\Phi$ and reduces its rank (the minimal number of required Kraus operators) from $d^2$ to $d$.
01551nas a2200157 4500000000100000000000100001008004100002100002200043700002200065700002200087245009300109856003900202300001100241490000800252520113300260 2019 d 1 aMichał Oszmaniec 1 aFilip Maciejewski 1 aZbigniew Puchała 00 aSimulating all quantum measurements using only projective measurements and postselection uhttps://arxiv.org/abs/1807.08449v1 a012351 0 v100 3 aImplementation of generalized quantum measurements is often experimentally demanding, as it requires performing a projective measurement on a system of interest extended by the ancilla. We report an alternative scheme for implementing generalized measurements that uses solely: (a) classical randomness and post-processing, (b) projective measurements on a relevant quantum system and (c) postselection on non-observing certain outcomes. The method implements arbitrary quantum measurement in d dimensional system with success probability 1/d. It is optimal in the sense that for any dimensionn d there exist measurements for which the success probability cannot be higher. We apply our results to bound the relative power of projective and generalised measurements for unambiguous state discrimination. Finally, we test our scheme experimentally on IBM quantum processor. Interestingly, due to noise involved in the implementation of entangling gates, the quality with which our scheme implements generalized qubit measurements is higher than the one obtained with the standard construction using the auxiliary system.
01353nas a2200169 4500000000100000000000100001008004100002100001900043700002700062700002200089700002200111245006900133856003700202300001100239490000700250520092600257 2019 d 1 aKamil Korzekwa 1 aStanisław Czachórski 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aDistinguishing classically indistinguishable states and channels uhttps://arxiv.org/abs/1812.09083 a475303 0 v52 3 aWe investigate an original family of quantum distinguishability problems, where the goal is to perfectly distinguish between M quantum states that become identical under a completely decohering map. Similarly, we study distinguishability of M quantum channels that cannot be distinguished when one is restricted to decohered input and output states. The studied problems arise naturally in the presence of a superselection rule, allow one to quantify the amount of information that can be encoded in phase degrees of freedom (coherences), and are related to time-energy uncertainty relation. We present a collection of results on both necessary and sufficient conditions for the existence of M perfectly distinguishable states (channels) that are classically indistinguishable.
01400nas a2200157 4500000000100000000000100001008004100002100002200043700002100065700002200086245005600108856003700164300001400201490000800215520101900223 2019 d 1 aZbigniew Puchała 1 aŁukasz Rudnicki 1 aKarol Życzkowski 00 aPauli semigroups and unistochastic quantum channels uhttps://arxiv.org/abs/1903.12448 a2376-2381 0 v383 3 aWe adopt the perspective of similarity equivalence, in gate set tomography called the gauge, to analyze various properties of quantum operations belonging to a semigroup, Φ=e^{Lt},and therefore given through the Lindblad operator. We first observe that the non unital part of the channel decouples from the time evolution. Focusing on unital operations we restrict our attention to the single-qubit case, showing that the semigroup embedded inside the tetrahedron of Pauli channels is bounded by the surface composed of product probability vectors and includes the identity map together with the maximally depolarizing channel. Consequently, every member of the Pauli semigroup is unitarily equivalent to a unistochastic map, describing a coupling with one-qubit environment initially in the maximally mixed state, determined by a unitary matrix of order four.
01737nas a2200169 4500000000100000000000100001008004100002260001300043100001900056700002200075700002100097700002200118245005800140856004800198490000700246520131400253 2022 d c03/2022 1 aKamil Korzekwa 1 aZbigniew Puchała 1 aMarco Tomamichel 1 aKarol Życzkowski 00 aEncoding classical information into quantum resources uhttps://dx.doi.org/10.1109/TIT.2022.3157440 0 v68 3 aWe introduce and analyse the problem of encoding classical information into different resources of a quantum state. More precisely, we consider a general class of communication scenarios characterised by encoding operations that commute with a unique resource destroying map and leave free states invariant. Our motivating example is given by encoding information into coherences of a quantum system with respect to a fixed basis (with unitaries diagonal in that basis as encodings and the decoherence channel as a resource destroying map), but the generality of the framework allows us to explore applications ranging from super-dense coding to thermodynamics. For any state, we find that the number of messages that can be encoded into it using such operations in a one-shot scenario is upper-bounded in terms of the information spectrum relative entropy between the given state and its version with erased resources. Furthermore, if the resource destroying map is a twirling channel over some unitary group, we find matching one-shot lower-bounds as well. In the asymptotic setting where we encode into many copies of the resource state, our bounds yield an operational interpretation of resource monotones such as the relative entropy of coherence and its corresponding relative entropy variance.
00419nas a2200157 4500000000100000000000100001008004100002260001200043100002300055700002500078700002200103700002300125245006800148856003800216490000700254 2021 d c07/2021 1 aFereshte Shahbeigi 1 aDavid Amaro-Alcalá 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aLog-Convex set of Lindblad semigroups acting on N -level system uhttps://doi.org/10.1063/5.0009745 0 v62 01608nas a2200157 4500000000100000000000100001008004100002100003200043700001900075700002200094700002200116245006800138856003800206490000700244520119900251 2022 d 1 aGrzegorz Rajchel-Mieldzioć 1 aKamil Korzekwa 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aAlgebraic and geometric structures inside the Birkhoff polytope uhttps://doi.org/10.1063/5.0046581 0 v63 3 aThe Birkhoff polytope Bd consisting of all bistochastic matrices of order d assists researchers from many areas, including combinatorics, statistical physics and quantum information. Its subset Ud of unistochastic matrices, determined by squared moduli of unitary matrices, is of a particular importance for quantum theory as classical dynamical systems described by unistochastic transition matrices can be quantised. In order to investigate the problem of unistochasticity we introduce the set Ld of bracelet matrices that forms a subset of Bd , but a superset of Ud . We prove that for every dimension d this set contains the set of factorisable bistochastic matrices Fd and is closed under matrix multiplication by elements of Fd. Moreover, we prove that both Ld and Fd are star-shaped with respect to the flat matrix. We also analyse the set of d × d unistochastic matrices arising from circulant unitary matrices, and show that their spectra lie inside d-hypocycloids on the complex plane. Finally, applying our results to small dimensions, we fully characterise the set of circulant unistochastic matrices of order d ≤ 4, and prove that such matrices form a monoid for d = 3.
01790nas a2200181 4500000000100000000000100001008004100002260001200043100002200055700001900077700002000096700002100116700002200137245002800159856004800187490000800235520136500243 2021 d c11/2021 1 aZbigniew Puchała 1 aKamil Korzekwa 1 aRoberto Salazar 1 aPaweł Horodecki 1 aKarol Życzkowski 00 aDephasing superchannels uhttps://doi.org/10.1103/PhysRevA.104.052611 0 v104 3 aWe characterise a class of environmental noises that decrease coherent properties of quantum channels by introducing and analysing the properties of dephasing superchannels. These are defined as superchannels that affect only non-classical properties of a quantum channel E, i.e., they leave invariant the transition probabilities induced by E in the distinguished basis. We prove that such superchannels ΞC form a particular subclass of Schur-product supermaps that act on the Jamiolkowski state J(E) of a channel E via a Schur product, J′=J∘C. We also find physical realizations of general ΞC through a pre- and post-processing employing dephasing channels with memory, and show that memory plays a non-trivial role for quantum systems of dimension d>2. Moreover, we prove that coherence generating power of a general quantum channel is a monotone under dephasing superchannels. Finally, we analyse the effect dephasing noise can have on a quantum channel E by investigating the number of distinguishable channels that E can be mapped to by a family of dephasing superchannels. More precisely, we upper bound this number in terms of hypothesis testing channel divergence between E and its fully dephased version, and also relate it to the robustness of coherence of E.
00389nas a2200145 4500000000100000000000100001008004100002260001200043100002100055700002400076700002200100245006700122856004700189490000700236 2022 d c08/2022 1 aKrzysztof Domino 1 aMátyás Koniorczyk 1 aZbigniew Puchała 00 aStatistical quality assessment of Ising-based annealer outputs uhttps://doi.org/10.1007/s11128-022-03623-5 0 v21 01444nas a2200169 4500000000100000000000100001008004100002260001200043100001800055700002300073700002200096700002200118245006400140856004600204490000700250520101700257 2022 d c08/2022 1 aKoorosh Sadri 1 aFereshte Shahbeigi 1 aZbigniew Puchała 1 aKarol Życzkowski 00 aAccessible maps in a group of classical or quantum channels uhttps://doi.org/10.1142/S1230161222500020 0 v29 3 aWe study the problem of accessibility in a set of classical and quantum channels admitting a group structure. Group properties of the set of channels, and the structure of the closure of the analyzed group G plays a pivotal role in this regard. The set of all convex combinations of the group elements contains a subset of channels that are accessible by a dynamical semigroup. We demonstrate that accessible channels are determined by probability vectors of weights of a convex combination of the group elements, which depend neither on the dimension of the space on which the channels act, nor on the specific representation of the group. Investigating geometric properties of the set A of accessible maps we show that this set is non-convex, but it enjoys the star-shape property with respect to the uniform mixture of all elements of the group. We demonstrate that the set A covers a positive volume in the polytope of all convex combinations of the elements of the group.
00355nas a2200121 4500000000100000000000100001008004100002100002200043700002200065700002200087245007900109856004500188 2023 d 1 aFilip Maciejewski 1 aZbigniew Puchała 1 aMichał Oszmaniec 00 aExploring Quantum Average-Case Distances: Proofs, properties, and examples uhttps://doi.org/10.1109/TIT.2023.3250100 00343nas a2200133 4500000000100000000000100001008004100002100002200043700002200065700002200087245004700109856004700156490000600203 2023 d 1 aFilip Maciejewski 1 aZbigniew Puchała 1 aMichał Oszmaniec 00 aOperational Quantum Average-Case Distances uhttps://doi.org/10.22331/q-2023-09-11-1106 0 v7 01618nas a2200157 4500000000100000000000100001008004100002260001000043100003200053700002200085700001900107245002100126856004700147490000600194520126000200 2024 d c07/24 1 aHanna Wojewódka-Ściążko 1 aZbigniew Puchała 1 aKamil Korzekwa 00 aResource engines uhttps://doi.org/10.22331/q-2024-01-10-1222 0 v8 3 aIn this paper we aim to push the analogy between thermodynamics and quantum resource theories one step further. Previous inspirations were based on thermodynamic considerations concerning scenarios with a single heat bath, neglecting an important part of thermodynamics that studies heat engines operating between two baths at different temperatures. Here, we investigate the performance of resource engines, which replace the access to two heat baths at different temperatures with two arbitrary constraints on state transformations. The idea is to imitate the action of a two--stroke heat engine, where the system is sent to two agents (Alice and Bob) in turns, and they can transform it using their constrained sets of free operations. We raise and address several questions, including whether or not a resource engine can generate a full set of quantum operations or all possible state transformations, and how many strokes are needed for that. We also explain how the resource engine picture provides a natural way to fuse two or more resource theories, and we discuss in detail the fusion of two resource theories of thermodynamics with two different temperatures, and two resource theories of coherence with respect to two different bases.