Quantum Algorithm Simulation with SWAP Gates on Non-Quantum Clusters
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The simulation of quantum algorithms using non-quantum computers is limited by communication bottlenecks caused by remote gates, which require significant communication resources and increase execution time, especially when handling large numbers of qubits.
Innovation Solution
A method that compiles an initial quantum circuit into a compiled quantum circuit by adding SWAP gates before remote gates, transforming them into local gates, and optimizing the sequence of gates to minimize the number of SWAP gates and communication sessions, using a directed acyclic graph to reorder gates for maximum efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If remote gates are used in quantum circuits executed on non-quantum computer clusters, then quantum algorithms can be simulated, but communication resources are consumed and execution time increases
Solution Approach 1:
The patent applies preliminary action by inserting SWAP gates before remote gates during the compilation phase. This pre-transformation moves qubits involved in remote gates to local qubits in advance, so that when the quantum circuit executes, the gates become local gates that can be performed without inter-node communication. The SWAP gates are added beforehand to reposition qubits, eliminating the need for communication during the actual gate execution.
Solution Approach 2:
The SWAP gates act as intermediaries that facilitate the transformation of remote gates into local gates. By inserting SWAP gates before remote gates, the patent creates a bridge between the distributed quantum state representation and the local gate execution model. The SWAP gates mediate the transition from requiring communication to enabling local execution, effectively resolving the communication bottleneck without changing the underlying quantum algorithm.
2Quantity of substance
If multiple non-quantum computers are interconnected as a cluster to handle large qubit numbers, then sufficient computing resources are provided, but collective operation is limited by available communication resources
Solution Approach 1:
The patent extracts the communication dependency from the quantum circuit execution by transforming remote gates into local gates through SWAP gate insertion. This extraction removes the need for inter-node communication during gate execution, allowing the cluster to utilize its computing resources independently. The SWAP gates are added locally at each node, and the transformed circuit can be executed without relying on the communication infrastructure between nodes.
Solution Approach 2:
The patent enables self-service by allowing each node to execute its portion of the quantum circuit independently after the SWAP gate transformation. Once remote gates are converted to local gates, each node can process its local qubits and gates without requiring coordination or communication with other nodes. This self-service capability eliminates communication overhead while preserving the ability to handle large qubit numbers through the distributed cluster architecture.
Data Source
AI summary
A method of simulating execution of a quantum algorithm by using a cluster of non-quantum computers (100) comprises adding at least one SWAP gate before at least one remote gate in an initial quantum circuit that corresponds to the quantum algorithm, so that the remote gate becomes local gate. The invention proposes testing several combinations of SWAP gates to be added before a gate sequence portion of the initial quantum circuit, and selecting one of the tested combinations of SWAP gates that maximizes the gate number in the sequence portion. The number of SWAP gates added into the quantum circuit and a run time of the quantum algorithm using the cluster are reduced in this way.