Sledovat
Han-Hsuan Lin
Han-Hsuan Lin
NTHU, Taiwan
E-mailová adresa ověřena na: cs.nthu.edu.tw
Název
Citace
Citace
Rok
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
1292022
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
982014
Quantum-inspired sublinear classical algorithms for solving low-rank linear systems
NH Chia, HH Lin, C Wang
arXiv preprint arXiv:1811.04852, 2018
662018
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
382015
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
33*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
262019
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
232018
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
NH Chia, A Gilyén, T Li, HH Lin, E Tang, C Wang
ACM Press, 2020
192020
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
182020
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
172019
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, 2014
172014
Constant-round blind classical verification of quantum sampling
KM Chung, Y Lee, HH Lin, X Wu
Annual International Conference on the Theory and Applications of …, 2022
112022
Oracles with costs
S Kimmel, CYY Lin, HH Lin
arXiv preprint arXiv:1502.02174, 2015
92015
A Quantum-Proof Non-malleable Extractor: With Application to Privacy Amplification Against Active Quantum Adversaries
D Aggarwal, KM Chung, HH Lin, T Vidick
Annual International Conference on the Theory and Applications of …, 2019
52019
On relating one-way classical and quantum communication complexities
NG Boddu, R Jain, HH Lin
Quantum 7, 1010, 2023
32023
A quantum-proof non-malleable extractor, with application to privacy amplification against active quantum adversaries
D Aggarwal, KM Chung, HH Lin, T Vidick
arXiv preprint arXiv:1710.00557, 2017
32017
On the impossibility of general parallel fast-forwarding of Hamiltonian simulation
NH Chia, KM Chung, YC Hsieh, HH Lin, YT Lin, YC Shen
arXiv preprint arXiv:2305.12444, 2023
12023
On the Sample Complexity of PAC Learning Quantum Process
K Chung, H Lin
arXiv preprint arXiv:1810.10938 12, 2018
12018
Efficient learning of -doped stabilizer states with single-copy measurements
NH Chia, CY Lai, HH Lin
Quantum 8, 1250, 2024
2024
On relating one-way classical and quantum communication complexities
N Goud Boddu, R Jain, HH Lin
arXiv e-prints, arXiv: 2107.11623, 2021
2021
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20