A parity-aware graphical calculus extends the ZX diagram language to fermionic modes, covering Gaussian states, partial traces, purification, fermionization/bosonization, and fermionic error-correcting codes.
Quon Classical Simulation: Unifying Cliffords, Matchgates and Entanglement
1 Pith paper cite this work. Polarity classification is still indexing.
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.
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Graphical Calculus for Fermionic Tensors
A parity-aware graphical calculus extends the ZX diagram language to fermionic modes, covering Gaussian states, partial traces, purification, fermionization/bosonization, and fermionic error-correcting codes.