default search action
Shih-Han Hung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Rihan Hai, Shih-Han Hung, Sebastian Feld:
Quantum Data Management: From Theory to Opportunities. ICDE 2024: 5376-5381 - [i20]Rihan Hai, Shih-Han Hung, Sebastian Feld:
Quantum Data Management: From Theory to Opportunities. CoRR abs/2403.02856 (2024) - [i19]Nai-Hui Chia, Min-Hsiu Hsieh, Shih-Han Hung, En-Jui Kuo:
Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy. CoRR abs/2405.07137 (2024) - [i18]Rihan Hai, Shih-Han Hung, Tim Coopmans, Floris Geerts:
Data Management in the Noisy Intermediate-Scale Quantum Era. CoRR abs/2409.14111 (2024) - 2023
- [j3]Kesha Hietala, Robert Rand, Liyi Li, Shih-Han Hung, Xiaodi Wu, Michael Hicks:
A Verified Optimizer for Quantum Circuits. ACM Trans. Program. Lang. Syst. 45(3): 18:1-18:35 (2023) - [c8]Nguyen-Kieu Viet-Nhi, Nguyen-Quoc-Khanh Le, Vu Cong Truc, Thi Thuy Nguyen, Tran Nguyen Anh Duy, Nguyen Tu Thai Bao, How Tseng, Shih-Han Hung:
Predicting Tumor Mutational Burden and Survival in Head and Neck Squamous Cancer Patients Using Machine Learning and Bioinformatics Approaches. BCB 2023: 87:1 - [c7]Scott Aaronson, Shih-Han Hung:
Certified Randomness from Quantum Supremacy. STOC 2023: 933-944 - [i17]Shih-Han Hung, En-Jui Kuo:
The Computational Complexity of Quantum Determinants. CoRR abs/2302.08083 (2023) - [i16]Scott Aaronson, Shih-Han Hung:
Certified Randomness from Quantum Supremacy. CoRR abs/2303.01625 (2023) - [i15]Scott Aaronson, Shih-Han Hung:
Certified Randomness from Quantum Supremacy. Electron. Colloquium Comput. Complex. TR23 (2023) - [i14]Nai-Hui Chia, Shih-Han Hung:
Non-Interactive Classical Verification of Quantum Depth: A Fine-Grained Characterization. IACR Cryptol. ePrint Arch. 2023: 1911 (2023) - 2022
- [i13]Nai-Hui Chia, Shih-Han Hung:
Classical verification of quantum depth. CoRR abs/2205.04656 (2022) - 2021
- [j2]Kesha Hietala, Robert Rand, Shih-Han Hung, Xiaodi Wu, Michael Hicks:
A verified optimizer for Quantum circuits. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - [c6]Manuel Barbosa, Gilles Barthe, Xiong Fan, Benjamin Grégoire, Shih-Han Hung, Jonathan Katz, Pierre-Yves Strub, Xiaodi Wu, Li Zhou:
EasyPQC: Verifying Post-Quantum Cryptography. CCS 2021: 2564-2586 - [c5]Andrew M. Childs, Shih-Han Hung, Tongyang Li:
Quantum Query Complexity with Matrix-Vector Products. ICALP 2021: 55:1-55:19 - [c4]Kesha Hietala, Robert Rand, Shih-Han Hung, Liyi Li, Michael Hicks:
Proving Quantum Programs Correct. ITP 2021: 21:1-21:19 - [i12]Andrew M. Childs, Shih-Han Hung, Tongyang Li:
Quantum query complexity with matrix-vector products. CoRR abs/2102.11349 (2021) - [i11]Manuel Barbosa, Gilles Barthe, Xiong Fan, Benjamin Grégoire, Shih-Han Hung, Jonathan Katz, Pierre-Yves Strub, Xiaodi Wu, Li Zhou:
EasyPQC: Verifying Post-Quantum Cryptography. IACR Cryptol. ePrint Arch. 2021: 1253 (2021) - 2020
- [c3]Shaopeng Zhu, Shih-Han Hung, Shouvanik Chakrabarti, Xiaodi Wu:
On the principles of differentiable quantum programming languages. PLDI 2020: 272-285 - [c2]Gorjan Alagic, Andrew M. Childs, Alex B. Grilo, Shih-Han Hung:
Non-interactive Classical Verification of Quantum Computation. TCC (3) 2020: 153-180 - [i10]Shaopeng Zhu, Shih-Han Hung, Shouvanik Chakrabarti, Xiaodi Wu:
On the Principles of Differentiable Quantum Programming Languages. CoRR abs/2004.01122 (2020) - [i9]Kesha Hietala, Robert Rand, Shih-Han Hung, Liyi Li, Michael Hicks:
Proving Quantum Programs Correct. CoRR abs/2010.01240 (2020) - [i8]Gorjan Alagic, Andrew M. Childs, Alex B. Grilo, Shih-Han Hung:
Non-interactive classical verification of quantum computation. IACR Cryptol. ePrint Arch. 2020: 1422 (2020)
2010 – 2019
- 2019
- [j1]Shih-Han Hung, Kesha Hietala, Shaopeng Zhu, Mingsheng Ying, Michael Hicks, Xiaodi Wu:
Quantitative robustness analysis of quantum programs. Proc. ACM Program. Lang. 3(POPL): 31:1-31:29 (2019) - [i7]Kesha Hietala, Robert Rand, Shih-Han Hung, Xiaodi Wu, Michael Hicks:
Verified Optimization in a Quantum Intermediate Representation. CoRR abs/1904.06319 (2019) - [i6]Shouvanik Chakrabarti, Andrew M. Childs, Shih-Han Hung, Tongyang Li, Chunhao Wang, Xiaodi Wu:
Quantum algorithm for estimating volumes of convex bodies. CoRR abs/1908.03903 (2019) - [i5]Gorjan Alagic, Andrew M. Childs, Shih-Han Hung:
Two-message verification of quantum computation. CoRR abs/1911.08101 (2019) - [i4]Kesha Hietala, Robert Rand, Shih-Han Hung, Xiaodi Wu, Michael Hicks:
A Verified Optimizer for Quantum Circuits. CoRR abs/1912.02250 (2019) - 2018
- [i3]Shih-Han Hung, Kesha Hietala, Shaopeng Zhu, Mingsheng Ying, Michael Hicks, Xiaodi Wu:
Quantitative Robustness Analysis of Quantum Programs (Extended Version). CoRR abs/1811.03585 (2018) - 2017
- [i2]Jianxin Chen, Andrew M. Childs, Shih-Han Hung:
Quantum algorithm for multivariate polynomial interpolation. CoRR abs/1701.03990 (2017) - 2016
- [c1]Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski:
Optimal Quantum Algorithm for Polynomial Interpolation. ICALP 2016: 16:1-16:13 - 2015
- [i1]Andrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski:
Optimal quantum algorithm for polynomial interpolation. CoRR abs/1509.09271 (2015)
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 2025-01-20 23:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint