activity
20232026
collaborators

11 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

A Tale of Two Walks: Kipnis, Marchioro and Presutti Meet Kac in a Quantum World

Qian Chen, Jingcheng Liu, Minglong Qin +4

We reveal an unexpected connection between the parallel Kac's walk and the Kipnis-Marchioro-Presutti (KMP) process. The twirling channel induced by the parallel Kac's walk on the s…

quant-ph2026

Rapid Mixing of Parallel Kac's Walk: From Spheres to Stiefel Manifolds

Qian Chen, Minglong Qin, Fang Song +2

Kac's walk is a classical local random walk whose action on a single real unit vector in dimension mixes in total variation in sequential steps~\cite{PS17}. Lu, Qi…

cs.CC2026

Fooling Thresholds of Halfspaces

Minglong Qin, Penghui Yao, Mingnan Zhao +1

We initiate the study of constructing explicit pseudorandom generators for thresholds of halfspaces with seed length polylogarithmic in the number of halfspaces. This class of func…

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-ph2025

Nonlocal Games in the High-Noise Regime: Optimal Quantum Values and Rigidity

Honghao Fu, Minglong Qin, Haochen Xu +1

Motivated by the limitations of near-term quantum devices, we study nonlocal games in the high-noise regime, where the two players may share arbitrarily many copies of a noisy enta…

cs.CC2025

A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions

Penghui Yao, Mingnan Zhao

Developing explicit pseudorandom generators (PRGs) for prominent categories of Boolean functions is a key focus in computational complexity theory. In this paper, we investigate th…

math.OC2025

On the complexity of proximal gradient and proximal gradient-Newton-CG methods for -regularized Optimization

Hong Zhu

In this paper, we propose two second-order methods for solving the \(\ell_1\)-regularized composite optimization problem, which are developed based on two distinct definitions of a…

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

A Cryptographic Perspective on the Verifiability of Quantum Advantage

Nai-Hui Chia, Honghao Fu, Fang Song +1

In recent years, achieving verifiable quantum advantage on a NISQ device has emerged as an important open problem in quantum information. The sampling-based quantum advantages are…

quant-ph2023

Quantum Pseudorandom Scramblers

Chuhan Lu, Minglong Qin, Fang Song +2

Quantum pseudorandom state generators (PRSGs) have stimulated exciting developments in recent years. A PRSG, on a fixed initial (e.g., all-zero) state, produces an output state tha…