Quantum program compile method, and quantum program compile apparatus

Abstract

To make it possible to promptly determine a movement operation procedure corresponding to contents of a quantum program.SOLUTION: A quantum program compile apparatus 100 stores, in a storage device 101, information on node topology indicating a connection relation of each node in which a quantum bit is formed and information on control operation capable of being carried out in a predetermined region of the node topology, and, with respect to a quantum program described by combination of control operation to the quantum bit, generates a procedure of movement operations of the quantum bit in accordance with the connection relation, as a procedure for carrying out the control operation of the quantum program in the predetermined region in the node topology based on the node topology and each information of the control operation.SELECTED DRAWING: Figure 1

Description

[Technical field]

[0001] The present invention relates to a quantum program compiling method and a quantum program compiling device. [Background technology]

[0002] To realize a quantum computer, it is necessary to implement quantum bits that can hold the values ​​of 0 and 1 simultaneously. For example, in a silicon-electron quantum computer, a quantum bit is realized by confining an electron in a quantum dot implemented by a field-effect transistor or the like.

[0003] Control operations (operations for calculations) on these quantum bits are performed by applying a static magnetic field or an electromagnetic pulse to the quantum bit, but it is difficult to generate a static magnetic field or electromagnetic pulse specifically for the quantum bit in question.

[0004] The primitive operation in a quantum computer is the manipulation of a single quantum bit. There are quantum bit operations and two-qubit operations in which two quantum bits interact with each other. To realize two-qubit operations, the two target quantum bits must be placed close to each other. Therefore, in order to be able to perform two-qubit operations on as many pairs of quantum bits as possible, it is necessary to place the quantum bits as close as possible to each other.

[0005] However, when quantum bits are placed in close proximity, a control operation on one quantum bit can cause interference with unrelated quantum bits around it, resulting in unexpected changes in the quantum bit state and low-fidelity computation results.

[0006] In addition, to apply a static magnetic field or an electromagnetic pulse to a quantum bit, a voltage must be applied to the electrodes that control the quantum bit, and control lines are required to pass a current. In a design in which control lines are placed individually for each quantum bit, the number of control lines increases as the number of quantum bits increases, making it difficult to implement a large number of quantum bits due to spatial constraints for placing the control lines.

[0007] To address this problem, as shown in Patent Document 1, multiple quantum bits are controlled by a single control line. In the method disclosed in Patent Document 1, quantum bits are arranged in an array, and a common control line is provided for each column or row. Then, calculations for the quantum bits are realized by using this control line.

[0008] However, as mentioned above, the control lines are common to each column or row, so when a control operation is performed on a quantum bit, the control operation is also performed on unrelated quantum bits in the same column or row, resulting in an unexpected computation result.

[0009] Thus, depending on the implementation of the control lines, performing an operation on a qubit can affect surrounding qubits or qubits in the same column or row, resulting in low-fidelity or unexpected results.

[0010] As a means for solving the above problems, in a silicon electronic quantum computer, the movement operation of quantum bits can be utilized.

[0011] In the silicon electronics method, the transfer operation is an operation in which the electron constituting the quantum bit is spatially moved to an adjacent (and empty) quantum dot. This transfer operation makes it possible to isolate unrelated quantum bits from the quantum bit to be controlled, which may reduce unwanted effects on the quantum bit. [Prior art documents] [Patent documents]

[0012] [Patent Document 1] Patent Publication No. 2021-27142 Summary of the Invention [Problem to be solved by the invention]

[0013] However, the above movement operation is also realized by applying a voltage to the electrodes. Therefore, there is a possibility that a certain (side effect) effect will be exerted on the target quantum bit and the surrounding quantum bits. Therefore, it is necessary to design the movement operation appropriately, taking into account the effect of the control operation of the quantum bit and the effect of the movement operation. In addition, the procedure for moving the quantum bits depends on the content of the operations described as a quantum program, for example, the number of quantum bits to be used, the type and number of quantum bit operations, or the order of their execution.

[0014] From the above, when a quantum program to be executed is given, it is necessary to design a transfer operation procedure corresponding to that quantum program and input it into the quantum computer. However, the method for doing so is not self-evident.

[0015] In addition, because the design of the transfer operation procedure is performed before the quantum program is executed, if it takes a long time to design the transfer operation procedure, the time from providing the quantum program to the quantum computer to obtaining the calculation results will also be long. Therefore, in practical use, it is required to complete the design of the transfer operation procedure in a short time.

[0016] Therefore, an object of the present invention is to provide a technique that enables rapid determination of a transfer operation procedure corresponding to the contents of a quantum program. [Means for solving the problem]

[0017] The quantum program compiling method of the present invention, which solves the above-mentioned problems, is characterized in that an information processing device stores in a storage device information on node topology representing the connection relationships of each node in which quantum bits are formed, and information on control operations that can be performed in a specified area of ​​the node topology, and for a quantum program described by a combination of control operations on quantum bits, generates a procedure for moving the quantum bits along the connection relationships as a procedure for executing the control operations of the quantum program in a specified area in the node topology based on the information on the node topology and the control operations. The quantum program compilation device of the present invention is also characterized in that it comprises a storage device that holds information on node topology representing the connection relationships of each node in which quantum bits are formed, and information on control operations that can be performed in a specified area of ​​the node topology, and a calculation device that generates, for a quantum program described by a combination of control operations on quantum bits, a procedure for moving the quantum bits along the connection relationships as a procedure for executing the control operations of the quantum program in a specified area in the node topology based on the information on the node topology and the control operations. Effect of the Invention

[0018] According to the present invention, it is possible to quickly determine a transfer operation procedure corresponding to the contents of a quantum program. become. [Brief description of the drawings]

[0019] [Figure 1] FIG. 1 is a diagram illustrating a network configuration including a quantum program compilation device of this embodiment. [Diagram 2] FIG. 2 is a diagram illustrating an example of the hardware configuration of a quantum program compilation device in this embodiment. [Diagram 3] FIG. 2 is a diagram illustrating an example of a quantum program in this embodiment. [Figure 4] 4 is a diagram showing an example of a configuration of node topology information in the present embodiment; FIG. [Diagram 5]FIG. 2 is a diagram showing an example of a quantum dot topology according to the present embodiment. [Figure 6] 1A and 1B are diagrams illustrating examples of regions that configure the quantum dot topology of the present embodiment. [Figure 7] 4 is a diagram showing an example of the configuration of control operation information in the present embodiment. FIG. [Figure 8] 11A to 11C are diagrams illustrating an example of an operation method within a region according to the present embodiment. [Figure 9] 11A to 11C are diagrams illustrating an example of an operation method within a region according to the present embodiment. [Figure 10] 11A to 11C are diagrams illustrating an example of an operation method within a region according to the present embodiment. [Figure 11] 11A to 11C are diagrams illustrating an example of an operation method within a region according to the present embodiment. [Figure 12] FIG. 1 is a diagram showing an example of a flow of a quantum program compiling method according to an embodiment of the present invention. [Figure 13] FIG. 1 is a diagram showing an example of a flow of a quantum program compiling method according to an embodiment of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0020] <Network configuration> Hereinafter, an embodiment of the present invention will be described in detail with reference to the drawings. Fig. 1 is a network configuration diagram including a quantum program compiling device 100 of this embodiment. The quantum program compiling device 100 shown in Fig. 1 is a computer that can quickly determine a movement operation procedure corresponding to the contents of a quantum program.

[0021] 1, the quantum program compilation device 100 of this embodiment is communicably connected to a terminal 200 via an appropriate network 1. Therefore, these may be collectively referred to as a quantum program compilation system 10.

[0022] The quantum program compiling device 100 of this embodiment can be said to be a device that, for example, receives a processing request from a person who wishes to compile a quantum program and provides a compilation service for the quantum program.

[0023] On the other hand, the terminal 200 is a terminal that uploads the quantum program to be compiled to the above-mentioned quantum program compiling device 100 and obtains the compilation result. Specifically, various information processing devices such as personal computers, tablet terminals, and smartphones that are capable of transmitting and receiving necessary data to and from the quantum program compiling device 100 can be envisioned. <Hardware configuration> Moreover, the hardware configuration of the quantum program compiling device 100 of this embodiment is as shown in FIG.

[0024] That is, the quantum program compilation device 100 includes a storage device 101 , a memory 103 , a calculation device 104 , and a communication device 105 .

[0025] Of these, the storage device 101 is configured with an appropriate non-volatile storage element such as an SSD (Solid State Drive) or a hard disk drive.

[0026] The memory 103 is composed of a volatile storage element such as a RAM.

[0027] The arithmetic device 104 is a CPU (Central Processing Unit) that reads out the program 102 stored in the storage device 101 into the memory 103 and executes the program, controls the device itself, and performs various types of judgment, calculation, and control processing.

[0028] The communication device 105 is assumed to be a network interface card or the like that is connected to the network 1 and handles communication processing with the terminal 200 .

[0029] Furthermore, if the quantum program compiling device 100 is a stand-alone machine, it is preferable for it to further include an input device that accepts key input or voice input from the user, and an output device such as a display that displays processing data.

[0030] In addition to the program 102 for implementing the functions required for the quantum program compiling device of this embodiment, at least a quantum program 1010 to be compiled (see FIG. 3), node topology information 1011 (see FIG. 4) and control operation information 1012 (see FIG. 5) required for the compilation process are stored in the storage device 101. However, details of these data will be described later. <Data structure example> Next, various information used by the quantum program compiling device 100 of this embodiment will be described. FIG. 3 shows an example of a quantum program 1010 in this embodiment. As shown in the figure, the quantum program 1010 assumed in this embodiment is a program that performs a cx gate operation in a predetermined quantum circuit "12" with the control bit of the quantum bits being "5" and the target bit being "12". However, this is of course just one example, and quantum programs in the form of a combination of various quantum gates in various quantum circuits can be adopted.

[0031] FIG. 4 shows an example of node topology information 1011 of this embodiment, FIG. 5 shows an example of a quantum bit topology of this embodiment, and FIG. 6 shows an example of an area constituting a quantum dot topology of this embodiment.

[0032] The node topology information 1011 in this embodiment is, for example, a table that uses the identification information of each region (see FIG. 6) that constitutes the quantum dot topology (see FIG. 5) as a key, and defines the connections between the quantum bits contained in the region in terms of the relationship between the root, i.e., the starting point where the quantum bit exists in the region, and each point where the quantum bit can move downward from there toward an adjacent region.

[0033] Of course, this is just an example, and the information may define the node topology in other forms. In addition, in the node topology information 1011 of this embodiment, pre-conditions and post-conditions are defined for each area. The specific contents of these pre-conditions and post-conditions will be described later.

[0034] 7 shows an example of the control operation information 1012 of this embodiment. The control operation information 1012 in this embodiment is information that defines, for example, for each region defined in the above-mentioned node topology information 1011, each piece of information including an intra-region operation method (described later) indicating the form of electron movement of a quantum bit that can be executed in that region, a quantum computer on which electron movement or control operation is to be executed, executable control operations, a movement operation cost to that quantum bit, and a control operation cost. Of these, the "control operation cost" information is set to a value of "no control operation" if a control operation cannot be executed in that region and by the intra-region operation method.

[0035] In addition, in FIG. 8 to FIG. 11, each quantum bilayer in each of the regions "1" and "2" is This shows an example of the manipulation of electron transfer between nuclei.

[0036] For example, the example in Figure 8 explains the "pre-conditions" that regulate the existence of electrons at their initial positions (left end of the region) when "Region Operation Method 1" is applied to each quantum bit in "Region 1," the movement paths of each electron from the initial positions by the "movement operations," and the "post-conditions" that regulate the existence of electrons that are ultimately determined at the end positions of the region by performing the movement operations sequentially.

[0037] Similarly, the example in Figure 9 explains the "pre-conditions" that regulate the existence of electrons at their initial positions (left end of the region) when "region operation method 2" is applied to each quantum bit in "region 1," the movement paths of each electron from the initial positions by the "movement operations," and the "post-conditions" that regulate the existence of electrons that are ultimately determined at the end positions of the region by performing the movement operations sequentially.

[0038] In addition, the examples in Figures 10 and 11 explain the "pre-conditions" that regulate the existence of electrons at their initial positions (left end of the region) when "Intra-region operation method 1" is applied to each quantum bit in the above-mentioned "Region 1" and the adjacent "Region 2" on the downside, the movement paths of each electron from the initial positions by the "movement operations", and the "post-conditions" that regulate the existence of electrons that are finally determined at the end positions of the region by performing the movement operations sequentially. <Flow example> The actual procedure of the quantum program compilation method in this embodiment will be described below with reference to the drawings. Various operations corresponding to the quantum program compilation method described below are realized by a program that the quantum program compilation device 100 reads into a memory or the like and executes. This program is composed of codes for performing the various operations described below.

[0039] 12 is a diagram showing an example of a flow of the quantum program compiling method in this embodiment. In this case, the quantum program compiling device 100, for example, refers to the quantum program 1010 (FIG. 3) provided from the terminal 200 and stored in the storage device 101, and acquires each value of the quantum bit and the target control operation that are the control execution target in the quantum program 1010 (s1).

[0040] In the example of quantum program 1010 shown in FIG. 3, the quantum bits to be controlled and executed are "5" and "12", and the target control operation is a "cx gate."

[0041] Next, the quantum program compiling device 100 refers to the node topology information 1011, and identifies (s2) electrons corresponding to the quantum bit (5, 12) of the control execution target acquired in s1 on the quantum dot topology indicated by the node topology information 1011. This identification identifies the quantum bits "5" and "12" in "Area 1" in the node topology information 1011 of FIG.

[0042] Furthermore, the quantum program compiling device 100 refers to the control operation information 1012 to identify a control execution region in which the target control operation (information acquired in s1) can be executed (s3). According to the control operation information 1012 in Fig. 7, it is stipulated that "CX" can be executed in "Region 2", and "Region 2" is identified as the control execution region.

[0043] Next, the quantum program compiling apparatus 100 selects the path region sequence up to "Region 2", which is the control execution region (s4). In this embodiment, since "Region 2" is the control execution region, the path region sequence is from "Region 1" to "Region 2". In other words, when the regions are connected in series, the connection state from the region that is the electron movement viewpoint to the region of the control execution region is The resulting group of regions becomes the route region series.

[0044] On the other hand, in the case where there are multiple systems of connected areas, with the control execution area ultimately being the node, the quantum program compilation device 100 can be assumed to arbitrarily select one of the multiple systems and execute this flow, repeating this process as many times as the number of systems, until the judgment at s6 described below is "YES", i.e., until the desired control operation can be executed.

[0045] Furthermore, the quantum program compiling device 100 selects the intra-domain operation method defined in the domains 1 and 2 specified up to this point (s5). The intra-domain operation method defines the method of moving electrons between quantum bits within a domain, as shown in Figs. 8 to 11.

[0046] This selection refers to the value in the "intra-area operation method" column of the control operation information 1012, and selects, for example, one of the methods defined for the quantum bit in which the electron to be moved is located. However, depending on the result of the determination in the next step s6, there may be cases where another intra-area operation method defined for the quantum bit is selected.

[0047] Next, the quantum program compiling device 100 judges whether the post-condition of the upstream region and the pre-condition of the downstream region are consistent and the desired control operation is executed on the target quantum bit (s6). In the case of this embodiment, the consistency of the pre- and post-conditions is judged between the upstream region "region 1" and the downstream region "region 2".

[0048] The above-mentioned post-conditions prescribe at least one of the number of quantum bits that have advanced from "region 1" (toward adjacent region 2) or the positions of the advancement thereof, and the stopping positions of the quantum bits in "region 1" by executing at least one of the electron movement operation and control operation. The quantum program compiling device 100 holds such post-conditions for each region in the node topology information 1011 (FIG. 4) of the storage device 101.

[0049] In addition, the above-mentioned preconditions are assumed to stipulate at least one of the number of quantum bits entering "area 2" (from the above-mentioned area 1) or the entry position thereof, and the initial position of the quantum bits in "area 2". The quantum program compiling device 100 also holds information on these preconditions for each area in the node topology information 1011 (FIG. 4) of the storage device 101.

[0050] In this case, for example, the quantum program compilation device 100 checks whether the post-condition of "intra-area operation method 2" in "Area 1" (assumed to be selected in s5) is consistent with the pre-condition of "intra-area operation method 1" in "Area 2" (also assumed to be selected in s5) adjacent to this "Area 1" and into which the quantum bit is allowed to enter.

[0051] If the post-condition of "Region-internal Operation Method 2" in "Region 1" is, for example, that a total of four sets of electrons are output from the quantum bit #6 and the quantum bit #12, and the pre-condition of "Region 2" is, for example, that in the initial state, no electrons exist in any quantum bit within the region, and a total of four sets of electrons are input to each of the quantum bits #13 and #17 connected to "Region 1", then there will be no problem with the consistency of the conditions.

[0052] However, suppose that in "Region 1"'s "Intra-Region Operation Method 2" a control operation is not performed on the electrons of the quantum bits "5" and "12". In that case, the determination in the above-mentioned s6 outputs "NO", that is, the desired control operation is not performed on the target quantum bit, and the quantum program compiling device 100 returns the process to s5 and performs the operations related to each region. Then, a different method of operation within the area can be selected.

[0053] As a result, it is assumed that "intra-domain operation method 1" is selected for "domain 1" and "intra-domain operation method 1" is selected for "domain 2." Then, it is assumed that the quantum program compiling device 100 executes s6 again, and as a result, for example, it is in a form in which there is no problem with the consistency of the pre- and post-conditions as described above, and the control operations are executed on the electrons of the above-mentioned quantum bits "5" and "12."

[0054] In this case, the determination in s6 above results in "YES", that is, a determination result that the desired control operation is executed on the target quantum bit, and the quantum program compiling device 100 ends the process.

[0055] In addition to the above flow, a case in which a desired control operation is executed while minimizing the cost related to operations such as electron movement will be described with reference to the flow of Fig. 13. Note that s20 to s23 in this flow are the same as s1 to s4 in the flow of Fig. 12, and therefore description thereof will be omitted.

[0056] Here, the quantum program compiling device 100 refers to the control operation information 1012 (FIG. 7) and selects the intra-domain operation method with the smallest cost (s24). For example, among the patterns of the domains and intra-domain operation methods, any combination of (#1, #3), (#1, #4), (#2, #3), and (#2, #4) can realize the desired control operation "CX", but the pattern with the smallest total cost (#1, #3), that is, the combination pattern of "intra-domain operation method 1" in "domain 1" and "intra-domain operation method 1" in "domain 2", is selected.

[0057] The quantum program compiling device 100 also determines whether the post-condition of the upper region, i.e., "region 1," and the pre-condition of the lower region, i.e., "region 2," indicated by the pattern selected in the above-mentioned s24, match, and whether the desired control operation is executed on the target quantum bit (s25). This determination is the same process as s6 in the flow of FIG. 12, so a description thereof will be omitted.

[0058] If the above-mentioned judgment result indicates that the conditions are not consistent or the desired control operation is not executable (s25: NO), the quantum program compiling device 100 returns the process to s24 and selects a new intra-domain operation method.

[0059] On the other hand, if the above-mentioned determination result indicates that the conditions are consistent and the desired control operation is executable (s25: YES), the quantum program compiling device 100 determines whether all path region sequences have been evaluated (s26).

[0060] If the result of the above-mentioned determination is that all path region sequences have not yet been evaluated (s26: NO), the quantum program compiling device 100 returns the process to s23 and selects a new path region sequence.

[0061] On the other hand, if the result of the above judgment is that all path region sequences have been evaluated (s26: YES), the quantum program compiling device 100 selects the path region sequence and intra-region operation method that have the smallest cost (s27) and terminates the processing.

[0062] Although the best mode for carrying out the present invention has been specifically described above, the present invention is not limited to this, and various modifications are possible without departing from the spirit and scope of the present invention.

[0063] Generating and evaluating the procedures for movement and control operations by exhaustive search requires a huge amount of computation. However, according to this embodiment, the entire operation procedure is obtained by searching for combinations of patterns of movement operations and control operations defined for each region. Note that the patterns of movement operations and control operations (operation methods within a region) include "intrusion of electrons from outside," "advancement of electrons to outside," and "movement operations and control operations of electrons within the region."

[0064] Therefore, although the search space depends on the number of the above patterns, it is expected that the search space will be reduced compared to the conventional exhaustive search. Therefore, the procedure for the electron movement operation and control operation can be determined quickly. In other words, it is possible to quickly determine the movement operation procedure corresponding to the content of the quantum program.

[0065] The description of this specification makes at least the following clear. That is, in the quantum program compiling method of this embodiment, the information processing device further holds, in the storage device, information on the intra-region operation method defined for each partial region of the node topology, including a precondition that is a premise for the quantum bit operation in the partial region, at least one of a move operation or a control operation performed on the quantum bit under the premise, and information on a postcondition that represents the result of at least one of the move operation or the control operation, and when generating the procedure, obtains information on the target quantum bit that is the control execution target and its target control operation from the quantum program, selects a partial region in the node topology in which the target control operation can be executed as a control execution region, selects a series of each partial region that constitutes a path from a start region in which the target quantum bit exists in the node topology to the control execution region as a route region series, and selects the intra-region operation method in each region so that the postcondition of the upstream region and the precondition of the downstream region are consistent for two adjacent regions in the route region series, thereby generating the procedure for the move operation and the control operation.

[0066] This makes it possible to efficiently identify and generate a route to a subdomain where a desired control operation (one that needs to be executed by a quantum program) can be executed, while ensuring that the connections between each subdomain that constitutes the node topology are consistent. In other words, it becomes possible to more quickly determine a movement operation procedure that corresponds to the contents of the quantum program.

[0067] Furthermore, in the quantum program compiling method of this embodiment, the information processing device may store, in the storage device, as the preconditions, information on at least one of the number of quantum bits entering the subregion or the entry positions, and the initial positions of the quantum bits in the subregion, and select a method of operation within the region based on the preconditions including the information.

[0068] This makes it possible to accurately and efficiently identify and generate a route to a subdomain where a desired control operation (one that needs to be executed by a quantum program) can be executed, while ensuring that the connections between each subdomain that constitutes the node topology are properly matched. In other words, it becomes possible to more quickly determine a movement operation procedure that corresponds to the contents of the quantum program.

[0069] Furthermore, in the quantum program compiling method of this embodiment, the information processing device may retain, in the storage device, as the post-conditions, information on at least one of the number of quantum bits that have advanced from the sub-region or the position of their advancement, and the stopping position of the quantum bits in the sub-region, and select a method of operation within the region based on the post-conditions including the information.

[0070] According to this, while ensuring that the connections between the respective partial domains constituting the node topology are properly matched, the partial domains in which the desired control operations (those that need to be executed by the quantum program) can be executed are selected. This makes it possible to specify and generate routes with good accuracy and efficiency up to the quantum computing region. In other words, it becomes possible to more quickly determine the movement operation procedure corresponding to the contents of the quantum program.

[0071] In addition, in the quantum program compiling method of this embodiment, the information processing device may store an operation cost in the storage device as information on the intra-region operation method, evaluate the execution cost of the path region series based on the operation cost, and select the path region series and the intra-region operation method based on the result of the evaluation.

[0072] This makes it possible to make the above-mentioned movement operation procedure more efficient. That is, it becomes possible to quickly determine a movement operation procedure that corresponds to the contents of the quantum program.

[0073] In addition, in the quantum program compiling device of this embodiment, the storage device further holds, as information on the intra-region operation method defined for each partial region of the node topology, information on a precondition that is a premise for the quantum bit operation in the partial region, at least one of a move operation or a control operation performed on the quantum bit under the premise, and a post-condition that represents the result of at least one of the move operation or the control operation, and the arithmetic device, when generating the procedure, obtains information on the target quantum bit to be controlled and its target control operation from the quantum program, selects a partial region in the node topology in which the target control operation can be executed as a control execution region, selects a series of each partial region that constitutes a path from a starting region in which the target quantum bit exists in the node topology to the control execution region as a path region series, and selects the intra-region operation method in each of two adjacent regions in the path region series so that the post-condition of the upstream region and the pre-condition of the downstream region are consistent, thereby generating the procedure for the move operation and the control operation.

[0074] In addition, in the quantum program compiling device of this embodiment, the storage device may hold, as the preconditions, information on at least one of the number of quantum bits entering the subregion or the entry position thereof, and the initial position of the quantum bits in the subregion, and the calculation device may select the operation method within the region based on the preconditions including the information.

[0075] Furthermore, in the quantum program compiling device of this embodiment, the storage device may hold, as the post-condition, information on at least one of the number of quantum bits that have advanced from the sub-region or the position of their advancement by executing at least one of the move operation or the control operation, and the stopping position of the quantum bits in the sub-region, and the calculation device may select the operation method within the region based on the post-condition including the information.

[0076] In addition, in the quantum program compilation device of this embodiment, the storage device may store an operation cost as information on the intra-domain operation method, and the arithmetic device may evaluate the execution cost of the path domain series based on the operation cost, and select the path domain series and the intra-domain operation method based on the result of the evaluation. [Explanation of symbols]

[0077] 1 Network 10 Quantum Program Compilation System 100 Quantum program compilation device 101 Storage device 1010 Quantum Program 1011 Node Topology Information 1012 Control operation information 102 Programs 103 Memory 104 Arithmetic equipment 105 Communication equipment 200 terminals

Claims

1. An information processing device, storing, in a storage device, information on a node topology that represents a connection relationship of each node in which a quantum bit is formed, and information on a control operation that can be performed in a predetermined area of ​​the node topology; With respect to a quantum program described by a combination of control operations for quantum bits, a procedure of a movement operation of the quantum bits along the connection relationship is generated as a procedure for executing the control operations of the quantum program in a predetermined area in the node topology based on each information of the node topology and the control operations. A quantum program compilation method comprising:

2. The information processing device, In the storage device, as information of an intra-area operation method defined for each partial area of ​​the node topology, information on a precondition that is a premise for a quantum bit operation in the partial area, at least one of a move operation and a control operation performed on the quantum bit under the precondition, and information on a postcondition that represents a result of at least one of the move operation and the control operation are further stored; When generating the procedure, information on a target quantum bit to be controlled and its target control operation is obtained from the quantum program, a partial region in which the target control operation can be executed is selected as a control execution region in the node topology, a series of partial regions constituting a path from a starting region in which the target quantum bit exists in the node topology to the control execution region is selected as a path region series, and for two adjacent regions in the path region series, an intra-region operation method is selected in each region such that a post-condition of the upstream region and a pre-condition of the downstream region are consistent, thereby generating a procedure for the movement operation and the control operation. The quantum program compilation method according to claim 1 .

3. The information processing device, In the storage device, as the preconditions, information on at least one of the number of quantum bits entering the partial region or the entry positions thereof, and the initial positions of the quantum bits in the partial region are stored, and the intra-region operation method is selected based on the preconditions including the information. The quantum program compilation method according to claim 2 .

4. The information processing device, In the storage device, as the post-condition, information on at least one of the number of quantum bits that have advanced from the partial region or the positions of the quantum bits that have advanced and the positions of the quantum bits that have stopped in the partial region due to the execution of at least one of the movement operation and the control operation is stored, and a selection of an operation method within the region is executed based on the post-condition including the information. The quantum program compilation method according to claim 2 .

5. The information processing device, an operation cost is stored in the storage device as information on the operation method within the area, an execution cost of the route area sequence is evaluated based on the operation cost, and the route area sequence and the operation method within the area are selected based on a result of the evaluation; The quantum program compilation method according to claim 2 .

6. A storage device that stores information on a node topology that indicates a connection relationship of each node in which a quantum bit is formed, and information on a control operation that can be performed in a predetermined area of ​​the node topology; Regarding quantum programs described by combinations of control operations on quantum bits, A calculation device that generates a procedure for moving the quantum bit along the connection relationship as a procedure for executing the control operation of the quantum program in a predetermined area in the node topology based on each information of the node topology and the control operation; A quantum program compilation device comprising:

7. The storage device further holds, as information on an intra-area operation method defined for each partial area of ​​the node topology, information on a precondition that is a premise for a quantum bit operation in the partial area, at least one of a move operation or a control operation performed on the quantum bit under the precondition, and a postcondition that represents a result of at least one of the move operation or the control operation; When generating the procedure, the arithmetic device obtains information on a target quantum bit to be controlled and its target control operation from the quantum program, selects a partial region in the node topology in which the target control operation can be executed as a control execution region, selects a series of partial regions constituting a path from a starting region in which the target quantum bit exists in the node topology to the control execution region as a path region series, and generates the procedure for the movement operation and the control operation by selecting an intra-region operation method in each of two adjacent regions in the path region series so that the post-condition of the upstream region and the pre-condition of the downstream region are consistent.

7. The quantum program compilation device according to claim 6.

8. The storage device holds, as the precondition, at least one of the number of quantum bits entering the partial region or the entry positions thereof, and information on initial positions of the quantum bits in the partial region; The arithmetic device executes the selection of the operation method within the region based on the pre-condition including the information. The quantum program compilation device according to claim 7.

9. The storage device holds, as the post-condition, at least one of the number of quantum bits that have advanced from the partial region or the advance position thereof, and information on the stopping position of the quantum bits in the partial region by executing at least one of the movement operation or the control operation; The arithmetic device executes the selection of the intra-region operation method based on the post-condition including the information. The quantum program compilation device according to claim 7.

10. the storage device stores an operation cost as information on the operation method within the area; The computing device evaluates an execution cost of the route region sequence based on the operation cost, and selects the route region sequence and the intra-region operation method based on a result of the evaluation. The quantum program compilation device according to claim 7.

Images