7 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…
No-Go Theorems for Quantum Transport Metrics from Fixed Cost Operators
Minbo Gao, Zhengfeng Ji, Tianshi Yu
Coupling-based quantum optimal transport generalizes classical optimal transport by representing transport plans as bipartite states with prescribed marginals and evaluating their…
Reasoning about Continuous-Variable Quantum Systems
Tianshi Yu, Gilles Barthe, Minbo Gao +2
Continuous-variable quantum computing (CVQC) is a computing paradigm in which measurements yield values over a continuous domain. CVQC is both a convenient computational framework…
Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions
Gilles Barthe, Minbo Gao, Jam Kabeer Ali Khan +7
We present sound and complete relational program logics for infinite-dimensional quantum and classical-quantum programs. The logics model assertions as self-adjoint unbounded linea…
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…
A Characterization of Perfect Strategies for Mirror Games
Sizhuo Yan, Jianting Yang, Tianshi Yu +1
We associate mirror games with the universal game algebra and use the *-representation to describe quantum commuting operator strategies. We provide an algebraic characterization o…