default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHan-Hsuan Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Nai-Hui Chia
, Ching-Yi Lai, Han-Hsuan Lin:
Efficient learning of t-doped stabilizer states with single-copy measurements. Quantum 8: 1250 (2024)- 2023
- [j4]Naresh Goud Boddu, Rahul Jain, Han-Hsuan Lin:
On relating one-way classical and quantum communication complexities. Quantum 7: 1010 (2023) - [c11]Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, Yu-Ching Shen:
On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation. CCC 2023: 33:1-33:45 - [i12]Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, Yu-Ching Shen:
On the Impossibility of General Parallel Fast-forwarding of Hamiltonian Simulation. CoRR abs/2305.12444 (2023) - 2022
- [j3]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) - [c10]Kai-Min Chung, Yi Lee, Han-Hsuan Lin, Xiaodi Wu:
Constant-Round Blind Classical Verification of Quantum Sampling. EUROCRYPT (3) 2022: 707-736 - 2021
- [c9]Kai-Min Chung, Han-Hsuan Lin:
Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem. TQC 2021: 3:1-3:22 - [i11]Naresh Goud Boddu, Rahul Jain, Han-Hsuan Lin:
On relating one-way classical and quantum communication complexities. CoRR abs/2107.11623 (2021) - 2020
- [c8]Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang, Ruizhe Zhang:
On the Quantum Complexity of Closest Pair and Related Problems. CCC 2020: 16:1-16:43 - [c7]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 - [c6]Nai-Hui Chia, Tongyang Li, Han-Hsuan Lin, Chunhao Wang:
Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming. MFCS 2020: 23:1-23:15 - [c5]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 - [i10]Kai-Min Chung, Yi Lee, Han-Hsuan Lin, Xiaodi Wu:
Constant-round Blind Classical Verification of Quantum Sampling. CoRR abs/2012.04848 (2020)
2010 – 2019
- 2019
- [c4]Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick:
A Quantum-Proof Non-malleable Extractor - With Application to Privacy Amplification Against Active Quantum Adversaries. EUROCRYPT (2) 2019: 442-469 - [i9]Nai-Hui Chia, Tongyang Li, Han-Hsuan Lin, Chunhao Wang:
Quantum-inspired classical sublinear-time algorithm for solving low-rank semidefinite programming via sampling approaches. CoRR abs/1901.03254 (2019) - [i8]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) - [i7]Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang, Ruizhe Zhang:
On the Quantum Complexity of Closest Pair and Related Problems. CoRR abs/1911.01973 (2019) - [i6]Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick:
A Quantum-Proof Non-Malleable Extractor With Application to Privacy Amplification against Active Quantum Adversaries. IACR Cryptol. ePrint Arch. 2019: 254 (2019) - 2018
- [i5]Kai-Min Chung, Han-Hsuan Lin:
On the Sample Complexity of PAC Learning Quantum Process. CoRR abs/1810.10938 (2018) - [i4]Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang:
Quantum-inspired sublinear classical algorithms for solving low-rank linear systems. CoRR abs/1811.04852 (2018) - 2017
- [c3]Chuan-Chung Chang, Hsin-Hsiang Lo, Han-Hsuan Lin, Zhi-Rong Fan, Shao-Hsuan Cheng, Chih-Hung Lu, Fu-Ming Chuang, Jiun-In Guo:
Localized High Dynamic Range Plenoptic Image Compression. Computational Imaging 2017: 163-168 - [i3]Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick:
A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries. CoRR abs/1710.00557 (2017) - 2016
- [j2]Cedric Yen-Yu Lin, Han-Hsuan Lin:
Upper Bounds on Quantum Query Complexity Inspired by the Elitzur--Vaidman Bomb Tester. Theory Comput. 12(1): 1-35 (2016) - 2015
- [j1]Chih-Hung Lu, Han-Hsuan Lin, Chih-Wei Tang:
Fast Mode Decision for Depth Video Coding Using H.264/MVC. J. Inf. Sci. Eng. 31(5): 1693-1710 (2015) - [c2]Cedric Yen-Yu Lin, Han-Hsuan Lin:
Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester. CCC 2015: 537-566 - [c1]Shelby Kimmel, Cedric Yen-Yu Lin, Han-Hsuan Lin:
Oracles with Costs. TQC 2015: 1-26 - [i2]Shelby Kimmel, Cedric Yen-Yu Lin, Han-Hsuan Lin:
Oracles with Costs. CoRR abs/1502.02174 (2015) - 2014
- [i1]Cedric Yen-Yu Lin, Han-Hsuan Lin:
Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester. CoRR abs/1410.0932 (2014)
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-08-05 21:13 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:
