19 citations · 120 across the 23 of their papers we have counts for
26 papers
On Testing and Learning Quantum Junta Channels
Zongbo Bao, Penghui Yao
We consider the problems of testing and learning quantum -junta channels, which are -qubit to -qubit quantum channels acting non-trivially on at most out of qubits…
The Generations of Classical Correlations via Quantum Schemes
Zhenyu Chen, Lijinzhi Lin, Xiaodie Lin +2
Suppose two separated parties, Alice and Bob, share a bipartite quantum state or a classical correlation called a \emph{seed}, and they try to generate a target classical correlati…
Decidability of fully quantum nonlocal games with noisy maximally entangled states
Minglong Qin, Penghui Yao
This paper considers the decidability of fully quantum nonlocal games with noisy maximally entangled states. Fully quantum nonlocal games are a generalization of nonlocal games, wh…
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model
ChengSheng Wang, Xudong Wu, Penghui Yao
Computing the distance parameters of a network, including the diameter, radius, eccentricities and the all-pairs shortest paths (APSP) is a central problem in distributed computing…
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks
Xudong Wu, Penghui Yao
This paper studies the round complexity of computing the weighted diameter and radius of a graph in the quantum CONGEST model. We present a quantum algorithm that -approx…
Polynomial-Time Approximation of Zero-Free Partition Functions
Penghui Yao, Yitong Yin, Xinyuan Zhang
Zero-free based algorithm is a major technique for deterministic approximate counting. In Barvinok's original framework[Bar17], by calculating truncated Taylor expansions, a quasi-…