Graph Partitioning Approach for Fast Quantum Circuit Simulation
TimeTuesday, July 12th6pm - 7pm PDT
LocationLevel 2 Lobby
Event Type
Networking Reception
Work-in-Progress Poster
DescriptionDue to the exponential increase in computational complexity, fast simulation of the large quantum circuits is very difficult. This is a critical obstacle for the utilization of quantum computers because it means quantum computation can not be verified by conventional machines. There have been many researches for faster simulation of the quantum circuit but most of them does not yet fully bring the divide-and-conquer approach.
In this work, we introduce graph partitioning in quantum circuit simulation to efficiently divide a quantum circuit into smaller circuits and how to simulate them in an optimized way avoiding repetition of identical computations.