Nai-Hui Chia

Orcid: 0000-0002-4138-7956

According to our database1, Nai-Hui Chia authored at least 24 papers between 2012 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 the Need for Large Quantum Depth.
J. ACM, February, 2023

Non-Interactive Classical Verification of Quantum Depth: A Fine-Grained Characterization.
IACR Cryptol. ePrint Arch., 2023

A Cryptographic Perspective on the Verifiability of Quantum Advantage.
CoRR, 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

Classical verification of quantum depth.
CoRR, 2022

QMLP: An Error-Tolerant Nonlinear Quantum MLP Architecture using Parameterized Two-Qubit Gates.
Proceedings of the ISLPED '22: ACM/IEEE International Symposium on Low Power Electronics and Design, Boston, MA, USA, August 1, 2022

2021
Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round.
IACR Cryptol. ePrint Arch., 2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds.
IACR Cryptol. ePrint Arch., 2021

Quantum Meets the Minimum Circuit Size Problem.
Electron. Colloquium Comput. Complex., 2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
On Basing One-way Permutations on NP-hard Problems under Quantum Reductions.
Quantum, 2020

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds.
IACR Cryptol. ePrint Arch., 2020

Classical Verification of Quantum Computations with Efficient Verifier.
IACR Cryptol. ePrint Arch., 2020

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Round.
CoRR, 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
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

2016
How Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Problem?.
Proceedings of the 11th Conference on the Theory of Quantum Computation, 2016

2012
Quantum Blind Computation with Teleportation-based Computation.
Proceedings of the Ninth International Conference on Information Technology: New Generations, 2012

On bundle configuration for viral marketing in social networks.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012


  Loading...