On Preparing Ground States of Gapped Hamiltonians: An Efficient Quantum Lovász Local Lemma. - András Pal Gilyén; Or Sattath (FOCS, 2017)

Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension. - András Gilyén; Seth Lloyd; Ewin Tang (CoRR, 2018)

Improvements in Quantum SDP-Solving with Applications. - Joran van Apeldoorn; András Gilyén (ICALP, 2019)

The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation. - Shantanav Chakraborty; András Gilyén; Stacey Jeffery (ICALP, 2019)

Optimizing quantum optimization algorithms via faster quantum gradient computation. - András Gilyén; Srinivasan Arunachalam; Nathan Wiebe (SODA, 2019)

Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. - András Gilyén; Yuan Su; Guang Hao Low; Nathan Wiebe (STOC, 2019)

Distributional Property Testing in a Quantum World. - András Gilyén; Tongyang Li (ITCS, 2020)

Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension. - Nai-Hui Chia; András Gilyén; Han-Hsuan Lin; Seth Lloyd; Ewin Tang; Chunhao Wang (ISAAC, 2020)

Quadratic speedup for finding marked vertices by quantum walks. - Andris Ambainis; András Gilyén; Stacey Jeffery; Martins Kokainis (STOC, 2020)

Quantum algorithm for Petz recovery channels and pretty good measurements. - András Gilyén; Seth Lloyd; Iman Marvian; Yihui Quek; Mark M. Wilde (CoRR, 2020)

(Sub)Exponential advantage of adiabatic quantum computation with no sign problem. - András Gilyén; Umesh V. Vazirani (CoRR, 2020)

Convex optimization using quantum oracles. - Joran van Apeldoorn; András Gilyén; Sander Gribling; Ronald de Wolf (Quantum, 2020)

Quantum SDP-Solvers: Better upper and lower bounds. - Joran van Apeldoorn; András Gilyén; Sander Gribling; Ronald de Wolf (Quantum, 2020)

A Unified Framework of Quantum Walk Search. - Simon Apers; András Gilyén; Stacey Jeffery (STACS, 2021)

(Sub)Exponential advantage of adiabatic Quantum computation with no sign problem. - András Gilyén; Matthew B. Hastings; Umesh V. Vazirani (STOC, 2021)

Scalable Benchmarks for Gate-Based Quantum Computers. - Arjan Cornelissen; Johannes Bausch; András Gilyén (CoRR, 2021)

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning. - Nai-Hui Chia; András Pal Gilyén; Tongyang Li; Han-Hsuan Lin; Ewin Tang; Chunhao Wang (J. ACM, 2022)

An improved quantum-inspired algorithm for linear regression. - András Gilyén; Zhao Song 002; Ewin Tang (Quantum, 2022)

Quantum tomography using state-preparation unitaries. - Joran van Apeldoorn; Arjan Cornelissen; András Gilyén; Giacomo Nannicini (SODA, 2023)

On variants of multivariate quantum signal processing and their characterizations. - Balázs Németh; Blanka Kövér; Boglárka Kulcsár; Roland Botond Miklósi; András Gilyén (CoRR, 2023)

Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems. - Jintai Ding; Vlad Gheorghiu; András Gilyén; Sean Hallgren; Jianqiang Li (Quantum, 2023)

Quantum generalizations of Glauber and Metropolis dynamics. - András Gilyén; Chi-Fang Chen; João F. Doriguello; Michael J. Kastoryano (CoRR, 2024)

Symmetries, Graph Properties, and Quantum Speedups. - Shalev Ben-David; Andrew M. Childs; András Gilyén; William Kretschmer; Supartha Podder; Daochen Wang (SIAM J. Comput., 2024)

A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix. - Yanlin Chen 001; András Gilyén; Ronald de Wolf (SODA, 2025)