25 citations · 58 across the 4 of their papers we have counts for
7 papers
Improved Quantum Algorithms for Fidelity Estimation
András Gilyén, Alexander Poremba
Fidelity is a fundamental measure for the closeness of two quantum states, which is important both from a theoretical and a practical point of view. Yet, in general, it is difficul…
Scalable Benchmarks for Gate-Based Quantum Computers
Arjan Cornelissen, Johannes Bausch, András Gilyén
In the near-term "NISQ"-era of noisy, intermediate-scale, quantum hardware and beyond, reliably determining the quality of quantum devices becomes increasingly important: users nee…
(Sub)Exponential advantage of adiabatic quantum computation with no sign problem
András Gilyén, Umesh Vazirani
We demonstrate the possibility of (sub)exponential quantum speedup via a quantum algorithm that follows an adiabatic path of a gapped Hamiltonian with no sign problem. This strengt…
Symmetries, graph properties, and quantum speedups
Shalev Ben-David, Andrew M. Childs, András Gilyén +3
Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symmetric (partial) functions do not admit exponential quantum query speedups. This raises a natural question: h…
A Unified Framework of Quantum Walk Search
Simon Apers, András Gilyén, Stacey Jeffery
The main results on quantum walk search are scattered over different, incomparable frameworks, most notably the hitting time framework, originally by Szegedy, the electric network…
Quantum algorithms for zero-sum games
Joran van Apeldoorn, András Gilyén
We derive sublinear-time quantum algorithms for computing the Nash equilibrium of two-player zero-sum games, based on efficient Gibbs sampling methods. We are able to achieve speed…