Han-Hsuan Lin

Chung, K.-M., Lee, Y., Lin, H.-H., & Wu, X. (2020). Constant-round Blind Classical Verification of Quantum Sampling. ArXiv. Retrieved from https://arxiv.org/abs/2012.04848 (Original work published December 2020)

Chia, N.-H., Gilyen, A., Li, T., Lin, H.-H., Tang, E., & Wang, C. (2020). Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing Quantum machine learning. In Proceedings of STOC 2020. ACM. http://doi.org/10.1145/3357713.3384314 (Original work published June 2020)

Chia, N.-H., Li, T., Lin, H.-H., & Wang, C. (2020). Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. http://doi.org/10.4230/LIPICS.MFCS.2020.23 (Original work published August 2020)

Lin, C., & Lin, H.-H. (2016). Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester. Theory of Computing, 12, 1–35. http://doi.org/10.4086/toc.2016.v012a018 (Original work published November 2016)

Kimmel, S., Lin, C., & Lin, H.-H. (2015). Oracles with Costs. 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015), 44, 1–26. http://doi.org/10.4230/LIPIcs.TQC.2015.1 (Original work published February 2015)

Crosson, E., Farhi, E., Lin, C., Lin, H.-H., & Shor, P. (2014). Different Strategies for Optimization Using the Quantum Adiabatic Algorithm. ArXiv. http://doi.org/10.48550/ARXIV.1401.7320 (Original work published January 2014)