default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNai-Hui Chia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Nai-Hui Chia
, Ching-Yi Lai, Han-Hsuan Lin:
Efficient learning of t-doped stabilizer states with single-copy measurements. Quantum 8: 1250 (2024)- [i26]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) - [i25]Junhyung Lyle Kim, Nai-Hui Chia, Anastasios Kyrillidis:
A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm. CoRR abs/2406.13879 (2024) - [i24]Nai-Hui Chia, Kai-Min Chung, Xiao Liang, Jiahui Liu:
The Black-Box Simulation Barrier Persists in a Fully Quantum World. CoRR abs/2409.06317 (2024) - [i23]Nai-Hui Chia, Kai-Min Chung, Xiao Liang, Jiahui Liu:
The Black-Box Simulation Barrier Persists in a Fully Quantum World. IACR Cryptol. ePrint Arch. 2024: 1413 (2024) - 2023
- [j3]Nai-Hui Chia, Kai-Min Chung, Ching-Yi Lai:
On the Need for Large Quantum Depth. J. ACM 70(1): 6:1-6:38 (2023) - [c15]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 - [i22]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) - [i21]Nai-Hui Chia, Honghao Fu, Fang Song, Penghui Yao:
A Cryptographic Perspective on the Verifiability of Quantum Advantage. CoRR abs/2310.14464 (2023) - [i20]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
- [j2]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) - [c14]Nai-Hui Chia, Kai-Min Chung, Xiao Liang, Takashi Yamakawa:
Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round. CRYPTO (3) 2022: 533-563 - [c13]Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, Ruizhe Zhang:
Quantum Meets the Minimum Circuit Size Problem. ITCS 2022: 47:1-47:16 - [c12]Cheng Chu, Nai-Hui Chia, Lei Jiang, Fan Chen:
QMLP: An Error-Tolerant Nonlinear Quantum MLP Architecture using Parameterized Two-Qubit Gates. ISLPED 2022: 4:1-4:6 - [i19]Nai-Hui Chia, Shih-Han Hung:
Classical verification of quantum depth. CoRR abs/2205.04656 (2022) - [i18]Cheng Chu, Nai-Hui Chia, Lei Jiang, Fan Chen:
QMLP: An Error-Tolerant Nonlinear Quantum MLP Architecture using Parameterized Two-Qubit Gates. CoRR abs/2206.01345 (2022) - 2021
- [c11]Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds. CRYPTO (1) 2021: 315-345 - [c10]Nai-Hui Chia, Kai-Min Chung, Qipeng Liu, Takashi Yamakawa:
On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round. FOCS 2021: 59-67 - [i17]Nai-Hui Chia, Kai-Min Chung, Qipeng Liu, Takashi Yamakawa:
On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds. CoRR abs/2103.11244 (2021) - [i16]Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, Ruizhe Zhang:
Quantum Meets the Minimum Circuit Size Problem. CoRR abs/2108.03171 (2021) - [i15]Nai-Hui Chia, Kai-Min Chung, Xiao Liang, Takashi Yamakawa:
Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round. CoRR abs/2111.08665 (2021) - [i14]Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, Ruizhe Zhang:
Quantum Meets the Minimum Circuit Size Problem. Electron. Colloquium Comput. Complex. TR21 (2021) - [i13]Nai-Hui Chia, Kai-Min Chung, Qipeng Liu, Takashi Yamakawa:
On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds. IACR Cryptol. ePrint Arch. 2021: 376 (2021) - [i12]Nai-Hui Chia, Kai-Min Chung, Xiao Liang, Takashi Yamakawa:
Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round. IACR Cryptol. ePrint Arch. 2021: 1516 (2021) - 2020
- [j1]Nai-Hui Chia, Sean Hallgren, Fang Song:
On Basing One-way Permutations on NP-hard Problems under Quantum Reductions. Quantum 4: 312 (2020) - [c9]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 - [c8]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 - [c7]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 - [c6]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 - [c5]Nai-Hui Chia, Kai-Min Chung, Ching-Yi Lai:
On the need for large quantum depth. STOC 2020: 902-915 - [c4]Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
Classical Verification of Quantum Computations with Efficient Verifier. TCC (3) 2020: 181-206 - [i11]Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Round. CoRR abs/2011.02670 (2020) - [i10]Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
Classical Verification of Quantum Computations with Efficient Verifier. IACR Cryptol. ePrint Arch. 2020: 1273 (2020) - [i9]Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds. IACR Cryptol. ePrint Arch. 2020: 1384 (2020)
2010 – 2019
- 2019
- [i8]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) - [i7]Nai-Hui Chia, Kai-Min Chung, Ching-Yi Lai:
On the Need for Large Quantum Depth. CoRR abs/1909.10303 (2019) - [i6]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) - [i5]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) - [i4]Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
Classical Verification of Quantum Computations with Efficient Verifier. CoRR abs/1912.00990 (2019) - 2018
- [i3]Nai-Hui Chia, Sean Hallgren, Fang Song:
On Basing One-way Permutations on NP-hard Problems under Quantum Reductions. CoRR abs/1804.10309 (2018) - [i2]Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang:
Quantum-inspired sublinear classical algorithms for solving low-rank linear systems. CoRR abs/1811.04852 (2018) - 2016
- [c3]Nai-Hui Chia, Sean Hallgren:
How Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Problem?. TQC 2016: 6:1-6:16 - [i1]Nai-Hui Chia, Sean Hallgren:
How hard is deciding trivial versus nontrivial in the dihedral coset problem? CoRR abs/1608.02003 (2016) - 2012
- [c2]De-Nian Yang, Wang-Chien Lee, Nai-Hui Chia, Mao Ye, Hui-Ju Hung:
On bundle configuration for viral marketing in social networks. CIKM 2012: 2234-2238 - [c1]Nai-Hui Chia, Chia-Hung Chien, Wei-Ho Chung, Sy-Yen Kuo:
Quantum Blind Computation with Teleportation-based Computation. ITNG 2012: 769-774
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-10-23 21:21 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:
