00594nas a2200133 4500000000100000000000100001008004100002100002300043700002200066245006700088300001100155490000700166520028700173 2012 d1 aBartłomiej Gardas1 aZbigniew Puchała00aNotes on the Riccati operator equation in open quantum systems a0121060 v533 a

Recent problem [B. Gardas, J. Math. Phys. {bf 52}, 042104 (2011)] concerning an antilinear solution of the Riccati equation is solved. We also exemplify that a simplification of the Riccati equation, even under reasonable assumptions, can lead to a not equivalent equation.

00672nas a2200145 4500000000100000000000100001000000100002008004100003100002300044700002200067245005600089300001100145490000700156520036300163 2011 d1 aBartłomiej Gardas1 aZbigniew Puchała00aStationary states of two-level open quantum systems a2153060 v443 a

A problem of finding stationary states of open quantum systems is addressed. We focus our attention on a generic type of open system: a qubit coupled to its environment. We apply the theory of block operator matrices and find stationary states of two-level open quantum systems under certain conditions applied on both the qubit and the surrounding.

01187nas a2200181 4500000000100000000000100001000000100002008004100003100002200044700002200066700001700088700002300105245007600128300001100204490000700215520076900222022001400991 2011 d1 aZbigniew Puchała1 aJaroslaw Miszczak1 aPiotr Gawron1 aBartłomiej Gardas00aExperimentally feasible measures of distance between quantum operations a1–120 v103 a

We present two measures of distance between quantum processes which can be measured directly in laboratory without resorting to process tomography. The measures are based on the superfidelity, introduced recently to provide an upper bound for quantum fidelity. We show that the introduced measures partially fulfill the requirements for distance measure between quantum processes. We also argue that they can be especially useful as diagnostic measures to get preliminary knowledge about imperfections in an experimental setup. In particular we provide quantum circuit which can be used to measure the superfidelity between quantum processes. We also provide a physical interpretation of the introduced metrics based on the continuity of channel capacity.

 a1570-075500471nas a2200169 4500000000100000000000100001008004100002100002100043700002200064700002300086700001700109700002200126245006400148856007000212300001100282490000800293 2019 d1 aJakub Czartowski1 aKonrad Szymański1 aBartłomiej Gardas1 aYan Fyodorov1 aKarol Życzkowski00aSeparability gap and large deviation entanglement criterion uhttps://journals.aps.org/pra/abstract/10.1103/PhysRevA.100.042326 a0423260 v10000407nas a2200157 4500000000100000000000100001008004100002260000800043100002300051700001500074700002000089245006600109856005600175300001100231490000700242 2018 d cNov1 aBartłomiej Gardas1 aMarek Rams1 aJacek Dziarmaga00aQuantum neural networks to simulate many-body quantum systems uhttps://link.aps.org/doi/10.1103/PhysRevB.98.184304 a1843040 v9800482nas a2200157 4500000000100000000000100001008004100002260000800043100002300051700002000074700001900094245013700113856005600250300001100306490000700317 2017 d cMar1 aBartłomiej Gardas1 aJacek Dziarmaga1 aWojciech Zurek00aDynamics 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 a1043060 v9500377nas a2200157 4500000000100000000000100001008004100002100002300043700002000066700001900086700001900105245003300124856004700157300000900204490000600213 2018 d1 aBartłomiej Gardas1 aJacek Dziarmaga1 aWojciech Zurek1 aMichael Zwolak00aDefects in Quantum Computers uhttps://doi.org/10.1038/s41598-018-22763-2 a45390 v800294nas a2200121 4500000000100000000000100001008004100002100002300043700001500066245007500081300001000156490000600166 2018 d1 aBartłomiej Gardas1 aS. Deffner00aQuantum fluctuation theorem for error diagnostics in quantum annealers a171910 v800409nas a2200145 4500000000100000000000100001008004100002100002300043700001700066245007300083856007100156300001400227490000800241022001400249 2018 d1 aBartłomiej Gardas1 aAndrzej Ptok00aCounting defects in quantum computers with Graphics Processing Units uhttp://www.sciencedirect.com/science/article/pii/S0021999118302304 a320 - 3260 v366 a0021-999100373nas a2200145 4500000000100000000000100001008004100002260000800043100002300051700002200074245005700096856005600153300001100209490000700220 2015 d cOct1 aBartłomiej Gardas1 aSebastian Deffner00aThermodynamic universality of quantum Carnot engines uhttps://link.aps.org/doi/10.1103/PhysRevE.92.042126 a0421260 v9200437nas a2200169 4500000000100000000000100001008004100002260000800043100001700051700002000068700002300088700001900111245006400130856005500194300001100249490000700260 2016 d cFeb1 aAnna Francuz1 aJacek Dziarmaga1 aBartłomiej Gardas1 aWojciech Zurek00aSpace and time renormalization in phase transition dynamics uhttp://link.aps.org/doi/10.1103/PhysRevB.93.075134 a0751340 v9300286nas a2200133 4500000000100000000000100001008004100002100002300043700001500066700001400081245004100095300001000136490000600146 2016 d1 aBartłomiej Gardas1 aS. Deffner1 aA. Saxena00aNon-hermitian quantum thermodynamics a234080 v600384nas a2200133 4500000000100000000000100001008004100002260000800043100002300051245010200074856005600176300001100232490000700243 2010 d cOct1 aBartłomiej Gardas00aExact 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 a0421150 v8200296nas a2200121 4500000000100000000000100001008004100002100002300043245005200066856003800118300001100156490000700167 2010 d1 aBartłomiej Gardas00aRiccati equation and the problem of decoherence uhttps://doi.org/10.1063/1.3442364 a0621030 v5100433nas a2200157 4500000000100000000000100001008004100002260000800043100002300051700002200074700001700096245008800113856005600201300001100257490000700268 2016 d cAug1 aBartłomiej Gardas1 aSebastian Deffner1 aAvadh Saxena00aRepeatability of measurements: Non-Hermitian observables and quantum Coriolis force uhttps://link.aps.org/doi/10.1103/PhysRevA.94.022121 a0221210 v9400390nas a2200157 4500000000100000000000100001008004100002260000800043100002300051700002200074700001700096245004500113856005600158300001100214490000700225 2016 d cOct1 aBartłomiej Gardas1 aSebastian Deffner1 aAvadh Saxena00aPT-symmetric slowing down of decoherence uhttps://link.aps.org/doi/10.1103/PhysRevA.94.040101 a0401010 v9400481nas a2200169 4500000000100000000000100001008004100002100002400043700001700067700001900084700002300103245007800126856007100204300001400275490000800289022001400297 2015 d1 aMichał Januszewski1 aAndrzej Ptok1 aDawid Crivelli1 aBartłomiej Gardas00aGPU-based acceleration of free energy calculations in solid state physics uhttp://www.sciencedirect.com/science/article/pii/S0010465515000697 a220 - 2270 v192 a0010-465500412nas a2200169 4500000000100000000000100001008004100002260000700043100002300050700001500073700001200088700001300100245006400113856004900177300000900226490000700235 2015 d c121 aBartłomiej Gardas1 aJ. Łuczka1 aA. Ptok1 aJ. Dajka00aEnergetics of an rf SQUID Coupled to Two Thermal Reservoirs uhttps://doi.org/10.1371/journal.pone.0143912 a1-100 v1000381nas a2200157 4500000000100000000000100001008004100002260001200043100002300055700001500078700002300093245004800116856003700164490000800201022001400209 2021 d c11/20201 aKonrad Jałowiecki1 aMarek Rams1 aBartłomiej Gardas00aBrute-forcing spin-glass problems with CUDA uhttps://arxiv.org/abs/1904.036210 v260 a0010-465500361nas a2200145 4500000000100000000000100001008004100002260001200043100001900055700001500074700002300089245005800112856003700170490000800207 2019 d c12/20191 aA. Więckowski1 aS. Deffner1 aBartłomiej Gardas00aDisorder-assisted graph coloring on quantum annealers uhttps://arxiv.org/abs/1903.070560 v10000416nas a2200145 4500000000100000000000100001008004100002260000800043100002300051700001600074245010300090856005900193300001100252490000700263 2014 d capr1 aBartłomiej Gardas1 aJerzy Dajka00aReply to Comment on `Initial states of qubit–environment models leading to conserved quantities' uhttps://doi.org/10.1088%2F1751-8113%2F47%2F16%2F168002 a1680020 v4700496nas a2200145 4500000000100000000000100001008004100002100002300043700001600066245016600082856007100248300000900319490000800328022001400336 2014 d1 aBartłomiej Gardas1 aJerzy Dajka00aReply 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 a19700 v378 a0375-960100348nas a2200145 4500000000100000000000100001008004100002260000800043100002300051700001600074245003500090856005900125300001100184490000700195 2013 d cjun1 aBartłomiej Gardas1 aJerzy Dajka00aNew symmetry in the Rabi model uhttps://doi.org/10.1088%2F1751-8113%2F46%2F26%2F265302 a2653020 v4600394nas a2200145 4500000000100000000000100001008004100002260000800043100002300051700001600074245008100090856005900171300001100230490000700241 2013 d cmay1 aBartłomiej Gardas1 aJerzy Dajka00aInitial states of qubit–environment models leading to conserved quantities uhttps://doi.org/10.1088%2F1751-8113%2F46%2F23%2F235301 a2353010 v4600463nas a2200169 4500000000100000000000100001008004100002260000800043100001600051700002300067700001800090245010200108856004600210300001600256490000700272022001400279 2013 d cApr1 aJerzy Dajka1 aBartłomiej Gardas1 aJerzy Łuczka00aRelation Between Purity of an Open Qubit Dynamics and Its Initial Correlation with an Environment uhttps://doi.org/10.1007/s10773-012-1430-1 a1148–11590 v52 a1572-957500406nas a2200145 4500000000100000000000100001008004100002100002300043700001600066245006900082856007100151300001600222490000800238022001400246 2013 d1 aBartłomiej Gardas1 aJerzy Dajka00aMulti-photon Rabi model: Generalized parity and its applications uhttp://www.sciencedirect.com/science/article/pii/S0375960113009432 a3205 - 32080 v377 a0375-960100350nas a2200121 4500000000100000000000100001008004100002100002300043245010600066856003800172300001100210490000700221 2011 d1 aBartłomiej Gardas00aRiccati equation and the problem of decoherence II: Symmetry and the solution of the Riccati equation uhttps://doi.org/10.1063/1.3574889 a0421040 v5200365nas a2200133 4500000000100000000000100001008004100002260000800043100002300051245008000074856005900154300001100213490000700224 2011 d capr1 aBartłomiej Gardas00aExact solution of the Schrödinger equation with the spin-boson Hamiltonian uhttps://doi.org/10.1088%2F1751-8113%2F44%2F19%2F195301 a1953010 v4400434nas a2200169 4500000000100000000000100001008004100002260001200043100002100055700002400076700002200100700002300122700002200145700002300167245006700190490000700257 2023 d c01/20231 aKrzysztof Domino1 aMátyás Koniorczyk1 aKrzysztof Krawiec1 aKonrad Jałowiecki1 aSebastian Deffner1 aBartłomiej Gardas00aQuantum annealing in the NISQ era: railway conflict management0 v2500399nas a2200157 4500000000100000000000100001008004100002100002300043700002400066700001700090700002300107245005300130856003700183490000700220022001400227 2020 d1 aKonrad Jałowiecki1 aAndrzej Więckowski1 aPiotr Gawron1 aBartłomiej Gardas00aParallel in time dynamics with quantum annealers uhttps://arxiv.org/abs/1909.049290 v10 a2045-232200478nas a2200169 4500000000100000000000100001008004100002260000800043100001500051700001900066700001800085700002300103700002300126245009400149856005700243490000800300 2021 d cAug1 aMarek Rams1 aMasoud Mohseni1 aDaniel Eppens1 aKonrad Jałowiecki1 aBartłomiej Gardas00aApproximate optimization, sampling, and spin-glass droplet discovery with tensor networks uhttps://link.aps.org/doi/10.1103/PhysRevE.104.0253080 v10400479nas a2200157 4500000000100000000000100001008004100002260001200043100002600055700001900081700002200100700002200122700002300144245008700167856006700254 2022 d c07/20221 aTomasz Śmierzchalski1 aŁukasz Pawela1 aZbigniew Puchała1 aTomasz Trzciński1 aBartłomiej Gardas00aPost-Error Correction for Quantum Annealing Processor using Reinforcement Learning uhttps://link.springer.com/chapter/10.1007/978-3-031-08760-8_2200365nas a2200145 4500000000100000000000100001008004100002100001800043700001600061700002000077700002300097700002200120245006900142490000800211 2022 d1 aArtur Soriani1 aPierre Naze1 aMarcus Bonancca1 aBartłomiej Gardas1 aSebastian Deffner00aThe three phases of quantum annealing: fast, slow, and very slow0 v10500417nas a2200157 4500000000100000000000100001008004100002100001800043700001700061700002000078700002300098700002200121245007100143856003700214490000800251 2022 d1 aArtur Soriani1 aPierre Nazé1 aMarcus Bonança1 aBartłomiej Gardas1 aSebastian Deffner00aAssessing performance of quantum annealing with non-linear driving uhttps://arxiv.org/abs/2203.170090 v10502064nas a2200229 4500000000100000000000100001008004100002260001200043100002600055700002100081700001900102700001900121700002200140700002400162700002300186700002200209700002100231245008200252856002600334490000700360520146700367 2024 d c09/20141 aTomasz Śmierzchalski1 aJakub Pawłowski1 aArtur Przybysz1 aŁukasz Pawela1 aZbigniew Puchała1 aMátyás Koniorczyk1 aBartłomiej Gardas1 aSebastian Deffner1 aKrzysztof Domino00aHybrid quantum-classical computation for automatic guided vehicles scheduling uhttps://rdcu.be/dUkwi0 v143 a

Motivated by recent efforts to develop quantum computing for practical, industrial-scale challenges, we demonstrate the effectiveness of state-of-the-art hybrid (not necessarily quantum) solvers in addressing the business-centric optimization problem of scheduling Automatic Guided Vehicles (AGVs). Some solvers can already leverage noisy intermediate-scale quantum (NISQ) devices. In our study, we utilize D-Wave hybrid solvers that implement classical heuristics with potential assistance from a quantum processing unit. This hybrid methodology performs comparably to existing classical solvers. However, due to the proprietary nature of the software, the precise contribution of quantum computation remains unclear. Our analysis focuses on a practical, business-oriented scenario: scheduling AGVs within a factory constrained by limited space, simulating a realistic production setting. Our approach maps a realistic AGVs problem onto one reminiscent of railway scheduling and demonstrates that the AGVs problem is better suited to quantum computing than its railway counterpart, the latter being denser in terms of the average number of constraints per variable. The main idea here is to highlight the potential usefulness of a hybrid approach for handling AGVs scheduling problems of practical sizes. We show that a scenario involving up to 21 AGVs, significant due to possible deadlocks, can be efficiently addressed by a hybrid solver in seconds.

00448nas a2200145 4500000000100000000000100001008004100002100002600043700002100069700002200090700002300112245010500135856005500240490000700295 2024 d1 aTomasz Śmierzchalski1 aZakaria Mzaouali1 aSebastian Deffner1 aBartłomiej Gardas00aEfficiency Optimization in Quantum Computing: Balancing Thermodynamics and Computational Performance uhttps://www.nature.com/articles/s41598-024-55314-z0 v1400633nas a2200229 4500000000100000000000100001008004100002100002300043700002300066700002500089700002200114700002300136700001900159700001800178700002400196700001700220700002500237700002200262700002100284700002200305245007600327 2023 d1 aBartłomiej Gardas1 aPrzemysław Głomb1 aPrzemysław Sadowski1 aZbigniew Puchała1 aKonrad Jałowiecki1 aŁukasz Pawela1 aOrphee Faucoz1 aPierre-Marie Brunet1 aPiotr Gawron1 aMatthijs Van Waveren1 aMickaël Savinaud1 aGuillaume Pasero1 aVeronique Defonte00aHyper-Spectral Image Classification Using Adiabatic Quantum Computation00544nas a2200193 4500000000100000000000100001008004100002100002500043700002200068700002100090700002200111700002400133700001800157700001700175700002300192700002200215700001900237245009400256 2023 d1 aMatthijs Van Waveren1 aMickaël Savinaud1 aGuillaume Pasero1 aVeronique Defonte1 aPierre-Marie Brunet1 aOrphee Faucoz1 aPiotr Gawron1 aBartłomiej Gardas1 aZbigniew Puchała1 aŁukasz Pawela00aComparison of Quantum Neural Network Algorithms For Earth Observation Data Classification01245nas a2200181 4500000000100000000000100001008004100002260000700043100002200050700001600072700002300088700002200111245007800133856003800211490000700249520079300256022001401049 2024 d c041 aDevjyoti Tripathy1 aAkram Touil1 aBartłomiej Gardas1 aSebastian Deffner00aQuantum information scrambling in two-dimensional Bose–Hubbard lattices uhttps://doi.org/10.1063/5.01993350 v343 a

It is a well-understood fact that the transport of excitations throughout a lattice is intimately governed by the underlying structures. Hence, it is only natural to recognize that the dispersion of information also has to depend on the lattice geometry. In the present work, we demonstrate that two-dimensional lattices described by the Bose–Hubbard model exhibit information scrambling for systems as little as two hexagons. However, we also find that the out-of-time-ordered correlator (OTOC) shows the exponential decay characteristic for quantum chaos only for a judicious choice of local observables. More generally, the OTOC is better described by Gaussian-exponential convolutions, which alludes to the close similarity of information scrambling and decoherence theory.

 a1054-150001395nas a2200169 4500000000100000000000100001008004100002260001200043100002100055700001700076700002000093700002300113700002200136245006000158490000700218520100000225 2025 d c08/20251 aKrzysztof Domino1 aEmery Doucet1 aReece Robertson1 aBartłomiej Gardas1 aSebastian Deffner00aOn the Baltimore Light RailLink into the quantum future0 v153 a

In the current era of noisy intermediate-scale quantum (NISQ) technology, quantum devices present new avenues for addressing complex, real-world challenges including potentially NP-hard optimization problems. This work aims to showcase how the inherent noise in NISQ devices can be leveraged to solve such real-world problems effectively. Utilizing a D-Wave quantum annealer and IonQ's gate-based NISQ computers, we generate and analyze solutions for managing train traffic under stochastic disturbances. Our case study focuses on the Baltimore Light RailLink, which embodies the characteristics of both tramway and railway networks. We explore the feasibility of using NISQ technology to model the stochastic nature of disruptions in these transportation systems. Our research marks the inaugural application of both quantum computing paradigms to tramway and railway rescheduling, highlighting the potential of quantum noise as a beneficial resource in complex optimization scenarios.

00503nas a2200181 4500000000100000000000100001008004100002260001800043100001900061700001900080700001400099700002200113700002300135700002100158245007700179856005700256490000800313 2024 d c12 July, 20241 aKhadija Hawary1 aMohamed Azzouz1 aMorad Baz1 aSebastian Deffner1 aBartłomiej Gardas1 aZakaria Mzaouali00aNavigating the phase diagram of quantum many-body systems in phase space uhttps://link.aps.org/doi/10.1103/PhysRevE.110.0141200 v11000379nas a2200157 4500000000100000000000100001008004100002100002100043700002200064700001800086700001900104700002300123700002200146245004600168490000700214 2024 d1 aRyszard Kukulski1 aMateusz Stępniak1 aKamil Hendzel1 aŁukasz Pawela1 aBartłomiej Gardas1 aZbigniew Puchała00aLocal certification of unitary operations0 v1400605nas a2200217 4500000000100000000000100001008004100002100001700043700002500060700002300085700002300108700002500131700002000156700002100176700002200197700002400219700001800243700002200261700001900283245008500302 2024 d1 aPiotr Gawron1 aPrzemysław Sadowski1 aPrzemysław Głomb1 aBartłomiej Gardas1 aMatthijs Van Waveren1 aClément Forray1 aGuillaume Pasero1 aMickaël Savinaud1 aPierre-Marie Brunet1 aOrphee Faucoz1 aZbigniew Puchała1 aŁukasz Pawela00aWhat Could be Achieved with a Million Qubits Quantum Annealer in Remote Sensing?00416nas a2200169 4500000000100000000000100001008004100002100002100043700001800064700002000082700001900102700001900121700001800140700001900158700002300177245004600200 2025 d1 aJakub Pawłowski1 aJan Tuziemski1 aPaweł Tarasiuk1 aArtur Przybysz1 aRobert Adamski1 aKamil Hendzel1 aŁukasz Pawela1 aBartłomiej Gardas00a VeloxQ: A Fast and Efficient QUBO Solver00542nas a2200169 4500000000100000000000100001008004100002260010600043100002000149700001700169700002100186700002100207700002300228700002200251245004900273856005000322 2025 d c12/2025bIEEE International Conference on Quantum Computing and Engineering (QCE25)aAlbuquerque, USA1 aReece Robertson1 aEmery Doucet1 aZakaria Mzaouali1 aKrzysztof Domino1 aBartłomiej Gardas1 aSebastian Deffner00aSimon's Period Finding on a Quantum Annealer uhttps://ieeexplore.ieee.org/document/1125034402601nas a2200181 4500000000100000000000100001008004100002260001200043100001800055700002600073700002300099700001500122700001900137245012900156856006200285490000700347520206500354 2025 d c05/20251 aAnna Dziubyna1 aTomasz Śmierzchalski1 aBartłomiej Gardas1 aMarek Rams1 aMasoud Mohseni00aLimitations 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.0540490 v233 a

Optimization problems pose challenges across various fields. In recent years, quantum annealers have emerged as a promising platform for tackling such challenges. Here, to provide an additional perspective, we develop a heuristic tensor-network-based algorithm to reveal the low-energy spectra of Ising spin-glass systems with interaction graphs relevant to present-day quantum annealers. Our deterministic approach combines a branch-and-bound search strategy with an approximate calculation of marginals via tensor-network contractions. Its application to quasi-two-dimensional lattices with large unit cells of up to 24 spins, realized in current quantum annealing processors, requires a dedicated approach that uses sparse structures in the tensor-network representation and GPU hardware acceleration. We benchmark our approach on random problems defined on Pegasus and Zephyr graphs with up to a few thousand spins, comparing it against the D-Wave Advantage quantum annealer and the simulated bifurcation algorithm, with the latter representing an emerging class of classical Ising solvers. In addition to examining the quality of the best solutions, we compare the diversity of low-energy states sampled by all the solvers. For the largest considered independent and identically distributed problems with over 5000 spins, the state-of-the-art tensor-network approaches lead to solutions that are 0.1% to 1% worse than the best solutions obtained by Ising machines while being 2 orders of magnitude slower. We attribute these results to approximate contraction failures. For embedded tile planting instances, our approach reaches approximately 0.1% from the planted ground state, a factor of 3 better than the Ising solvers. While all three methods can output diverse low-energy solutions—e.g., differing by at least a quarter of spins with energy error below 1%—our deterministic branch-and-bound approach finds sets of a few such states at most. In contrast, both Ising machines prove capable of sampling sets of thousands of such solutions.

01649nas a2200193 4500000000100000000000100001008004100002260000700043100002000050700002400070700002300094700001500117700001900132245007900151856003800230490000800268520116500276022001401441 2025 d c091 aSubhajit Sarkar1 aGabriela Wójtowicz1 aBartłomiej Gardas1 aMarek Rams1 aMichael Zwolak00aApproaching the scaling limit of transport through lattices with dephasing uhttps://doi.org/10.1063/5.02832820 v1633 a

We examine the stationary-state equations for lattices with generalized Markovian dephasing and relaxation. When the Hamiltonian is quadratic, the single-particle correlation matrix has a closed system of equations even in the presence of these two processes. The resulting equations have a vectorized form related to, but distinct from, Lyapunov’s equation. We present an efficient solution that helps to achieve the scaling limit, e.g., of the current decay with lattice length. As an example, we study the super-diffusive-to-diffusive transition in a lattice with long-range hopping and dephasing. The approach enables calculations with up to 104 sites, representing an increase of 10 to 40 times over prior studies. This enables a more precise extraction of the diffusion exponent, enhances agreement with theoretical results, and supports the presence of a phase transition. There is a wide range of problems that have Markovian relaxation, noise, and driving. They include quantum networks for machine-learning-based classification and extended reservoir approaches for transport. The results here will be useful for these classes of problems.

 a0021-960601466nas a2200205 4500000000100000000000100001008004100002100002600043700001800069700002300087700002100110700001900131700002300150700001500173245010500188856007200293490000700365520087400372022001401246 2025 d1 aTomasz Śmierzchalski1 aAnna Dziubyna1 aKonrad Jałowiecki1 aZakaria Mzaouali1 aŁukasz Pawela1 aBartłomiej Gardas1 aMarek Rams00aSpinGlassPEPS.jl: Tensor-network package for Ising-like optimization on quasi-two-dimensional graphs uhttps://www.sciencedirect.com/science/article/pii/S23527110250022490 v313 a

This work introduces SpinGlassPEPS.jl, a software package implemented in Julia, designed to find low-energy configurations of generalized Potts models, including Ising and QUBO problems, utilizing heuristic tensor network contraction algorithms on quasi-2D geometries. In particular, the package employs the Projected Entangled-Pairs States to approximate the Boltzmann distribution corresponding to the model’s cost function. This enables an efficient branch-and-bound search (within the probability space) that exploits the locality of the underlying problem’s topology. As a result, our software enables the discovery of low-energy configurations for problems on quasi-2D graphs, particularly those relevant to modern quantum annealing devices. The modular architecture of SpinGlassPEPS.jl supports various contraction schemes and hardware acceleration.

 a2352-711000466nas a2200169 4500000000100000000000100001008004100002260001600043100002000059700001900079700001800098700001900116700002300135245006500158856006600223490000700289 2026 d c 08/07/20261 aJakub Pawlowski1 aPawel Tarasiuk1 aJan Tuziemski1 aŁukasz Pawela1 aBartłomiej Gardas00aToward quantum scaling advantage in approximate optimization uhttps://journals.aps.org/prapplied/abstract/10.1103/qcws-8kgm0 v2600448nas a2200157 4500000000100000000000100001008004100002260001500043100002100058700002100079700002100100700002300121245007300144856006600217490000700283 2026 d c21/04/20261 aPhilipp Hanussek1 aJakub Pawłowski1 aZakaria Mzaouali1 aBartłomiej Gardas00aQuantum-inspired dynamical models on quantum and classical annealers uhttps://journals.aps.org/prapplied/abstract/10.1103/rrf3-jm5m0 v2500444nas a2200169 4500000000100000000000100001008004100002260001500043100001800058700002100076700002000097700001900117700002300136245004100159856006600200490000800266 2026 d c29/04/20261 aJan Tuziemski1 aJakub Pawłowski1 aPaweł Tarasiuk1 aŁukasz Pawela1 aBartłomiej Gardas00aLimits of quantum run-time advantage uhttps://journals.aps.org/prapplied/abstract/10.1103/gpsf-pn1x0 v 2500429nas a2200169 4500000000100000000000100001008004100002260001200043100001700055700002100072700002000093700002300113700002200136700002100158245006900179300001100248 2026 d c05/20261 aEmery Doucet1 aZakaria Mzaouali1 aReece Robertson1 aBartłomiej Gardas1 aSebastian Deffner1 aKrzysztof Domino00aThermodynamic significance of QUBO encoding on quantum annealers a05451200359nas a2200133 4500000000100000008004100001100002000042700002000062700001800082700001900100700002300119245004400142856003900186 2026 d1 aJakub Pawlowski1 aPaweł Tarasiuk1 aJan Tuziemski1 aŁukasz Pawela1 aBartłomiej Gardas00aSimulated Bifurcation Quantum Annealing uhttps://arxiv.org/abs/2604.01050v100409nas a2200145 4500000000100000008004100001100002000042700002600062700001700088700002300105700002200128700002100150245005500171856003700226 2026 d1 aJakub Pawlowski1 aTomasz Śmierzchalski1 aFengping Jin1 aBartłomiej Gardas1 aSebastian Deffner1 aZakaria Mzaouali00aQuantum annealers as programmable thermal machines uhttps://arxiv.org/abs/2608.0456400517nas a2200145 4500000000100000008004100001100002300042700002100065700002300086700001900109245015000128856007200278490000700350022001400357 2026 d1 aKonrad Jałowiecki1 aJakub Pawłowski1 aBartłomiej Gardas1 aŁukasz Pawela00aOmnisolver: 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/S23527110260052240 v36 a2352-711000420nas a2200121 4500000000100000008004100001100001900042700002300061245012100084856007200205490000700277022001400284 2026 d1 aŁukasz Pawela1 aBartłomiej Gardas00aVersion 2.0.1 - SpinGlassPEPS.jl: Tensor-network package for Ising-like optimization on quasi-two-dimensional graphs uhttps://www.sciencedirect.com/science/article/pii/S23527110260051820 v36 a2352-7110