Project Grant 2514704

I-CORPS: TRANSLATION POTENTIAL OF DISTRIBUTED QUANTUM RESOURCE MANAGEMENT AND SCHEDULING WITH EFFICIENT CIRCUIT CUTTING -THIS I-CORPS PROJECT FOCUSES ON THE DEVELOPMENT OF A SCALABLE QUANTUM-CLASSICAL FRAMEWORK, TO OVERCOME CRITICAL LIMITATIONS IN NEAR-TERM QUANTUM COMPUTING HARDWARE. WHILE QUANTUM COMPUTERS HOLD TRANSFORMATIVE POTENTIAL FOR SOLVING COMPLEX PROBLEMS IN DRUG DISCOVERY, CRYPTOGRAPHY, AND MATERIALS SCIENCE, TODAY'S ERROR-PRONE, SMALLER-SCALE QUANTUM DEVICES LACK THE CAPACITY AND RELIABILITY TO EXECUTE LARGE ALGORITHMS. THIS QUANTUM-CLASSICAL FRAMEWORK OVERCOMES THESE BARRIERS BY INTELLIGENTLY LEVERAGING BOTH QUANTUM AND CLASSICAL COMPUTING RESOURCES TO EXECUTE QUANTUM CIRCUITS THAT ARE TOO LARGE TO FIT ON EXISTING QUANTUM HARDWARE. THE TECHNOLOGY ENABLES QUANTUM ADVANTAGE ON CURRENT RESOURCE-CONSTRAINED HARDWARE AND ACCELERATES PRACTICAL APPLICATION WHILE REDUCING COSTS FOR QUANTUM CLOUD PROVIDERS, RESEARCH INSTITUTIONS, AND ENTERPRISES. THIS I-CORPS PROJECT UTILIZES EXPERIENTIAL LEARNING COUPLED WITH A FIRST-HAND INVESTIGATION OF THE INDUSTRY ECOSYSTEM TO ASSESS THE TRANSLATION POTENTIAL OF THE TECHNOLOGY. THIS SOLUTION IS BASED ON A SCALABLE COMPUTING FRAMEWORK THAT PARTITIONS LARGE QUANTUM CIRCUITS INTO SMALLER, EXECUTABLE SUBCIRCUITS AND MANAGES THEIR EXECUTION AND RECONSTRUCTION WITHIN A HETEROGENEOUS DISTRIBUTED SYSTEM COMPRISING BOTH QUANTUM AND CLASSICAL COMPUTING RESOURCES. THIS COMPUTING FRAMEWORK EMPLOYS ADVANCED GRAPH PARTITIONING ALGORITHMS TO MODEL QUANTUM CIRCUITS AND IDENTIFY OPTIMAL CUTTING POINTS, TAKING INTO ACCOUNT PRACTICAL HARDWARE CONSTRAINTS TO MINIMIZE CUTTING OVERHEAD AND MAXIMIZE ALGORITHM FIDELITY. THIS FRAMEWORK ALSO INCORPORATES A WEIGHTED CLOSEST-FIRST SCHEDULER FOR DISTRIBUTING SUBCIRCUITS EFFICIENTLY ACROSS HETEROGENEOUS QUANTUM AND CLASSICAL RESOURCES, ENABLING BOTH SEQUENTIAL AND PARALLEL EXECUTION. SCIENTIFICALLY, THIS FRAMEWORK ADVANCES BEYOND EXISTING TOOLS BY OFFERING IMPROVED PERFORMANCE, ENHANCED RESOURCE UTILIZATION, AND SUPERIOR SCALABILITY FOR DISTRIBUTED QUANTUM SYSTEMS, WHILE PRESERVING THE FULL COMPUTATIONAL POWER OF THE ORIGINAL CIRCUIT. USERS BENEFIT FROM ITS SEAMLESS INTEGRATION WITH STANDARD QUANTUM PROGRAMMING ENVIRONMENTS, USER-FRIENDLY APPLICATION PROGRAMMING INTERFACES, AND AUTOMATED PIPELINES, ALLOWING THEM TO LEVERAGE COMPLEX QUANTUM ALGORITHMS ON RESOURCE-CONSTRAINED HARDWARE WITHOUT REQUIRING DEEP EXPERTISE IN CIRCUIT OPTIMIZATION TECHNIQUES. THIS AWARD REFLECTS NSF'S STATUTORY MISSION AND HAS BEEN DEEMED WORTHY OF SUPPORT THROUGH EVALUATION USING THE FOUNDATION'S INTELLECTUAL MERIT AND BROADER IMPACTS REVIEW CRITERIA.- SUBAWARDS ARE NOT PLANNED FOR THIS AWARD.