Quon Classical Simulation: Unifying Cliffords, Matchgates and Entanglement
By: Zixuan Feng , Zhengwei Liu , Fan Lu and more
Potential Business Impact:
Unifies computer simulations of quantum circuits.
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.
Similar Papers
Quantum circuit complexity and unsupervised machine learning of topological order
Quantum Physics
Helps quantum computers learn patterns better.
Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers
Quantum Physics
Helps quantum computers understand how things change.
Simulating Clifford Circuits with Gaussian Elimination
Quantum Physics
Makes quantum computers run faster and more efficiently.