A unilateral quantum computing method based on blind quantum computing

Abstract

The present invention relates to a unilateral quantum computing method based on blind quantum computing, in which a client (Alice) entrusts its quantum computing task to a server (Bob) without sufficient quantum capability. In this process, the server cannot know the private information of the client, and the client can verify the correctness of the entrusted calculation. The server first prepares enough single-particle quantum states according to the requirements of the client, and then the client and the server undergo three quantum interactions, and then the single-particle quantum states required by the client can be generated. Using the existing single-particle quantum states, a verifiable unilateral blind quantum computing method can be implemented. The present invention further reduces the quantum capability of the client on the basis of the blind computing method model based on the client executing a single quantum bit gate, thereby improving the feasibility in real life.

Description

Technical Field

[0001] The present invention relates to quantum computing and unilateral quantum computing, and in particular to a unilateral quantum computing method based on blind quantum computing. Background Art

[0002] As we all know, quantum computing has significant advantages over classical computing in solving certain problems. Therefore, quantum computing may become a necessity for many people in the future. However, classical computers cannot realize quantum computing, which will prompt some people to build quantum computers. In fact, when the first generation of quantum computers come out, there may be only a few people in the world who can use them. In other words, many people do not have the opportunity to use quantum computers directly. In order to realize the calculation through a quantum computer, someone will entrust his quantum calculation to the owner of the quantum computer. Unfortunately, some private information may be leaked in this process. To solve this problem, Childs proposed the idea of ​​blind quantum computing (BQC). Childs proposed the first BQC protocol in 2005. In this protocol, the client needs to prepare quantum states, store quantum states, and execute SWAP gates. Since then, many BQC protocols have been proposed one after another. For example, Broadbent et al. proposed the universal blind quantum computing (UBQC) protocol in order to limit the quantum capabilities of the client. In this protocol, the client only needs to prepare a single quantum state. Based on the fact that it is easier to measure a single-qubit state than to prepare a single-qubit state in an experimental setting, Morimae and Fujii proposed a new BQC protocol in 2013. The client needs to measure a single quantum state instead of preparing a single quantum state. Li et al. proposed a new BQC protocol in 2021. In this protocol, the client only needs to execute a few specific single-qubit gates. Specifically, the client needs to execute , Door or , Door.

[0003] The existing unilateral quantum computing based on blind quantum computing still requires the client to have certain quantum capabilities. In the model that allows the client to execute single-qubit gates, the client's ability is to execute Door and This is equivalent to the client being able to execute any single-qubit gate. Obviously, the client's quantum ability is relatively strong. Therefore, in this model, further limiting the client's quantum ability is a problem worth exploring. Summary of the invention

[0004] In view of the above problems, the purpose of the present invention is to provide a unilateral quantum computing that further limits the client's quantum capabilities while allowing the client to execute single-qubit gates, thereby reducing the capability requirements for the client.

[0005] To achieve the above purpose, the present invention adopts the following technical solution. According to the expression habits in this field, the solution mainly includes client Alice and server Bob. The specific implementation steps are as follows:

[0006] Step 1: Alice asks Bob to prepare In status The single particle bit of These particles will be divided into 7 groups. Included particles; collection Include particles; collection , Each contains Particles.

[0007] Note: Alice determines which set each particle belongs to, and because of this, Bob cannot know the actual state of each particle.

[0008] Step 2: Bob transmits one particle to Alice at a time. Alice performs the following operations on the received particles: (1) If the particle comes from the set , then Alice performs the corresponding operation to make the state of the particle become or (2)If the particle comes from the collection , then Alice performs the corresponding operation to make the state of the particle become (3) If the particle comes from another set, Alice does not perform any operation. After Alice performs the corresponding operation on the particle, she returns the particle to Bob.

[0009] Note: In this step, the quantum states produced by Alice's execution of the single-qubit gate are non-orthogonal, and for this reason, Bob cannot obtain the actual state of each particle through measurement.

[0010] Step 3: Alice tells Bob which particles belong to , then Bob uses the basis or base To measure these particles. By comparing the results, we can detect whether there is an external attacker. If there is an external attacker, the protocol will terminate, otherwise it will continue.

[0011] Note: In this step, the main purpose is to detect whether there is any external attacker interfering in the process of transmitting particles.

[0012] Step 4: Bob executes once for all particles Door.

[0013] Step 5: Bob transmits particles to Alice one by one again. Alice performs the following operations on the received particles: (1) If the particle comes from the set , then Alice performs the corresponding operation to make the state of the particle become , then Alice performs the corresponding operation to make the state of the particle become or (3)If the particle comes from the collection , then Alice performs the corresponding operation to make the state of the particle become (4) If the particle comes from another set, Alice does not perform any operation. After Alice performs the corresponding operation on the particle, she returns the particle to Bob.

[0014] Step 6: Alice tells Bob which particles belong to , then Bob uses the basis or base To measure these particles. By comparing the results, we can detect whether there is an external attacker. If there is, the protocol will terminate, otherwise it will continue.

[0015] Step 7: Bob executes once for all particles Door.

[0016] Step 8: Bob transmits particles to Alice one by one again. Alice performs the following operations on the received particles: (1) If the particle comes from the set or , then Alice does not perform any operation. (2) If the particle comes from the set , then Alice performs the corresponding operation to make the state of the particle become or (3)If the particle comes from the collection , then Alice performs the corresponding operation to make the state of the particle become or (4)If the particle comes from the collection , then Alice performs the corresponding operation to make the state of the particle become After Alice performs the corresponding operation on the particle, she returns the particle to Bob.

[0017] Step 9: Alice tells Bob which particles belong to , then Bob uses the basis or base To measure these particles. By comparing the results, we can detect whether there is an external attacker. If there is an external attacker, the protocol will terminate, otherwise it will continue.

[0018] Note: After this step is completed, all resource states required to execute a verifiable universal blind quantum computing protocol are ready.

[0019] Step 10: Alice and Bob use the remaining particles to perform a verifiable universal blind quantum computation.

[0020] Beneficial effects of the present invention:

[0021] 1. In terms of the client's quantum capability, Alice only needs to execute and Gate,In addition, Alice does not need to have any quantum capabilities, and the lower client capability requirements make this method more practical;

[0022] 2. This method limits the number of client participants to two, one is the client Alice and the other is the server Bob. Fewer participants can reduce the risk of internal leakage. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] Figure 1 It is the main flow chart of the present invention.

Claims

1. A unilateral quantum computing method based on blind quantum computing, characterized in that: The following steps are involved: S1: Alice asks Bob to prepare M+T+D+3S single-particle bits in state |0>, where M=M1+M2+M3, T=T1+T2+T3; these particles will be divided into 7 sets, sets P1, P2, P3 contain M1+T1, M2+T2, M3+T3 particles respectively; set P4 contains D particles; sets P5, P6, P7 each contain S particles; Alice is the client, and Bob is the server; S2: Bob transmits one particle to Alice at a time. Alice performs the following operations on the received particle: (1) If the particle comes from set P1, Alice executes the corresponding single-qubit gate to make the particle's state become |+> or |->; (2) If the particle comes from set P5, Alice executes the corresponding single-qubit gate to make the particle's state become one of {|0>, |1>, |+>, |->}; (3) If the particle comes from other sets, Alice does not perform any operation; After executing the corresponding single-qubit gate on the particle, Alice returns the particle to Bob; S3: Alice tells Bob which particles belong to P5, and then Bob uses the basis {|0>,|1>} or the basis {|+>,|->} to measure these particles; by comparing the results, he detects whether there is an external attacker. If there is, the protocol terminates, otherwise it continues; S4: Bob performs a T-gate on the remaining particles; S5: Bob transmits particles to Alice one by one again. Alice performs the following operations on the received particles: (1) If the particle comes from set P1, Alice executes the corresponding single-qubit gate to make the state of the particle become (2) If the particle comes from set P2, Alice executes the corresponding single-qubit gate to make the particle's state become |+> or |->; (3) If the particle comes from set P6, Alice executes the corresponding single-qubit gate to make the particle's state become one of {|0>,|1>,|+>,|->}; (4) If the particle comes from other sets, Alice does not perform any operation; After executing the corresponding single-qubit gate on the particle, Alice returns the particle to Bob; S6: Alice tells Bob which particles belong to P6, and then Bob uses the basis {|0>,|1>} or the basis {|+>,|->} to measure these particles; by comparing the results, he detects whether there is an external attacker. If there is, the protocol terminates, otherwise it continues; S7: Bob performs an S-gate on the remaining particles; S8: Bob transmits particles to Alice one by one again. Alice performs the following operations on the received particles: (1) If the particle comes from set P1 or P2, Alice does not perform any operation; (2) If the particle comes from set P3, Alice executes the corresponding single-qubit gate to make the particle's state become |+> or |->; (3) If the particle comes from set P4, Alice executes the corresponding single-qubit gate to make the particle's state become |0> or |1>; (4) If the particle comes from set P7, Alice executes the corresponding single-qubit gate to make the particle's state become one of {|0>,|1>,|+>,|->}; After Alice executes the corresponding single-qubit gate on the particle, she returns the particle to Bob; S9: Alice tells Bob which particles belong to P7, and then Bob uses the basis {|0>,|1>} or the basis {|+>,|->} to measure these particles; by comparing the results, he detects whether there is an external attacker. If there is, the protocol terminates, otherwise it continues; S10: Alice and Bob use the remaining particles to perform a verifiable universal blind quantum computation.

Images