Quantum Program Compilation via Common Subgraph Identification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In quantum computing, the compilation of quantum programs is inefficient due to repetitive compilation of common subcircuits within sets of quantum circuits, leading to increased processing time and resource utilization.
Innovation Solution
Identifying and compiling common quantum subcircuits once, then replacing them across multiple quantum circuits, reducing redundant compilation and optimizing transpilation by leveraging commutation directed acyclic graphs (DAGs) to determine common subgraphs with an upper-bound size exceeding a threshold, thereby speeding up the compilation process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If quantum circuits are compiled individually without identifying common subcircuits, then each circuit is processed completely, but compilation time and resource utilization increase due to repetitive compilation of common subcircuits
Solution Approach 1:
The patent merges common subcircuits across multiple quantum circuits by identifying identical subgraph patterns in their commutation DAG representations. Once a common subcircuit is identified, it is compiled once and then reused across all circuits that contain it, combining the compilation efforts and eliminating redundant processing.
Solution Approach 2:
The patent performs preliminary identification of common subcircuits before the actual compilation process. By analyzing the commutation DAGs and finding common subgraphs in advance, the system prepares a library of reusable compiled subcircuits that can be efficiently inserted during the final circuit assembly, avoiding repeated compilation of the same patterns.
2Productivity
If common subcircuits are identified and compiled once for reuse, then compilation efficiency improves, but the complexity of the compilation system increases due to graph analysis and subgraph matching
Solution Approach 1:
The patent replaces complex manual or heuristic subcircuit matching with automated graph theory-based analysis. By representing quantum circuits as commutation DAGs and using subgraph isomorphism algorithms, the system achieves precise and efficient identification of common subcircuits without requiring complex rule-based systems or manual intervention.
Solution Approach 2:
The patent introduces commutation DAGs as an intermediary representation between the quantum circuit description and the compilation process. This intermediate graph structure facilitates systematic analysis and comparison of circuits, enabling automated identification of common subcircuits through standard graph algorithms rather than direct circuit manipulation.
Data Source
AI summary
Embodiments are provided for compilation of a quantum program. In some embodiments, a system can include a processor that executes computer-executable components stored in memory. The computer-executable components can include an identification component that selects a subgraph that is common among a first commutation directed acyclic graph (DAG) and a second commutation DAG. The subgraph has an upper-bound size that is greater than a threshold size. The first commutation DAG represents a first quantum circuit of a set of quantum circuits and the second commutation DAG represents a second quantum circuit of the set of quantum circuits. The computer-executable components also include a compilation component that compiles a quantum subcircuit corresponding to the subgraph. The computer-executable components further include a configuration component that replaces the quantum subcircuit in the first quantum circuit with the compiled quantum subcircuit.