default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrás Gilyén
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i21]Yanlin Chen, András Gilyén, Ronald de Wolf:
A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix. CoRR abs/2405.14765 (2024)- [i20]András Gilyén, Chi-Fang Chen, Joao F. Doriguello, Michael J. Kastoryano:
Quantum generalizations of Glauber and Metropolis dynamics. CoRR abs/2405.20322 (2024) - 2023
- [j5]Jintai Ding, Vlad Gheorghiu, András Gilyén, Sean Hallgren, Jianqiang Li:
Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems. Quantum 7: 1069 (2023) - [c14]Joran van Apeldoorn, Arjan Cornelissen, András Gilyén, Giacomo Nannicini:
Quantum tomography using state-preparation unitaries. SODA 2023: 1265-1318 - [i19]Balázs Németh, Blanka Kövér, Boglárka Kulcsár, Roland Botond Miklósi, András Gilyén:
On variants of multivariate quantum signal processing and their characterizations. CoRR abs/2312.09072 (2023) - 2022
- [j4]Nai-Hui Chia
, András Pal Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, Chunhao Wang:
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning. J. ACM 69(5): 33:1-33:72 (2022) - [j3]András Gilyén, Zhao Song, Ewin Tang:
An improved quantum-inspired algorithm for linear regression. Quantum 6: 754 (2022) - [i18]Joran van Apeldoorn, Arjan Cornelissen, András Gilyén, Giacomo Nannicini:
Quantum tomography using state-preparation unitaries. CoRR abs/2207.08800 (2022) - 2021
- [c13]Simon Apers, András Gilyén, Stacey Jeffery:
A Unified Framework of Quantum Walk Search. STACS 2021: 6:1-6:13 - [c12]András Gilyén, Matthew B. Hastings, Umesh V. Vazirani:
(Sub)Exponential advantage of adiabatic Quantum computation with no sign problem. STOC 2021: 1357-1369 - [i17]Arjan Cornelissen, Johannes Bausch, András Gilyén:
Scalable Benchmarks for Gate-Based Quantum Computers. CoRR abs/2104.10698 (2021) - [i16]Jintai Ding, Vlad Gheorghiu, András Gilyén, Sean Hallgren, Jianqiang Li:
Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems. CoRR abs/2111.00405 (2021) - 2020
- [j2]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Convex optimization using quantum oracles. Quantum 4: 220 (2020) - [j1]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Quantum SDP-Solvers: Better upper and lower bounds. Quantum 4: 230 (2020) - [c11]Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang:
Symmetries, Graph Properties, and Quantum Speedups. FOCS 2020: 649-660 - [c10]András Gilyén, Tongyang Li:
Distributional Property Testing in a Quantum World. ITCS 2020: 25:1-25:19 - [c9]Nai-Hui Chia, András Gilyén, Han-Hsuan Lin, Seth Lloyd, Ewin Tang, Chunhao Wang:
Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension. ISAAC 2020: 47:1-47:17 - [c8]Nai-Hui Chia, András Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, Chunhao Wang:
Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning. STOC 2020: 387-400 - [c7]Andris Ambainis, András Gilyén, Stacey Jeffery, Martins Kokainis:
Quadratic speedup for finding marked vertices by quantum walks. STOC 2020: 412-424 - [i15]Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang:
Symmetries, graph properties, and quantum speedups. CoRR abs/2006.12760 (2020) - [i14]András Gilyén, Seth Lloyd, Iman Marvian, Yihui Quek, Mark M. Wilde:
Quantum algorithm for Petz recovery channels and pretty good measurements. CoRR abs/2006.16924 (2020) - [i13]András Gilyén, Zhao Song, Ewin Tang:
An improved quantum-inspired algorithm for linear regression. CoRR abs/2009.07268 (2020) - [i12]András Gilyén, Umesh V. Vazirani:
(Sub)Exponential advantage of adiabatic quantum computation with no sign problem. CoRR abs/2011.09495 (2020)
2010 – 2019
- 2019
- [c6]Shantanav Chakraborty, András Gilyén, Stacey Jeffery:
The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation. ICALP 2019: 33:1-33:14 - [c5]Joran van Apeldoorn, András Gilyén:
Improvements in Quantum SDP-Solving with Applications. ICALP 2019: 99:1-99:15 - [c4]András Gilyén, Srinivasan Arunachalam, Nathan Wiebe:
Optimizing quantum optimization algorithms via faster quantum gradient computation. SODA 2019: 1425-1444 - [c3]András Gilyén, Yuan Su, Guang Hao Low, Nathan Wiebe:
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. STOC 2019: 193-204 - [i11]András Gilyén, Tongyang Li:
Distributional property testing in a quantum world. CoRR abs/1902.00814 (2019) - [i10]Andris Ambainis, András Gilyén, Stacey Jeffery, Martins Kokainis:
Quadratic speedup for finding marked vertices by quantum walks. CoRR abs/1903.07493 (2019) - [i9]Nai-Hui Chia, András Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, Chunhao Wang:
Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning. CoRR abs/1910.06151 (2019) - [i8]Simon Apers, András Gilyén, Stacey Jeffery:
A Unified Framework of Quantum Walk Search. CoRR abs/1912.04233 (2019) - 2018
- [i7]Shantanav Chakraborty, András Gilyén, Stacey Jeffery:
The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation. CoRR abs/1804.01973 (2018) - [i6]András Gilyén, Yuan Su, Guang Hao Low, Nathan Wiebe:
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. CoRR abs/1806.01838 (2018) - [i5]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Convex optimization using quantum oracles. CoRR abs/1809.00643 (2018) - [i4]András Gilyén, Seth Lloyd, Ewin Tang:
Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension. CoRR abs/1811.04909 (2018) - 2017
- [c2]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Quantum SDP-Solvers: Better Upper and Lower Bounds. FOCS 2017: 403-414 - [c1]András Pal Gilyén, Or Sattath:
On Preparing Ground States of Gapped Hamiltonians: An Efficient Quantum Lovász Local Lemma. FOCS 2017: 439-450 - [i3]Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf:
Quantum SDP-Solvers: Better upper and lower bounds. CoRR abs/1705.01843 (2017) - [i2]András Gilyén, Srinivasan Arunachalam, Nathan Wiebe:
Optimizing quantum optimization algorithms via faster quantum gradient computation. CoRR abs/1711.00465 (2017) - 2016
- [i1]András Gilyén, Or Sattath:
On preparing ground states of gapped Hamiltonians: An efficient Quantum Lovász Local Lemma. CoRR abs/1611.08571 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-27 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
