activity
20182024
most citedComment to Spatial Search by Quantum Walk is Optimal for Almost all Graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

5 papers

quant-ph2020

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…

quant-ph20201 cited

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' (…

quant-ph2018

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

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.

quant-ph2018

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…