activity
20052026
most citedSmooth Rényi Entropy of Ergodic Quantum Information Sources

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

collaborators

6 papers

cs.PL2026

Automated Amortised Analysis of Skew Heaps and Leftist Heaps (Extended Version)

Armin Walch, Georg Moser, Berry Schoenmakers +1

We study the fully automated amortised analysis of purely functional data structures like skew heaps, as well as weight- and rank-biased leftist heaps. For that we generalise earli…

cs.DS2024★ 1 cited

Amortized Analysis of Leftist Heaps

Berry Schoenmakers

Leftist heaps and skew heaps are two well-known data structures for mergeable priority queues. Leftist heaps are constructed for efficiency in the worst-case sense whereas skew hea…

cs.CR2018

Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash Chains

Berry Schoenmakers

We present optimal binary pebbling algorithms for in-place reversal (backward traversal) of one-way hash chains. For a hash chain of length , the number of hashes performed in…

quant-ph2007★ 6 cited

Smooth Rényi Entropy of Ergodic Quantum Information Sources

Berry Schoenmakers, Jilles Tjoelker, Pim Tuyls +1

We prove that the average smooth Renyi entropy rate will approach the entropy rate of a stationary, ergodic information source, which is equal to the Shannon entropy rate for a cla…

quant-ph2005★ 2 cited

Generic Security Proof of Quantum Key Exchange using Squeezed States

Karin Poels, Pim Tuyls, Berry Schoenmakers

Recently, a Quantum Key Exchange protocol that uses squeezed states was presented by Gottesman and Preskill. In this paper we give a generic security proof for this protocol. The m…

quant-ph2005

Quantum Information Theoretical Analysis of Various Constructions for Quantum Secret Sharing

Karin Rietjens, Berry Schoenmakers, Pim Tuyls

Recently, an information theoretical model for Quantum Secret Sharing (QSS) schemes was introduced. By using this model, we prove that pure state Quantum Threshold Schemes (QTS) ca…