András Pál Gilyén
where else to find them
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| A Quantum Speed-Up for Approximating the Top Eigenvector of aMatrix via Improved Tomography | Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms | 2024-04-22 |
Claims a quantum algorithm that outputs a classical description of the top eigenvector of a d×d matrix with gap constant using block-encoding plus a new… | ||
| (Sub)Exponential Advantage of Adiabatic Quantum Computation With No Sign Problem | Quantum Wave in Computing Reunion 2021 | 2021-07-15 |
Constructs sparse, sign-problem-free Hamiltonians (adjacency matrices of large graphs) with a straight linear interpolation and inverse-polynomial spectral gap… | ||
| nothing matches | ||