Search

KR-102963021-B1 - METHOD FOR SCHEDULING QUANTUM CIRCUITS AND SERVER PERFORMING THE SAME

KR102963021B1KR 102963021 B1KR102963021 B1KR 102963021B1KR-102963021-B1

Abstract

The present invention is configured to include, as a method performed by a processor of a scheduling server, the steps of acquiring a quantum circuit, determining the resource requirements of the quantum circuit based on at least one parameter analyzed in the quantum circuit, determining in real time available resources of a simulation computing server for processing the quantum circuit, and determining in real time a processing schedule of the quantum circuit according to the resource requirements and the available resources.

Inventors

  • 김희성
  • 도선희

Assignees

  • 주식회사 블록에스

Dates

Publication Date
20260512
Application Date
20241227

Claims (20)

  1. As a method performed by the processor of a scheduling server, Step of acquiring a quantum circuit; A step of determining the resource requirements of the quantum circuit based on at least one parameter analyzed in the quantum circuit; A step of determining in real time available resources of a plurality of simulation computing servers for processing the above quantum circuit; A step of determining the processing schedule of the quantum circuit in real time according to the resource requirements and available resources; A step of monitoring the load of resources including a plurality of processors, memory, and network included in each of the plurality of simulation computing servers to determine whether resource redistribution is necessary while simulating the quantum circuit in the plurality of simulation computing servers according to the processing schedule above; A step of determining the possibility of job migration for a simulation computing server requiring resource redistribution among the plurality of simulation computing servers based on the results of the above monitoring; A step of calculating the work transfer time and load difference to the remaining simulation computing server among the plurality of simulation computing servers based on the above judgment result; A step of determining a simulation computing server capable of resource redistribution among the remaining simulation computing servers based on the above task transition time and the above load difference; and A quantum circuit scheduling method comprising the step of changing the processing schedule of available resources in real time within the resource-redistributable simulation computing server to process at least some of the tasks of the quantum circuit.
  2. In paragraph 1, The step of determining the above resource requirements is, A quantum circuit scheduling method comprising the step of determining the resource requirement based on the complexity of the quantum circuit or the amount of computation of the quantum circuit.
  3. In paragraph 2, The step of determining the above resource requirements is, A quantum circuit scheduling method further comprising the step of analyzing at least one parameter among the number of gates, gate type, circuit depth, parallelism, gate dependency, or memory requirement of a quantum circuit.
  4. In paragraph 3, The step of analyzing the above parameters is, A quantum circuit scheduling method further comprising the step of determining a section in which the resource requirement can be reduced in the quantum circuit for resource optimization according to the simultaneous processing of the quantum circuit, by utilizing at least one of a plurality of processors, memory, or network included in the simulation computing server according to the result of the above parameter analysis.
  5. In paragraph 1, The step of determining the above available resources in real time is, A quantum circuit scheduling method further comprising the step of verifying a performance indicator or the structure of at least one of a plurality of processors, memory, or network included in the simulation computing server.
  6. In paragraph 5, The step of determining the above processing schedule in real time is, A quantum circuit scheduling method further comprising the step of determining one simulation computing server, a processor, and the processing order thereof for processing the quantum circuit based on a resource allocation range matching the above performance indicators.
  7. In paragraph 6, The step of determining the above processing schedule in real time is, A quantum circuit scheduling method comprising the step of determining a schedule to process the quantum circuit in parallel using two or more simulation computing servers or processors.
  8. delete
  9. delete
  10. delete
  11. Communication interface; Memory; A processor operably connected to the communication interface and the memory; comprising The above processor is, Quantum circuit scheduling is configured to acquire a quantum circuit, determine the resource requirements of the quantum circuit based on at least one parameter analyzed in the quantum circuit, determine in real time the available resources of a plurality of simulation computing servers for processing the quantum circuit, determine in real time the processing schedule of the quantum circuit according to the resource requirements and the available resources, monitor the load of resources including a plurality of processors, memory, and networks included in each of the plurality of simulation computing servers to determine whether resource redistribution is necessary for each of the plurality of simulation computing servers while simulating the quantum circuit in the simulation computing servers according to the processing schedule, determine the possibility of job migration for a simulation computing server requiring resource redistribution among the plurality of simulation computing servers based on the result of the monitoring, calculate the job transfer time and load difference to the remaining simulation computing servers among the plurality of simulation computing servers based on the result of the determination, determine a simulation computing server capable of resource redistribution among the remaining simulation computing servers based on the job transfer time and load difference, and change the processing schedule of available resources within the resource redistribution-capable simulation computing server in real time to process at least a portion of the tasks of the quantum circuit. Server.
  12. In Paragraph 11, The above processor is, A quantum circuit scheduling server configured to determine the resource requirements based on the complexity of the quantum circuit or the computational amount of the quantum circuit.
  13. In Paragraph 12, The above processor is, A quantum circuit scheduling server further configured to analyze at least one parameter among the number of gates, gate type, circuit depth, parallelism, gate dependency, or memory requirement of a quantum circuit to determine the above resource requirements.
  14. In Paragraph 13, The above processor is, A quantum circuit scheduling server further configured to determine a section in which the resource requirement can be reduced in the quantum circuit for resource optimization according to the simultaneous processing of the quantum circuit, by utilizing at least one of a plurality of processors, memory, or network included in the simulation computing server, while analyzing the above parameters according to the result of the parameter analysis.
  15. In Paragraph 11, The above processor is, A quantum circuit scheduling server further configured to check performance indicators or respective structures for at least one of a plurality of processors, memory, or network included in the simulation computing server in order to determine the above available resources in real time.
  16. In paragraph 15, The above processor is, A quantum circuit scheduling server further configured to determine a simulation computing server, a processor, and the processing order thereof for processing the quantum circuit based on a resource allocation range matching the above performance indicators.
  17. In Paragraph 16, The above processor is, A quantum circuit scheduling server configured to determine a schedule for processing the quantum circuit in parallel using two or more simulation computing servers or processors.
  18. delete
  19. delete
  20. delete

Description

Method for scheduling quantum circuits and server performing the same The present invention relates to a quantum circuit scheduling method and a server for performing the same. Quantum computing refers to a method of processing data by utilizing quantum mechanical phenomena such as quantum entanglement or superposition. Although quantum computing is considered the next generation of computers because it can solve complex problems faster than conventional computing, it is still in the early stages of development and has not yet been commercialized. Accordingly, major research institutions and companies studying quantum computing are providing platforms capable of testing and verifying quantum circuits by offering not only quantum computers but also quantum simulators for technology development. However, conventional platforms are configured to allow users to manually select the backend for simulation or process tasks on a single backend, which limits their performance when dealing with complex quantum circuits. In particular, while high-performance backends are required to handle complex quantum circuits, existing simulators do not automatically optimize backend performance, leading to resource waste or reduced simulation speeds. The background description of the invention is provided to facilitate a better understanding of the present invention. The matters described in the background description should not be understood as an acknowledgment that they exist as prior art. FIG. 1 is a schematic diagram illustrating a quantum circuit scheduling method according to one embodiment of the present invention. FIG. 2 is a block diagram showing the configuration of a quantum circuit simulation system according to one embodiment of the present invention. FIG. 3 is a block diagram showing the configuration of a quantum circuit simulation server according to one embodiment of the present invention. FIG. 4 is a schematic flowchart of a quantum circuit scheduling method according to one embodiment of the present invention. FIG. 5 is a schematic diagram illustrating the resource requirements of a quantum circuit according to one embodiment of the present invention. FIGS. 6a and 6b are schematic diagrams illustrating a method for resetting quantum circuit scheduling according to one embodiment of the present invention. The advantages and features of the present invention and the methods for achieving them will become clear by referring to the embodiments described below in detail together with the accompanying drawings. However, the present invention is not limited to the embodiments disclosed below but may be implemented in various different forms. These embodiments are provided merely to ensure that the disclosure of the present invention is complete and to fully inform those skilled in the art of the scope of the invention, and the present invention is defined only by the scope of the claims. In connection with the description of the drawings, similar reference numerals may be used for similar components. In this document, expressions such as "have," "can have," "include," or "can include" refer to the existence of the relevant feature (e.g., numerical values, functions, actions, or components, etc.) and do not exclude the existence of additional features. In this document, expressions such as “A or B,” “at least one of A or/and B,” or “one or more of A or/and B” may include all possible combinations of items listed together. For example, “A or B,” “at least one of A and B,” or “at least one of A or B” may refer to cases including (1) at least one A, (2) at least one B, or (3) both at least one A and at least one B. Expressions such as "first," "second," "first," or "second" used in this document may modify various components regardless of order and/or importance, and are used merely to distinguish one component from another without limiting such components. For example, the first user device and the second user device may represent different user devices regardless of order or importance. For example, without departing from the scope of rights set forth in this document, the first component may be named the second component, and similarly, the second component may be renamed the first component. Where it is stated that a certain component (e.g., a first component) is "(operatively or communicatively) coupled with" or "connected to" another component (e.g., a second component), it should be understood that the said certain component may be directly connected to the said other component or connected through another component (e.g., a third component). On the other hand, where it is stated that a certain component (e.g., a first component) is "directly connected" or "directly connected" to another component (e.g., a second component), it may be understood that no other component (e.g., a third component) exists between the said certain component and the said other component. As used in this document, the expression “config