Quantum instruction compiler for optimizing hybrid algorithms
A compiler for a gate-based superconducting quantum computer compiles hybrid classical/quantum algorithms for quantum processing cells with different configurations. The compiler inputs the algorithm and outputs code in a target language executable by a quantum processing cell of a quantum processing system that can execute the algorithm. The compiler includes various functionality, such as: parsing, analyzing control flows, addressing, compressing, and translating. The compiler optimizes algorithms in various manners using the functionality. Some optimizations include addressing efficiently, compressing based on simulations, and translating for efficient execution of parametric functions. The compiler may function in the environment of a cloud quantum computing system. The cloud quantum computing system may receive algorithms from remote access nodes for execution on local classical and quantum computing systems.
1. A method for determining a result for a quantum algorithm, the method comprising:
receiving, from a client device, a quantum algorithm for execution on a quantum processor to determine a result;
parsing the quantum algorithm into a sequence of quantum instructions including a subsequence of initial quantum instructions that manipulate a quantum state to a resulting state;
determining, using a classical processing system and according to a replacement policy, a subsequence of replacement quantum instructions that manipulate the quantum state to the resulting state;
replacing, using the classical processing system and according to a replacement policy, the subsequence of initial quantum instructions with the subsequence of replacement quantum instructions in the sequence of quantum instructions;
translating the sequence of quantum instructions into a sequence of instructions in a target language for executing on the quantum processor;
sending the sequence of instructions to the quantum processor to execute the sequence of instructions;
obtaining a result of the quantum algorithm based on the execution of the sequence of the instructions by the quantum processor; and
transmitting the result of the quantum algorithm to the client device.
2. The method of claim 1 , wherein the replacement policy defines any of:
a maximum size of the quantum state that can be manipulated to the resulting state,
a maximum number of quantum processing sub-units of the quantum processor that replacement quantum instructions can simultaneously manipulate.
3. The method of claim 1 , wherein instructions compiled from the sequence of quantum instructions including the subsequence of replacement quantum instructions execute more quickly on the quantum processor than instructions compiled from the sequence of quantum instructions including the subsequence of initial quantum instructions.
4. The method of claim 1 , wherein a first number of instructions compiled from the sequence of quantum instructions including the subsequence of replacement quantum instructions is lower than a second number of instructions compiled from the sequence of quantum instructions including the subsequence of initial quantum instructions.
5. The method of claim 1 , wherein the subsequence of replacement quantum instructions is smaller than the subsequence of initial quantum instructions.
6. The method of claim 1 , wherein determining a subsequence of replacement quantum instructions further comprises:
calculating a replacement quantum instruction of the subsequence of replacement quantum instructions by multiplying one or more of the subsequence of initial quantum instructions by another one or more of the subsequence of initial quantum instructions.
7. The method of claim 1 , wherein determining a subsequence of replacement quantum instructions further comprises:
accessing a replacement quantum instruction from a system datastore, the replacement quantum instruction for replacing one or more of the subsequence of initial quantum instructions.
8. The method of claim 1 , wherein the quantum state is the initial state of the quantum processor.
9. The method of claim 1 , wherein the subsequence of initial quantum instructions is at the beginning of the sequence of quantum instructions.
10. The method of claim 1 , wherein the subsequence of replacement quantum instructions is at the beginning of the sequence of quantum instructions.
11. A system for determining a result of a quantum algorithm, the system comprising:
a quantum processing system configured to execute quantum instructions of the quantum algorithm;
a classical processing system including one or more processors; and
a non-transitory, computer-readable storage medium storing a computer program executable by the classical processing system to perform steps comprising:
receiving, from a client device via the classical processing system, a quantum algorithm for execution on a quantum processor to determine a result;
parsing the quantum algorithm into a sequence of quantum instructions including a subsequence of initial quantum instructions that manipulate a quantum state to a resulting state;
determining, using the classical processing system and according to a replacement policy, a subsequence of replacement quantum instructions that manipulate the quantum state to the resulting state;
replacing, using the classical processing system and according to a replacement policy, the subsequence of initial quantum instructions with the subsequence of replacement quantum instructions in the sequence of quantum instructions;
translating the sequence of quantum instructions into a sequence of instructions in a target language for executing on the quantum processing system;
sending the sequence of instructions to the quantum processing system to execute the sequency of instructions;
obtaining a result of the quantum algorithm based on the execution of the sequence of the instructions by the quantum processing system; and
transmitting the result of the quantum algorithm to the client device.
12. The system of claim 11 , wherein the replacement policy defines any of:
a maximum size of the quantum state that can be manipulated to the resulting state,
a maximum number of quantum processing sub-units of the quantum processor that replacement quantum instructions can simultaneously manipulate.
13. The system of claim 11 , wherein instructions in the target language compiled from the sequence of quantum instructions including the subsequence of replacement quantum instructions execute more quickly on the quantum processing system than instructions in the target language compiled from the sequence of quantum instructions including the subsequence of initial quantum instructions.
14. The system of claim 11 , wherein a first number of instructions in the target language compiled from the sequence of quantum instructions including the subsequence of replacement quantum instructions is lower than a second number of instructions in the target language compiled from the sequence of quantum instructions including the subsequence of initial quantum instructions.
15. The system of claim 11 , wherein the subsequence of replacement quantum instructions is smaller than the subsequence of initial quantum instructions.
16. The system of claim 11 , wherein the computer program instructions for determining a subsequence of replacement quantum instructions are further executable to perform steps comprising:
calculating a replacement quantum instruction of the subsequence of replacement quantum instructions by multiplying one or more of the subsequence of initial quantum instructions by another one or more of the subsequence of initial quantum instructions.
17. The system of claim 11 , wherein the computer program instructions for determining a subsequence of replacement quantum instructions are further executable to perform steps comprising:
accessing a replacement quantum instruction from a system datastore, the replacement quantum instruction for replacing one or more of the subsequence of initial quantum instructions.
18. The system of claim 11 , wherein the quantum state is the initial state of the quantum processor.
19. The system of claim 11 , wherein the subsequence of initial quantum instructions is at the beginning of the sequence of quantum instructions.
20. A non-transitory computer-readable storage medium storing computer instructions for determining a result of a quantum algorithm, the computer instructions, when executed by one or more processors, causing the one or more processors to:
receive, from a client device, a quantum algorithm for execution on a quantum processor to determine a result;
parse the quantum algorithm into a sequence of quantum instructions including a subsequence of initial quantum instructions that manipulate a quantum state to a resulting state;
determine, using a classical processing system and according to a replacement policy, a subsequence of replacement quantum instructions that manipulate the quantum state to the resulting state;
replace, using the classical processing system and according to a replacement policy, the subsequence of initial quantum instructions with the subsequence of replacement quantum instructions in the sequence of quantum instructions;
translate the sequence of quantum instructions into a sequence of instructions in a target language for executing on the quantum processor;
send the sequence of instructions to the quantum processor to execute the sequence of the instructions;
obtain a result of the quantum algorithm based on the execution of the sequence of the instructions by the quantum processor; and
transmit the result of the quantum algorithm to the client device.