[go: up one dir, main page]

CN112529194A - Method and apparatus for eliminating quantum noise, computer device, medium, and product - Google Patents

Method and apparatus for eliminating quantum noise, computer device, medium, and product Download PDF

Info

Publication number
CN112529194A
CN112529194A CN202011437359.7A CN202011437359A CN112529194A CN 112529194 A CN112529194 A CN 112529194A CN 202011437359 A CN202011437359 A CN 202011437359A CN 112529194 A CN112529194 A CN 112529194A
Authority
CN
China
Prior art keywords
quantum
computer
quantum noise
sub
channels
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.)
Granted
Application number
CN202011437359.7A
Other languages
Chinese (zh)
Other versions
CN112529194B (en
Inventor
王鑫
王琨
蒋佳卿
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Baidu Netcom Science and Technology Co Ltd
Original Assignee
Beijing Baidu Netcom Science and Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Baidu Netcom Science and Technology Co Ltd filed Critical Beijing Baidu Netcom Science and Technology Co Ltd
Priority to CN202011437359.7A priority Critical patent/CN112529194B/en
Publication of CN112529194A publication Critical patent/CN112529194A/en
Application granted granted Critical
Publication of CN112529194B publication Critical patent/CN112529194B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N10/00Quantum computing, i.e. information processing based on quantum-mechanical phenomena

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)
  • Complex Calculations (AREA)

Abstract

The present disclosure provides a method and apparatus for eliminating quantum noise, a computer device, a medium, and a product, which relate to the field of computer technologies, and in particular, to a quantum computer. The method for eliminating the quantum noise of the quantum computer comprises the following steps: modeling quantum noise of a quantum computer to obtain a quantum noise channel; performing quasi-probability decomposition on the inverse mapping of the quantum noise channel to obtain a set of sub-quantum channels of the inverse mapping of the quantum noise channel and an extremely quasi-probability distribution; calculating according to the quasi-probability distribution to obtain corresponding probability distribution; sampling the set of the sub-quantum channels for a preset number of times according to the probability distribution, and connecting the corresponding sub-quantum channels in series at the output port of the quantum computer according to the sampling result after each sampling so as to perform data calculation on the sub-quantum channels and the quantum computer as a whole to obtain a calculation result; and calculating an average value of the obtained calculation results as an unbiased estimation of the calculation results of the quantum computer after the quantum noise is eliminated.

Description

Method and apparatus for eliminating quantum noise, computer device, medium, and product
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a quantum computer, and in particular, to a method and an apparatus for eliminating quantum noise, a computer device, a medium, and a product.
Background
Quantum computer technology has developed rapidly in recent years, but noise problems in quantum computers are inevitable in the foreseeable future: heat dissipation in the qubit, or random fluctuations in the underlying quantum physics process, will cause the state of the qubit to flip or randomize, leading to a failure of the computational process.
The current technical scheme for processing quantum noise mainly comprises the following two types: quantum Error Correction (Quantum Error Correction) and Quantum Error Mitigation (Quantum Error Mitigation) techniques. In the quantum error correction technology, each logic quantum bit is composed of a plurality of physical bits, error correction is realized through redundant physical quantum bit resources, however, with the increase of the number of the physical bits, the types of errors which can occur in a system are increased, and meanwhile, the operation of multi-quantum bit coding requires non-local interaction between the physical quantum bits, so that quantum error correction and a quantum gate of the logic bits are difficult to realize in experiments. The quantum error mitigation scheme does not need additional physical bits, but the quantum error mitigation scheme has requirements on the error type and error controllability of quantum wires, so that the quantum error mitigation scheme is difficult to implement on a recent quantum computer, and the method has no universality.
Disclosure of Invention
According to a first aspect of the present disclosure, there is provided a method of cancelling quantum noise of a quantum computer, comprising: modeling quantum noise of a quantum computer to obtain a quantum noise channel; performing quasi-probability decomposition on the inverse mapping of the quantum noise channel to obtain a set of sub-quantum channels of the inverse mapping of the quantum noise channel and quasi-probability distribution thereof; calculating according to the quasi probability distribution to obtain corresponding probability distribution; sampling the set of the sub-quantum channels for a preset number of times according to the probability distribution, and connecting the corresponding sub-quantum channels in series at the output port of the quantum computer according to the sampling result after each sampling so as to perform data calculation on the sub-quantum channels and the quantum computer as a whole to obtain a calculation result; and calculating an average value of the obtained calculation results as an unbiased estimation of the calculation results of the quantum computer after the quantum noise is eliminated.
According to a second aspect of the present disclosure, there is provided an apparatus for canceling quantum noise of a quantum computer, comprising: the modeling unit is configured to model quantum noise of the quantum computer to obtain a quantum noise channel; the quasi-probability decomposition unit is configured to perform quasi-probability decomposition on the inverse mapping of the quantum noise channel so as to obtain a set of sub-quantum channels of the inverse mapping of the quantum noise channel and quasi-probability distribution thereof; the first calculation unit is configured to calculate and obtain corresponding probability distribution according to the quasi-probability distribution; the sampling unit is configured to sample the set of the sub-quantum channels for a preset number of times according to the probability distribution, and after each sampling, the corresponding sub-quantum channels are connected in series at the output port of the quantum computer according to the sampling result, so that the sub-quantum channels and the quantum computer are used as a whole for data calculation to obtain a calculation result; and a second calculation unit configured to calculate an average value of the obtained calculation results as an unbiased estimation of the calculation results of the quantum computer after the quantum noise is eliminated.
According to a third aspect of the present disclosure, there is provided a computer device comprising: a memory, a processor, and a computer program stored on the memory, wherein the processor is configured to execute the computer program to implement the steps of the method of canceling quantum noise of a quantum computer.
According to a fourth aspect of the present disclosure, a non-transitory computer readable storage medium is provided, having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of a method of cancelling quantum noise of a quantum computer.
According to a fifth aspect of the disclosure, a computer program product is provided, comprising a computer program, wherein the computer program realizes the steps of the method of cancelling quantum noise of a quantum computer when executed by a processor.
The method for eliminating the quantum noise of the quantum computer according to one aspect of the disclosure is applicable to general quantum noise, does not depend on redundant auxiliary quantum bits, does not need to regulate and control the noise, and does not limit the structure of a noise-containing quantum circuit, thereby solving the problem that the existing quantum noise processing scheme cannot process the noise.
These and other aspects of the disclosure will be apparent from and elucidated with reference to the embodiments described hereinafter.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate exemplary embodiments of the embodiments and, together with the description, serve to explain the exemplary implementations of the embodiments. The illustrated embodiments are for purposes of illustration only and do not limit the scope of the claims. Throughout the drawings, identical reference numbers designate similar, but not necessarily identical, elements.
FIG. 1 shows a flow diagram of a method of cancelling quantum noise of a quantum computer according to an example embodiment;
FIG. 2 illustrates obtaining an inverse mapping of a quantum noise channel according to an example embodiment
Figure BDA0002821216330000021
A flow chart of the method of (1);
FIG. 3 shows a schematic diagram of concatenating sampled sub-quantum channels to a quantum computer output for data computation as a whole to obtain a computation result, according to an example embodiment;
FIG. 4 shows a schematic diagram of an apparatus to cancel quantum noise of a quantum computer according to an example embodiment; and
FIG. 5 illustrates a block diagram of an exemplary computing device that can be used to implement embodiments of the present disclosure.
Detailed Description
In the present disclosure, unless otherwise specified, the use of the terms "first", "second", etc. to describe various elements is not intended to limit the positional relationship, the timing relationship, or the importance relationship of the elements, and such terms are used only to distinguish one element from another. In some examples, a first element and a second element may refer to the same instance of the element, and in some cases, based on the context, they may also refer to different instances.
The terminology used in the description of the various described examples in this disclosure is for the purpose of describing particular examples only and is not intended to be limiting. Unless the context clearly indicates otherwise, if the number of elements is not specifically limited, the elements may be one or more. Furthermore, the term "and/or" as used in this disclosure is intended to encompass any and all possible combinations of the listed items.
To date, the various types of computers in use are based on classical physics as the theoretical basis for information processing, called traditional computers or classical computers. Classical information systems store data or programs using the most physically realizable binary data bits, each represented by a 0 or 1, called a bit or bit, as the smallest unit of information. The classic computer itself has inevitable weaknesses: one is the most fundamental limitation of computing process energy consumption. The minimum energy required by the logic element or the storage unit is more than several times of kT so as to avoid the misoperation of thermal expansion and dropping; information entropy and heating energy consumption; thirdly, when the wiring density of the computer chip is high, the uncertainty of the electronic position is small and the uncertainty of the momentum is large according to the heisenberg uncertainty relation. The electrons are no longer bound and there are quantum interference effects that can even destroy the performance of the chip.
Quantum computers (quantum computers) are physical devices that perform high-speed mathematical and logical operations, store and process quantum information in compliance with quantum mechanical properties and laws. When a device processes and calculates quantum information and runs a quantum algorithm, the device is a quantum computer. Quantum computers follow a unique quantum dynamics law, particularly quantum interference, to implement a new model of information processing. For parallel processing of computational problems, quantum computers have an absolute advantage in speed over classical computers. The transformation of each superposed component by the quantum computer is equivalent to a classical calculation, all the classical calculations are completed simultaneously and superposed according to a certain probability amplitude to give an output result of the quantum computer, and the calculation is called quantum parallel calculation. Quantum parallel processing greatly improves the efficiency of quantum computers, allowing them to accomplish tasks that classic computers cannot accomplish, such as factorization of a large natural number. Quantum coherence is essentially exploited in all quantum ultrafast algorithms. Therefore, quantum parallel computation of a classical state is replaced by a quantum state, so that the computation speed and the information processing function which are incomparable with a classical computer can be achieved, and meanwhile, a large amount of computation resources are saved.
With the rapid development of quantum computer technology, the application range of quantum computers is wider and wider due to the strong computing power and the faster operation speed. For example, chemical simulation refers to a process of mapping the hamiltonian of a real chemical system to physically operable hamiltonian, and then modulating parameters and evolution times to find eigenstates that reflect the real chemical system. When simulating an N-electron chemistry system on a classical computer, 2 is involvedNThe calculation amount of the Weischrodinger equation is exponentially increased along with the increase of the system electron number. Classical computers have therefore had very limited effect on chemical simulation problems. To break through this bottleneck, the powerful computing power of quantum computers must be relied upon. A Quantum intrinsic solver (VQE) algorithm is an efficient Quantum algorithm for performing chemical simulation on Quantum hardware, is one of the most promising applications of Quantum computers in the near future, and opens up many new chemical research fields. However, at present, the VQE capability of quantum computers is significantly limited by the noise rate of quantum computers, and therefore the noise problem must be dealt with first.
One core calculation process of quantum intrinsic solver algorithm VQE is to estimate the expected value Tr [ O ρ ]]Where ρ is the output state generated by the quantum computer and the observable O is the mapping of the hamiltonian of the real chemical system to the physically operable hamiltonian. Due to the existence of quantum noise, the practical evolution process of the quantum computer is formed by a noise channel
Figure BDA0002821216330000041
Characterised in that it results in a practically obtained desired value of
Figure BDA0002821216330000042
And thus the calculation result is erroneous. Thus, how to reduce or even eliminate the noise channel
Figure BDA0002821216330000043
Influence on expectation estimation in order to obtain Tr [ O ρ]The approximate estimation becomes an urgent problem to be solved.
Thus, according to an aspect of the present disclosure, an exemplary embodiment of the present disclosure provides a method 100 of cancelling quantum noise of a quantum computer, as shown in fig. 1, including: modeling quantum noise of a quantum computer to obtain a quantum noise channel (step 110); performing quasi-probability decomposition on the inverse mapping of the quantum noise channel to obtain a set of sub-quantum channels of the inverse mapping of the quantum noise channel and a probability distribution thereof (step 120); calculating to obtain corresponding probability distribution according to the quasi probability distribution (step 130); sampling the set of the sub-quantum channels for a predetermined number of times according to the probability distribution, and connecting the corresponding sub-quantum channels in series at the output port of the quantum computer according to the sampling result after each sampling so as to perform data calculation on the sub-quantum channels and the quantum computer as a whole to obtain a calculation result (step 140); and calculating an average value of the obtained calculation results as an unbiased estimation of the calculation results of the quantum computer after the quantum noise is removed (step 150).
The method for eliminating the quantum noise of the quantum computer according to the embodiment of the disclosure is suitable for general quantum noise, does not depend on redundant auxiliary quantum bits, does not need to regulate and control the noise, and does not limit the structure of a noise-containing quantum circuit, thereby solving the problem that the existing quantum noise processing scheme cannot process the noise.
Quantum channels are the most fundamental quantum operations that are physically realizable. In some examples, during data computation and evolution by the quantum computer, fundamental parameters of the quantum computer are obtained to model quantum noise for reconstruction based on the fundamental parameters to obtain a quantum noise channel.
According to some embodiments, modeling quantum noise of a quantum computer, resulting in a quantum noise channel comprises: quantum noise information is obtained through a corresponding analysis method; and modeling according to the quantum noise information to obtain a quantum noise channel. In some examples. The corresponding analysis method comprises at least one selected from the group consisting of: a Quantum Process Tomography (Quantum Process Tomography) method, and a Quantum Gate ensemble Tomography (Quantum Gate Set Tomography) method. However, it should be understood that other analysis methods that may be used to obtain quantum noise information are possible and not limited herein.
When controlling an unknown quantum computer system, the dynamic characteristics of the unknown quantum computer system are determined firstly. When the dynamic characteristics of any system are researched, the mathematical description of the system needs to be determined. Quantum chromatography is a method of obtaining a mathematical description of an unknown quantum system by preparing a series of appropriate quantum states and measuring and estimating their corresponding output quantum states. For example, quantum process chromatography is a commonly used method for experimentally determining unknown quantum operations, and in addition to completely characterizing the dynamics of a quantum computer system, can also be used to characterize the performance of a particular quantum gate or channel of quantum communication or to determine the type and magnitude of noise in a quantum computer system. By means of quantum chromatographic technology, we can measure and calculate various parameters reflecting the properties of quantum computer system directly or indirectly.
After the relevant parameters of the quantum noise of the quantum computer are obtained, the quantum noise channel can be obtained according to the parameter modeling. To perform quasi-probability decomposition on the inverse mapping of the quantum noise, the inverse mapping of the quantum noise channel needs to be obtained first.
According to some embodiments, as shown in FIG. 2, an inverse mapping of a quantum noise channel is obtained
Figure BDA0002821216330000051
The method comprises the following steps: obtaining a matrix representation N of a quantum noise channel (step 210); calculating an inverse of the matrix representation NN-1(step 220); and inverting the matrix N-1Conversion to Choi representation
Figure BDA0002821216330000052
As an inverse mapping of the quantum noise channel (step 230).
In some embodiments, the quantum noise channel is first represented as a matrix representation N using a matrix representation of the quantum channel, and then the inverse of the matrix N is calculated using gaussian elimination-1And then N is subjected to Choi-Jamiolkowski's method-1Conversion to Choi representation
Figure BDA0002821216330000053
Here, a quantum noise channel may be assumed
Figure BDA0002821216330000054
The inverse mapping of (c) always exists.
It should be understood that the modeled quantum noise channel may be of any type and is not limited thereto. However, to obtain the inverse mapping of the quantum noise channel, it is first required to convert the quantum noise channel into a matrix expression, and then perform an inverse operation on the matrix expression to obtain an inverse matrix thereof.
In some embodiments, inverse mapping of Choi representational forms of quantum noise channels
Figure BDA0002821216330000055
Quasi-probability decomposition is performed so that after the inverse matrix of the quantum noise channel is obtained, it can be further converted into Choi expression
Figure BDA0002821216330000056
According to some embodiments, quasi-probabilistic decomposing the inverse mapping of the quantum noise channel to obtain a set of sub-quantum channels of the inverse mapping of the quantum noise channel and their probability distributions comprises: obtaining an inverse mapping of the quantum noise channel
Figure BDA0002821216330000061
And mapping the inverse
Figure BDA0002821216330000062
Quasi-probability decomposition is performed to map the inverse
Figure BDA0002821216330000063
Splitting into at least two sub-quantum channels:
Figure BDA0002821216330000064
wherein p is1,…,pi… is satisfied with p1+…+pi+ … is a real number of 1,
Figure BDA0002821216330000065
is a plurality of sub-quantum channels in the set of decomposed sub-quantum channels, where | p1|+…+|piL + … has a minimum value. In some examples, the plurality of sub-quantum channels is at least 2.
The method according to the disclosed embodiment can be decomposed into any type of quantum channel, and the quantum noise channel is not needed to be decomposed into only a linear combination of a given type of noise-containing quantum wires, so that the application range of the method is wider.
In some examples, semi-positive Programming methods (Semidefinite Programming) may be used to pair on a classical computer
Figure BDA0002821216330000066
Quasi-probability decomposition is carried out according to the formula (1), and semi-positive definite planning has an efficient classical algorithm, so that the quasi-probability decomposition can be efficiently completed in a classical computer. It should be understood that other methods that can be used to perform quasi-probabilistic decomposition are possible and the disclosure is not limited thereto.
In some embodiments, the inverse mapping may be performed on a classical computer
Figure BDA0002821216330000067
Performing quasi-probability decomposition according to the following formula (3) to decompose into two sub-quantum channels:
Figure BDA0002821216330000068
wherein p is1,p2Is satisfying p1+p2A real number of 1 is defined as,
Figure BDA0002821216330000069
is two sub-quantum channels of a decomposition, and the decomposition satisfies | p1|+|p2The value of | is minimal. In the embodiment according to the present disclosure, only the inverse mapping of the quantum noise channel needs to be decomposed into the linear combination of any two sub-quantum channels, so that the operation is more concise and efficient; therefore, the calculation efficiency is greatly improved in the sampling process, and the quasi-probability decomposition can be efficiently completed in a classical computer.
According to some embodiments, the predetermined number of times the set of sub-quantum channels are sampled is:
K=2γ2log2(2/∈)/δ2formula (2)
Wherein δ is the preset calculation precision of the quantum computer after quantum noise is eliminated; e is the confidence coefficient; γ is the sampling efficiency, where γ ═ p1|+…|piL + …. In the above-described embodiment of decomposition into two sub-quantum channels, it can be understood that γ ═ p1|+|p2|。
Inverse mapping as described above
Figure BDA00028212163300000610
Decomposition into two sub-quantum channels
Figure BDA00028212163300000611
And
Figure BDA00028212163300000612
in the embodiment, as an example, theThe preset number of line samples is K. Thus, the following two steps are iterated for K rounds: (1) at the kth (K ∈ {1,2 … K }), based on the probability distribution
Figure BDA00028212163300000613
Sub-quantum channel
Figure BDA00028212163300000614
And
Figure BDA00028212163300000615
sampling to obtain
Figure BDA00028212163300000616
And recording the sampled coefficients as
Figure BDA0002821216330000071
(2) As shown in FIG. 3, an actual quantum computer 301 (including an ideal quantum computer 301a and a noise channel) is used
Figure BDA0002821216330000072
(301b) As the output of the sub-quantum channel
Figure BDA0002821216330000073
(302) I.e. the sub-quantum channels obtained by the round of sampling are concatenated at the output port of the quantum computer 301
Figure BDA0002821216330000074
(302) As a new device 303 to perform data calculation and evolution to obtain an estimated expected value of the output state 304
Figure BDA0002821216330000075
Figure BDA0002821216330000076
It will be appreciated that the inverse mapping will be
Figure BDA0002821216330000077
The sampling process for decomposing into more than two sub-quantum channels is also described above, and therefore will not be described herein again.
It should be understood that although the above description defines the range of K as K e {1,2 … K }, it should be understood that K can be any integer greater than or equal to 1 and is not limited thereto. It is conceivable, however, that in general the larger the value of K, the more accurate the unbiased estimation of the computation result of the quantum computer after quantum noise cancellation resulting from the final computation will likely be.
After K sampling rounds, K groups of estimated expected values can be obtained
Figure BDA0002821216330000078
Thus, the K sets of estimated expected values may be aggregated
Figure BDA0002821216330000079
The average value is calculated as an unbiased estimate of the calculation result of the quantum computer after the quantum noise is eliminated.
According to some embodiments, the average of the obtained calculation results is calculated according to the following average formula (4):
Figure BDA00028212163300000710
wherein,
Figure BDA00028212163300000711
representing coefficients obtained after each sampling
Figure BDA00028212163300000712
The sign of (A) if
Figure BDA00028212163300000713
Is a positive number, then
Figure BDA00028212163300000714
Figure BDA00028212163300000715
If it is not
Figure BDA00028212163300000716
Is a negative number, then
Figure BDA00028212163300000717
After the kth sampling, the sub-quantum channel is obtained by connecting the output ends of the quantum computers in series for sampling
Figure BDA00028212163300000718
And then performing calculation/evolution to obtain calculation results, wherein ° is the concatenation sign, i belongs to {1,2 … }, and K belongs to {1,2 … K }.
Through the Hoeffding Hough inequality, the method disclosed by the invention can theoretically ensure that the average value xi calculated according to the formula (4) can be estimated in an unbiased manner by the probability greater than 1-epsilon, namely the average value Tr [ O rho ], and the estimation error is within the delta range. Finally, the average value ξ is output as an effective estimate of the noise-removed Tr [ O ρ ].
According to the embodiment, the quasi-probability decomposition is carried out on the inverse mapping of the quantum noise channel according to the method disclosed by the invention, the sampling cost is lower, and the operation efficiency is higher.
According to another aspect of the present disclosure, there is also provided an apparatus 400 for canceling quantum noise of a quantum computer according to an exemplary embodiment of the present disclosure, as shown in fig. 4, including: a modeling unit 410 configured to model quantum noise of the quantum computer to obtain a quantum noise channel; a quasi-probability decomposition unit 420 configured to perform quasi-probability decomposition on the inverse mapping of the quantum noise channel to obtain a set of sub-quantum channels of the inverse mapping of the quantum noise channel and a quasi-probability distribution thereof; a first calculating unit 430, configured to calculate a corresponding probability distribution according to the quasi-probability distribution; a sampling unit 440 configured to sample the set of sub-quantum channels for a predetermined number of times according to the probability distribution, and after each sampling, concatenate corresponding sub-quantum channels at an output port of the quantum computer according to a sampling result, so as to perform data calculation on the sub-quantum channels and the quantum computer as a whole, and obtain a calculation result; and a second calculation unit 450 configured to calculate an average value of the obtained calculation results as an unbiased estimation of the calculation results of the quantum computer after quantum noise is eliminated.
According to some embodiments, the modeling unit 410 comprises: a unit for acquiring quantum noise information by a quantum process chromatography method; and modeling according to the quantum noise information to obtain a unit of a quantum noise channel.
According to some embodiments, the quasi-probabilistic decomposition unit 420 includes: obtaining an inverse mapping of the quantum noise channel
Figure BDA0002821216330000081
A unit of (1); and mapping the inverse
Figure BDA0002821216330000082
A unit for performing quasi-probability decomposition according to the following formula:
Figure BDA0002821216330000083
wherein p is1,…,pi… is satisfied with p1+…+pi+ … is a real number of 1,
Figure BDA0002821216330000084
is a plurality of sub-quantum channels in the set of decomposed sub-quantum channels, where | p1|+…+|piL + … has a minimum value.
According to some embodiments, obtaining an inverse mapping of the quantum noise channel
Figure BDA0002821216330000085
The unit (2) comprises: obtaining a matrix expression N of the quantum noise channel; calculating an inverse matrix N of the matrix representation N-1(ii) a And applying the inverse matrix N-1Conversion to Choi representation
Figure BDA0002821216330000086
As an inverse mapping of the quantum noise channel.
According to some embodiments, the predetermined number of times is:
K=2γ2log2(2/∈)/δ2
wherein δ is the preset calculation precision of the quantum computer after quantum noise is eliminated, e is the confidence coefficient, and γ is | p1|+…|pi|+…。
According to some embodiments, the average of the obtained calculation results is calculated according to the following average formula:
Figure BDA0002821216330000087
wherein, the
Figure BDA0002821216330000088
Representing coefficients obtained after each sampling
Figure BDA0002821216330000089
The sign of the (c) is greater than the (c),
Figure BDA00028212163300000810
the calculation results obtained by performing data calculation after the kth sampling, wherein i belongs to {1,2 … }, and K belongs to {1,2 … K }.
Here, the operations of the above units 410 to 450 of the apparatus 400 for eliminating quantum noise of a quantum computer are similar to the operations of the steps 110 to 150 described above, and are not described herein again.
According to another aspect of the present disclosure, there is also provided a computer device comprising a memory, a processor and a computer program stored on the memory, the processor being configured to execute the computer program to implement the steps of the above method of cancelling quantum noise of a quantum computer.
According to yet another aspect of the present disclosure, there is also provided a computer readable storage medium, on which a computer program is stored, which computer program, when being executed by a processor, realizes the above-mentioned steps of the method of cancelling quantum noise of a quantum computer.
According to yet another aspect of the present disclosure, there is also provided a computer program product comprising a computer program which, when executed by a processor, implements the steps of the above-described method of cancelling quantum noise of a quantum computer.
Referring to fig. 5, a block diagram of a structure of a computer device 500, which may be a server or a client of the present disclosure, which is an example of a hardware device that may be applied to aspects of the present disclosure, will now be described.
Computer device 500 may include components connected to bus 502 (possibly via one or more interfaces) or in communication with bus 502. For example, computer device 500 may include a bus 502, one or more processors 504, one or more input devices 506, and one or more output devices 508. The one or more processors 504 may be any type of processor and may include, but are not limited to, one or more general purpose processors and/or one or more special purpose processors (e.g., special processing chips). The processor 504 may process instructions for execution within the computer device 500, including instructions stored in or on a memory to display graphical information for a GUI on an external input/output apparatus (such as a display device coupled to an interface). In other embodiments, multiple processors and/or multiple buses may be used, along with multiple memories and multiple memories, as desired. Also, multiple computer devices may be connected, with each device providing portions of the necessary operations (e.g., as a server array, a group of blade servers, or a multi-processor system). One processor 504 is illustrated in fig. 5.
Input device 506 may be any type of device capable of inputting information to computer device 500. Input device 506 may receive input numeric or character information and generate key signal inputs related to user settings and/or functional controls of a computer device that cancels quantum noise of a quantum computer, and may include, but is not limited to, a mouse, a keyboard, a touch screen, a track pad, a track ball, a joystick, a microphone, and/or a remote control. Output device 508 can be any type of device capable of presenting information and can include, but is not limited to, a display, speakers, a video/audio output terminal, a vibrator, and/or a printer.
The computer device 500 may also include or be connected with a non-transitory storage device 510, which may be any storage device that is non-transitory and that may enable data storage, and may include, but is not limited to, a magnetic disk drive, an optical storage device, a solid state memory, a floppy disk, a flexible disk, a hard disk, a magnetic tape or any other magnetic medium, an optical disk or any other optical medium, a ROM (read only memory), a RAM (random access memory), a cache memory and/or any other memory chip or cartridge, and/or any other medium from which a computer may read data, instructions and/or code. The non-transitory storage device 510 may be removable from the interface. The non-transitory storage device 510 may have data/programs (including instructions)/code/units (e.g., the modeling unit 410, the quasi-probability decomposition unit 420, the first calculation unit 430, the sampling unit 440, and the second calculation unit 450 shown in fig. 4) for implementing the above-described methods and steps.
The computer device 500 may also include a communication device 512. The communication device 512 may be any type of device or system that enables communication with external devices and/or with a network, and may include, but is not limited to, a modem, a network card, an infrared communication device, a wireless communication device, and/or a chipset, such as a bluetooth (TM) device, an 1302.11 device, a WiFi device, a WiMax device, a cellular communication device, and/or the like.
Computer device 500 may also include a working memory 514, which may be any type of working memory that can store programs (including instructions) and/or data useful for the operation of processor 504, and which may include, but is not limited to, random access memory and/or read only memory devices.
Software elements (programs) may be located in the working memory 514 including, but not limited to, an operating system 516, one or more application programs 518, drivers, and/or other data and code. Instructions for performing the above-described methods and steps may be included in one or more of the application programs 518, and the above-described methods may be implemented by the instructions of the one or more application programs 518 being read and executed by the processor 2004. Executable code or source code for the instructions of the software elements (programs) may also be downloaded from a remote location.
It will also be appreciated that various modifications may be made in accordance with specific requirements. For example, customized hardware might also be used and/or particular elements might be implemented in hardware, software, firmware, middleware, microcode, hardware description languages, or any combination thereof. For example, some or all of the disclosed methods and apparatus may be implemented by programming hardware (e.g., programmable logic circuitry including Field Programmable Gate Arrays (FPGAs) and/or Programmable Logic Arrays (PLAs)) in an assembly language or hardware programming language such as VERILOG, VHDL, C + +, using logic and algorithms according to the present disclosure.
It should also be understood that the foregoing method may be implemented in a server-client mode. For example, a client may receive data input by a user and send the data to a server. The client may also receive data input by the user, perform part of the processing in the foregoing method, and transmit the data obtained by the processing to the server. The server may receive data from the client and perform the aforementioned method or another part of the aforementioned method and return the results of the execution to the client. The client may receive the results of the execution of the method from the server and may present them to the user, for example, through an output device. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computer devices and having a client-server relationship to each other. The server may be a server of a distributed system or a server incorporating a blockchain. The server can also be a cloud server, or an intelligent cloud computing server or an intelligent cloud host with artificial intelligence technology. The cloud Server is a host product in a cloud computing service system, and is used for solving the defects of high management difficulty and weak service expansibility in the traditional physical host and Virtual Private Server (VPS) service.
It should also be understood that the components of computer device 500 may be distributed across a network. For example, some processes may be performed using one processor while other processes may be performed by another processor that is remote from the one processor. Other components of computing device 500 may also be similarly distributed. As such, computer device 500 may be interpreted as a distributed computing system that performs processing at multiple locations.
Although embodiments or examples of the present disclosure have been described with reference to the accompanying drawings, it is to be understood that the above-described methods, systems and apparatus are merely exemplary embodiments or examples and that the scope of the present invention is not limited by these embodiments or examples, but only by the claims as issued and their equivalents. Various elements in the embodiments or examples may be omitted or may be replaced with equivalents thereof. Further, the steps may be performed in an order different from that described in the present disclosure. Further, various elements in the embodiments or examples may be combined in various ways. It is important that as technology evolves, many of the elements described herein may be replaced with equivalent elements that appear after the present disclosure.

Claims (15)

1. A method of eliminating quantum noise of a quantum computer, comprising:
modeling the quantum noise of the quantum computer to obtain a quantum noise channel;
performing quasi-probability decomposition on the inverse mapping of the quantum noise channel to obtain a set of inversely mapped sub-quantum channels of the quantum noise channel and quasi-probability distribution thereof;
calculating according to the quasi probability distribution to obtain corresponding probability distribution;
sampling the set of the sub-quantum channels for a preset number of times according to the probability distribution, and connecting the corresponding sub-quantum channels in series at an output port of the quantum computer according to sampling results after each sampling so as to perform data calculation on the sub-quantum channels and the quantum computer as a whole to obtain a calculation result; and
and calculating the average value of the obtained calculation results to be used as the unbiased estimation of the calculation results of the quantum computer after the quantum noise is eliminated.
2. The method of claim 1, modeling quantum noise of the quantum computer, resulting in a quantum noise channel comprising:
obtaining quantum noise information by a respective analysis method, wherein the respective analysis method comprises at least one selected from the group consisting of: quantum process chromatography, quantum gate ensemble chromatography; and
and modeling according to the quantum noise information to obtain a quantum noise channel.
3. The method of claim 1, wherein quasi-probabilistically decomposing the inverse mapping of the quantum noise channel to obtain the set of inversely mapped sub-quantum channels of the quantum noise channel and their quasi-probabilistically probability distributions comprises:
obtaining an inverse mapping of the quantum noise channel
Figure FDA0002821216320000011
And
mapping the inverse
Figure FDA0002821216320000012
Performing quasi-probability decomposition according to the following formula:
Figure FDA0002821216320000013
wherein p is1,...,pi.. is that p is satisfied1+...+pi+ … is a real number of 1,
Figure FDA0002821216320000014
is after decompositionA plurality of sub-quantum channels in a set of sub-quantum channels, wherein | p1|+…+|piL + … has a minimum value.
4. The method of claim 3, obtaining an inverse mapping of the quantum noise channel
Figure FDA0002821216320000015
The method comprises the following steps:
obtaining a matrix expression N of the quantum noise channel;
calculating an inverse matrix N of the matrix representation N-1(ii) a And
the inverse matrix N-1Conversion to Choi representation
Figure FDA0002821216320000016
As an inverse mapping of the quantum noise channel.
5. The method of claim 3, wherein the predetermined number of times is:
K=2γ2log2(2/∈)/δ2
wherein δ is the preset calculation precision of the quantum computer after quantum noise is eliminated, e is the confidence coefficient, and γ is | p1|+…|pi|+…。
6. The method of claim 5, wherein the average of the obtained calculation results is calculated according to the following average formula:
Figure FDA0002821216320000021
wherein, the
Figure FDA0002821216320000022
Representing coefficients obtained after each sampling
Figure FDA0002821216320000023
The sign of the (c) is greater than the (c),
Figure FDA0002821216320000024
and calculating a calculation result obtained by performing data calculation after the kth sampling, wherein i belongs to {1, 2. }, and K belongs to {1, 2.. K }.
7. An apparatus for canceling quantum noise of a quantum computer, comprising:
the modeling unit is configured to model the quantum noise of the quantum computer to obtain a quantum noise channel;
a quasi-probability decomposition unit configured to perform quasi-probability decomposition on the inverse mapping of the quantum noise channel to obtain a set of inversely mapped sub-quantum channels of the quantum noise channel and a quasi-probability distribution thereof;
the first calculation unit is configured to calculate corresponding probability distribution according to the quasi probability distribution;
the sampling unit is configured to sample the set of the sub-quantum channels for a preset number of times according to the probability distribution, and after each sampling, the corresponding sub-quantum channels are connected in series at an output port of the quantum computer according to a sampling result, so that the sub-quantum channels and the quantum computer are used as a whole for data calculation to obtain a calculation result; and
a second calculation unit configured to calculate an average value of the obtained calculation results as an unbiased estimation of the calculation results of the quantum computer after quantum noise is eliminated.
8. The apparatus of claim 7, wherein the modeling unit comprises:
obtaining quantum noise information by a respective analysis method, wherein the respective analysis method comprises at least one selected from the group consisting of: quantum process chromatography, quantum gate ensemble chromatography; and
and modeling according to the quantum noise information to obtain a unit of a quantum noise channel.
9. The apparatus of claim 7, wherein the quasi-probabilistic decomposition unit comprises:
obtaining an inverse mapping of the quantum noise channel
Figure FDA0002821216320000025
A unit of (1); and
mapping the inverse
Figure FDA0002821216320000031
A unit for performing quasi-probability decomposition according to the following formula:
Figure FDA0002821216320000032
wherein p is1,...,pi.. is that p is satisfied1+...+pi+ … is a real number of 1,
Figure FDA0002821216320000033
is a plurality of sub-quantum channels in the set of decomposed sub-quantum channels, where | p1|+…+|piL + … has a minimum value.
10. The apparatus of claim 9, wherein an inverse mapping of the quantum noise channel is obtained
Figure FDA0002821216320000034
The unit (2) comprises:
obtaining a matrix expression N of the quantum noise channel;
calculating an inverse matrix N of the matrix representation N-1(ii) a And
the inverse matrix N-1Conversion to Choi representation
Figure FDA0002821216320000035
As the quantum noiseInverse mapping of the acoustic channel.
11. The apparatus of claim 9, wherein the predetermined number of times is:
K=2γ2log2(2/∈)/δ2
wherein δ is the preset calculation precision of the quantum computer after quantum noise is eliminated, e is the confidence coefficient, and γ is | p1|+…|pi|+…。
12. The apparatus of claim 11, wherein the average of the obtained calculation results is calculated according to an average formula as follows:
Figure FDA0002821216320000036
wherein, the
Figure FDA0002821216320000037
Representing coefficients obtained after each sampling
Figure FDA0002821216320000038
The sign of the (c) is greater than the (c),
Figure FDA0002821216320000039
and calculating a calculation result obtained by performing data calculation after the kth sampling, wherein i belongs to {1, 2. }, and K belongs to {1, 2.. K }.
13. A computer device, comprising:
a memory, a processor, and a computer program stored on the memory,
wherein the processor is configured to execute the computer program to implement the steps of the method of any one of claims 1-6.
14. A non-transitory computer readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the method of any of claims 1-6.
15. A computer program product comprising a computer program, wherein the computer program realizes the steps of the method of any one of claims 1-6 when executed by a processor.
CN202011437359.7A 2020-12-07 2020-12-07 Method and apparatus for eliminating quantum noise, computer device, medium, and product Active CN112529194B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011437359.7A CN112529194B (en) 2020-12-07 2020-12-07 Method and apparatus for eliminating quantum noise, computer device, medium, and product

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011437359.7A CN112529194B (en) 2020-12-07 2020-12-07 Method and apparatus for eliminating quantum noise, computer device, medium, and product

Publications (2)

Publication Number Publication Date
CN112529194A true CN112529194A (en) 2021-03-19
CN112529194B CN112529194B (en) 2021-09-03

Family

ID=74999392

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011437359.7A Active CN112529194B (en) 2020-12-07 2020-12-07 Method and apparatus for eliminating quantum noise, computer device, medium, and product

Country Status (1)

Country Link
CN (1) CN112529194B (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112990472A (en) * 2021-03-25 2021-06-18 北京百度网讯科技有限公司 Method and apparatus for eliminating quantum noise, electronic device, and medium
CN113065659A (en) * 2021-03-25 2021-07-02 北京百度网讯科技有限公司 Method and apparatus for eliminating quantum noise, electronic device, and medium
CN113098802A (en) * 2021-03-25 2021-07-09 北京百度网讯科技有限公司 Inverse mapping decomposition method and device for quantum noise channel, electronic device, and medium
CN113098803A (en) * 2021-03-25 2021-07-09 北京百度网讯科技有限公司 Inverse mapping decomposition method and device for quantum noise channel, electronic device, and medium
CN113298262A (en) * 2021-06-10 2021-08-24 北京百度网讯科技有限公司 Quantum device denoising method and device, electronic device and computer readable medium
CN114429218A (en) * 2022-01-25 2022-05-03 北京百度网讯科技有限公司 Method and apparatus for eliminating quantum noise, electronic device and medium
CN114492823A (en) * 2022-01-25 2022-05-13 北京百度网讯科技有限公司 Method and apparatus for eliminating quantum noise, electronic device, and medium
CN114565101A (en) * 2022-03-21 2022-05-31 苏州浪潮智能科技有限公司 Noise-containing quantum computing simulation method, device, equipment and medium
US12198013B1 (en) 2023-07-07 2025-01-14 International Business Machines Corporation Calibrating a quantum error mitigation technique

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140140602A1 (en) * 2011-07-13 2014-05-22 Timo Aspelmeier Transmission image reconstruction and imaging using poissonian detector data
CN110210073A (en) * 2019-05-10 2019-09-06 腾讯科技(深圳)有限公司 Quantum noise process analysis method, device, equipment and storage medium
CN111461335A (en) * 2020-04-03 2020-07-28 合肥本源量子计算科技有限责任公司 Noise-containing single-quantum logic gate implementation method and device based on MPI (Multi-processor interface) multi-process

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140140602A1 (en) * 2011-07-13 2014-05-22 Timo Aspelmeier Transmission image reconstruction and imaging using poissonian detector data
CN110210073A (en) * 2019-05-10 2019-09-06 腾讯科技(深圳)有限公司 Quantum noise process analysis method, device, equipment and storage medium
CN111461335A (en) * 2020-04-03 2020-07-28 合肥本源量子计算科技有限责任公司 Noise-containing single-quantum logic gate implementation method and device based on MPI (Multi-processor interface) multi-process

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
陶宗明等: "光电探测器的量子噪声特性研究", 《大气与环境光学学报》 *

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113098803B (en) * 2021-03-25 2021-11-02 北京百度网讯科技有限公司 Inverse mapping decomposition method and device for quantum noise channel, electronic device, and medium
CN113065659B (en) * 2021-03-25 2022-01-11 北京百度网讯科技有限公司 Method and apparatus for eliminating quantum noise, electronic device, and medium
CN113098802A (en) * 2021-03-25 2021-07-09 北京百度网讯科技有限公司 Inverse mapping decomposition method and device for quantum noise channel, electronic device, and medium
CN113098803A (en) * 2021-03-25 2021-07-09 北京百度网讯科技有限公司 Inverse mapping decomposition method and device for quantum noise channel, electronic device, and medium
CN113098802B (en) * 2021-03-25 2021-10-26 北京百度网讯科技有限公司 Inverse mapping decomposition method and device for quantum noise channel, electronic device, and medium
CN112990472A (en) * 2021-03-25 2021-06-18 北京百度网讯科技有限公司 Method and apparatus for eliminating quantum noise, electronic device, and medium
CN113065659A (en) * 2021-03-25 2021-07-02 北京百度网讯科技有限公司 Method and apparatus for eliminating quantum noise, electronic device, and medium
CN113298262A (en) * 2021-06-10 2021-08-24 北京百度网讯科技有限公司 Quantum device denoising method and device, electronic device and computer readable medium
CN113298262B (en) * 2021-06-10 2022-04-26 北京百度网讯科技有限公司 Quantum device denoising method and device, electronic device and computer readable medium
CN114492823B (en) * 2022-01-25 2024-07-19 北京百度网讯科技有限公司 Method and device for eliminating quantum noise, electronic equipment and medium
CN114492823A (en) * 2022-01-25 2022-05-13 北京百度网讯科技有限公司 Method and apparatus for eliminating quantum noise, electronic device, and medium
CN114429218A (en) * 2022-01-25 2022-05-03 北京百度网讯科技有限公司 Method and apparatus for eliminating quantum noise, electronic device and medium
CN114565101A (en) * 2022-03-21 2022-05-31 苏州浪潮智能科技有限公司 Noise-containing quantum computing simulation method, device, equipment and medium
US12198013B1 (en) 2023-07-07 2025-01-14 International Business Machines Corporation Calibrating a quantum error mitigation technique

Also Published As

Publication number Publication date
CN112529194B (en) 2021-09-03

Similar Documents

Publication Publication Date Title
CN112529194B (en) Method and apparatus for eliminating quantum noise, computer device, medium, and product
CN112990472B (en) Method and apparatus for eliminating quantum noise, electronic device, and medium
JP7471736B2 (en) Method and system for estimating ground state energy of a quantum system
CN113065659B (en) Method and apparatus for eliminating quantum noise, electronic device, and medium
CN113298262B (en) Quantum device denoising method and device, electronic device and computer readable medium
CN114429218A (en) Method and apparatus for eliminating quantum noise, electronic device and medium
CN115310618A (en) Quantum noise cancellation method and apparatus in quantum operation, electronic device, and medium
CN113098803B (en) Inverse mapping decomposition method and device for quantum noise channel, electronic device, and medium
CN113098802B (en) Inverse mapping decomposition method and device for quantum noise channel, electronic device, and medium
Shingu et al. Boltzmann machine learning with a variational quantum algorithm
US11915121B2 (en) Simulator-assisted training for interpretable generative models
CN114492823A (en) Method and apparatus for eliminating quantum noise, electronic device, and medium
Blank et al. Quantum-enhanced analysis of discrete stochastic processes
CN114580649A (en) Method and device for eliminating quantum Pagli noise, electronic equipment and medium
WO2023130918A1 (en) Method and apparatus for managing state of quantum system, device and medium
CN114239840A (en) Quantum channel noise coefficient estimation method and device, electronic device and medium
CN114580648A (en) Method and device for eliminating generalized amplitude damping noise, electronic equipment and medium
Pocrnic et al. Quantum simulation of Lindbladian dynamics via repeated interactions
Sannia et al. A hybrid classical-quantum approach to speed-up Q-learning
Lu et al. Variational 3D shape segmentation for bounding volume computation
KR20240083896A (en) Method for generating time series data and system thereof
CN115618663B (en) Quantum solving method and device for coupling grid equation and physical equation
Akhtar et al. Bayesian analysis of generalized log-Burr family with R
US20220147852A1 (en) Mitigating partiality in regression models
CN113052309A (en) Method, computer system and storage medium for compressing neural network model

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