1 citations · 1 across the 6 of their papers we have counts for
6 papers · 1 filter
Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding
Tongyang Li, Fengning Ou, Xinzhao Wang +3
Many quantum algorithms require coherent access to classical data, often modeled by quantum read-only memory (QROM). We initiate the study of the count of sparse QROM,…
Linear-Size QAC0 Channels: Learning, Testing and Hardness
Yangjing Dong, Fengning Ou, Penghui Yao
Shallow quantum circuits have attracted increasing attention in recent years, due to the fact that current noisy quantum hardware can only perform faithful quantum computation for…
Optimal quantum sampling on distributed databases
Longyun Chen, Jingcheng Liu, Penghui Yao
Quantum sampling, a fundamental subroutine in numerous quantum algorithms, involves encoding a given probability distribution in the amplitudes of a pure state. Given the hefty cos…
On the Computational Power of QAC0 with Barely Superlinear Ancillae
Anurag Anshu, Yangjing Dong, Fengning Ou +1
is the family of constant-depth polynomial-size quantum circuits consisting of arbitrary single qubit unitaries and multi-qubit Toffoli gates. It was introduced by…
Communication Complexity of Common Randomness Generation with Isotropic States
Yangjing Dong, Penghui Yao
This paper addresses the problem of generating a common random string with min-entropy k using an unlimited supply of noisy EPR pairs or quantum isotropic states, with minimal comm…
Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality
Zongbo Bao, Yangjing Dong, Fengning Ou +1
We prove an almost optimal hypercontractive inequality for products of quantum erasure channels, generalizing the hypercontractivity for classical binary erasure channels. To our k…