activity
20182025
most citedHilbert-Schmidt distance and entanglement witnessing

25 citations · 47 across the 6 of their papers we have counts for

collaborators
Showing quant-phShow all

6 papers · 1 filter

quant-ph2025

Benchmarking weak randomness in Quantum and Natural Sources

Maciej Stankiewicz, Roberto Salazar, Mikołaj Czechlewski +7

Private randomness is a fundamental resource for cryptography, security proofs, and information processing. Quantum devices offer a unique advantage by amplifying weak randomness s…

quant-ph2021

Private Weakly-Random Sequences from Human Heart Rate for Quantum Amplification

Maciej Stankiewicz, Karol Horodecki, Omer Sakarya +1

We investigate whether the heart rate can be treated as a semi-random source with the aim of amplification by quantum devices. We use a semi-random source model called -Santha-V…

quant-ph2021★ 1 cited

Upper bounds on the leakage of private data and operational approach to markovianity

Karol Horodecki, Michał Studziński, Ryszard P. Kostecki +2

We quantify the consequences of a private key leakage and private randomness generated during quantum key distribution. We provide simple lower bounds on the one-way distillable ke…

quant-ph2020★ 17 cited

Distance between Bound Entangled States from Unextendible Product Bases and Separable States

Marcin Wieśniak, Palash Pandya, Omer Sakarya +1

We discuss the use of the Gilbert algorithm to tailor entanglement witnesses for unextendibleproduct basis bound entangled states (UPB BE states). The method relies on the fact tha…

quant-ph2019★ 4 cited

Hybrid quantum network design against unauthorized secret-key generation, and its memory cost

Omer Sakarya, Marek Winczewski, Adam Rutkowski +1

A significant number of servers that constitute the Internet are to provide private data via private communication channels to mutually anonymous registered users. Such are the ser…

quant-ph2018★ 25 cited

Hilbert-Schmidt distance and entanglement witnessing

Palash Pandya, Omer Sakarya, Marcin Wieśniak

Gilbert proposed an algorithm for bounding the distance between a given point and a convex set. In this article we apply the Gilbert's algorithm to get an upper bound on the Hilber…