Follow
Han-Hsuan Lin
Han-Hsuan Lin
NTHU, Taiwan
Verified email at cs.nthu.edu.tw
Title
Cited by
Cited by
Year
Different strategies for optimization using the quantum adiabatic algorithm
E Crosson, E Farhi, CYY Lin, HH Lin, P Shor
arXiv preprint arXiv:1401.7320, 2014
872014
Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
NH Chia, AP Gilyén, T Li, HH Lin, E Tang, C Wang
Journal of the ACM 69 (5), 1-72, 2022
852022
Quantum-inspired sublinear classical algorithms for solving low-rank linear systems
NH Chia, HH Lin, C Wang
arXiv preprint arXiv:1811.04852, 2018
452018
Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester
CYY Lin, HH Lin
Proceedings of the 30th Conference on Computational Complexity, 537-566, 2015
312015
Quantum-inspired classical sublinear-time algorithm for solving low-rank semidefinite programming via sampling approaches
NH Chia, T Li, HH Lin, C Wang
arXiv preprint arXiv:1901.03254, 2019
26*2019
On the quantum complexity of closest pair and related problems
S Aaronson, NH Chia, HH Lin, C Wang, R Zhang
arXiv preprint arXiv:1911.01973, 2019
182019
Quantum-inspired classical sublinear-time algorithm for solving low-rank semidefinite programming via sampling approaches
NH Chia, T Li, HH Lin, C Wang
arXiv preprint arXiv:1901.03254, 2019
162019
Sample efficient algorithms for learning quantum channels in PAC model and the approximate state discrimination problem
KM Chung, HH Lin
arXiv preprint arXiv:1810.10938, 2018
132018
Quantum-inspired algorithms for solving low-rank linear equation systems with logarithmic dependence on the dimension
NH Chia, A Gilyén, HH Lin, S Lloyd, E Tang, C Wang
31st International Symposium on Algorithms and Computation (ISAAC 2020), 2020
92020
Oracles with costs
S Kimmel, CYY Lin, HH Lin
arXiv preprint arXiv:1502.02174, 2015
92015
Constant-round blind classical verification of quantum sampling
KM Chung, Y Lee, HH Lin, X Wu
Advances in Cryptology–EUROCRYPT 2022: 41st Annual International Conference …, 2022
72022
Different strategies for optimization using the quantum adiabatic algorithm (2014)
E Crosson, E Farhi, CYY Lin, HH Lin, P Shor
arXiv preprint arXiv:1401.7320, 0
7
A Quantum-Proof Non-malleable Extractor: With Application to Privacy Amplification Against Active Quantum Adversaries
D Aggarwal, KM Chung, HH Lin, T Vidick
Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019
62019
On the Sample Complexity of PAC Learning Quantum Process
KM Chung, HH Lin
arXiv preprint arXiv:1810.10938 12, 2018
12018
On relating one-way classical and quantum communication complexities
NG Boddu, R Jain, HH Lin
arXiv preprint arXiv:2107.11623, 2021
2021
On relating one-way classical and quantum communication complexities
N Goud Boddu, R Jain, HH Lin
arXiv e-prints, arXiv: 2107.11623, 2021
2021
A quantum-proof non-malleable extractor
D Aggarwal, KM Chung, HH Lin, T Vidick
Annual International Conference on the Theory and Applications of …, 2019
2019
Topics in quantum algorithms: adiabatic algorithm, quantum money, and bomb query complexity
HH Lin
Massachusetts Institute of Technology, 2015
2015
Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester
C Yen-Yu Lin, HH Lin
arXiv e-prints, arXiv: 1410.0932, 2014
2014
The system can't perform the operation now. Try again later.
Articles 1–19