Search Results - "Dong, Yangjing"
-
1
Communication Complexity of Common Randomness Generation With Isotropic States
Published in IEEE transactions on information theory (01-08-2024)“…This paper addresses the problem of generating a common random string with min-entropy k using an unlimited supply of quantum isotropic states, with minimal…”
Get full text
Journal Article -
2
Communication Complexity of Common Randomness Generation with Isotropic States
Published 08-11-2023“…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…”
Get full text
Journal Article -
3
On the Computational Power of QAC0 with Barely Superlinear Ancillae
Published 08-10-2024“…$\mathrm{QAC}^0$ is the family of constant-depth polynomial-size quantum circuits consisting of arbitrary single qubit unitaries and multi-qubit Toffoli gates…”
Get full text
Journal Article -
4
Hypercontractivity for Quantum Erasure Channels via Multipartite Log-Sobolev Inequality
Published 24-11-2023“…We prove an almost optimal hypercontractive inequality for quantum erasure channels, generalizing the hypercontractivity for classical binary erasure channels…”
Get full text
Journal Article -
5
The Computational Advantage of MIP Vanishes in the Presence of Noise
Published 07-12-2023“…Quantum multiprover interactive proof systems with entanglement MIP* are much more powerful than its classical counterpart MIP (Babai et al. '91, Ji et al…”
Get full text
Journal Article