activity
20232026
most citedOn the Computational Power of QAC0 with Barely Superlinear Ancillae

1 citations · 1 across the 6 of their papers we have counts for

collaborators

8 papers

quant-ph2026

A Dichotomy for MIP* in the Presence of Unital Noise

Yangjing Dong, Zhenyu Jiang, Minglong Qin +2

A recent work studied quantum two-prover one-round proof systems . It showed that when is a noisy EPR state with quantum maximal correlation $…

quant-ph2026

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…

quant-ph2026

On the Computational Power of Geometrically Local QAC circuits

Yangjing Dong, Fengning Ou, Penghui Yao

The computational power of , which are constant-depth quantum circuit families consisting of arbitrary single-qubit unitaries and n-qubit generalized Toffoli gates, h…

quant-ph2025

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…

quant-ph2024★ 1 cited

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…

quant-ph2023

The Computational Advantage of MIP* Vanishes in the Presence of Noise

Yangjing Dong, Honghao Fu, Anand Natarajan +3

Quantum multiprover interactive proof systems with entanglement MIP* are much more powerful than its classical counterpart MIP (Babai et al. '91, Ji et al. '20): while MIP = NEXP,…

quant-ph2023

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…

quant-ph2023

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…