activity
20192026
most citedIterative Quantum Amplitude Estimation

198 citations · 210 across the 23 of their papers we have counts for

collaborators
Showing 2026Show all

8 papers · 1 filter

quant-ph2026

Approximate cloning of structured pure states

Yaroslav Herasymenko, Junqiao Lin, Philip Verduyn Lunel +1

The no-cloning theorem is a cornerstone result in quantum mechanics that forbids copying of general quantum information. More quantitatively, even given copies of an unknown st…

quant-ph2026

Quantum Fourier transform toolbox

Carli Bruinsma, Pietro M. Posta, Joppe Stokvis +2

Quantum Fourier transforms (QFTs) are essential primitives in quantum algorithms. While abelian groups admit efficient QFT circuits, with circuit size polynomial in the logarithm o…

quant-ph2026

Quantum Fourier transform for the symmetric group

Carli Bruinsma, Dmitry Grinko, Maris Ozols

Quantum Fourier transforms (QFT) for general groups were recognized to be fundamental already early in the field. A canonical example of non-abelian QFT for the symmetric group was…

quant-ph2026

Optimal cloning of mixed states

Marco Fanizza, Dmitry Grinko, Thilo Scharnhorst +1

We consider the problem of approximate cloning of quantum states: given copies of an unknown state , prepare an -copy state with high fidel…

quant-ph2026

Sample complexity of quantum resource testing via one-shot quantum blurring

Dmitry Grinko, Ludovico Lami

Quantum resource testing is a fundamental primitive of quantum information processing, profoundly connected to resource manipulation. Its goal is to discriminate copies of a gi…

quant-ph2026

Classical shadows with arbitrary group representations

Maxwell West, Frederic Sauvage, Aniruddha Sen +6

Classical shadows (CS) has recently emerged as an important framework to efficiently predict properties of an unknown quantum state. A common strategy in CS protocols is to paramet…

math.DS2026

Double Recurrence and Almost Sure Convergence: Primes and Weighted Theory

Jan Fornal, Ben Krause

Let be a probability space equipped with an invertible, measure-preserving transformation . We exhibit a wide class of weights so that whenever $f,g \i…

quant-ph2026

Stronger Welch Bounds and Optimal Approximate -Designs

Riccardo Castellano, Dmitry Grinko, Sadra Boreiri +2

The question of how well a finite ensemble of quantum states can approximate Haar randomness is relevant in many areas of quantum physics. Here we consider this problem from a geom…