4 papers
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…
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…
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…
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…