activity
20122026
most citedDistinguishability of generic quantum states

48 citations · 159 across the 25 of their papers we have counts for

collaborators

26 papers

physics.comp-ph2026

Omnisolver: An extensible interface to Ising spin-glass and QUBO solvers: adding a distributed GPU brute-force plugin

Konrad Jałowiecki, Jakub Pawłowski, Bartłomiej Gardas +1

This software update extends Omnisolver with \texttt{omnisolver-bruteforce}, a first-class plugin for exact exhaustive search of QUBO and Ising instances on CUDA-enabled GPUs. The…

quant-ph2026

Noise Resilience of Quantum Key Distribution Protocols Secured Against Independent Attacks With One-Way Communication

Adam Bílek, Ryszard Kukulski, Paulina Lewandowska +2

We investigate the resilience to noise of single-qubit quantum key distribution (QKD) protocols in the scenario of security against independent eavesdropping attacks and key distil…

quant-ph2026

Asymptotic distinguishability of Haar-averaged measurement models

Ludmiła Marcinkowska, Łukasz Pawela, Marcin Markiewicz +1

We study discrimination problems generated by the same basic Haar-random measurement mechanism at two observational levels. First, we derive an explicit expression for the type-II…

quant-ph2026★ 1 cited

IntegrateUnitary.jl: A Julia package for symbolic integration over Haar measures

Łukasz Pawela, Zbigniew Puchała

Symbolic integration over the Haar measure of compact groups is a computational cornerstone in quantum information science and random matrix theory. We present \texttt{IntegrateUni…

quant-ph2026

Simulated Bifurcation Quantum Annealing

Jakub Pawłowski, Paweł Tarasiuk, Jan Tuziemski +2

We introduce Simulated Bifurcation Quantum Annealing (SBQA), a quantum-inspired optimization algorithm that extends simulated bifurcation by incorporating inter-replica interaction…

quant-ph2025

Recent quantum runtime (dis)advantages

J. Tuziemski, J. Pawłowski, P. Tarasiuk +2

A robust definition of quantum runtime is essential for assessing the performance of quantum algorithms and claims of quantum advantage. While for most classical hardware the total…

quant-ph2025

Toward quantum scaling advantage in approximate optimization

J. Pawłowski, P. Tarasiuk, J. Tuziemski +2

In a recent Letter [H. Munoz-Bauza and D. Lidar, Phys. Rev. Lett. 134, 160601 (2025)], quantum annealing was reported to exhibit a scaling advantage in approximately solving quadra…

quant-ph2025★ 1 cited

Quantum-aware Transformer model for state classification

Przemysław Sekuła, Michał Romaszewski, Przemysław Głomb +2

Entanglement is a fundamental feature of quantum mechanics, playing a crucial role in quantum information processing. However, classifying entangled states, particularly in the mix…

quant-ph2025★ 1 cited

SpinGlassPEPS.jl: Tensor-network package for Ising-like optimization on quasi-two-dimensional graphs

Tomasz Śmierzchalski, Anna M. Dziubyna, Konrad Jałowiecki +4

This work introduces SpinGlassPEPSjl, a software package implemented in Julia, designed to find low-energy configurations of generalized Potts models, including Ising and QUBO p…

quant-ph2025★ 2 cited

VeloxQ: A Fast and Efficient QUBO Solver

J. Pawłowski, J. Tuziemski, P. Tarasiuk +5

We introduce VeloxQ, a fast solver for Quadratic Unconstrained Binary Optimization (QUBO) problems, which are central to many real-world optimization tasks. Unlike approaches that…

quant-ph2025

Single-shot comparison of random quantum channels and measurements

Marcin Markiewicz, Łukasz Pawela, Zbigniew Puchała

In this work we provide an efficiency analysis of the problem of comparison of two randomly chosen quantum operations in the single-shot regime. We provide tight bounds for the suc…

quant-ph2023★ 5 cited

Quantum-embeddable stochastic matrices

Fereshte Shahbeigi, Christopher T. Chubb, Ryszard Kukulski +2

The classical embeddability problem asks whether a given stochastic matrix , describing transition probabilities of a -level system, can arise from the underlying homogeneous…

quant-ph2023

PyQBench: a Python library for benchmarking gate-based quantum computers

Konrad Jałowiecki, Paulina Lewandowska, Łukasz Pawela

We introduce PyQBench, an innovative open-source framework for benchmarking gate-based quantum computers. PyQBench can benchmark NISQ devices by verifying their capability of discr…

quant-ph2023★ 1 cited

Discrimination and certification of unknown quantum measurements

Aleksandra Krawiec, Łukasz Pawela, Zbigniew Puchała

We study the discrimination of von Neumann measurements in the scenario when we are given a reference measurement and some other measurement. The aim of the discrimination is to de…

quant-ph2022

Limitations on quantum key repeaters for all key correlated states

Leonard Sikorski, Karol Horodecki, Łukasz Pawela

Quantum key repeater is the backbone of the future Quantum Internet. It is an open problem to determine, for an arbitrary mixed bipartite state shared between the stations of a qua…

quant-ph2022★ 3 cited

Post-Error Correction for Quantum Annealing Processor using Reinforcement Learning

Tomasz Śmierzchalski, Łukasz Pawela, Zbigniew Puchała +2

Finding the ground state of the Ising spin-glass is an important and challenging problem (NP-hard, in fact) in condensed matter physics. However, its applications spread far beyond…

cs.SE2021★ 1 cited

Omnisolver: an extensible interface to Ising spin glass solvers

Konrad Jałowiecki, Łukasz Pawela

We introduce a new framework for implementing Binary Quadratic Model (BQM) solvers called Omnisolver. The framework provides an out-of-the-box dynamically built command-line interf…

quant-ph2021★ 3 cited

Relating entropies of quantum channels

Dariusz Kurzyk, Łukasz Pawela, Zbigniew Puchała

In this work, we study two different approaches to defining the entropy of a quantum channel. One of these is based on the von Neumann entropy of the corresponding Choi-Jamiołkowsk…

math.PR2020★ 4 cited

Asymptotic entropy of the Gibbs state of complex networks

Adam Glos, Aleksandra Krawiec, Łukasz Pawela

In this work we study the entropy of the Gibbs state corresponding to a graph. The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated…

quant-ph2018★ 12 cited

Multiple-shot and unambiguous discrimination of von Neumann measurements

Zbigniew Puchała, Łukasz Pawela, Aleksandra Krawiec +2

We present an in-depth study of the problem of multiple-shot discrimination of von Neumann measurements in finite-dimensional Hilbert spaces. Specifically, we consider two scenario…

quant-ph2018★ 35 cited

Strategies for optimal single-shot discrimination of quantum measurements

Zbigniew Puchała, Łukasz Pawela, Aleksandra Krawiec +1

In this work we study the problem of single-shot discrimination of von Neumann measurements, which we associate with measure-and-prepare channels. There are two possible approaches…

math.NA2017★ 18 cited

Efficient computation of higher order cumulant tensors

Krzysztof Domino, Piotr Gawron, Łukasz Pawela

In this paper, we introduce a novel algorithm for calculating arbitrary order cumulants of multidimensional data. Since the order cumulant can be presented in the for…

quant-ph2015★ 48 cited

Distinguishability of generic quantum states

Zbigniew Puchała, Łukasz Pawela, Karol Życzkowski

Properties of random mixed states of order distributed uniformly with respect to the Hilbert-Schmidt measure are investigated. We show that for large , due to the concentrat…

quant-ph2015★ 16 cited

Coherent chemical kinetics as quantum walks I: Reaction operators for radical pairs

A. Chia, A. Gorecka, K. C. Tan +4

Classical chemical kinetics use rate-equation models to describe how a reaction proceeds in time. Such models are sufficient for describing state transitions in a reaction where co…