CN115392469A - Quantum line mapping method and system based on dynamic deep search and electronic equipment - Google Patents
Quantum line mapping method and system based on dynamic deep search and electronic equipment Download PDFInfo
- Publication number
- CN115392469A CN115392469A CN202210981388.2A CN202210981388A CN115392469A CN 115392469 A CN115392469 A CN 115392469A CN 202210981388 A CN202210981388 A CN 202210981388A CN 115392469 A CN115392469 A CN 115392469A
- Authority
- CN
- China
- Prior art keywords
- quantum
- state
- physical
- sub
- current state
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000013507 mapping Methods 0.000 title claims abstract description 77
- 238000000034 method Methods 0.000 title claims abstract description 43
- 238000011156 evaluation Methods 0.000 claims abstract description 45
- 230000008569 process Effects 0.000 claims abstract description 22
- 239000002096 quantum dot Substances 0.000 description 60
- 238000010586 diagram Methods 0.000 description 18
- 238000010276 construction Methods 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 238000012217 deletion Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
- G06N10/20—Models of quantum computing, e.g. quantum circuits or universal quantum computers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
- G06N10/40—Physical realisations or architectures of quantum processors or components for manipulating qubits, e.g. qubit coupling or qubit control
Landscapes
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Condensed Matter Physics & Semiconductors (AREA)
- Computational Mathematics (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Artificial Intelligence (AREA)
- Tests Of Electronic Circuits (AREA)
Abstract
The invention relates to the technical field of quantum line mapping, in particular to a quantum line mapping method, a quantum line mapping system and electronic equipment based on dynamic deep search, wherein the method comprises the following steps: initializing a state in a search space, obtaining a current state containing a physical quantum circuit and an input logical quantum circuit to be mapped, obtaining a second physical quantum circuit, obtaining a sub-state corresponding to the second physical quantum circuit, and obtaining a plurality of sub-states by changing a specified quantum operation; performing state evaluation on each sub-state to obtain a state evaluation result of each sub-state; updating the states in the search space except all the sub-states according to all the state evaluation results; a new state is selected from the search space as the current state until the physical quantum circuit meeting the output condition converts the quantum circuit mapping problem into a search process, and a solution with better quality, namely less mapping redundancy is found through high-depth search, so that the efficiency is high.
Description
Technical Field
The invention relates to the technical field of quantum line mapping, in particular to a quantum line mapping method, a quantum line mapping system and electronic equipment based on dynamic deep search.
Background
Physical qubits in quantum computers directly present connectivity constraints, which manifest themselves in that only two-qubit quantum operations can be performed between particular pairs of physical qubits. Therefore, before executing a quantum program in a quantum computer, it is necessary to map an input logical quantum wire to a physical quantum wire that conforms to connectivity restrictions of the corresponding quantum computer, and the quantum wires before and after mapping are functionally equivalent. Generally, a logical quantum wire can be mapped into a plurality of physical quantum wires, and the redundancy introduced by different mapping results is different, and the degree of redundancy directly affects the precision of quantum wire execution. Thus, in addition to the need to find a physical quantum wire that satisfies the conditions, the quantum wire mapping algorithm also needs to make the redundancy introduced by the wire as small as possible.
Disclosure of Invention
The invention provides a quantum line mapping method, a quantum line mapping system and electronic equipment based on dynamic deep search, aiming at the defects of the prior art.
The invention discloses a quantum line mapping method based on dynamic deep search, which adopts the technical scheme as follows:
s1, initializing a state in a search space to obtain the current state of a logical quantum line to be mapped, wherein the current state comprises a physical quantum line and an input logical quantum line;
s2, adding appointed quantum operation to the physical quantum circuit contained in the current state to obtain a first physical quantum circuit, updating the first physical quantum circuit according to the logic quantum circuit contained in the current state to obtain a second physical quantum circuit, obtaining a sub-state corresponding to the second physical quantum circuit, and obtaining a plurality of sub-states by changing the appointed quantum operation;
s3, performing state evaluation on each sub-state to obtain a state evaluation result of each sub-state;
s4, updating the states except all the sub-states in the search space according to all the state evaluation results;
and S5, selecting a new state from the search space as the current state, and returning to execute the S2 until the physical quantum line meets the output condition.
The quantum line mapping method based on dynamic depth search has the following beneficial effects:
the method can convert the quantum line mapping problem into a searching process, finds a solution with better quality, namely less mapping redundancy through high-depth searching, balances solving time through dynamic control of the searching depth, and is high in efficiency.
The invention discloses a quantum line mapping system based on dynamic depth search, which adopts the technical scheme as follows:
the system comprises an initialization module, an addition acquisition module, an evaluation module, an update module and a repeated execution output module;
the initialization module is configured to: initializing a state in a search space to obtain the current state of a logic quantum line to be mapped, wherein the current state comprises a physical quantum line and an input logic quantum line;
the addition acquisition module is used for: adding a specified quantum operation to the physical quantum wires contained in the current state to obtain a first physical quantum wire, updating the first physical quantum wire according to the logical quantum wires contained in the current state to obtain a second physical quantum wire, obtaining a sub-state corresponding to the second physical quantum wire, and obtaining a plurality of sub-states by changing the specified quantum operation;
the evaluation module is to: performing state evaluation on each substate to obtain a state evaluation result of each substate;
the update module is to: updating the states except all the sub-states in the search space according to all the state evaluation results;
the repeated execution output module is used for: and selecting a new state from the search space as the current state, and repeatedly calling the adding acquisition module, the evaluation module and the updating module until the physical quantum line meets the output condition.
The quantum line mapping system based on dynamic depth search has the following beneficial effects:
the quantum line mapping problem can be converted into a searching process, a solution which is better, namely less in mapping redundancy is found through high-depth searching, meanwhile, the solution time is balanced through dynamic control over the searching depth, and the efficiency is high.
A storage medium of the present invention stores instructions, and when the instructions are read by a computer, the instructions cause the computer to execute a quantum wire mapping method based on dynamic depth search according to any one of the above.
An electronic device of the present invention includes a processor and the storage medium, where the processor executes instructions in the storage medium.
Drawings
Fig. 1 is a schematic flowchart of a quantum wire mapping method based on dynamic depth search according to an embodiment of the present invention;
FIG. 2 illustrates one of the schematic diagrams of the circuit;
FIG. 3 is a second schematic diagram of an exemplary circuit;
FIG. 4 is a third schematic diagram of an exemplary circuit;
FIG. 5 is a schematic diagram of qubit mapping;
FIG. 6 is a schematic diagram of a logical quantum wire;
FIG. 7 is a schematic diagram of a physical quantum wire;
fig. 8 is a schematic structural diagram of a quantum wire mapping system based on dynamic depth search according to an embodiment of the present invention.
Detailed Description
As shown in fig. 1, a quantum wire mapping method based on dynamic depth search according to an embodiment of the present invention includes the following steps:
s1, initializing a state in a search space to obtain the current state of a logical quantum line to be mapped, wherein the current state comprises a physical quantum line and an input logical quantum line;
s2, adding appointed quantum operation to the physical quantum circuit contained in the current state to obtain a first physical quantum circuit, updating the first physical quantum circuit according to the logical quantum circuit contained in the current state to obtain a second physical quantum circuit, obtaining a sub-state corresponding to the second physical quantum circuit, and obtaining a plurality of sub-states by changing the appointed quantum operation;
s3, performing state evaluation on each sub-state to obtain a state evaluation result of each sub-state;
s4, updating the states except all the sub-states in the search space according to all the state evaluation results;
and S5, selecting a new state from the search space as the current state, and returning to execute the S2 until the physical quantum line meets the output condition.
It should be noted that, when S2 is executed for the first time, the logical quantum wire included in the current state in S2 is the input logical quantum wire, and when S2 is executed for the second time and S2 is executed subsequently, the logical quantum wire included in the current state in S2 is the logical quantum wire updated by S5.
The "state" is set forth as follows:
the construction process of a physical quantum wire can be seen as a search process in a tree space, which can be expressed as
In which
And
representing a set of states and a set of edges in space, respectively. Each state in the space consists of a logical quantum wire, a physical quantum wire, a quantum bit map, two estimates (local and global), access times statistics, which can be denoted as
. In addition, the state
A sub-state of
Is equivalent to the direction
In the introduction of a switching operation and in accordance with this switchingOperation update
To obtain
Corresponding to
Specific construction details will be described later. Wherein, will
In
Respectively assigning a determined value to obtain a current state.
The specified quantum operation is a swap gate that acts on a particular qubit pair as determined by the qubit computer architecture diagram, e.g., for FIG. 3, the particular qubit pair includes two pairs
The process of adding a designated quantum operation to a physical quantum circuit is the prior art and is not described in detail;
wherein, the process of updating the first physical quantum wire according to the logic quantum wire contained in the current state to obtain the second physical quantum wire is as follows:
the executable quantum operation in the logical quantum wire contained in the current state is added to the first physical quantum wire, resulting in a second physical quantum wire.
The process of obtaining a sub-state corresponding to the second physical quantum circuit is the prior art and will not be described again. The specific implementation process of obtaining multiple sub-states by changing the specified quantum operations:
adding different specified quantum operations to the physical quantum wires contained in the current state to obtain a plurality of first physical quantum wires, updating each first physical quantum wire according to the logical quantum wires contained in the current state to obtain a plurality of second physical quantum wires, and obtaining a sub-state corresponding to each second physical quantum wire to obtain a plurality of sub-states;
wherein the designated quantum operations are changed according to different quantum computer structure patterns.
Wherein the state evaluation result of any sub-state comprises: in S3, the specific implementation process of performing state estimation on each sub-state to obtain a state estimation result of each sub-state includes:
s30, obtaining the difference value between the number of the quantum operations in the logic quantum circuit contained in the current state and the number of the quantum operations in the logic quantum circuit contained in any sub-state
；
S31, extracting two quantum bit quanta operations with the shortest distance of the 0 th layer in any sub-state;
s32, utilization of
Calculating to obtain a global estimate
(ii) a Obtaining the state evaluation result of any sub-state as
；
And repeatedly executing S30-S32 to obtain the state evaluation result of each sub-state.
The pseudo code of the state evaluation Evaluate is as follows:
1. 
middle quantum exerciseThe number of the operations is equal to or greater than the total number of the operations,
the number of medium quantum operations;
2. 
；
3. 
performing quantum operation on two quantum bits with the shortest distance in the middle 0 layer;
4. 
；
5. return to
；
Step 1 in the pseudo code corresponds to step 2, step 3 corresponds to step 31, and steps 4 to 5 correspond to step 32.
In S4, updating the states in the search space except all the sub-states according to all the state evaluation results, which specifically includes:
s40, extracting the sub-state corresponding to the maximum global evaluation value
；
S41, judging whether to use
If yes, the program is exited without updating, and if not, S42 is executed;
s42, updating the global estimation of S to
；
S43, handle
Is updated to
Handle for bicycle
Is updated to
If in the parent state of
If not, the program is exited, and if not, S41 is executed. The pseudo code is:
inputting: search tree
Update the initial state
Coefficient of attenuation
；
1. 
Global valuation in all substates
A maximum sub-state;
2. if it is not
If yes, the program is exited;
3. 
；
4. 
if in the parent state of
If yes, the program is exited;
5. entering the step 2;
in the pseudo code, step 1 corresponds to S40, step 2 corresponds to S41, step 3 corresponds to S42, and step 4 and step 5 correspond to S43.
And S5, selecting a new state from the search space as a current state, and returning to execute S2 until the physical quantum wire meets the output condition. Specifically, the method comprises the following steps:
s50, extracting an initial state of a search space;
s51, extracting all sub-states of the initial state;
s52, if the number of all the sub-states is zero, namely, the sub-states do not exist, outputting an initial state as a selected new state, and if the number of all the sub-states is not zero, executing S53;
s53, according to
A new sub-state is selected from the sub-states of the initial state, and the new sub-state is set as a new initial state to proceed to S51.
Inputting: search tree
Update the initial state
Coefficient of exploration
；
1. 
The set of all of the sub-states,
；
2. if it is not
Then return to
；
3. 
Entering step 1;
step 1 in the above pseudo code corresponds to S50 and S51, step 2 corresponds to S52, and step 3 corresponds to S53. The output conditions specifically refer to: a physical quantum wire is found that complies with the corresponding quantum computer connectivity constraints and is functionally equivalent to the incoming logical quantum wire.
The quantum line mapping problem can be converted into a searching process, a solution which is better, namely less in mapping redundancy is found through high-depth searching, meanwhile, the solution time is balanced through dynamic control over the searching depth, and the efficiency is high.
The invention aims to design a quantum wire mapping algorithm, which is equivalent to a search process in a tree space and can be divided into the following six parts: main program, deep search, search tree expansion, state evaluation, search tree update and search tree decision, wherein the main program refers to: a main program of a quantum wire mapping algorithm; the depth search refers to: extracting a state to be expanded of a search tree through deep search, wherein the expansion of the search tree refers to: opening a state to be expanded of the search tree to obtain a plurality of sub-states of the state to be expanded; the state evaluation means: evaluating the quality of the new open state; the search tree updating means: updating the evaluation values of other states in the search space along a specific path; the search tree decision means: the redundant state of the search space is deleted, and the algorithm efficiency is improved;
in addition, the algorithm also needs to preset the following parameters:
1) Coefficient of attenuation
To represent searchAttenuation strength of a state evaluation value in a cable tree updating process;
2) Number of iterations
Representing the iteration times of the depth search module;
3) Coefficient of exploration
Representing the access tendency of the deep search module to the new state;
the specific explanation of the main program, the deep search, the search tree expansion, the state evaluation, the search tree update and the search tree decision is as follows:
1) Searching the tree:
in the present invention, the construction process of the physical quantum wire can be regarded as a search process in a tree space, which can be expressed as
Wherein
And
representing a set of states and a set of edges in space, respectively. Each state in the space consists of a logical quantum wire, a physical quantum wire, a quantum bit map, two estimates (local and global), access times statistics, which can be denoted as
. In addition, the state
Is equivalent to a sub-state of
Introducing a switching operation and switching according to the switching operationChange operation update
To obtain
Corresponding to
Specific construction details will be described later.
2) The pseudo code of the Main program Main of the line mapping is as follows:
inputting: quantum computer structure diagram
Logic quantum circuit
Initial qubit mapping
Coefficient of attenuation
Number of iterations
Coefficient of exploration
1.，
The empty-capacity sub-line is connected with the load,
；
2. 
；
3. 
；
4. if it is not
If the number of intermediate quantum operations is 0, then return
；
5. 
；
6. If it is used
Entering step 9;
7. 
；
8. 
entering step 6;
9. 
entering step 4;
wherein, the input: search tree
Update the initial state
Coefficient of exploration
；
if it is used
Then return to
；
3) The pseudo code for the deep Search is as follows:
inputting: search tree
Update the initial state
Coefficient of exploration
；
1. 
The set of all of the sub-states,
；
2. if it is used
Then return to
；
3. 
Entering step 1;
4) The pseudocode for search tree extension Open is as follows:
1. 
；
2. if it is not
Entering step 9;
3. 
；
4. 
；
5. 
set all executable quantum operations down if
Entering step 7;
6. for the
Entering step 5;
7. 
，
8. 
entering the step 2;
9. return to
；
4) The pseudocode for state evaluation Evaluate is as follows:
1. 
the number of medium quantum operations is such that,
the number of medium quantum operations;
2. 
；
3. 
performing quantum operation on two qubits with the shortest distance in the middle 0 layer;
4. 
；
5. return to
；
5) The pseudo code for the search tree Update is:
inputting: search tree
Update the initial state
Coefficient of attenuation
；
1. 
Global valuation in all substates
A maximum state;
2. if it is used
If yes, the program is exited;
3. 
；
4. 
if in the parent state of
If yes, the program is exited;
5. entering the step 2;
6) Pseudo code for search tree decision Judge is as follows:
inputting: search tree
State of awaiting decision
；
1. 
Global valuation in all substates
A maximum state;
2. return to
；
Technical terms in the present invention are explained as follows:
1) Quantum bit:
qubits are the fundamental unit of quantum computer storage of data. The quantum program implements a specific function by performing a corresponding operation on a qubit.
2) Quantum operation:
quantum operations can change the state of their active qubits to achieve a particular function. In the present invention, the quantum operation can be divided into a single quantum bit operation and a two quantum bit operation according to the number of active quantum bits. The single-qubit operation acts only on a particular qubit and can only change the state of this qubit; two qubit operations act on two qubits, which can change their state. In the present invention, use
Is expressed and acted on
General single qubit operation on qubits with
Is expressed as acting on
A typical two-qubit operation on a qubit. In addition, two special two-qubit operations are required in the present invention: swap operation and control not operation. One acts on
The swap operation and the control not operation on the qubit can be used separately
And (4) showing.
It is noted that for quantum operations with a number of active qubits greater than 2, it can be decomposed into a number of single-qubit and two-qubit quantum operations.
3) Quantum wire:
quantum wires are a common use of quantum processesMethods are described which generally consist of a qubit and a series of quantum operations. In the example circuit shown in FIG. 2, it contains two qubits
Each line represents a corresponding qubit, block a represents
And block B represents
And module C represents
。
The user does not consider the execution limitations of the quantum computer when designing the quantum wire. Therefore, before executing a quantum program described by a quantum wire in a quantum computer, a user-designed quantum wire needs to be mapped onto a new quantum wire, and the mapped quantum wire needs to be made functionally equivalent to an input wire while satisfying the execution constraint of the corresponding quantum computer. The invention refers to the quantum circuit designed at user level as logic quantum circuit (denoted as logic quantum circuit)
) The quantum wire obtained by mapping is referred to as a physical quantum wire (described as
）。
4) Layer of quantum wire:
for a quantum wire, if we shift all the quantum operations therein as far to the left as possible, then the quantum operations in the same column after left shifting can be divided into one layer. For the circuit shown in FIG. 3, it comprises three layers, where the quantum operations in the 0 th, 1 st, and 2 nd layers are respectively
。
5) Logical qubits and physical qubits:
the invention refers to the quantum bit in the logic quantum circuit as logic quantum bit, and uses
Is indicated by the reference number
A logical qubit of (a); the qubits in the physical quantum wires are called physical qubits
Is given a reference numeral of
The physical qubit of (a). It should be noted that the physical qubits in the physical quantum wires correspond one-to-one to the actual qubits in the quantum computer.
6) Quantum computer structure diagram
In some quantum computers, connectivity between physical bits is limited in that quantum operations of two qubits can only be performed between specific pairs of physical bits, which limitation may be represented by a block diagram. The structure diagram of a quantum computer can be described as an undirected graph, denoted as
Wherein
A collection of nodes in the diagram is represented,
a set of edges is represented that are,
representing an edge in the structure diagram.
The nodes in (1) represent physical qubits and the edges represent the connectivity of the qubits, so that the quantum operation of two qubits can be performed only between physical qubits directly connected by the edges. In the example of figure 4 of the drawings,
therefore, only the physical bit can be used
Performing a quantum operation between two qubits
The corresponding quantum operation may not be performed in between. In addition to this, the present invention is,
can also be written as
。
7) Quantum bit mapping:
when running a quantum program in a quantum computer, it is necessary to map the qubits in a logical quantum wire onto physical qubits, a process called qubit mapping. Can use symbols
A quantum bit map is represented that is,
to represent
The logical qubits correspond to the physical qubits under the mapping, e.g., in FIG. 5, the initial state of the qubit mapping is
Mapping to
Mapping to
Mapping to
I.e. by
。
Furthermore, a certain qubit mapping can be changed by introducing a swap operation in the physical line, which is used in the invention
Or
Representing qubit mapping
One edge in the lead-in structure diagram
Corresponding exchange operation or
And then obtaining a new quantum bit mapping. Suppose that
By introducing into physical quantum wires
A new qubit mapping can be obtained
Satisfy the following requirements
、
. For example in the context of figure 5 of the drawings,
，
。
8) Quantum operation mapping:
for general quantum operation in logical quantum wires
And a qubit mapping
The mapping of the quantum operation in a physical quantum wire is called
。
9) Distance of two qubit operations:
for any two-qubit operation in a logical quantum line
A quantum computer structure pattern
A qubit mapping
The two qubits operating
Is a distance of
Is defined in the present invention as
Middle node
The shortest distance therebetween. For example, for the architectural diagram shown in FIG. 4 and the qubit mapping shown on the left of FIG. 5, quantum operations
Of (2) is
Because of
To is that
And with
In that
The shortest path in (1) is
And has a length of 2.
10 Execution of quantum operations in logical quantum wires:
if at a given qubit mapping
Next, two qubit quantum operations in logical quantum wires (assuming effects on qubits)
Up) satisfies (1) that it is in logicLayer 0 in the quantum wires; (2)
The two qubit quantum operations are said to be executable.
If at a given qubit mapping
Next, a single qubit quantum operation in a logical quantum wire is located at layer 0 in the logical quantum wire, and the single qubit quantum operation is said to be executable.
11 Execution of two qubit quantum operations in a logical quantum wire:
for a two-qubit quantum operation of layer 0 in a logical quantum wire (assumed to be
) The execution of which refers to the process of constantly changing the qubit mapping by introducing a series of redundant switching operations to the physical quantum wires, so that the mapping of the qubit operations in the physical quantum wires can be performed, i.e. satisfy
And will be
Is deleted from the logic quantum circuit
Physical quantum wires are added.
For example, for the structure diagram of FIG. 4, assume that the initial qubits are mapped as
Assume that the two-qubit operation of layer 0 in the logical quantum wire needs to be performed as
. To meet the architectural constraints, only the switching operations that can be introduced into a physical quantum wire are
And
. Because of
At this time
Mapping in physical lines as
And due to
Thus, it is possible to
It is not executable. If introduced into the physical line
Then the qubits are mapped into
、
At this time
Mapping in physical lines as
And due to
At this time
Can be executed. To sum up, at the initial qubit mapping of
When it is, above
Need to be introduced into the physical line
And deleted from the logical quantum wire
. It should be noted that the execution of a quantum operation is usually not exclusive, for example, in the above example, by introducing
Can also realize
Is performed.
12 Quantum wire mapping:
quantum wire mapping refers to the process of constructing a physical quantum wire based on a given computer structure pattern, logical quantum wires, and an initial quantum bit mapping, requiring that the output physical quantum wires be functionally equivalent to the input logical quantum wires, and wherein the two quantum bit gates meet the constraints of the computer structure pattern.
A specific approach to quantum wire mapping is to perform two-qubit operations (usually in left-to-right order) on each of the logical quantum wires by introducing redundant switching operations on it in the physical quantum wires. For the logical quantum wire shown in fig. 6 and the quantum computer structure diagram shown in fig. 4, and assuming that the initial quantum bit maps to
And performing quantum line mapping on the obtained data. The control non-operation on the left side is performed first
The execution of this operation requires the introduction of a physical quantum wire
Updating the qubit map to
、
Then introduced later
Deletion of
(ii) a Second, the control non-operation on the right side is executed
Because at this time
At layer 0 of the logical quantum wire and its mapping in the physical wire is
Already executable, so that only physical quantum wires need to be introduced
Deletion of
. The resulting physical quantum wires output by the entire quantum wire mapping process are shown in fig. 7.
In the above embodiments, although the steps are numbered as S1, S2, etc., but only the specific embodiments are given in the present application, and a person skilled in the art may adjust the execution sequence of S1, S2, etc. according to the actual situation, which is also within the protection scope of the present invention, it is understood that some embodiments may include some or all of the above embodiments.
As shown in fig. 8, a quantum wire mapping system 200 based on dynamic depth search according to an embodiment of the present invention includes an initialization module 210, an addition acquisition module 220, an evaluation module 230, an update module 240, and a repeated execution output module 250;
the initialization module 210 is configured to: initializing a state in a search space to obtain the current state of a logical quantum line to be mapped, wherein the current state comprises a physical quantum line and an input logical quantum line;
the addition acquisition module 220 is configured to: adding appointed quantum operation to a physical quantum circuit contained in the current state to obtain a first physical quantum circuit, updating the first physical quantum circuit according to a logical quantum circuit contained in the current state to obtain a second physical quantum circuit, obtaining a corresponding sub-state of the second physical quantum circuit, and obtaining a plurality of sub-states by changing the appointed quantum operation;
the evaluation module 230 is configured to: performing state evaluation on each sub-state to obtain a state evaluation result of each sub-state;
the update module 240 is configured to: updating the states except all the sub-states in the search space according to all the state evaluation results;
the repeat execution output module 250 is configured to: a new state is selected from the search space as the current state, and the add acquisition module 220, the evaluation module 230, and the update module 240 are repeatedly invoked until the physical quantum wires meet the output condition.
The method can convert the quantum line mapping problem into a searching process, finds a solution with better quality, namely less mapping redundancy through high-depth searching, balances solving time through dynamic control of the searching depth, and is high in efficiency.
Optionally, in the above technical solution, the process of updating the first physical quantum wire by the addition obtaining module 220 according to the logical quantum wire included in the current state includes:
the quantum operation which can be executed by the logical quantum wire in the logical quantum wires included in the current state is added to the first physical quantum wire to obtain the second physical quantum wire.
Optionally, in the above technical solution, the state evaluation result of any sub-state includes: a global estimate of any sub-state, and a difference between the number of quantum operations in the logical quantum wires contained in the current state and the number of quantum operations in the logical quantum wires contained in any sub-state.
The above steps for realizing the corresponding functions of each parameter and each unit module in the quantum wire mapping system 200 based on dynamic depth search according to the present invention can refer to the above parameters and steps in the embodiment of the quantum wire mapping method based on dynamic depth search, which are not described herein again.
The storage medium of an embodiment of the present invention stores instructions, and when the instructions are read by a computer, the computer is caused to execute any one of the above quantum line mapping methods based on dynamic depth search.
An electronic device according to an embodiment of the present invention includes a processor and the storage medium, where the processor executes instructions in the storage medium. The electronic device can be a computer, a mobile phone and the like.
As will be appreciated by one skilled in the art, the present invention may be embodied as a system, method or computer program product.
Accordingly, the present disclosure may be embodied in the form of: may be embodied entirely in hardware, entirely in software (including firmware, resident software, micro-code, etc.) or in a combination of hardware and software, and may be referred to herein generally as a "circuit," module "or" system. Furthermore, in some embodiments, the invention may also be embodied in the form of a computer program product in one or more computer-readable media having computer-readable program code embodied in the medium.
Any combination of one or more computer-readable media may be employed. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium include an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
Although embodiments of the present invention have been shown and described above, it will be understood that the above embodiments are exemplary and not to be construed as limiting the present invention, and that changes, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.
Claims (8)
1. A quantum wire mapping method based on dynamic depth search is characterized by comprising the following steps:
s1, initializing a state in a search space to obtain the current state of a logical quantum line to be mapped, wherein the current state comprises a physical quantum line and an input logical quantum line;
s2, adding appointed quantum operation to the physical quantum circuit contained in the current state to obtain a first physical quantum circuit, updating the first physical quantum circuit according to the logic quantum circuit contained in the current state to obtain a second physical quantum circuit, obtaining a sub-state corresponding to the second physical quantum circuit, and obtaining a plurality of sub-states by changing the appointed quantum operation;
s3, performing state evaluation on each sub-state to obtain a state evaluation result of each sub-state;
s4, updating the states except all the sub-states in the search space according to all the state evaluation results;
and S5, selecting a new state from the search space as the current state, and returning to execute the S2 until the physical quantum line meets the output condition.
2. The method according to claim 1, wherein the updating the first physical quantum wire according to the logical quantum wire included in the current state to obtain a second physical quantum wire comprises:
the quantum operation which can be executed by the logic quantum wires in the logic quantum wires contained in the current state is added to the first physical quantum wires to obtain the second physical quantum wires.
3. A dynamic depth search based quantum wire mapping method according to claim 1, wherein the state evaluation result of any sub-state comprises: a global estimate of the any sub-state, and a difference between the number of quantum operations in the logical quantum wires contained by the current state and the number of quantum operations in the logical quantum wires contained by the any sub-state.
4. A quantum line mapping system based on dynamic depth search is characterized by comprising an initialization module, an addition acquisition module, an evaluation module, an update module and a repeated execution output module;
the initialization module is configured to: initializing a state in a search space to obtain the current state of a logical quantum line to be mapped, wherein the current state comprises a physical quantum line and an input logical quantum line;
the addition acquisition module is used for: adding a specified quantum operation to the physical quantum wires contained in the current state to obtain a first physical quantum wire, updating the first physical quantum wire according to the logical quantum wires contained in the current state to obtain a second physical quantum wire, obtaining a sub-state corresponding to the second physical quantum wire, and obtaining a plurality of sub-states by changing the specified quantum operation;
the evaluation module is to: performing state evaluation on each substate to obtain a state evaluation result of each substate;
the update module is to: updating the states in the search space except all the sub-states according to all the state evaluation results;
the repeated execution output module is used for: and selecting a new state from the search space as the current state, and repeatedly calling the adding acquisition module, the evaluation module and the updating module until the physical quantum line meets the output condition.
5. The dynamic depth search based quantum wire mapping system of claim 4, wherein the process of updating the first physical quantum wire by the addition obtaining module according to the logical quantum wire included in the current state comprises:
the quantum operation which can be executed by the logic quantum wires in the logic quantum wires contained in the current state is added to the first physical quantum wires to obtain the second physical quantum wires.
6. The dynamic depth search based quantum wire mapping system of claim 4, wherein the state evaluation result of any sub-state comprises: a global estimate of the any sub-state, and a difference between the number of quantum operations in the logical quantum wires comprised by the current state and the number of quantum operations in the logical quantum wires comprised by the any sub-state.
7. A storage medium having stored therein instructions that, when read by a computer, cause the computer to execute a dynamic depth search based quantum wire mapping method according to any one of claims 1 to 3.
8. An electronic device comprising the storage medium of claim 7 and a processor, wherein the processor executes instructions in the storage medium.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210981388.2A CN115392469A (en) | 2022-08-16 | 2022-08-16 | Quantum line mapping method and system based on dynamic deep search and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210981388.2A CN115392469A (en) | 2022-08-16 | 2022-08-16 | Quantum line mapping method and system based on dynamic deep search and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115392469A true CN115392469A (en) | 2022-11-25 |
Family
ID=84120005
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210981388.2A Pending CN115392469A (en) | 2022-08-16 | 2022-08-16 | Quantum line mapping method and system based on dynamic deep search and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115392469A (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080140749A1 (en) * | 2004-12-20 | 2008-06-12 | Stmicroelectronics S.R.L. | Method and device for performing a quantum algorithm to simulate a genetic algorithm |
| CN110569979A (en) * | 2019-09-09 | 2019-12-13 | 中国科学技术大学 | Logical-physical bit remapping method for noisy medium-sized quantum equipment |
| US20200125985A1 (en) * | 2018-10-21 | 2020-04-23 | President And Fellows Of Harvard College | Qubit allocation for noisy intermediate-scale quantum computers |
| US20200272926A1 (en) * | 2019-02-21 | 2020-08-27 | IonQ, Inc. | Quantum circuit optimization |
| CN112085204A (en) * | 2020-09-18 | 2020-12-15 | 东南大学 | Line transformation method for quantum compiling |
| CN112651509A (en) * | 2020-10-14 | 2021-04-13 | 腾讯科技（深圳）有限公司 | Method and device for determining quantum circuit |
| US20210173988A1 (en) * | 2018-08-21 | 2021-06-10 | President And Fellows Of Harvard College | Quantum circuit embedding by simulated annealing |
| CN113918168A (en) * | 2021-10-29 | 2022-01-11 | 中国人民解放军战略支援部队信息工程大学 | Quantum line depth-oriented compiling optimization method and device |
| WO2022039183A1 (en) * | 2020-08-20 | 2022-02-24 | 国立大学法人東京大学 | Quantum circuit generation device, quantum circuit generation method, and quantum circuit generation program |
| CN114330730A (en) * | 2021-12-25 | 2022-04-12 | 北京量子信息科学研究院 | Quantum line block compiling method, device, equipment, storage medium and product |
| CN114416105A (en) * | 2022-03-30 | 2022-04-29 | 北京中科弧光量子软件技术有限公司 | Quantum operation compiling method and system, storage medium and electronic equipment |
| CN114707655A (en) * | 2022-03-30 | 2022-07-05 | 北京中科弧光量子软件技术有限公司 | Quantum line conversion method, quantum line conversion system, storage medium and electronic equipment |
-
2022
- 2022-08-16 CN CN202210981388.2A patent/CN115392469A/en active Pending
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080140749A1 (en) * | 2004-12-20 | 2008-06-12 | Stmicroelectronics S.R.L. | Method and device for performing a quantum algorithm to simulate a genetic algorithm |
| US20210173988A1 (en) * | 2018-08-21 | 2021-06-10 | President And Fellows Of Harvard College | Quantum circuit embedding by simulated annealing |
| US20200125985A1 (en) * | 2018-10-21 | 2020-04-23 | President And Fellows Of Harvard College | Qubit allocation for noisy intermediate-scale quantum computers |
| US20200272926A1 (en) * | 2019-02-21 | 2020-08-27 | IonQ, Inc. | Quantum circuit optimization |
| CN110569979A (en) * | 2019-09-09 | 2019-12-13 | 中国科学技术大学 | Logical-physical bit remapping method for noisy medium-sized quantum equipment |
| WO2022039183A1 (en) * | 2020-08-20 | 2022-02-24 | 国立大学法人東京大学 | Quantum circuit generation device, quantum circuit generation method, and quantum circuit generation program |
| CN112085204A (en) * | 2020-09-18 | 2020-12-15 | 东南大学 | Line transformation method for quantum compiling |
| CN112651509A (en) * | 2020-10-14 | 2021-04-13 | 腾讯科技（深圳）有限公司 | Method and device for determining quantum circuit |
| WO2022077797A1 (en) * | 2020-10-14 | 2022-04-21 | 腾讯科技（深圳）有限公司 | Quantum circuit determining method and apparatus, device, and storage medium |
| CN113918168A (en) * | 2021-10-29 | 2022-01-11 | 中国人民解放军战略支援部队信息工程大学 | Quantum line depth-oriented compiling optimization method and device |
| CN114330730A (en) * | 2021-12-25 | 2022-04-12 | 北京量子信息科学研究院 | Quantum line block compiling method, device, equipment, storage medium and product |
| CN114416105A (en) * | 2022-03-30 | 2022-04-29 | 北京中科弧光量子软件技术有限公司 | Quantum operation compiling method and system, storage medium and electronic equipment |
| CN114707655A (en) * | 2022-03-30 | 2022-07-05 | 北京中科弧光量子软件技术有限公司 | Quantum line conversion method, quantum line conversion system, storage medium and electronic equipment |
Non-Patent Citations (2)
| Title |
|---|
| XIANGZHEN ZHOU 等: "Quantum Circuit Transformation: A Monte Carlo Tree Search Framework" * |
| 窦星磊 等: "面向超导量子计算机的程序映射技术研究" * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110825375B (en) | Quantum program conversion method and device, storage medium and electronic device | |
| US11010527B2 (en) | Optimization of a quantum circuit by inserting swap gates | |
| CN114970865B (en) | Quantum circuit processing method and device on quantum chip and electronic equipment | |
| US8302041B1 (en) | Implementation flow for electronic circuit designs using choice networks | |
| CN112668722A (en) | Quantum circuit processing method, device, equipment, storage medium and product | |
| CN111915011B (en) | Single-amplitude quantum computing simulation method | |
| CN109951392B (en) | Intelligent routing method for medium and large networks based on deep learning | |
| WO2021071379A1 (en) | Quantum circuit simulation | |
| CN116822422A (en) | Analysis optimization method of digital logic circuit and related equipment | |
| CN112381231A (en) | Quantum topological graph optimization method and device, terminal and storage medium | |
| CN114416105B (en) | Quantum operation compiling method and system, storage medium and electronic equipment | |
| CN111931939A (en) | Single-amplitude quantum computation simulation method | |
| CN116663491B (en) | Method, equipment and medium for covering group condition constraint statement based on BDD solving function | |
| US20160292064A1 (en) | Iterative test generation based on data source analysis | |
| CN115392469A (en) | Quantum line mapping method and system based on dynamic deep search and electronic equipment | |
| CN114707655B (en) | Quantum line conversion method, quantum line conversion system, storage medium and electronic equipment | |
| CN115358407B (en) | Approximate quantum compiling method and system based on tensor network and electronic equipment | |
| JP5048358B2 (en) | Logical processor | |
| CN115879562A (en) | Quantum program initial mapping determination method and device and quantum computer | |
| CN114329853A (en) | Quantum topological graph optimization method and device, terminal and storage medium | |
| Burnaev et al. | Adaptive design of experiments for sobol indices estimation based on quadratic metamodel | |
| Chatterjee et al. | An improved algorithm for k-terminal probabilistic network reliability analysis | |
| Dubrovin et al. | Graph representation methods for the discrete mathematics instructions set computer | |
| WO2013180920A2 (en) | Buildable part pairs in an unconfigured product structure | |
| CN111177482B (en) | Method, device and equipment for parallel processing of graph data and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20221125 |