5 papers
A Sharp Local-Question Threshold for GHZ-Equatorial Completeness in Four-Player XOR Games
Ziao Tang, Chengkai Zhu, Ge Bai +2
We determine the smallest number of active questions per player at which a four-player binary exclusive-or (XOR) game of commuting-operator value one need not admit a Greenberger--…
Benchmarking Agents for Proving Theorems in Quantum Algorithms and Quantum Information
Lei Zhang, Yusheng Zhao, Yimeng Cao +10
Formal verification is becoming increasingly practical for quantum computing, yet the ability of AI agents to construct machine-checkable proofs in this domain remains unmeasured.…
Logical Entangling with Phantom Codes in Hypergraph Products
Keming He, Ziao Tang, Zetong Li +2
The paper identifies the simplex‑repetition family of binary CSS hypergraph product codes as the unique HGP family that satisfies the phantom‑code condition, allowing logical CNOT…
Lean-QIT: Towards a Formal Infrastructure for Quantum Information Theory
Chengkai Zhu, Ziao Tang, Guocheng Zhen +6
Quantum information theory (QIT) characterizes the capabilities and fundamental limits of quantum information processing, underpinning quantum communication, computation, and error…
Simulation of Adjoints and Petz Recovery Maps for Unknown Quantum Channels
Chengkai Zhu, Ziao Tang, Guocheng Zhen +3
Transformations of quantum channels, such as the transpose, complex conjugate, and adjoint, are fundamental to quantum information theory. Given access to an unknown channel, a cen…