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, in which…
Dimension-Free Approximate Tensorization of Quantum Hypercontractivity for Qudit Depolarizing Semigroups
Yangjing Dong, Li Gao, Fengning Ou +2
We prove approximate tensorization for hypercontractivity and logarithmic-Sobolev constants for a class of primitive reversible quantum Markov semigroups satisfying the positive of…
On the Computational Complexity of Geometrically Local QAC0 circuits
Yangjing Dong, Fengning Ou, Penghui Yao
The computational complexity of , which are constant-depth, polynomial-size quantum circuit families consisting of arbitrary single-qubit unitaries and -qubit ge…
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…
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…
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…