Quantum device performance verification method and device, electronic device and medium

Abstract

The present disclosure provides a method, apparatus, electronic device, computer-readable storage medium and computer program product for verifying the performance of a quantum device, which relates to the field of quantum computers, and in particular to the field of quantum local verification technology. The implementation scheme is: performing a first operation: generating a two-bit quantum state shared by a first quantum system and a second quantum system through a quantum device; obtaining a Bell state shared by the first quantum system and the second quantum system; performing Bell measurement on the two-bit quantum state and the corresponding part of the Bell state belonging to it on the first quantum system and the second quantum system respectively; in response to the measurement results of both parties being the same after performing the first operation for a preset number of times, determining that the two-bit quantum state generated by the quantum device is a Bell state.

Description

Technical Field

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

[0002] Quantum entanglement has very important applications in the fields of quantum computing and quantum information processing. Inaccurate quantum entangled states will significantly affect the results of quantum computing and quantum information processing. Therefore, before using quantum devices to generate entangled states, it is necessary to complete quantum device performance verification to ensure the quality of entanglement. Performance verification of quantum devices requires a large number of repeated experiments to reduce the probability of false assertions. The more experiments are conducted, the more time and quantum state resources are consumed. Summary of the invention

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

[0004] According to one aspect of the present disclosure, a method for verifying the performance of a quantum device is provided, comprising: performing a first operation, wherein the first operation comprises the following steps: generating, by the quantum device, a two-bit quantum state shared by a first quantum system and a second quantum system; obtaining a Bell state shared by the first quantum system and the second quantum system; performing Bell measurement on the two-bit quantum state and a corresponding portion of the Bell state belonging to the first quantum system on the first quantum system to obtain a first measurement result; and performing Bell measurement on the two-bit quantum state and a corresponding portion of the Bell state belonging to the second quantum system on the second quantum system to obtain a second measurement result; in response to determining that the first measurement result and the second measurement result are the same and the number of executions of the first operation does not exceed a preset number of times, repeatedly performing the first operation; and in response to the first measurement result and the second measurement result obtained after performing the first operation a preset number of times being the same, determining that the two-bit quantum state generated by the quantum device is a Bell state.

[0005] According to another aspect of the present disclosure, a quantum device performance verification apparatus is provided, comprising: an execution unit configured to execute a first operation, wherein the first operation comprises the following steps: generating, by means of the quantum device, a two-bit quantum state shared by a first quantum system and a second quantum system; acquiring a Bell state shared by the first quantum system and the second quantum system; performing Bell measurement on the two-bit quantum state and a corresponding portion of the Bell state belonging to the first quantum system on the first quantum system to obtain a first measurement result; and performing Bell measurement on the two-bit quantum state and a corresponding portion of the Bell state belonging to the second quantum system on the second quantum system to obtain a second measurement result; a first determination unit configured to repeatedly execute the first operation in response to determining that the first measurement result and the second measurement result are the same and the number of executions of the first operation does not exceed a preset number of times; and a second determination unit configured to determine that the two-bit quantum state generated by the quantum device is a Bell state in response to the first measurement result and the second measurement result obtained after executing the first operation a preset number of times are the same.

[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, by introducing Bell measurement and making use of entanglement resources, high verification efficiency can be achieved by only requiring local measurements on the first quantum system and the second quantum system, thereby completing the task of quantum device performance verification with less resource consumption, thereby improving verification efficiency.

[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 schematic diagram of LOCC-based quantum device performance verification according to an embodiment of the present disclosure is shown;

[0013] Figure 2 A flowchart of a method for verifying quantum device performance according to an embodiment of the present disclosure is shown;

[0014] Figure 3 A schematic diagram showing the performance verification of a quantum device assisted by entanglement according to an embodiment of the present disclosure is shown;

[0015] Figure 4 A block diagram showing a structure of a quantum device performance verification apparatus according to an embodiment of the present disclosure; and

[0016] Figure 5 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

[0017] 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, descriptions of well-known functions and structures are omitted in the following description.

[0018] 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.

[0019] 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.

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

[0021] 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.

[0022] 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.

[0023] Quantum computing based on quantum computers is the core of the next generation of computing technology. More and more emerging quantum technologies are emerging, the technology of quantum hardware is improving year by year, and quantum communication and quantum Internet are also developing. One of the most important resources of quantum technology is quantum entanglement, which is the core resource and basic component of quantum computing and quantum information processing. It is the core part of many famous quantum information processing cases, such as quantum key distribution, quantum superdense coding, and quantum teleportation.

[0024] Taking quantum super-dense coding as an example, the relevant quantum protocol is as follows: Alice and Bob, the two parties in the protocol communication, pre-share a pair of highly entangled Bell states; Alice performs corresponding quantum coding operations on the quantum bits she holds according to the two bits of classical information that need to be transmitted, and then transmits the quantum bit after the operation to Bob through an ideal quantum channel; Bob performs Bell measurement on the received quantum bits and the quantum bits originally held, and decodes the two bits of classical information transmitted by Alice. Quantum super-dense coding cleverly uses the properties of quantum entanglement to transmit two classical bits of information through one quantum bit, thereby achieving a communication method with greater capacity and higher efficiency.

[0025] In quantum super-dense coding, Alice and Bob need to share a pair of highly entangled Bell quantum states to encode the transmitted classical information. If the fidelity of the Bell states they share is not high enough, the super-dense coding protocol cannot be carried out normally, and Bob cannot accurately decode the classical information transmitted by Alice, which cannot reflect the advantages of quantum information processing.

[0026] It can be seen from the quantum super-dense coding protocol that how to efficiently verify whether an unknown quantum device accurately produces Bell states is a core issue in quantum computing. In addition, considering that the verification process itself cannot consume more and more stringent resources than the object to be verified (Bell state), the two parties involved in the verification are required to use only local quantum operations and classical communication (LOCC) to complete the verification process through classical data post-processing.

[0027] When a two-bit quantum state is locally verified by a local quantum operation, for example, a device manufacturer builds a quantum device Each call to the quantum device A two-bit quantum state σ can be generated at one timeAB (This quantum state belongs to two quantum systems, Alice and Bob.)

[0028] The device manufacturer can ensure that the quantum device must necessarily fall into one of the following two cases: Good Case - the quantum device can precisely produce a Bell state i.e., F(σ AB , Ψ): = <Ψ|σ|Ψ> = 1, where Ψ ≡ |Ψ><Ψ|; or, Bad Case - the quantum state σ produced by the quantum device AB and the Bell state |Ψ> have a fidelity less than or equal to 1 - ε, i.e., F(σ AB , Ψ): = <Ψ|σ AB |Ψ> ≤ 1 - ε, where ε is the error value preset by the manufacturer, and F() represents the fidelity function.

[0029] Before Alice and Bob use the quantum device , they first need to determine which case this quantum device is: If it is Good Case, then they can use the Bell state generated by this quantum device to perform quantum information processing tasks; if it is Bad Case, then they cannot use this quantum device to perform quantum information processing tasks. Figure 1 FIG. shows a schematic diagram of LOCC-based quantum device performance verification according to an embodiment of the present disclosure.

[0030] Considering the limited quantum capabilities of Alice and Bob, as described above, a local verification method can be adopted to verify their quantum performance. Specifically, the quantum device is called to generate a quantum state σ AB , where the subscript A indicates that the first qubit is located in the Alice quantum system, and the subscript B indicates that the second qubit is located in the Bob quantum system. Alice and Bob use local measurements to measure the two qubits respectively and record the measurement results, and then transfer the measurement results through classical communication and determine whether the quantum device belongs to Good Case or Bad Case.

[0031] Quantum entanglement has very important applications in the fields of quantum computing and quantum information processing. An inaccurate Bell state will significantly affect the results of quantum computing and quantum information processing. Therefore, before using a quantum device, it is necessary to complete the quantum device performance verification to ensure the quality of the generated Bell state. And the quantum device performance verification requires a large number of repeated experiments to reduce the probability of false assertions. The more experiments are performed, the more resources such as time and quantum states are consumed.

[0032] Therefore, according to an embodiment of the present disclosure, a method for verifying the performance of a quantum device is provided. Figure 2 FIG. 1 is a flow chart of a method for verifying quantum device performance according to an embodiment of the present disclosure. Figure 2 As shown, method 200 includes: performing a first operation (step 210); in response to determining that the first measurement result and the second measurement result are the same and the number of executions of the first operation does not exceed a preset number of times, repeatedly performing the first operation (step 220); and in response to the first measurement result and the second measurement result obtained after performing the first operation a preset number of times being the same, determining that the two-bit quantum state generated by the quantum device is a Bell state (step 230).

[0033] In an embodiment of the present disclosure, the first operation includes the following steps: generating a two-bit quantum state shared by a first quantum system and a second quantum system through the quantum device; obtaining a Bell state shared by the first quantum system and the second quantum system; performing a Bell measurement on the two-bit quantum state and a corresponding part of the Bell state belonging to the first quantum system on the first quantum system to obtain a first measurement result; and performing a Bell measurement on the two-bit quantum state and a corresponding part of the Bell state belonging to the second quantum system on the second quantum system to obtain a second measurement result.

[0034] In the embodiments of the present disclosure, by introducing Bell measurement and making use of entanglement resources, high verification efficiency can be achieved by only requiring local measurements on the first quantum system and the second quantum system, thereby completing the quantum device performance verification task with less resource consumption, thereby improving verification efficiency.

[0035] According to some embodiments, the method according to the embodiment of the present disclosure further includes: in response to determining that the first measurement result and the second measurement result are different, determining that the two-bit quantum state generated by the quantum device is not a Bell state.

[0036] In order to accurately judge the unknown quantum device Whether to create the Bell state |Ψ>, Alice and Bob (the first quantum system and the second quantum system) can satisfy the following constraints: 1) If the unknown quantum device Indeed, Bell states are created. Alice and Bob always assert Good Case to prevent accidental injury. If the unknown quantum device 1) No Bell state is created, and the probability that Alice and Bob incorrectly assert a Good Case is as small as possible; 2) The quantum measurement used by Alice and Bob is a local measurement, that is, Alice and Bob each measure the quantum state, and no entangled measurement is used between the two (otherwise the optimal verification scheme is a global verification scheme using Bell measurement between the two); 3) Alice and Bob use random quantum measurements, so that equipment manufacturers cannot customize non-Bell states that always pass the test based on the deterministic measurement information used by Alice and Bob, thereby deceiving Alice and Bob.

[0037] For example, Alice and Bob use the single-bit standard basis to measure {|0><0|, {|1><1|} for verification. Since the output of the ideal Bell state in these two local measurements is always 00 or 11, if the unknown quantum device After the measurement is performed and the output is one of these two output results, Alice and Bob can assert that the unknown quantum device is a GoodCase; conversely, if a measurement result is 01 or 10, it can be asserted that the unknown quantum device It is a Bad Case.

[0038] Generally, the performance of two-bit quantum states generated by unknown quantum devices can be verified using an optimal global verification scheme. The optimal global verification scheme requires the use of Bell Measurement. First, four two-bit quantum states are defined:

[0039]

[0040]

[0041]

[0042]

[0043] It should be noted that |Ψ0> is the Bell state to be verified as mentioned above. Bell measurement is a two-qubit entanglement measurement. Its four measurement operators correspond to the four quantum states mentioned above. The Bell measurement is defined as follows:

[0044]

[0045] Among them, i ≡|Ψ i ><Ψ i |. iThe subscript i in the equation represents the corresponding output result, that is, there are four output results of Bell measurement, namely 0, 1, 2, and 3. The corresponding results are 00, 01, 10, and 11 in binary representation.

[0046] For example, in the optimal global verification scheme, the following operations may be included:

[0047] Step 1: Calculate the total number of test rounds N that need to be performed g , and initialize the iteration parameter k=0.

[0048] Step 2: Update the iteration parameter k=k+1 and make the following judgment:

[0049] If k < N g , execute step 3 (i.e., perform entanglement measurement and continue testing the unknown quantum device).

[0050] If k ≥ N g , jump to step 4 (i.e. the verification process is completed and the quantum device passes the test);

[0051] Step 3: Alice and Bob call the quantum device Generate a two-qubit quantum state σ and use Bell measurement Measure the quantum state. If the measurement result is 0, jump to step 2 for the next round of testing; otherwise, directly output BadCase.

[0052] Step 4: Output Good Case.

[0053] It can be understood that the number of quantum devices required to call the optimal global verification scheme can be determined according to the following formula:

[0054]

[0055] Among them, ε is the preset error tolerance of the quantum device, and δ is the preset confidence level for errors in verifying the performance of the quantum device.

[0056] However, when locally verifying a two-bit quantum state through a local quantum operation, the usual verification scheme may include the following steps:

[0057] Step 1: Calculate the total number of test rounds N that need to be performed l , initialize the iteration parameter k=0.

[0058] Step 2: Update the iteration parameter k=k+1 and make the following judgment:

[0059] If k < N l , execute step 3 (i.e., perform local measurement and continue testing the unknown quantum device);

[0060] If k ≥ N l , jump to step 4 (i.e. the verification process is completed and the quantum device passes the test).

[0061] Step 3: Alice and Bob call the quantum device Generate a two-qubit quantum state σ, and uniformly randomly select a measurement pair σ from the three local measurements {XX, YY, ZZ} (X, Y, Z are Pauli operators) (i.e. Alice and Bob both perform one of the X, Y, Z measurements), communicate the measurement results and analyze the measurement results according to the following strategy:

[0062] If XX or ZZ measurement is selected: If the measurement result is 00 or 11, jump to step 2 for the next round of testing; if the output result is 01 or 10, directly output Bad Case.

[0063] If YY measurement is selected: If the measurement result is 01 or 10, jump to step 2 for the next round of testing; if the output result is 00 or 11, directly output Bad Case.

[0064] Step 4: Output Good Case.

[0065] It can be understood that the number of quantum devices required to be called for the above local verification scheme is:

[0066]

[0067] By comparison, the above local verification scheme has an additional cost of 3 / 2 compared to the optimal global scheme.

[0068] It can be seen that the optimal global verification scheme can achieve the best efficiency, but it requires Bell measurement between Alice and Bob. If Alice and Bob are far apart, Bell measurement between them cannot be achieved. The above-mentioned local verification scheme can be efficiently implemented even when Alice and Bob are far apart because it uses local measurement, but its efficiency is relatively low and the number of quantum devices that need to be called is relatively large.

[0069] Therefore, the local verification scheme according to the embodiment of the present disclosure combines the advantages of the above two schemes and avoids their disadvantages. By performing local measurement of Bell measurement on Alice and Bob respectively (i.e., introducing entanglement assistance), the efficiency can be effectively improved compared with the above local verification scheme.

[0070] Specifically, suppose Alice and Bob pre-share Bell states The subscript A0 indicates that the first qubit is in Alice's hand, and B0 indicates that the second qubit is in Bob's hand. This shared Bell state process can be completed by a trusted third party. In each round of verification, Alice and Bob call the quantum device Generate a quantum state The subscript A1 indicates that the first qubit of this quantum state is in Alice's hand, and B1 indicates that the second qubit is in Bob's hand. In this way, Alice now has two qubits A0A1, and Bob now has two qubits B0B1, and they can perform local measurements on these two qubits respectively.

[0071] Figure 3 A schematic diagram of introducing entanglement-assisted quantum device performance verification according to an embodiment of the present disclosure is shown. The advantage of entanglement assistance is that the local measurement performed by Alice and Bob can itself be an entangled measurement, that is, entangled measurements can be performed separately on the two quantum bits A0A1&B0B1 because these two quantum bits are on the same platform. Therefore, even if Alice and Bob are far apart, entanglement can be used to establish the correlation of measurement results, thereby improving verification efficiency.

[0072] According to some embodiments, the preset number N e Determined based on the following formula:

[0073]

[0074] Wherein, ε is the preset error tolerance of the quantum device, and δ is the preset confidence level of errors in verifying the performance of the quantum device. The local verification scheme according to the embodiment of the present disclosure has the same verification efficiency as the optimal global scheme, and only uses local measurements.

[0075] According to some embodiments, determining that the two-bit quantum state generated by the quantum device is a Bell state includes: in response to the first measurement result and the second measurement result obtained after performing the first operation a preset number of times being the same, determining that there is a probability of 1-δ that the two-bit quantum state generated by the quantum device is a Bell state.

[0076] In an exemplary embodiment according to the present disclosure, the unknown quantum device generating the two-bit quantum state can be locally verified by the following steps:

[0077] Step 1: Calculate the total number of testing rounds that need to be performed Initialize the iteration parameter k=0.

[0078] Step 2: Update the iteration parameter k=k+1 and make the following judgment:

[0079] If k < Ne , execute step 3 (i.e., perform local measurement and continue testing the unknown quantum device).

[0080] If k ≥ N e , jump to step 4 (i.e. the verification process is completed and the quantum device passes the test);

[0081] Step 3: Alice and Bob obtain a shared Bell state And call the quantum device Generate a two-qubit quantum state Alice performs Bell measurement on qubit A0A1 and records the measurement result a0a1 (binary representation); Bob performs Bell measurement on qubit B0B1 and records the measurement result b0b1 (binary representation). Both parties communicate the measurement results and analyze them according to the following strategy: If the measurement results a0a1 and b0b1 are the same, that is, a0a1=b0b1, jump to step 2 for the next round of testing; if the measurement results a0a1 and b0b1 are the same, that is, a0a1=b0b1, jump to step 2 for the next round of testing; 不 If the two cases are the same, the Bad Case is output directly.

[0082] Step 4: Output Good Case.

[0083] Therefore, if the steps executed in the above embodiment finally output a Bad Case, it can be believed that the quantum device does not produce a Bell state. If the final output is a Good Case, there is a probability of more than 1-δ that the quantum device produces a Bell state.

[0084] According to the scheme of the embodiments of the present disclosure, the performance of quantum devices can be efficiently evaluated, which helps users or buyers make better choices and purchase decisions, and then use these devices to realize more valuable applications; it has strong practicality and can be widely used in small and medium-scale quantum devices that integrate hundreds of physical quantum bits, and can efficiently verify whether an unknown quantum device accurately generates Bell states, and then use these devices to realize more valuable applications, accelerating the progress of the noisy intermediate-scale quantum (NISQ) era.

[0085] According to the embodiments of the present disclosure, Figure 4As shown, a quantum device performance verification apparatus 400 is also provided, comprising: an execution unit 410, configured to execute a first operation, wherein the first operation comprises the following steps: generating a two-bit quantum state shared by a first quantum system and a second quantum system through the quantum device; acquiring a Bell state shared by the first quantum system and the second quantum system; performing Bell measurement on the two-bit quantum state and the corresponding part of the Bell state belonging to the first quantum system on the first quantum system to obtain a first measurement result; and performing Bell measurement on the two-bit quantum state and the corresponding part of the Bell state belonging to the second quantum system on the second quantum system to obtain a second measurement result; a first determination unit 420, configured to repeatedly execute the first operation in response to determining that the first measurement result and the second measurement result are the same and the number of executions of the first operation does not exceed a preset number of times; and a second determination unit 430, configured to determine that the two-bit quantum state generated by the quantum device is a Bell state in response to the first measurement result and the second measurement result obtained after executing the first operation a preset number of times are the same.

[0086] Here, the operations of the above-mentioned units 410-430 of the quantum device performance verification apparatus 400 are similar to the operations of steps 210-230 described above, and will not be repeated here.

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

[0088] refer to Figure 5 , a block diagram of an electronic device 500 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.

[0089] like Figure 5As shown, the electronic device 500 includes a computing unit 501, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 502 or a computer program loaded from a storage unit 508 into a random access memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the electronic device 500 can also be stored. The computing unit 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.

[0090] Multiple components in the electronic device 500 are connected to the I / O interface 505, including: an input unit 506, an output unit 507, a storage unit 508, and a communication unit 509. The input unit 506 can be any type of device that can input information to the electronic device 500. The input unit 506 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 507 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 508 can include but is not limited to a disk, an optical disk. The communication unit 509 allows the electronic device 500 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.

[0091] The computing unit 501 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 501 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 501 performs the various methods and processes described above, such as method 200. For example, in some embodiments, the method 200 may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 508. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 500 via the ROM 502 and / or the communication unit 509. When the computer program is loaded into the RAM 503 and executed by the computing unit 501, one or more steps of the method 200 described above may be performed. Alternatively, in other embodiments, the computing unit 501 may be configured to perform the method 200 in any other appropriate manner (e.g., by means of firmware).

[0092] 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), complex 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.

[0093] 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.

[0094] 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.

[0095] 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).

[0096] The systems and techniques described herein can be implemented in a computing system that includes backend 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 frontend 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 backend components, middleware components, or frontend components. The components of the system can 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), the Internet, and a blockchain network.

[0097] 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.

[0098] 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.

[0099] 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 method for verifying quantum device performance, comprising: Perform a first operation, wherein the first operation includes the following steps: generating, by the quantum device, a two-bit quantum state shared by a first quantum system and a second quantum system; Acquire a Bell state shared by the first quantum system and the second quantum system; performing, on the first quantum system, a Bell measurement on the two-bit quantum state and corresponding parts of the Bell state belonging to the first quantum system to obtain a first measurement result; and performing Bell measurement on the two-bit quantum state and corresponding parts of the Bell state belonging to the second quantum system on the second quantum system to obtain a second measurement result; In response to determining that the first measurement result is the same as the second measurement result and the number of executions of the first operation does not exceed a preset number of times, repeatedly executing the first operation; and In response to the first measurement result and the second measurement result obtained after performing the first operation a preset number of times being the same, it is determined that the two-bit quantum state generated by the quantum device is a Bell state.

2. The method of claim 1, further comprising: In response to determining that the first measurement result and the second measurement result are different, it is determined that the two-bit quantum state generated by the quantum device is not a Bell state.

3. The method of claim 1, wherein: The preset number N e Determined based on the following formula: Among them, ε is the preset error tolerance of the quantum device, and δ is the preset confidence level of errors in verifying the performance of the quantum device.

4. The method of claim 3, wherein: Determining that the two-bit quantum state generated by the quantum device is a Bell state includes: in response to the first measurement result and the second measurement result obtained after performing the first operation a preset number of times being the same, determining that there is a probability of 1-δ that the two-bit quantum state generated by the quantum device is a Bell state.

5. A quantum device performance verification device, comprising: The execution unit is configured to execute a first operation, wherein the first operation includes the following steps: generating, by the quantum device, a two-bit quantum state shared by a first quantum system and a second quantum system; Acquire a Bell state shared by the first quantum system and the second quantum system; performing, on the first quantum system, a Bell measurement on the two-bit quantum state and corresponding parts of the Bell state belonging to the first quantum system to obtain a first measurement result; and performing Bell measurement on the two-bit quantum state and corresponding parts of the Bell state belonging to the second quantum system on the second quantum system to obtain a second measurement result; a first determining unit configured to, in response to determining that the first measurement result is the same as the second measurement result and the number of executions of the first operation does not exceed a preset number of times, repeatedly execute the first operation; and The second determining unit is configured to determine that the two-bit quantum state generated by the quantum device is a Bell state in response to the first measurement result and the second measurement result obtained after performing the first operation a preset number of times being the same.

6. The apparatus according to claim 5, further comprising a third determining unit configured to: In response to determining that the first measurement result and the second measurement result are different, it is determined that the two-bit quantum state generated by the quantum device is not a Bell state.

7. The device according to claim 5, wherein: The preset number N e Determined based on the following formula: Among them, ε is the preset error tolerance of the quantum device, and δ is the preset confidence level of errors in verifying the performance of the quantum device.

8. The device according to claim 7, wherein: The second determining unit includes a determining subunit configured to: In response to the first measurement result and the second measurement result obtained after performing the first operation a preset number of times being the same, it is determined that there is a probability of 1-δ that the two-bit quantum state generated by the quantum device is a Bell state.

9. An electronic device, comprising: 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 4.

10. A non-transitory computer-readable storage medium storing computer instructions, wherein: The computer instructions are used to cause the computer to execute the method according to any one of claims 1-4.

11. A computer program product comprising a computer program, wherein: When the computer program is executed by a processor, the method according to any one of claims 1 to 4 is implemented.

Images