14 citations · 23 across the 3 of their papers we have counts for
4 papers
Basic quantum subroutines: finding multiple marked elements and summing numbers
Joran van Apeldoorn, Sander Gribling, Harold Nieuwboer
We show how to find all marked elements in a list of size using the optimal number of quantum queries and only a polylogarithmic overhead in the gate comple…
Quantum tomography using state-preparation unitaries
Joran van Apeldoorn, Arjan Cornelissen, András Gilyén +1
We describe algorithms to obtain an approximate classical description of a -dimensional quantum state when given access to a unitary (and its inverse) that prepares it. For pure…
A Framework for Distributed Quantum Queries in the CONGEST Model
Joran van Apeldoorn, Tijn de Vos
The Quantum CONGEST model is a variant of the CONGEST model, where messages consist of qubits. We give a general framework for implementing quantum query algorithms in…
Quantum SDP-Solvers: Better upper and lower bounds
Joran van Apeldoorn, András Gilyén, Sander Gribling +1
Brandão and Svore very recently gave quantum algorithms for approximately solving semidefinite programs, which in some regimes are faster than the best-possible classical algorithm…