CN113849187B - Quantum line noise-oriented compiling optimization method and device - Google Patents
Quantum line noise-oriented compiling optimization method and device Download PDFInfo
- Publication number
- CN113849187B CN113849187B CN202111187456.XA CN202111187456A CN113849187B CN 113849187 B CN113849187 B CN 113849187B CN 202111187456 A CN202111187456 A CN 202111187456A CN 113849187 B CN113849187 B CN 113849187B
- Authority
- CN
- China
- Prior art keywords
- quantum
- logic gate
- line
- gate group
- noise
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformation of program code
- G06F8/41—Compilation
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Condensed Matter Physics & Semiconductors (AREA)
- Computational Mathematics (AREA)
- Artificial Intelligence (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Devices For Executing Special Programs (AREA)
Abstract
The invention provides a compiling and optimizing method and device for quantum line noise. The method comprises the following steps: constructing a quantum line to be optimized into a directed acyclic graph, and traversing the quantum line to be optimized based on a graph traversal method; and for each traversed sub-line, checking whether the sub-line meets a pattern matching rule, if so, replacing an original quantum logic gate group with higher noise in the sub-line by using a target quantum logic gate group with lower noise according to the pattern matching rule, and finally obtaining an equivalent quantum line with lower noise. The invention can effectively reduce quantum line noise, improve the execution accuracy of the quantum program on a real quantum computer, and reduce the resource and time overhead of the running process of the quantum program.
Description
Technical Field
The invention relates to the technical field of quantum computers, in particular to a compiling optimization method and device for quantum line noise.
Background
The current quantum computer development is in the NISQ (medium scale quantum computer with noise) stage, and quantum noise is a major obstacle to building large scale quantum computers. The NISQ device has severe limitations on the number of quantum bits available to the algorithm and the maximum line depth achievable.
Quantum compilation is the translation of quantum algorithms implemented in high-level quantum programming languages into executable code on quantum computers. Since quantum computers typically support a limited set of basic operations, a quantum compiler needs to compile complex quantum algorithms into the basic operations supported by the quantum computer. The quantum compiling optimization mainly studies how to reduce the total quantum gate number, the line depth and the like, and since the accuracy of the final result is affected by system noise, a compiler aiming at the NISQ equipment aims at maximizing the overall fidelity. Quantum compilation optimization is important for quantum computers, and existing quantum compilers employ many compilation optimization techniques, wherein optimization to reduce the effects of noise is achieved primarily by minimizing the number of quantum operands generated by compilation.
At present, a compiling and optimizing method which is more effective for quantum line noise is called a peephole optimizing technology. The idea of the optimization technology is as follows: the compiler finds a particular pattern for a certain sub-line in traversing the quantum line and replaces the sub-line with an equivalent sub-line with less quantum operations or shorter quantum line depth. The replacement operation is equivalent replacement, the semantics of the original quantum program is kept, and the purpose of reducing quantum noise is achieved by simplifying quantum circuits.
In a real quantum computer, different quantum logic gates have different noises, the compiling and optimizing method mainly realizes the optimization of the noise of the quantum circuit by simplifying the quantum circuit, and the method has the problems of low accuracy of the final quantum algorithm executed on the real quantum computer, high actual operation cost and high cost aiming at the problems of insufficient analysis and optimization of the noise of the quantum circuit and high noise of the generated quantum circuit.
Disclosure of Invention
Aiming at the problems of high noise and low execution accuracy of a quantum circuit generated by the current quantum compiling tool, the invention provides a compiling optimization method and device facing to the quantum circuit noise, which can improve the execution accuracy of a quantum algorithm on a real quantum computer and reduce the running expense of the quantum algorithm caused by the quantum noise.
In one aspect, the present invention provides a quantum wire noise-oriented compiling and optimizing method, including:
constructing a quantum line to be optimized into a directed acyclic graph, and traversing the quantum line to be optimized based on a graph traversal method;
and for each traversed sub-line, checking whether the sub-line meets a pattern matching rule, if so, replacing an original quantum logic gate group with higher noise in the sub-line by using a target quantum logic gate group with lower noise according to the pattern matching rule, and finally obtaining an equivalent quantum line with lower noise.
Further, the constructing the quantum wires to be optimized into a directed acyclic graph specifically includes:
the operation of the quantum logic gate on different quantum bits is used as a node of the directed acyclic graph, and the evolution relation of the state of the quantum bits is used as an edge of the directed acyclic graph, so that the whole quantum circuit to be optimized is constructed into the directed acyclic graph.
Further, a pattern matching rule is predefined in a configuration file; the pattern matching rule refers to that an original quantum logic gate group to be replaced and a target quantum logic gate group are used as rules in a replacement process, the original quantum logic gate group to be replaced and the target quantum logic gate group are in an equivalent relation, and the noise of the target quantum logic gate group is smaller than that of the original quantum logic gate group to be replaced.
Further, the target quantum logic gate set with lower noise is used to replace the original quantum logic gate set with higher noise in the sub-line, and finally the equivalent quantum line with lower noise is obtained, specifically:
deleting the original quantum logic gate group for each sub-line according with the pattern matching rule, inserting a target quantum logic gate group in a corresponding position, and regenerating the sub-line;
and finally obtaining the equivalent quantum circuit with lower noise after traversing and replacing all the sub-circuits which accord with the pattern matching rule.
In another aspect, the present invention provides a quantum wire noise-oriented coding optimization apparatus, including:
the quantum line traversal module is used for constructing the quantum line to be optimized into a directed acyclic graph and traversing the quantum line to be optimized based on a graph traversal method;
and the quantum line noise optimization module is used for checking whether the sub-line accords with the pattern matching rule or not aiming at each traversed sub-line, and if so, replacing the original quantum logic gate group with higher noise in the sub-line by using the target quantum logic gate group with lower noise according to the pattern matching rule, thereby finally obtaining the equivalent quantum line with lower noise.
Further, the constructing the quantum wires to be optimized into a directed acyclic graph specifically includes:
the operation of the quantum logic gate on different quantum bits is used as a node of the directed acyclic graph, and the evolution relation of the state of the quantum bits is used as an edge of the directed acyclic graph, so that the whole quantum circuit to be optimized is constructed into the directed acyclic graph.
Further, the quantum wire noise optimization module is further configured to predefine a pattern matching rule in a configuration file; the pattern matching rule refers to that an original quantum logic gate group to be replaced and a target quantum logic gate group are used as rules in a replacement process, the original quantum logic gate group to be replaced and the target quantum logic gate group are in an equivalent relation, and the noise of the target quantum logic gate group is smaller than that of the original quantum logic gate group to be replaced.
Further, the target quantum logic gate set with lower noise is used to replace the original quantum logic gate set with higher noise in the sub-line, and finally the equivalent quantum line with lower noise is obtained, specifically:
deleting the original quantum logic gate group for each sub-line according with the pattern matching rule, inserting a target quantum logic gate group in a corresponding position, and regenerating the sub-line;
and finally obtaining the equivalent quantum circuit with lower noise after traversing and replacing all the sub-circuits which accord with the pattern matching rule.
The invention has the beneficial effects that:
the invention provides a compiling optimization method and a device for quantum line noise, which adopt a quantum line traversal method based on a graph and a quantum line noise optimization method based on pattern matching in the compiling process of a quantum program, namely: firstly, the quantum wires are regarded as directed acyclic graphs, and then the quantum wires are traversed in a graph traversal mode; and then, according to the principle that quantum logic gates can be mutually converted, in the process of traversing the quantum circuit, based on a pattern matching rule, equivalently replacing the quantum logic gate group with higher noise with the quantum logic gate group with lower noise, thereby obtaining the quantum circuit which is equivalent to the original quantum circuit and has lower noise, achieving the purpose of reducing the noise of the whole quantum circuit in the compiling process, effectively reducing the noise of the quantum circuit, improving the execution accuracy of the quantum program on a real quantum computer, and reducing the resource and time overhead in the running process of the quantum program.
Drawings
Fig. 1 is a schematic flowchart of a quantum wire noise-oriented compiling and optimizing method according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of a quantum wire noise-oriented compiling and optimizing apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly described below with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example 1
As shown in fig. 1, an embodiment of the present invention provides a method for compiling and optimizing quantum wire noise, including the following steps:
s101: constructing a quantum line to be optimized into a directed acyclic graph, and traversing the quantum line to be optimized based on a graph traversal method;
specifically, the constructing a quantum wire to be optimized into a directed acyclic graph specifically includes: the operation of the quantum logic gate on different quantum bits is used as a node of the directed acyclic graph, and the evolution relation of the state of the quantum bits is used as an edge of the directed acyclic graph, so that the whole quantum circuit to be optimized is constructed into the directed acyclic graph.
Traversing the quantum line to be optimized based on a graph traversal method, specifically: after the quantum circuit to be optimized is abstracted into the directed acyclic graph, the traversal process of the quantum circuit is the traversal process of the graph, and the traversal problem of the sub-circuit in the quantum circuit is the finding problem of the subgraph in the graph. In the compiling process of the quantum wire, the whole quantum wire is traversed by adopting a graph traversal mode.
S102: and for each traversed sub-line, checking whether the sub-line meets a pattern matching rule, if so, replacing an original quantum logic gate group with higher noise in the sub-line by using a target quantum logic gate group with lower noise according to the pattern matching rule, and finally obtaining an equivalent quantum line with lower noise.
Specifically, a pattern matching rule is predefined in a configuration file; the pattern matching rule refers to that an original quantum logic gate group to be replaced and a target quantum logic gate group are used as rules in a replacement process, the original quantum logic gate group to be replaced and the target quantum logic gate group are in an equivalent relation, and the noise of the target quantum logic gate group is smaller than that of the original quantum logic gate group to be replaced.
During traversal of the quantum wire, an equivalent replacement of the set of quantum logic gates in the quantum wire is implemented based on the defined pattern matching rules. The equivalent replacement process comprises deletion of the original quantum logic gate group and insertion of the target quantum logic gate group, and in order to ensure the correctness of the replaced quantum circuit, a method for regenerating the quantum circuit is adopted, namely: the method comprises the following steps of replacing the original quantum logic gate group with higher noise in the sub-line by the target quantum logic gate group with lower noise to finally obtain the equivalent quantum line with lower noise, wherein the steps are as follows: deleting the original quantum logic gate group for each sub-line according with the pattern matching rule, inserting a target quantum logic gate group in a corresponding position, and regenerating the sub-line; and finally obtaining the equivalent quantum circuit with lower noise after traversing and replacing all the sub-circuits which accord with the pattern matching rule.
Example 2
As shown in fig. 2, an embodiment of the present invention provides a quantum wire noise-oriented compiling and optimizing apparatus, including: quantum wire ergodic module and quantum wire noise optimizing module; wherein:
the quantum line traversal module is used for constructing the quantum line to be optimized into a directed acyclic graph, and traversing the quantum line to be optimized based on a graph traversal method. The quantum circuit noise optimization module is used for checking whether each traversed sub-circuit accords with a pattern matching rule or not, if so, replacing an original quantum logic gate group with higher noise in the sub-circuit by using a target quantum logic gate group with lower noise according to the pattern matching rule, and finally obtaining an equivalent quantum circuit with lower noise; in addition, the quantum wire noise optimization module is also used for predefining a pattern matching rule in a configuration file; the pattern matching rule refers to that an original quantum logic gate group to be replaced and a target quantum logic gate group are used as rules in a replacement process, the original quantum logic gate group to be replaced and the target quantum logic gate group are in an equivalent relation, and the noise of the target quantum logic gate group is smaller than that of the original quantum logic gate group to be replaced.
As an implementation manner, the constructing the quantum wire to be optimized as a directed acyclic graph specifically includes: the operation of the quantum logic gate on different quantum bits is used as a node of the directed acyclic graph, and the evolution relation of the state of the quantum bits is used as an edge of the directed acyclic graph, so that the whole quantum circuit to be optimized is constructed into the directed acyclic graph.
As an implementable manner, the target quantum logic gate set with lower noise is used to replace the original quantum logic gate set with higher noise in the sub-line, and finally the equivalent quantum line with lower noise is obtained, specifically:
deleting the original quantum logic gate group for each sub-line according with the pattern matching rule, inserting a target quantum logic gate group in a corresponding position, and regenerating the sub-line; and finally obtaining the equivalent quantum circuit with lower noise after traversing and replacing all the sub-circuits which accord with the pattern matching rule.
Compared with the prior quantum compiling optimization technology, the invention adopts the quantum circuit noise optimization method based on the mode matching, so that the noise of the quantum logic gate in the optimized quantum circuit is reduced, the execution accuracy of the quantum algorithm on a real quantum computer is improved, and the operation expense of the quantum algorithm is reduced.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (4)
1. The compiling optimization method facing quantum line noise is characterized by comprising the following steps:
constructing a quantum line to be optimized into a directed acyclic graph, and traversing the quantum line to be optimized based on a graph traversal method;
for each traversed sub-line, checking whether the sub-line meets a pattern matching rule, if so, replacing an original quantum logic gate group with higher noise in the sub-line by using a target quantum logic gate group with lower noise according to the pattern matching rule, and finally obtaining an equivalent quantum line with lower noise; the method comprises the following steps of replacing the original quantum logic gate group with higher noise in the sub-line by the target quantum logic gate group with lower noise to finally obtain the equivalent quantum line with lower noise, wherein the steps are as follows: deleting the original quantum logic gate group for each sub-line according with the pattern matching rule, inserting a target quantum logic gate group in a corresponding position, and regenerating the sub-line; after traversing and replacing all sub-circuits which accord with the pattern matching rule, finally obtaining an equivalent quantum circuit with lower noise;
wherein, a pattern matching rule is predefined in a configuration file; the pattern matching rule refers to that an original quantum logic gate group to be replaced and a target quantum logic gate group are used as rules in a replacement process, the original quantum logic gate group to be replaced and the target quantum logic gate group are in an equivalent relation, and the noise of the target quantum logic gate group is smaller than that of the original quantum logic gate group to be replaced.
2. The method for quantum wire noise-oriented compilation optimization according to claim 1, wherein the constructing the quantum wire to be optimized as a directed acyclic graph specifically comprises:
the operation of the quantum logic gate on different quantum bits is used as a node of the directed acyclic graph, and the evolution relation of the state of the quantum bits is used as an edge of the directed acyclic graph, so that the whole quantum circuit to be optimized is constructed into the directed acyclic graph.
3. A quantum-line-noise-oriented coding optimization apparatus, comprising:
the quantum line traversal module is used for constructing the quantum line to be optimized into a directed acyclic graph and traversing the quantum line to be optimized based on a graph traversal method;
the quantum circuit noise optimization module is used for checking whether the sub-circuit accords with the pattern matching rule or not aiming at each traversed sub-circuit, and if so, replacing the original quantum logic gate group with higher noise in the sub-circuit by using the target quantum logic gate group with lower noise according to the pattern matching rule to finally obtain the equivalent quantum circuit with lower noise; the method comprises the following steps of replacing the original quantum logic gate group with higher noise in the sub-line by the target quantum logic gate group with lower noise to finally obtain the equivalent quantum line with lower noise, wherein the steps are as follows: deleting the original quantum logic gate group for each sub-line according with the pattern matching rule, inserting a target quantum logic gate group in a corresponding position, and regenerating the sub-line; after traversing and replacing all sub-circuits which accord with the pattern matching rule, finally obtaining an equivalent quantum circuit with lower noise; the method is also used for predefining a pattern matching rule in a configuration file; the pattern matching rule refers to that an original quantum logic gate group to be replaced and a target quantum logic gate group are used as rules in a replacement process, the original quantum logic gate group to be replaced and the target quantum logic gate group are in an equivalent relation, and the noise of the target quantum logic gate group is smaller than that of the original quantum logic gate group to be replaced.
4. The apparatus for quantum wire noise-oriented coding optimization according to claim 3, wherein the constructing the quantum wire to be optimized as a directed acyclic graph specifically comprises:
the operation of the quantum logic gate on different quantum bits is used as a node of the directed acyclic graph, and the evolution relation of the state of the quantum bits is used as an edge of the directed acyclic graph, so that the whole quantum circuit to be optimized is constructed into the directed acyclic graph.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111187456.XA CN113849187B (en) | 2021-10-12 | 2021-10-12 | Quantum line noise-oriented compiling optimization method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111187456.XA CN113849187B (en) | 2021-10-12 | 2021-10-12 | Quantum line noise-oriented compiling optimization method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113849187A CN113849187A (en) | 2021-12-28 |
| CN113849187B true CN113849187B (en) | 2022-05-10 |
Family
ID=78977993
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111187456.XA Active CN113849187B (en) | 2021-10-12 | 2021-10-12 | Quantum line noise-oriented compiling optimization method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113849187B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114528021B (en) * | 2022-01-28 | 2022-11-08 | 中国人民解放军战略支援部队信息工程大学 | Time-sharing multiplexing quantum measurement and control system and low-power-consumption high-efficiency quantum measurement and control compiling method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110929873A (en) * | 2019-12-11 | 2020-03-27 | 合肥本源量子计算科技有限责任公司 | Quantum program processing method and device, storage medium and electronic device |
| CN111027703A (en) * | 2019-12-11 | 2020-04-17 | 合肥本源量子计算科技有限责任公司 | Quantum line query method and device, storage medium and electronic device |
| CN111027702A (en) * | 2019-12-11 | 2020-04-17 | 合肥本源量子计算科技有限责任公司 | Method, device, storage medium and electronic device for realizing quantum line replacement |
| CN113011593A (en) * | 2021-03-15 | 2021-06-22 | 北京百度网讯科技有限公司 | Method and system for eliminating quantum measurement noise, electronic device and medium |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10922457B2 (en) * | 2017-10-19 | 2021-02-16 | University Of Maryland | Automated optimization of large-scale quantum circuits with continuous parameters |
| US11783217B2 (en) * | 2019-02-21 | 2023-10-10 | IonQ, Inc. | Quantum circuit optimization |
| US11379749B2 (en) * | 2020-03-05 | 2022-07-05 | Massachusetts Institute Of Technology | Identifying noise sources in quantum systems via multi-level noise spectroscopy |
| CN113158615B (en) * | 2021-04-15 | 2023-04-14 | 深圳市腾讯计算机***有限公司 | Method, device and equipment for optimizing quantum gate and storage medium |
-
2021
- 2021-10-12 CN CN202111187456.XA patent/CN113849187B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110929873A (en) * | 2019-12-11 | 2020-03-27 | 合肥本源量子计算科技有限责任公司 | Quantum program processing method and device, storage medium and electronic device |
| CN111027703A (en) * | 2019-12-11 | 2020-04-17 | 合肥本源量子计算科技有限责任公司 | Quantum line query method and device, storage medium and electronic device |
| CN111027702A (en) * | 2019-12-11 | 2020-04-17 | 合肥本源量子计算科技有限责任公司 | Method, device, storage medium and electronic device for realizing quantum line replacement |
| CN113011593A (en) * | 2021-03-15 | 2021-06-22 | 北京百度网讯科技有限公司 | Method and system for eliminating quantum measurement noise, electronic device and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113849187A (en) | 2021-12-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110609693B (en) | Code updating method and device based on data standardization and terminal equipment | |
| US10534590B2 (en) | Dynamic recompilation techniques for machine learning programs | |
| US8918769B2 (en) | Application of optimization techniques to intermediate representations for code generation | |
| US11216258B2 (en) | Direct function call substitution using preprocessor | |
| CN110399133B (en) | JavaScript code optimization method based on front-end byte code technology | |
| US7966609B2 (en) | Optimal floating-point expression translation method based on pattern matching | |
| US20110067018A1 (en) | Compiler program, compilation method, and computer system | |
| US20150277876A1 (en) | Compiling device, compiling method, and storage medium storing compiler program | |
| US10956137B2 (en) | Compiling source code using source code transformations selected using benchmark data | |
| US20120311550A1 (en) | Method for optimizing binary codes in language having access to zoned decimal type variable, optimization apparatus and computer program for the same | |
| CN113849187B (en) | Quantum line noise-oriented compiling optimization method and device | |
| CN104375875A (en) | Method for compiler optimization of applications and compiler | |
| CN110780879A (en) | Decision execution method, device, equipment and medium based on intelligent compiling technology | |
| US7555745B2 (en) | Program and apparatus for translating language, and program converting method | |
| CN113918168B (en) | Quantum line depth-oriented compiling optimization method and device | |
| US20130031537A1 (en) | Specialized Function Implementation Using Code Frequency Profiling | |
| CN115951890A (en) | Method, system and device for code conversion between different front-end frames | |
| KR20180135528A (en) | Method of creating the balanced parse tree having optimized height | |
| CN104951290A (en) | Method and equipment for optimizing software | |
| WO2023123111A1 (en) | Compiling method and compiling apparatus | |
| CN105487911A (en) | Compilation instruction based many-core data fragmentation method | |
| CN116414396A (en) | LLVM (logical level virtual machine) target definition file generation method and device and electronic equipment | |
| US9785422B1 (en) | Applying multiple rewriting without collision for semi-automatic program rewriting system | |
| US11615014B2 (en) | Using relocatable debugging information entries to save compile time | |
| WO2024113831A1 (en) | Memory security management method and device |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |