Quon Classical Simulation: Unifying Cliffords, Matchgates and Entanglement
Abstract
We propose a new framework of topological complexity to study the computational complexity of quantum circuits and tensor networks. Within this framework, we establish the Quon Classical Simulation (QCS) for hybrid Clifford-Matchgate circuits, which is efficient for both Clifford circuits and Matchgate circuits, therefore answering a long standing open question on unifying efficient classical simulations. This framework is built upon the Quon language, a 2+1D topological quantum field theory with space-time boundary and defects. Its exponential computation complexity is captured by Magic holes, a topological feature capturing the global long-range entanglement. Both Clifford circuits and Matchgate circuits are free of Magic holes. Efficient classical simulations of Cliffords and Matchgates are implemented by two parallel operations, generalized surgery theory of 3-manifolds and Yang-Baxter relations on the 2D boundary respectively, with additional binary arithmetic properties.
Cite
@article{arxiv.2505.07804,
title = {Quon Classical Simulation: Unifying Cliffords, Matchgates and Entanglement},
author = {Zixuan Feng and Zhengwei Liu and Fan Lu and Ningfeng Wang},
journal= {arXiv preprint arXiv:2505.07804},
year = {2025}
}
Comments
44 pages, many figures