collaborators

6 papers

math.CO2026

Supersaturation for Eventown via Generator Switching

Zicheng Han, Xiande Zhang, Yuhao Zhao

An eventown family is a family of even-sized subsets of in which every two distinct members have an even-sized intersection. A classical theorem of Berlekamp and Graver shows…

quant-ph2026

Robust Quantum Extremal Numbers

Wanchen Zhang, Zicheng Han, Xiande Zhang

Absolutely maximally entangled states require every reduction of at most half of the parties to be maximally mixed, a condition that is both rigid and often impossible for qubit sy…

quant-ph2026

Automated Construction and Verification of Unextendible Product Bases

Zicheng Han, Wanchen Zhang, Fei Shi +1

Unextendible product bases (UPBs) are important structures in quantum information theory, with applications to completely entangled subspaces, bound entanglement, and local indisti…

quant-ph2026

A five-qubit 1-resistant graph state and stabilizer marginal certificates

Zicheng Han, Wanchen Zhang, Xiande Zhang

We study particle-loss resistant entanglement within the framework of stabilizer and graph states. A pure state is \(m\)-resistant if it remains entangled after the loss of any \(m…

math.CO2026

A Hypergraph Container Method for Spread SAT: Approximation and Speedup

Zicheng Han, Yupeng Lin, Jie Ma +1

We develop a hypergraph container method for the Boolean Satisfiability Problem (SAT) via the newly developed container results [Campos and Samotij (2026)]. This provides an explic…

quant-ph2025

New constructions of multipartite entanglement resistant to particle loss

Wanchen Zhang, Zicheng Han, Fei Shi +1

An entangled state is called m-resistant if it remains entangled after losing an arbitrary subset of mparticles but becomes fully separable after losing any number of particles lar…