672 citations
- Michael Walter2 profiles24 · h 30
- Ludovico Lami23 · h 29
- F. Speelman16 · h 13
- J. Helsen2 profiles16 · h 18
- R. Gerritsma5 profiles16 · h 16
- Florian Schreck4 profiles15 · h 14
- A. Safavi-Naini2 profiles14 · h 21
- Christian Majenz12 · h 20
- M. Ozols11 · h 21
- K. Schoutens2 profiles10 · h 37
- Bartosz Regula9 · h 27
- Christian Schaffner9 · h 31
- University of AmsterdamNL195 papers
- Centrum Wiskunde & InformaticaNL123 papers
- Institute for Theoretical Physics AmsterdamNL38 papers
- Institute of PhysicsPL26 papers
- Delft University of TechnologyNL25 papers
- QuTechNL21 papers
- University of CopenhagenDK21 papers
- Ruhr University BochumDE17 papers
- Leiden UniversityNL13 papers
- Stanford UniversityUS13 papers
- Massachusetts Institute of TechnologyUS12 papers
- University of Maryland, College ParkUS12 papers
28 papers · 2 filters
Quantum policy gradient algorithms
Sofiene Jerbi, Arjan Cornelissen, Māris Ozols +1
Understanding the power and limitations of quantum access to data in machine learning tasks is primordial to assess the potential of quantum computing in artificial intelligence. P…
Upper Bounds on the Distillable Randomness of Bipartite Quantum States
Ludovico Lami, Bartosz Regula, Xin Wang +1
The distillable randomness of a bipartite quantum state is an information-theoretic quantity equal to the largest net rate at which shared randomness can be distilled from the stat…
Grothendieck inequalities characterize converses to the polynomial method
Jop Briët, Francisco Escudero Gutiérrez, Sander Gribling
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorit…
Thrifty shadow estimation: re-using quantum circuits and bounding tails
Jonas Helsen, Michael Walter
Shadow estimation is a recent protocol that allows estimating exponentially many expectation values of a quantum state from ``classical shadows'', obtained by applying random quant…
Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers
Llorenç Escolà-Farràs, Florian Speelman
Protocols for quantum position verification (QPV) which combine classical and quantum information are insecure in the presence of loss. We study the exact loss-tolerance of the mos…
(No) Quantum space-time tradeoff for USTCON
Simon Apers, Stacey Jeffery, Galina Pass +1
Undirected -connectivity is important both for its applications in network problems, and for its theoretical connections with logspace complexity. Classically, a long line of w…