Quantum circuit operation method and device, electronic device and medium

By using a combination of controlled gates and Hadamard gates in quantum circuits to measure auxiliary qubits, the high resource consumption problem of large-scale quantum state Renyi entropy estimation is solved, and fast entropy estimation is achieved on recent quantum computers.

CN114548413BActive Publication Date: 2024-11-01BEIJING BAIDU NETCOM SCI & TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210179534.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-02-25
Publication Date
2024-11-01
Estimated Expiration
2042-02-25

AI Technical Summary

Technical Problem

Estimating the Renyi entropy of large-scale quantum states is too resource-intensive in current technologies and is difficult to achieve efficiently on near-term quantum computers, especially when the system contains multiple qubits.

Method used

A quantum circuit operation method is adopted, which involves inputting Q+1 system quantum states and an auxiliary qubit into a quantum circuit, and using a combination of controlled gates and Hadamard gates to measure the quantum states on the auxiliary qubit to obtain the undetermined terms in the Fourier series expression of the quantum Renyi entropy, and calculating the estimated value of the entropy through random sampling.

Benefits of technology

The estimation of quantum Renyi entropy can be computed quickly and efficiently on recent quantum computers, reducing computational resource requirements and making it suitable for entropy estimation of large-scale quantum states.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114548413B_ABST
    Figure CN114548413B_ABST
Patent Text Reader

Abstract

The present disclosure provides a quantum circuit operation method, device, electronic device, computer-readable storage medium and computer program product, which relate to the field of quantum computers, and in particular to the field of quantum circuit technology. The implementation scheme is: perform the following operations for a predetermined number of times: input Q+1 system quantum states and the first auxiliary quantum bit into the quantum circuit, the quantum circuit includes Q controlled gates, so as to act on the controlled gates between the first auxiliary quantum bit, the first system quantum state and each second system quantum state, and act on the H gate before the first auxiliary quantum bit acts on the first controlled gate and after the last controlled gate, respectively, and the second system quantum state is the system quantum state other than the first system quantum state; measure the output quantum state of the quantum circuit to obtain the corresponding undetermined term in the Fourier series expression of the quantum Renyi entropy. The undetermined term is obtained based on sampling multiple expansion terms of the Fourier series expression of the quantum Renyi entropy.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of quantum computers, in particular to the field of quantum circuit technology, and specifically to a quantum circuit operation method, device, electronic device, computer-readable storage medium, and computer program product. Background Art

[0002] In scientific research and engineering applications, estimating the quantum Renyi entropy of a system is an important problem. In general, it is very difficult to calculate the entropy of a physical system. Even with the most advanced supercomputers available today, when the number of quantum bits in the system is large, the time consumed by the supercomputer and other large resources are unacceptable. In recent years, with the rise of quantum computing, more and more people are studying quantum computers and using quantum computers to solve practical problems. Summary of the invention

[0003] The present disclosure provides a quantum circuit operation method, apparatus, electronic device, computer-readable storage medium, and computer program product.

[0004] According to one aspect of the present disclosure, a quantum circuit operation method is provided, comprising: performing the following operations a predetermined number of times: inputting Q+1 system quantum states and a first auxiliary quantum bit into the quantum circuit, wherein the quantum circuit comprises Q controlled gates to respectively act on the controlled gates between the first auxiliary quantum bit, the first system quantum state and each second system quantum state, and respectively act on an H gate before the first auxiliary quantum bit acts on the first controlled gate and after the first auxiliary quantum bit acts on the last controlled gate, wherein the second system quantum state is Q system quantum states other than the first system quantum state among the Q+1 system quantum states; measuring the quantum state output on the first auxiliary quantum bit of the quantum circuit to obtain a corresponding undetermined term in a Fourier series expression of quantum Renyi entropy, wherein the undetermined term is obtained by sampling a plurality of expanded terms of the Fourier series expression of the quantum Renyi entropy, the predetermined number of times is the number of the undetermined terms, Q is determined based on the undetermined terms and a preset estimation accuracy, and Q is a positive integer.

[0005] According to another aspect of the present disclosure, a quantum circuit operation device is provided, comprising: an operation unit configured to perform the following operations a predetermined number of times: inputting Q+1 system quantum states and a first auxiliary quantum bit into the quantum circuit, wherein the quantum circuit comprises Q controlled gates to respectively act on the controlled gates between the first auxiliary quantum bit, the first system quantum state and each second system quantum state, and respectively act on an H gate before the first auxiliary quantum bit acts on the first controlled gate and after the first auxiliary quantum bit acts on the last controlled gate, wherein the second system quantum state is Q system quantum states other than the first system quantum state among the Q+1 system quantum states; measuring the quantum state output on the first auxiliary quantum bit of the quantum circuit to obtain a corresponding undetermined term in a Fourier series expression of quantum Renyi entropy, wherein the undetermined term is obtained by sampling a plurality of expanded terms of the Fourier series expression of the quantum Renyi entropy, the predetermined number of times is the number of the undetermined terms, Q is determined based on the undetermined terms and a preset estimation accuracy, and Q is a positive integer.

[0006] According to another aspect of the present disclosure, an electronic device is provided, comprising: at least one processor; and a memory communicatively connected to the at least one processor; the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the method described in the present disclosure.

[0007] According to another aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided. The computer instructions are used to cause a computer to execute the method described in the present disclosure.

[0008] According to another aspect of the present disclosure, a computer program product is provided, including a computer program, which implements the method described in the present disclosure when executed by a processor.

[0009] According to one or more embodiments of the present disclosure, it can be run on a recent quantum computer and can conveniently and quickly calculate the estimated value of the quantum Renyi entropy.

[0010] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The accompanying drawings exemplarily illustrate the embodiments and constitute a part of the specification, and together with the text description of the specification, are used to explain the exemplary implementation of the embodiments. The embodiments shown are for illustrative purposes only and do not limit the scope of the claims. In all drawings, the same reference numerals refer to similar but not necessarily identical elements.

[0012] Figure 1 A flowchart showing a method for operating a quantum circuit according to an embodiment of the present disclosure is shown;

[0013] Figure 2 A circuit diagram of a quantum circuit according to an embodiment of the present disclosure is shown;

[0014] Figure 3 The embodiment according to the present disclosure is shown Figure 2 Circuit diagram of the controlled gate in;

[0015] Figure 4 A circuit diagram of a two-qubit Swap operator according to an embodiment of the present disclosure is shown;

[0016] Figure 5 The embodiment according to the present disclosure is shown Figure 3 A circuit diagram of a two-bit controlled gate select (S);

[0017] Figure 6 A block diagram showing a structure of an operating device of a quantum circuit according to an embodiment of the present disclosure; and

[0018] Figure 7 A structural block diagram of an exemplary electronic device that can be used to implement the embodiments of the present disclosure is shown. DETAILED DESCRIPTION

[0019] The following is a description of exemplary embodiments of the present disclosure in conjunction with the accompanying drawings, including various details of the embodiments of the present disclosure to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope of the present disclosure. Similarly, for the sake of clarity and conciseness, the description of well-known functions and structures is omitted in the following description.

[0020] 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, timing relationship, or importance relationship of these elements, and such terms are only used to distinguish one element from another element. In some examples, the first element and the second element may refer to the same instance of the element, and in some cases, based on the description of the context, they may also refer to different instances.

[0021] The terms used in the description of various examples in this disclosure are only for the purpose of describing specific examples and are not intended to be limiting. Unless the context clearly indicates otherwise, if the number of elements is not specifically limited, the element can be one or more. In addition, the term "and / or" used in this disclosure covers any one of the listed items and all possible combinations.

[0022] The embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings.

[0023] So far, all the different types of computers in use are based on classical physics as the theoretical basis for information processing, and are called traditional computers or classical computers. Classical information systems use binary data bits, which are the easiest to implement physically, to store data or programs. Each binary data bit is represented by 0 or 1, called a bit or bit, as the smallest unit of information. Classical computers themselves have inevitable weaknesses: one is the most basic limitation of energy consumption in the computing process. The minimum energy required for logic elements or storage units should be several times more than kT to avoid misoperation due to thermal expansion and fall; the second is information entropy and heat energy consumption; the third is that when the wiring density of computer chips is very high, according to the Heisenberg uncertainty relation, when the uncertainty of the electron position is very small, the uncertainty of the momentum will be very large. Electrons are no longer bound, and there will be quantum interference effects, which may even destroy the performance of the chip.

[0024] A quantum computer is a physical device that follows the properties and laws of quantum mechanics to perform high-speed mathematical and logical operations, store and process quantum information. When a device processes and calculates quantum information and runs quantum algorithms, it is a quantum computer. Quantum computers follow the unique laws of quantum dynamics (especially quantum interference) to achieve a new mode of information processing. For parallel processing of computational problems, quantum computers have an absolute advantage in speed over classical computers. The transformation of each superposition component by a quantum computer is equivalent to a classical calculation. All these classical calculations are completed at the same time and superimposed according to a certain probability amplitude to give the output result of the quantum computer. This calculation is called quantum parallel computing. Quantum parallel processing greatly improves the efficiency of quantum computers, allowing them to complete tasks that classical computers cannot complete, such as factoring a large natural number. Quantum coherence is essentially used in all quantum ultra-fast algorithms. Therefore, quantum parallel computing, which replaces classical states with quantum states, can achieve computing speeds and information processing functions that are incomparable to classical computers, while saving a lot of computing resources.

[0025] In scientific research and engineering applications, estimating the quantum Renyi entropy of a system is an important problem. For example, in lithium battery technology, an important problem is to calculate the energy density of the battery. Generally, the energy density is characterized by the free energy of the system, and the free energy can be estimated by difference using the quantum Renyi entropy. On the other hand, the quantum Renyi entropy can characterize the degree of disorder of a system, that is, the greater the entropy, the more disordered the system is. In information theory, some quantities related to entropy can describe the ability to compress quantum data; in machine learning, the construction of decision trees is also related to entropy. In addition, entropy has important applications in feature selection, financial data analysis, and even condensed matter physics and high-energy physics.

[0026] In mathematics, R is usually used α (ρ) represents Renyi entropy. In particular, assuming that the system is in quantum state ρ, then for a given α∈(0, 1)∪(1, ∞), the quantum Renyi entropy of the system is defined as:

[0027]

[0028] Here, tr represents the trace of the matrix, and log represents the logarithm with base 2. The entropy estimation problem is to find an estimate est such that |est-R is given a system in a quantum state ρ and for any precision ∈>0. α (ρ)|≤∈. Due to the parameter α, Renyi entropy is nonlinear. In physics, it can characterize the energy transfer of quantum measurements (two-time measurements of energy transfers). In addition, by setting α, Renyi entropy can characterize other entropies. Specifically, when α=0, it is Hartley entropy; when α=1, it is von Neumann entropy; when α=2, it is collision entropy.

[0029] Whether in engineering applications or scientific research, estimating the entropy of large-scale quantum states is very important, but also very difficult. Studies have shown that the resources consumed by estimating the Renyi entropy of quantum states (such as the number of quantum states) increase exponentially with the size of the system. If the system contains 50 quantum bits, even with the most advanced supercomputers today, the time consumed and the large amount of other resources are unacceptable. Therefore, a more efficient quantum entropy estimation scheme will help explore the characteristics of large-scale quantum states and promote the development of the aforementioned related fields.

[0030] In recent years, with the rise of quantum computing, more and more people are exploring quantum computers and studying the use of quantum computers to solve practical problems. Quantum computers are a type of device that follows the laws of quantum mechanics and are widely believed to have capabilities that surpass classical computers and can solve tasks that classical computers cannot complete. In this context, a quantum Renyi entropy estimation scheme based on quantum computing theory is considered to use the powerful computing power of quantum computers to solve the entropy estimation problem of large-scale quantum states.

[0031] Currently, there are three main quantum algorithms for estimating Renyi entropy.

[0032] Scheme 1 systematically studies the resources required to estimate the Renyi entropy of an unknown quantum state. In particular, the scheme assumes that any measurement can be made on the quantum state and the measurement results can be processed by classical methods. The main cost of this scheme is the number of target quantum states. Studies have shown that for any α∈(0,1)∪(1,∞), the number of quantum states consumed by this scheme depends exponentially on the scale of the quantum state, so it is not suitable for large-scale quantum states.

[0033] Scheme 2 proposes a quantum algorithm to estimate Renyi entropy. For the target quantum state, this scheme assumes that the input is a purification quantum circuit that can effectively prepare the target quantum state. In particular, this scheme combines the input circuit with quantum singular value transformation and DQC1 (Deterministic Quantum Computation with one clean qubit) model to estimate tr(ρ α ), and then calculate R α The estimated value of (ρ).

[0034] However, the quantum circuit for preparing quantum state purification is unknown. Current technology generally assumes that the density matrix is ​​stored on a device similar to QRAM, or that the circuit for preparing quantum states is known. It can be seen that the current scheme does not provide an effective solution to prepare quantum state purification. In addition, many of the technologies involved are difficult to implement on recent quantum computers, mainly because the depth of the circuit and the number of quantum bits are limited. For example, the realization of amplitude estimation requires the use of a circuit similar to phase estimation, which requires the use of auxiliary quantum bits and deep circuits, and is therefore not practical on recent quantum computers. Moreover, it consumes a lot of computing resources. When processing multiple different quantum states, the circuit needs to be compiled separately for each quantum state. For example, if ten quantum states are processed, the circuit needs to be compiled ten times. This time, because the circuit for preparing the quantum state is different at the time of input, the overall circuit needs to be adjusted according to the specific quantum state. Therefore, there are very large limitations when processing multiple quantum states.

[0035] Scheme 3 proposes a shallow-depth quantum circuit to estimate the entropy R when α is an integer α (ρ). In particular, the scheme is based on the Swap test (used to estimate tr(ρ 2 )) and designed a shallow quantum circuit to estimate tr(ρ α ), and then calculate R α (ρ), where α is an integer. However, this scheme is only applicable to the case where α is an integer and cannot estimate the Renyi entropy corresponding to more general real numbers.

[0036] Therefore, if Figure 1 As shown, according to an embodiment of the present disclosure, a quantum circuit operation method 100 is provided, comprising: performing the following operations for a predetermined number of times (step 110): inputting Q+1 system quantum states and a first auxiliary quantum bit into the quantum circuit, the quantum circuit comprising Q controlled gates, so as to act on the controlled gates respectively between the first auxiliary quantum bit, the first system quantum state and each second system quantum state, and acting on the H gate respectively before the first auxiliary quantum bit acts on the first controlled gate and after the first auxiliary quantum bit acts on the last controlled gate, the second system quantum state is Q system quantum states other than the first system quantum state among the Q+1 system quantum states (step 1101); measuring the quantum state outputted on the first auxiliary quantum bit of the quantum circuit to obtain the corresponding undetermined term in the Fourier series expression of the quantum Renyi entropy (step 1102). The undetermined term is obtained by sampling multiple expansion terms of the Fourier series expression of the quantum Renyi entropy, the predetermined number of times is the number of the undetermined term, Q is determined based on the undetermined term and a preset estimation accuracy, and Q is a positive integer.

[0037] The quantum circuit according to the present disclosure can be run on a recent quantum computer and can conveniently and quickly calculate the estimated value of the quantum Renyi entropy.

[0038] In the present disclosure, a quantum circuit can be used to calculate the undetermined term of the Fourier series expression of the quantum Renyi entropy, thereby obtaining an estimated value of the entropy. Specifically, using F α (ρ) is used to represent the Fourier series, which is the approximate function of Renyi entropy, and its definition is as follows:

[0039]

[0040] Among them, ρ is the quantum state of the system; represents the binomial coefficient, and Represents the generalized binomial coefficient, where the coefficients s, l, and k have value ranges of

[0041] When l = 2n, When l = 2n + 1, n is a non-negative integer, where Parameters K, L, M l It can be determined based on the constant Λ and the preset estimation accuracy ∈ as follows:

[0042]

[0043]

[0044]

[0045]

[0046]

[0047] Among them, D l ,U l The definition of is related to l, representing the number l, The maximum value of, and l, The minimum value of .

[0048] It can be seen that quantum circuits are mainly used to calculate decomposition terms The constant Λ is an arbitrary lower bound for the non-zero eigenvalues ​​of the quantum state of the system. For example, the estimation precision ∈∈(0,1).

[0049] Figure 2 A schematic diagram of a quantum circuit according to an embodiment of the present disclosure is shown, which can be used to calculate the corresponding to-be-determined term Achieve accuracy ∈. The specific steps are: Use a classical computer to calculate the parameters K, L, Ml , calculate tr(ρ by Swap test 2 ). Define a matrix M, whose elements are:

[0050]

[0051] Among them, M sl represents the element in the lth row and sth column of the matrix M, and l and s are integers. Set parameters in represents the 1-norm of the matrix M, that is, the sum of the absolute values ​​of all elements.

[0052] According to some embodiments, for all combinations of (l, s), the probability distribution of multiple expanded terms of the Fourier series expression of quantum Renyi entropy is determined based on the following formula:

[0053]

[0054] The elements (s, l) of the sampling matrix M are sampled multiple times based on the probability distribution R.

[0055] According to some embodiments, the number of items to be determined is determined according to the following formula:

[0056]

[0057] in, δ is a preset constant used to characterize the failure probability. There is a certain probability of obtaining inaccurate results in random sampling calculations, and δ is the probability of obtaining inaccurate results.

[0058] Therefore, for all (l,s) that satisfy the condition Perform B sampling to obtain the sampled samples (s1,l1),…,(s B ,l B ). For each sample (s1,l1),…,(s B ,l B ), and the corresponding undetermined terms are calculated by quantum circuits

[0059] Continue to refer to Figure 2 Describe the calculation (s=1,2,…,B) quantum circuits and steps. For convenience, we use the parameter T to represent For a given parameter ε, set the integer Parameter t = T / Q. Figure 2As shown, the circuit prepares the quantum state ρ and an auxiliary quantum bit |0><0| on Q+1 registers. Then, a Hadamard gate (i.e., H gate) is first applied to |0><0|, and controlled gates are applied to registers (1, 2), (1, 3), (1, 4), ..., (1, Q+1) respectively. -iSt , where S represents the Swap gate. That is, the controlled gate acts on the first quantum state and the second quantum state Acting on the first quantum state and the third quantum state with a controlled gate ..., acting on the first quantum state and the (Q+1)th quantum state with controlled gates Figure 2 The symbol S 12 represents the Swap operator acting on quantum states ρ1 and ρ2, and other similar symbols satisfy the same definition. Finally, a Hadamard gate is applied to the auxiliary qubit. On the far right of the circuit, the auxiliary qubit is measured after passing through the circuit to obtain the measurement result. The measurement operator includes but is not limited to the Pauli matrix Z. The measurement result is the required term That is, the corresponding items to be determined. By adjusting Q, the corresponding (s1,l1),…,(s B ,l B ) item.

[0060] By randomly sampling multiple expanded terms in the Fourier series expression of quantum Renyi entropy and solving the sampled undetermined terms through quantum circuits, the amount of calculation can be greatly reduced and the calculation efficiency can be improved.

[0061] In some embodiments, quantum circuits can be used to implement controlled swap evolution, i.e., controlled-e -iSt To achieve controlled-e -iSt , define two single-bit rotation gates and a unitary operator as follows:

[0062]

[0063]

[0064]

[0065] Among them, a = cost + |sint|, sgn (-t) represents the sign of -t, i is an imaginary number, and S is the Swap operator. By adding two auxiliary quantum bits, acting on the revolving gates R1, R2 and the controlled gate controlled-select (S), controlled-e -iSt Circuits such as Figure 3 shown.

[0066] like Figure 3 As shown, the circuit (301) of the controlled gate controlled-A can be used as Figure 2 controlled-e -iSt Circuit. Figure 3 As shown, the controlled-gate controlled-A includes two controlled-W modules and a Module. Figure 3 It can be seen that controlled-W consists of controlled revolving doors R1, R2 and controlled door select (S). Figure 3 The dots on the qubits in the figure represent controlled gates, and the solid and hollow ones represent controlled by |1> and |0>, respectively. A controlled gate consists of a control bit and a working bit, and the operation used on the working bit is determined by the control bit. For example, if the control bit is |1>, R1 is applied to the target qubit, and if the control bit is in state |0>, R2 is applied. In addition, controlled-W and The two parts in the middle (i.e. the parts outside the dotted box) are symmetry operators along the direction orthogonal to the quantum state |00>.

[0067] exist Figure 3 In the figure, the second and third lines from top to bottom are the marked additional two auxiliary qubits, acting on the rotating gates R1 and R2 respectively. The controlled gate select(S) acts on the first and third (from top to bottom) auxiliary qubits respectively, and the Swap operator S acts on the two quantum states ρ. Figure 3 As shown, the circuit uses only single-bit and two-bit quantum gates and controlled-select (S) gates.

[0068] In some embodiments, the controlled-select (S) gate can be constructed by a Toffoli gate. Generally speaking, a two-bit Swap operator can be constructed by three CNOT gates, such as Figure 4 As shown. By adding an auxiliary qubit, a two-qubit controlled-select (S) circuit can be constructed, as shown Figure 5 As shown, the first and second lines (from top to bottom) form the first two-qubit quantum state, and the fourth and fifth lines (from top to bottom) form the second two-qubit quantum state. For the multi-qubit Swap operator, its quantum circuit can be constructed similarly: just use similar Figure 5 In addition, the phase gate It only needs to act on one quantum bit, and only once.

[0069] According to the embodiments of the present disclosure, only a constant number of auxiliary quantum bits, single quantum bit gates, two-qubit controlled gates, and Toffoli gates are used, which reduces the quantum resources required for quantum simulation and makes it easy to implement on recent quantum computers.

[0070] According to the embodiments of the present disclosure, Figure 6 As shown, a quantum circuit operation device 600 is provided, comprising: an operation unit 610, configured to perform the following operations for a predetermined number of times: inputting Q+1 system quantum states and a first auxiliary quantum bit into the quantum circuit, wherein the quantum circuit comprises Q controlled gates, so as to act on the controlled gates respectively between the first auxiliary quantum bit, the first system quantum state and each second system quantum state, and to act on an H gate respectively before the first auxiliary quantum bit acts on the first controlled gate and after the first auxiliary quantum bit acts on the last controlled gate, wherein the second system quantum state is Q system quantum states other than the first system quantum state among the Q+1 system quantum states; measuring the quantum state outputted on the first auxiliary quantum bit of the quantum circuit to obtain the corresponding undetermined term in the Fourier series expression of the quantum Renyi entropy, wherein the undetermined term is obtained by sampling multiple expanded terms of the Fourier series expression of the quantum Renyi entropy, the predetermined number of times is the number of the undetermined terms, Q is determined based on the undetermined terms and a preset estimation accuracy, and Q is a positive integer.

[0071] Here, the operations of the above-mentioned units 610 of the quantum circuit operation device 600 are respectively similar to the operations of step 110 described above, and will not be repeated here.

[0072] According to an embodiment of the present disclosure, an electronic device, a readable storage medium and a computer program product are also provided.

[0073] refer to Figure 7 , a block diagram of an electronic device 700 that can be used as a server or client of the present disclosure will now be described, which is an example of a hardware device that can be applied to various aspects of the present disclosure. The electronic device is intended to represent various forms of digital electronic computer devices, such as laptop computers, desktop computers, workbenches, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.

[0074] like Figure 7As shown, the device 700 includes a computing unit 701, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 702 or a computer program loaded from a storage unit 708 into a random access memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the device 700 can also be stored. The computing unit 701, the ROM X02, and the RAM 703 are connected to each other via a bus 704. An input / output (I / O) interface 705 is also connected to the bus 704.

[0075] Multiple components in the device 700 are connected to the I / O interface 705, including: an input unit 706, an output unit 707, a storage unit 708, and a communication unit 709. The input unit 706 can be any type of device that can input information to the device 700. The input unit 706 can receive input digital or character information and generate key signal input related to user settings and / or function control of the electronic device, and can 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 controller. The output unit 707 can be any type of device that can present information, and can include but is not limited to a display, a speaker, a video / audio output terminal, a vibrator, and / or a printer. The storage unit 708 can include but is not limited to a disk, an optical disk. The communication unit 709 allows the device 700 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks, and can include but is not limited to a modem, a network card, an infrared communication device, a wireless communication transceiver, and / or a chipset, such as a Bluetooth™ device, an 802.11 device, a WiFi device, a WiMax device, a cellular communication device, and / or the like.

[0076] The computing unit 701 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 701 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 701 performs the various methods and processes described above, such as method 100. For example, in some embodiments, the method 100 may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 708. In some embodiments, part or all of the computer program may be loaded and / or installed on the device 700 via the ROM 702 and / or the communication unit 709. When the computer program is loaded into the RAM 703 and executed by the computing unit 701, one or more steps of the method 100 described above may be performed. Alternatively, in other embodiments, the computing unit 701 may be configured to perform the method 100 in any other appropriate manner (e.g., by means of firmware).

[0077] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0078] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0079] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, 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 disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0080] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0081] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.

[0082] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship with each other. The server may be a cloud server, a server of a distributed system, or a server combined with a blockchain.

[0083] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps described in this disclosure can be performed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.

[0084] Although the embodiments or examples of the present disclosure have been described with reference to the accompanying drawings, it should be understood that the above-mentioned methods, systems and devices are merely exemplary embodiments or examples, and the scope of the present invention is not limited by these embodiments or examples, but only by the claims after authorization and their equivalent scope. Various elements in the embodiments or examples can be omitted or replaced by their equivalent elements. In addition, each step can be performed in an order different from that described in the present disclosure. Further, the various elements in the embodiments or examples can be combined in various ways. It is important that with the evolution of technology, many elements described herein can be replaced by equivalent elements that appear after the present disclosure.

Claims

1. A quantum circuit operation method, include: Perform the following actions a predetermined number of times: Inputting Q+1 system quantum states and a first auxiliary quantum bit into the quantum circuit, wherein the quantum circuit includes Q controlled gates, so as to respectively act on the controlled gates between the first auxiliary quantum bit, the first system quantum state and each second system quantum state, and respectively act on an H gate before the first auxiliary quantum bit acts on the first controlled gate and after the first controlled gate acts on the last controlled gate, wherein the second system quantum state is Q system quantum states among the Q+1 system quantum states except the first system quantum state; The quantum state output on the first auxiliary quantum bit of the quantum circuit is measured to obtain the corresponding undetermined term in the Fourier series expression of the quantum Renyi entropy, wherein the undetermined term is obtained by sampling multiple expanded terms of the Fourier series expression of the quantum Renyi entropy, the predetermined number of times is the number of the undetermined terms, Q is determined based on the undetermined terms and a preset estimation accuracy, and Q is a positive integer.

2. The method according to claim 1, in, The controlled door includes a single-bit revolving door R 1 , R 2 and unitary operators, where The single bit revolving door R 1 , R 2 acting on corresponding qubits in two second auxiliary qubits respectively; and The unitary operator acts on the first auxiliary quantum bit and the single-bit rotation gate R 2 The corresponding second auxiliary quantum bit, the first system quantum state and the corresponding second system quantum state.

3. The method according to claim 1, in, The Fourier series expression is determined according to the following formula: Where ρ is the quantum state of the system, α is the parameter of the quantum Renyi entropy, α∈(0,1)∪(1,∞); when l=2n, When l = 2n + 1, n is a non-negative integer, where in, For expanded items, ∈ is the estimation accuracy, and Λ is the lower bound of the non-zero eigenvalues ​​of the quantum state of the system.

4. The method according to claim 3, in, For all combinations of (l, s), the probability distribution of the multiple expanded terms of the Fourier series expression of the quantum Renyi entropy is determined based on the following formula: Among them, M sl represents the element in the lth row and sth column of the matrix M, represents the 1-norm of the matrix M, l∈{0,1,…,L}, l and s are integers.

5. The method according to claim 4, in, The number of items to be determined is determined according to the following formula: in, δ is a constant.

6. A quantum circuit operation device, include: The operation unit is configured to perform the following operations a predetermined number of times: Inputting Q+1 system quantum states and a first auxiliary quantum bit into the quantum circuit, wherein the quantum circuit includes Q controlled gates, so as to respectively act on the controlled gates between the first auxiliary quantum bit, the first system quantum state and each second system quantum state, and respectively act on an H gate before the first auxiliary quantum bit acts on the first controlled gate and after the first controlled gate acts on the last controlled gate, wherein the second system quantum state is Q system quantum states among the Q+1 system quantum states except the first system quantum state; measuring the quantum state outputted on the first auxiliary quantum bit of the quantum circuit to obtain the corresponding undetermined term in the Fourier series expression of the quantum Renyi entropy, Among them, the items to be determined are obtained by sampling multiple expanded terms of the Fourier series expression of the quantum Renyi entropy, the predetermined number of times is the number of the items to be determined, Q is determined based on the items to be determined and a preset estimation accuracy, and Q is a positive integer.

7. The device according to claim 6, in, The controlled door includes a single-bit revolving door R 1 , R 2 and unitary operators, where The single bit revolving door R 1 , R 2 acting on corresponding qubits in two second auxiliary qubits respectively; and The unitary operator acts on the first auxiliary quantum bit and the single-bit rotation gate R 2 The corresponding second auxiliary quantum bit, the first system quantum state and the corresponding second system quantum state.

8. An electronic device, include: at least one processor; as well as a memory communicatively coupled to the at least one processor; in The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method according to any one of claims 1 to 5.

9. A non-transitory computer-readable storage medium storing computer instructions, in, The computer instructions are used to cause the computer to execute the method according to any one of claims 1-5.

10. A computer program product comprising a computer program, in, When the computer program is executed by a processor, the method according to any one of claims 1 to 5 is implemented.