2D Quantum Program Compilation Using Row-Column Qubit Sorting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current implementations of quantum program compilation in a 2D quantum computing environment are inefficient, leading to high computing resource expenditure and execution time due to the need for extensive qubit manipulations.
Innovation Solution
A computer-implemented method that identifies starting positions for qubit pairs, generates target row and column assignments using one-dimensional sorting algorithms, and determines swap-or-not operations to efficiently reposition qubits for gate operations, utilizing classical computing to minimize quantum computer resource usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If quantum program compilation is performed in a 2D quantum computing environment using current implementations, then qubit manipulations can be performed, but computing resource expenditure and execution time increase significantly
Solution Approach 1:
The patent applies dimensionality change by transforming the 2D qubit arrangement problem into two separate 1D sorting problems (row assignments and column assignments). The compiler first determines target row assignments using a 1D sorting algorithm, then determines target column assignments using another 1D sorting algorithm. This decomposition of the 2D positioning problem into sequential 1D problems reduces the computational complexity and resource expenditure required for qubit manipulation while maintaining the 2D spatial arrangement necessary for quantum gate operations.
2Reliability
If extensive qubit manipulations are performed to achieve target positions, then qubit pairs can be properly positioned for gate operations, but execution time and computing resource expenditure increase
Solution Approach 1:
The patent implements preliminary action by pre-determining the target row and column assignments for each qubit before executing the quantum program. The compiler calculates the optimal target positions using 1D sorting algorithms during the compilation phase, creating a predetermined repositioning plan. This preliminary determination of qubit positions allows the quantum computer to execute the program with minimal real-time manipulation, reducing execution time while ensuring accurate positioning for all gate operations.
3Ease of operation
If qubits are repositioned frequently to satisfy gate operation requirements, then proper qubit pairing is achieved, but the number of operations and resource usage increase
Solution Approach 1:
The patent applies segmentation by dividing the qubit repositioning process into two independent segments: row assignment and column assignment. Instead of treating qubit positioning as a single complex 2D rearrangement problem requiring numerous operations, the compiler separately determines target rows using one 1D sorting algorithm and target columns using another 1D sorting algorithm. This segmentation reduces the total number of operations required while maintaining the ability to properly pair qubits for all necessary gate operations.
Data Source
AI summary
Various embodiments of the disclosure provide apparatuses, systems, and computer program products for instruction compilation for execution in a 2D quantum environment. Some embodiments include identifying a set of starting positions corresponding to a set of qubit pairs for a set of qubits, generating a set of target row assignments based at least in part on the set of starting positions, generating a set of target column assignments comprising a target column assignment for each qubit pair in the set of qubit pairs, the set of target column assignments generated by applying a one-dimensional sorting algorithm to each row of the set of target row assignments, and generating at least one movement instruction based at least in part on the first set of swap-or-not operations and the second set of swap-or-not operations.