Graph Partitioning Approach for Fast Quantum Circuit Simulation

Owing to the exponential increase in computational complexity, the fast simulation of the large quantum circuit has become very dif-ficult. This is an important challenge for the utilization of quantum computers because it is closely related to the verification of quan-tum computation by classical machines. The Hybrid Schrodinger-Feynman simulation seems to be a promising solution, but its application is very limited. To solve this drawback, we propose an improved simulation method based on graph partitioning. Exper-imental results show that our approach significantly reduces the simulation time of the Hybrid Schrodinger-Feynman simulation.