Han-Hsuan Lin

Orcid: 0000-0002-5126-0174

According to our database1, Han-Hsuan Lin authored at least 17 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Efficient learning of t-doped stabilizer states with single-copy measurements.
Quantum, February, 2024

2023
On relating one-way classical and quantum communication complexities.
Quantum, May, 2023

On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning.
J. ACM, 2022

Constant-Round Blind Classical Verification of Quantum Sampling.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem.
Proceedings of the 16th Conference on the Theory of Quantum Computation, 2021

2020
Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Quantum-Inspired Algorithms for Solving Low-Rank Linear Equation Systems with Logarithmic Dependence on the Dimension.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

On the Quantum Complexity of Closest Pair and Related Problems.
Proceedings of the 35th Computational Complexity Conference, 2020

2019
A Quantum-Proof Non-Malleable Extractor With Application to Privacy Amplification against Active Quantum Adversaries.
IACR Cryptol. ePrint Arch., 2019

Quantum-inspired classical sublinear-time algorithm for solving low-rank semidefinite programming via sampling approaches.
CoRR, 2019

2018
Quantum-inspired sublinear classical algorithms for solving low-rank linear systems.
CoRR, 2018

On the Sample Complexity of PAC Learning Quantum Process.
CoRR, 2018

2017
Localized High Dynamic Range Plenoptic Image Compression.
Proceedings of the Computational Imaging XV, Burlingame, 2017

2016
Upper Bounds on Quantum Query Complexity Inspired by the Elitzur--Vaidman Bomb Tester.
Theory Comput., 2016

2015
Fast Mode Decision for Depth Video Coding Using H.264/MVC.
J. Inf. Sci. Eng., 2015

Oracles with Costs.
Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015


  Loading...