Paulina Lewandowska

Paulina Lewandowska

Auto-generated profile, based on publicly available information

Paulina Lewandowska

IT4Innovations VSB -Technical University of Ostrava 17. listopadu 2172/15 708 33 Ostrava Czech Republic

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 February 2023 in Scientific Reports
Verified
Journal Article
Open access
PDF file
PLPaulina Lewandowska
Paulina Lewandowska
ŁPŁukasz Pawela
Łukasz Pawela
ZPZbigniew Puchała
Zbigniew Puchała
The topic of causality has recently gained traction quantum information research. This work examines the problem of single-shot discrimination between process matrices which are an universal method defining a causal structure. We provide an exact expression for the optimal probability of correct distinction. In addition, we present an alternative way to achieve this expression by using the convex cone structure theory. We also express the discrimination task as semidefinite programming. Due to that, we have created the SDP calculating the distance between process matrices and we quantify it in terms of the trace norm. As a valuable by-product, the program finds an optimal realization of the discrimination task. We also find two classes of process matrices which can be distinguished perfectly. Our main result, however, is a consideration of the discrimination task for process matrices corresponding to quantum combs. We study which strategy, adaptive or non-signalling, should be used during the discrimination task. We proved that no matter which strategy you choose, the probability of distinguishing two process matrices being a quantum comb is the same.

18 November 2022 in Physical Review A
Verified
Journal Article
Closed access
PDF file
PLPaulina Lewandowska
Paulina Lewandowska
RKRyszard Kukulski
Ryszard Kukulski
ŁPŁukasz Pawela
Łukasz Pawela
ZPZbigniew Puchała
Zbigniew Puchała
This work examines the problem of learning an unknown von Neumann measurement of dimension d from a finite number of copies. To obtain a faithful approximation of the given measurement, we are allowed to use it N times. Our main goal is to estimate the asymptotic behavior of the maximum value of the average fidelity function Fd for a general N→1 learning scheme. We show that Fd=1−Θ(1N2) for arbitrary but fixed dimension d. In addition to that, we compared various learning schemes for d=2. We observed that the learning scheme based on deterministic port-based teleportation is asymptotically optimal but performs poorly for low N. In particular, we discovered a parallel learning scheme, which despite its lack of asymptotic optimality, provides a high value of the fidelity for low values of N and uses only two-qubit entangled memory states.

8 February 2026 in Scientific Reports
Verified
Journal Article
Open access
PDF file
ABAdam Bílek
Adam Bílek
JHJan Hlisnikovský
Jan Hlisnikovský
TBTomáš Bezděk
Tomáš Bezděk
RKRyszard Kukulski
Ryszard Kukulski
PLPaulina Lewandowska
Paulina Lewandowska
Tasks involving black boxes appear frequently in the theory of quantum information, with quantum channel discrimination as a central example that has been deeply studied. In this work, we experimentally study the discrimination between two unitary quantum channels in the multiple-shot scenario. We challenge the theoretical results concerning the probability of correct discrimination with the results collected from experiments performed on the IBM Brisbane. Our analysis shows that neither too deep quantum circuits nor circuits that create too much entanglement are suitable for the discrimination task. We conclude that circuit architectures which minimize entanglement overhead while preserving discrimination power are significantly more resilient to hardware noise if their depth does not exceed a threshold value. Consequently, our findings necessitate a paradigm shift: for execution on noisy hardware, the theoretically suboptimal circuit is, counterintuitively, often the superior choice.

18 October 2024 in Physical Review A
Verified
Journal Article
Closed access
PLPaulina Lewandowska
Paulina Lewandowska
RKRyszard Kukulski
Ryszard Kukulski

15 June 2020
Verified
Book Chapter
Open access
PDF file
PLPaulina Lewandowska
Paulina Lewandowska
RKRyszard Kukulski
Ryszard Kukulski
ŁPŁukasz Pawela
Łukasz Pawela
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.

23 May 2025 in arXiv
Verified
Preprint
Open access
PDF file
ABAdam Bílek
Adam Bílek
JHJan Hlisnikovský
Jan Hlisnikovský
TBTomáš Bezděk
Tomáš Bezděk
RKRyszard Kukulski
Ryszard Kukulski
PLPaulina Lewandowska
Paulina Lewandowska
Tasks involving black boxes appear frequently in quantum computer science. An example that has been deeply studied is quantum channel discrimination. In this work, we study the discrimination between two quantum unitary channels in the multiple-shot scenario. We challenge the theoretical results concerning the probability of correct discrimination with the results collected from experiments performed on the IBM Quantum processor Brisbane. Our analysis shows that neither too deep quantum circuits nor circuits that create too much entanglement are suitable for the discrimination task. We conclude that circuit architectures which minimize entanglement overhead while preserving discrimination power are significantly more resilient to hardware noise if their depth does not overpass threshold value.