This project develops new frameworks for distributed quantum computing by leveraging tools from graph theory to optimize how quantum circuits are partitioned, routed, and executed across networked quantum processors. Building on ideas from IBM’s “Tour de Gross” work, we model quantum workloads as graphs whose structure captures entanglement, communication costs, and hardware connectivity constraints. Graph-theoretic techniques such as partitioning, matching, and flow optimization are then used to minimize inter-node quantum communication and reduce circuit overhead in distributed settings. The ultimate goal is to establish scalable algorithms and compiler strategies that enable efficient execution of large quantum applications on modular, networked quantum architectures.
Stand Out From the Crowd
Upload your resume and get instant feedback on how well it matches this job.
Job Type
Part-time
Career Level
Intern
Education Level
No Education Listed