54 citations · 148 across the 21 of their papers we have counts for
21 papers · 1 filter
Parallel quantum channel discrimination and numerical ranges in tensor product subspaces
Adam Bílek, Paulina Lewandowska, Ryszard Kukulski
Quantum channel discrimination plays a crucial role in quantum information theory. Of particular interest is the case in which the channels can be discriminated perfectly. In this…
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…
A Bipartite Quantum Key Distribution Protocol Based on Indefinite Causal Order
Mateusz Leśniak, Ryszard Kukulski, Paulina Lewandowska +2
We propose a bipartite quantum key distribution (QKD) protocol based on causal nonseparability: the presence of a resource -- a process matrix -- that does not correspond to any de…
Resource-Efficient Variational Quantum Classifier
Petr Ptáček, Paulina Lewandowska, Ryszard Kukulski
We introduce the unambiguous quantum classifier based on Hamming distance measurements combined with classical post-processing. The proposed approach improves classification perfor…
Experimental study of multiple-shot unitary channels discrimination using the IBM Q computers
Adam Bílek, Jan Hlisnikovský, Tomáš Bezděk +2
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 dis…
Benchmarking quantum devices beyond classical capabilities
Rafał Bistroń, Marcin Rudziński, Ryszard Kukulski +1
Rapid development of quantum computing technology has led to a wide variety of sophisticated quantum devices. Benchmarking these systems becomes crucial for understanding their cap…
Shared entanglement for three-party causal order guessing game
Ryszard Kukulski, Paulina Lewandowska, Karol Życzkowski
In a variant of communication tasks, players cooperate in choosing their local strategies to compute a given task later, working separately. Utilizing quantum bits for communicatio…
Storage and retrieval of von Neumann measurements via indefinite causal order structures
Paulina Lewandowska, Ryszard Kukulski
This work presents the problem of learning an unknown von Neumann measurement of dimension using indefinite causal structures. In the considered scenario, we have access to …
Local certification of unitary operations
Ryszard Kukulski, Mateusz Stępniak, Kamil Hendzel +3
In this work, we analyze the local certification of unitary quantum channels, which is a natural extension of quantum hypothesis testing. A particular case of a quantum channel ope…
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…
On the probabilistic quantum error correction
Ryszard Kukulski, Łukasz Pawela, Zbigniew Puchała
Probabilistic quantum error correction is an error-correcting procedure which uses postselection to determine if the encoded information was successfully restored. In this work, we…
Storage and retrieval of von Neumann measurements
Paulina Lewandowska, Ryszard Kukulski, Łukasz Pawela +1
This work examines the problem of learning an unknown von Neumann measurement of dimension from a finite number of copies. To obtain a faithful approximation of the given measu…
Generating random quantum channels
Ryszard Kukulski, Ion Nechita, Łukasz Pawela +2
Several techniques of generating random quantum channels, which act on the set of -dimensional quantum states, are investigated. We present three approaches to the problem of sa…
Comment to Spatial Search by Quantum Walk is Optimal for Almost all Graphs
Ryszard Kukulski, Adam Glos
This comment is to correct the proof of optimality of quantum spatial search for Erdős-Rényi graphs presented in `Spatial Search by Quantum Walk is Optimal for Almost all Graphs' (…
On the optimal certification of von Neumann measurements
Paulina Lewandowska, Aleksandra Krawiec, Ryszard Kukulski +2
In this report we study certification of quantum measurements, which can be viewed as the extension of quantum hypotheses testing. This extension involves also the study of the inp…
Perturbation of the numerical range of unitary matrices
Ryszard Kukulski, Paulina Lewandowska, Łukasz Pawela
In this work we show how to approach the problem of manimulating the numerical range of a unitary matrix. This task has far-reaching impact on the study of discrimination of quantu…
Optimal representation of quantum channels
Paulina Lewandowska, Ryszard Kukulski, Ł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 matric…
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…
Quantum walks on hypergraphs
Przemysław Sadowski, Łukasz Pawela, Paulina Lewandowska +1
In this work we introduce the concept of a quantum walk on a hypergraph. We show that the staggered quantum walk model is a special case of a quantum walk on a hypergraph.
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…
Vertices cannot be hidden from quantum spatial search for almost all random graphs
Adam Glos, Aleksandra Krawiec, Ryszard Kukulski +1
In this paper we show that all nodes can be found optimally for almost all random Erdős-Rényi graphs using continuous-time quantum spatial search procedure. Thi…