3 citations · 5 across the 2 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2022★ 2 cited
On Hitting Times for General Quantum Markov Processes
Lorenzo Laneve, Francesco Tacchino, Ivano Tavernelli
Random walks (or Markov chains) are models extensively used in theoretical computer science. Several tools, including analysis of quantities such as hitting and mixing times, are h…
quant-ph2021★ 3 cited
Impossibility of composable Oblivious Transfer in relativistic quantum cryptography
Lorenzo Laneve, Lidia del Rio
We study the cryptographic primitive Oblivious Transfer; a composable construction of this resource would allow arbitrary multi-party computation to be carried out in a secure way,…