2 citations · 2 across the 3 of their papers we have counts for
3 papers
quant-ph2022
Testing and Learning Quantum Juntas Nearly Optimally
Thomas Chen, Shivam Nadimpalli, Henry Yuen
We consider the problem of testing and learning quantum -juntas: -qubit unitary matrices which act non-trivially on just of the qubits and as the identity on the rest…
cs.CR2022
A Review of zk-SNARKs
Thomas Chen, Hui Lu, Teeramet Kunpittaya +1
A zk-SNARK is a protocol that lets one party, the prover, prove to another party, the verifier, that a statement about some privately-held information is true without revealing the…
cs.GT2021★ 2 cited
Computational Hardness of the Hylland-Zeckhauser Scheme
Thomas Chen, Xi Chen, Binghui Peng +1
We study the complexity of the classic Hylland-Zeckhauser scheme [HZ'79] for one-sided matching markets. We show that the problem of finding an -approximate equilibrium in the H…