5 papers
An Explicit Counterexample to Tsirelson's Problem via a Linear System Game
Minbo Gao, Tianshi Yu, Lihong Zhi
We construct an explicit binary linear system game that separates , the closure of the set of finite dimensional quantum correlations, from , the set of commuting o…
An Algorithm for Diagonalizing Matrices of Formal Power Series
Zihao Dai, Hao Liang, Jingyu Lu +1
This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its…
A Noncommutative Nullstellensatz for Perfect Two-Answer Quantum Nonlocal Games
Tianshi Yu, Lihong Zhi
This paper introduces a noncommutative version of the Nullstellensatz, motivated by the study of quantum nonlocal games. It has been proved that a two-answer nonlocal game with a p…
Perfect Quantum Approximate Strategies for Imitation Games
Hao Liang, Tianshi Yu, Lihong Zhi
We prove that an imitation game has a perfect quantum approximate strategy if and only if there exists a bi-tracial state on the minimal tensor product of two universal C-alg…
Unlabeled Sensing Using Rank-One Moment Matrix Completion
Hao Liang, Jingyu Lu, Manolis C. Tsakiris +1
We study the unlabeled sensing problem that aims to solve a linear system of equations for an unknown permutation . For a generic matrix and a generic vector $y…