A quantum privacy identity authentication method and system based on dichromatic graph state entanglement witness and a storage medium

Abstract

The application discloses a quantum privacy identity authentication method and system based on a two-color graph state entanglement witness and a storage medium, in the method, a secret two-color graph is shared by using QKD for one time when a user registers, and in a subsequent login process, whether the user is a registered user is determined by using entanglement witness measurement on the two-color graph state, since the entanglement witness measurement on the two-color graph state has high efficiency, resource consumption in the quantum identity authentication process is saved, and therefore the method is more suitable for a platform with large daily login traffic.

Description

Technical Field

[0001] This invention relates to a quantum privacy authentication method based on two-color graph entanglement witness, belonging to the field of quantum secure communication technology. Technical Background

[0002] With the rapid development of modern network technology, privacy data breaches are becoming increasingly frequent. To combat this trend, network security technology has become a crucial research area. Privacy-preserving authentication is a technique that studies how to protect the cryptographic information used for authentication by both parties during the authentication process. With the rapid development of quantum computing technology, traditional privacy-preserving authentication techniques based on classical cryptography may soon be compromised, necessitating the research of more secure quantum privacy-preserving authentication. Among these, quantum authentication technology based on quantum key distribution (QKD) has been widely researched and applied. This scheme utilizes quantum entanglement and quantum key distribution technology to achieve unconditional security, but it requires a large amount of redundant quantum resources for key generation, and each authentication process requires the exchange of quantum states with the same complexity as the key length. This is unsuitable for large platforms with a large number of user registrations and logins daily. Therefore, while ensuring quantum security, it is necessary to research the application of technologies other than QKD in quantum authentication to improve resource utilization and platform operating efficiency.

[0003] Purpose of the invention

[0004] The technical problem to be solved by this invention is that in privacy authentication, when a user requests to log in to the server, the server needs to verify the user's identity. Therefore, an efficient method is needed to handle the large number of user logins. Traditional quantum authentication protocols require a large number of redundant qubits, resulting in high resource consumption. At the same time, the efficiency of quantum authentication also needs to be further improved.

[0005] To address the aforementioned technical problems, this invention provides a quantum privacy authentication method based on dichromatic graph entanglement witnessing, comprising the following steps:

[0006] Step 1: When a user registers, the server generates a dichromatic undirected graph G with n vertices. The graph G is then split into two subsets: S1 and S2. No edges connect the vertices within each subset. The adjacency matrix of the dichromatic undirected graph G is A = {a...} ij} n×n ;

[0007] Step 2: The server, based on the adjacency matrix A = {a ij} n×n Generate a key K = {k1, k2, ..., k} N}, where N is the length of the key. The key K is a non-trivial element of the adjacency matrix A. The element a in the i-th row and j-th column of adjacency matrix A is... ij Mapped to the x-th bit k in key K x ,in

[0008] Step 3: The server and user use quantum key distribution to pre-share the identity key K generated in step 2. Then, user decodes the pre-shared identity key K into the corresponding adjacency matrix A, obtaining the dichromatic undirected graph G that user will use for login verification in the future, and stores the adjacency matrix A.

[0009] Step 4: When User logs in, prepare two identical graph states |G>, and send both graph state particles to Server;

[0010] Step 5: The server retrieves the corresponding dichromatic undirected graph G used for verification by the user, and then measures the entanglement witness operator W on the graph state |G> as follows: Where g k It is the k-th stable component of the graph. N k Given the set of adjacent vertices of vertex k, we obtain the measurement value of the entanglement witness operator W. X k It is the Pauli X operator for measuring vertex k; The Pauli Z operator is used to measure each point l in the set of adjacent points of vertex k;

[0011] Step Six: If the measured value If the graph is successfully prepared, it means the user's identity has been successfully authenticated; otherwise, it means the graph was not successfully prepared and the user's identity authentication failed.

[0012] In the aforementioned quantum privacy authentication method based on entanglement witnessing of dichromatic graph states, in step one, when n=6, the adjacency matrix of the dichromatic undirected graph is:

[0013]

[0014] The dichromatic undirected graph is split into two subsets: S1 = {1, 3, 5} and S2 = {2, 4, 6}, where there are no edges between the vertices inside S1 and S2.

[0015] In the aforementioned quantum privacy authentication method based on two-color graph entanglement witnessing, in step three, when the key K = 101001010001101, the adjacency matrix A is calculated by sequentially piling all bits of the key K into the upper triangular part of an n×n matrix.

[0016]

[0017] Then restore the corresponding dichromatic image.

[0018] In the aforementioned quantum privacy authentication method based on entangled witnessing of two-color graph states, the steps for preparing two identical graph states in step four are as follows:

[0019] Let the two ground states of a qubit be the |0> state and the |1> state, respectively. First, prepare n qubits in a superposition state. The particles are then entangled using the edges between the vertices of the dichroic graph G. Where |0><0| and |1><1| are projection operators projected onto states |0> and |1> respectively, I is the identity operator, and Z is the Pauli Z-gate. It is a tensor product.

[0020] In the aforementioned quantum privacy authentication method based on two-color graph entanglement witnessing, the measurement method in step five is as follows:

[0021] 1) For the b-th graph state, let S b It is the b-th coloring set, and the stabilizer g is measured for each vertex k. k , obtain the measured value b = 1, 2, k ∈ S b ;

[0022] 2) For the b-th pattern, each measurement value obtained in step 1) Computation Operator The value M b , The measured value of the identity operator I is 1, which means that each Multiplying them together yields the product M. b b = 1, 2;

[0023] 3) The measured value of the entanglement witness operator W is

[0024] A quantum privacy authentication system based on dichromatic graph entanglement witnessing includes the following modules:

[0025] Dichromatic Undirected Graph Generation Module: When a user registers, the server generates a dichromatic undirected graph G with n vertices. The graph G is then split into two subsets: S1 and S2. No edges connect vertices within each subset. The adjacency matrix of the dichromatic undirected graph G is A = {a...} ij} n×n ;

[0026] Key generation module: The server generates the key based on the adjacency matrix A = {a}. ij} n×n Generate a key K = {k1, k2, ..., k} N}, where N is the length of the key. The key K is a non-trivial element of the adjacency matrix A. The element a in the i-th row and j-th column of adjacency matrix A is... ij Mapped to the x-th bit k in key K x ,in

[0027] Pre-shared module: Server and User use quantum key distribution to pre-share the identity key K generated in step two. Then User decodes the pre-shared identity key K into the corresponding adjacency matrix A, obtains the dichromatic undirected graph G that User will use for login verification, and stores the adjacency matrix A.

[0028] Graph state preparation module: When a user logs in, two identical graph states |G> are prepared, and the two graph state particles are sent to the server together.

[0029] Entanglement Witness Operator Calculation Module: The server retrieves the corresponding dichromatic undirected graph G used for verification by the user User, and then measures the entanglement of the graph state |G> as follows. Witness Operator W: Where g k It is the k-th stable component of the graph. N k Given the set of adjacent vertices of vertex k, we obtain the measurement value of the entanglement witness operator W. X k It is the Pauli X operator for measuring vertex k; The Pauli Z operator is used to measure each point l in the set of adjacent points of vertex k;

[0030] Pattern preparation and judgment module: If the measured value If the graph is successfully prepared, it means the user's identity has been successfully authenticated; otherwise, it means the graph was not successfully prepared and the user's identity authentication failed.

[0031] In the aforementioned quantum privacy authentication system based on dichromatic graph entanglement witnessing, the steps for preparing two identical graph states in the graph state preparation module are as follows:

[0032] Let the two ground states of a qubit be the |0> state and the |1> state, respectively. First, prepare n qubits in a superposition state. The particles are then entangled, and entanglement gates are applied between the corresponding particles based on the edges between the vertices of the dichromatic graph G. Where |0><0| and |1><1| are projection operators projected onto states |0> and |1> respectively, I is the identity operator, and Z is the Pauli Z-gate. It is a tensor product.

[0033] In the aforementioned quantum privacy authentication system based on entanglement witnessing in a two-color graph, when n=6, the adjacency matrix of the two-color undirected graph is:

[0034]

[0035] The dichromatic undirected graph is split into two subsets: S1 = {1, 3, 5} and S2 = {2, 4, 6}, where there are no edges between the vertices inside S1 and S2.

[0036] In the aforementioned quantum privacy authentication system based on entangled witnessing of two-color graph states, the measurement method in the entangled witnessing operator computation module is as follows:

[0037] 1) For the b-th graph state, let S b It is the b-th coloring set, and the stabilizer g is measured for each vertex k. k , obtain the measured value b = 1, 2, k ∈ S b ;

[0038] 2) For the b-th pattern, each measurement value obtained in step 1) Computation Operator The value M b , The measured value of the identity operator I is 1, which means that each Multiplying them together yields the product M. b b = 1, 2;

[0039] 3) The measured value of the entanglement witness operator W is

[0040] A computer-readable storage medium storing a computer program thereon, characterized in that, when the computer program is executed by a processor, it implements the quantum privacy authentication method based on the witnessing of dichromatic graph states as described above.

[0041] The beneficial effects achieved by this invention are as follows: The quantum privacy authentication method based on entangled witnessing of dichromatic graph states proposed in this invention uses a unique QKD to share a secret dichromatic graph during user registration. In subsequent login processes, the entangled witnessing measurement of the dichromatic graph states is used to determine whether the user is a registered user. Since the entangled witnessing measurement of dichromatic graph states is highly efficient, it saves the resource consumption in the quantum authentication process, thus making it more suitable for platforms with high daily login traffic.

[0042] Furthermore, compared to other quantum identity authentication protocols, the method of this invention requires only an N-bit key. The method involves transmitting 1000 qubits and performing measurements in only O(n) steps. Therefore, it has high execution efficiency, can effectively verify the identities of both parties, and significantly improves the privacy protection capabilities during the identity authentication process. Attached Figure Description

[0043] Figure 1 This is a flowchart of the quantum privacy authentication method based on dichromatic graph entanglement witness in Embodiment 1 of the present invention;

[0044] Figure 2 This is a schematic diagram of a dichromatic image;

[0045] Figure 3 This is a schematic diagram of the quantum circuit for the preparation of a dichromatic pattern. Detailed Implementation

[0046] The technical solution of the present invention will be further described below with reference to the accompanying drawings and specific embodiments.

[0047] Example 1

[0048] like Figure 1 As shown, this example provides a quantum privacy authentication method based on dichromatic graph entanglement witnessing, including the following steps:

[0049] Step 1: When a user registers, the server generates a dichromatic undirected graph G with n vertices. The graph G is then split into two subsets: S1 and S2. No edges connect the vertices within each subset. The adjacency matrix of the dichromatic undirected graph G is A = {a...} ij} n×n ;

[0050] like Figure 2 As shown, when n=6, the adjacency matrix of the dichromatic undirected graph is:

[0051]

[0052] The dichromatic undirected graph is partitioned into two subsets: S1 = {1, 3, 5} and S2 = {2, 4, 6}. S1 contains no edges between its internal vertices and is denoted as black; S2 also contains no edges between its internal vertices and is denoted as white. Both S1 and S2 are referred to as... Figure 2 The coloring set of the dichromatic image in the image;

[0053] Step 2: The server, based on the adjacency matrix A = {a ij} n×n Generate a key K = {k1, k2, ..., k} N}, where N is the length of the key, The key K is a non-trivial element of the adjacency matrix A, which is the bit string formed by arranging the upper triangular part (excluding the main diagonal) of matrix A in left-to-right and top-to-bottom order. The key K is the element a in the i-th row and j-th column of the adjacency matrix A. ij Mapped to the x-th bit k in key K x ,in

[0054] Figure 2 In this context, the corresponding key is K = 101001010001101, and the key length is N = 15.

[0055] Step 3: The server and user use quantum key distribution (QKD) to pre-share the identity key K generated in step 2. Then, user decodes the pre-shared identity key K into the corresponding adjacency matrix A, obtaining the dichromatic undirected graph G that user will use for login verification in the future, and stores the adjacency matrix A.

[0056] For the key K = 101001010001101, by stacking all the bits of key K sequentially in the upper triangular part of an n×n matrix, the corresponding adjacency matrix A is calculated as follows:

[0057]

[0058] Then restore the corresponding dichromatic image, such as Figure 2 As shown.

[0059] Step 4: When user logs in, prepare two identical graph states |G>, and send both graph state particles to server. The steps for preparing two identical graph states are as follows:

[0060] Let the two ground states of a qubit be the |0> state and the |1> state, respectively. First, prepare n qubits in a superposition state. The particles are then entangled, and entanglement gates are applied between the corresponding particles based on the edges between the vertices of the dichromatic graph G. Where |0><0| and |1><1| are projection operators projected onto states |0> and |1> respectively, I is the identity operator, and Z is the Pauli Z-gate. It is a tensor product;

[0061] like Figure 2 As shown, the corresponding graph states are obtained by applying entanglement gates between the particles corresponding to edges (1,2), (1,4), (2,3), (2,5), (3,6), (4,5), and (5,6). The quantum circuit is as follows: Figure 3 As shown;

[0062] Step 5: The server retrieves the corresponding dichromatic undirected graph G used for verification by the user, and then measures the entanglement witness operator W on the graph state |G> as follows: Where g k It is the k-th stable component of the graph. N k It is the set of adjacent vertices of vertex k;

[0063] The measurement method is as follows:

[0064] 1) For the b-th graph state, let S b It is the b-th coloring set, and the stabilizer g is measured for each vertex k. k , obtain the measured value in, X k It is the Pauli X operator for measuring vertex k. The Pauli Z operator is measured for every point l in the set of adjacent points of vertex k; b = 1, 2, k ∈ S. b ;

[0065] 2) For the b-th pattern, each measurement value obtained in step 1) Computation Operator The value M b , The measured value of the identity operator I is 1, which means that each Multiplying them together yields the product M. b b = 1, 2;

[0066] 3) The measured value of the entanglement witness operator W is

[0067] Step Six: If the measured value If the graph is successfully prepared, it means the user's identity has been successfully authenticated; otherwise, it means the graph was not successfully prepared and the user's identity authentication failed.

[0068] A quantum privacy authentication system based on dichromatic graph entanglement witnessing includes the following modules:

[0069] Dichromatic Undirected Graph Generation Module: When a user registers, the server generates a dichromatic undirected graph G with n vertices. The graph G is then split into two subsets: S1 and S2. No edges connect vertices within each subset. The adjacency matrix of the dichromatic undirected graph G is A = {a...} ij} n×n ;

[0070] Key generation module: The server generates the key based on the adjacency matrix A = {a}. ij} n×n Generate a key K = {k1, k2, ..., k} N}, where N is the length of the key, The key K is a non-trivial element of the adjacency matrix A. The element a in the i-th row and j-th column of adjacency matrix A is... ij Mapped to the x-th bit k in key K x ,in

[0071] Pre-shared module: Server and User use quantum key distribution to pre-share the identity key K generated in step two. Then User decodes the pre-shared identity key K into the corresponding adjacency matrix A, obtains the dichromatic undirected graph G that User will use for login verification, and stores the adjacency matrix A.

[0072] Graph state preparation module: When a user logs in, two identical graph states |G> are prepared, and the two graph state particles are sent to the server together.

[0073] Entanglement Witness Operator Calculation Module: The server retrieves the corresponding dichromatic undirected graph G used for verification by the user User, and then measures the following entanglement witness operator W on the graph state |G>: Where gk is the k-th stable component of the graph state. N k Given the set of adjacent vertices of vertex k, we obtain the measurement value of the entanglement witness operator W.

[0074] Pattern preparation and judgment module: If the measured value If the graph is successfully prepared, it means the user's identity has been successfully authenticated; otherwise, it means the graph was not successfully prepared and the user's identity authentication failed.

[0075] In the aforementioned quantum privacy authentication system based on dichromatic graph entanglement witnessing, the steps for preparing two identical graph states in the graph state preparation module are as follows:

[0076] Let the two ground states of a qubit be the |0> state and the |1> state, respectively. First, prepare n qubits in a superposition state. The particles are then entangled, and entanglement gates are applied between the corresponding particles based on the edges between the vertices of the dichromatic graph G. Where |0><0| and |1><1| are projection operators projected onto states |0> and |1> respectively, I is the identity operator, and Z is the Pauli Z-gate. It is a tensor product.

[0077] In the aforementioned quantum privacy authentication system based on entangled witnessing of two-color graph states, the measurement method in the entangled witnessing operator computation module is as follows:

[0078] 1) For the b-th graph state, let S b It is the b-th coloring set, and the stabilizer g is measured for each vertex k. k , obtain the measured value in, X k It is the Pauli X operator for measuring vertex k. The Pauli Z operator is measured for every point l in the set of adjacent points of vertex k; b = 1, 2, k ∈ S. b ;

[0079] 2) For the b-th pattern, each measurement value obtained in step 1) Computation Operator The value M b , The measured value of the identity operator I is 1, which means that each Multiplying them together yields the product M. b b = 1, 2;

[0080] 3) The measured value of the entanglement witness operator W is

[0081] A computer-readable storage medium storing a computer program thereon, characterized in that, when the computer program is executed by a processor, it implements the quantum privacy authentication method based on the witnessing of dichromatic graph states as described above.

[0082] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0083] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0084] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0085] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0086] The above description is only a preferred embodiment of the present invention. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the technical principles of the present invention, and these improvements and modifications should also be considered within the scope of protection of the present invention.

Claims

1. A quantum privacy authentication method based on two-color graph entanglement witnessing, characterized in that, Includes the following steps: Step 1: When a user registers, the server generates a unique identifier containing... A bicolor undirected graph with vertices. The dichromatic undirected graph Split into vertex subset one and vertex subset two A bicolor undirected graph in which no edges connect the vertices within each subset of vertices. The adjacency matrix is ; Step 2: The server uses the adjacency matrix... Generate a key ,in It is the length of the key. key It is an adjacency matrix The non-trivial elements will be used to construct the adjacency matrix. The Middle OK Column elements Mapped to key The first in bits ,in ; Step 3: The server and user use quantum key distribution to pre-share the identity key generated in step 2. Then the user will share the pre-shared identity key. Decode into the corresponding adjacency matrix The two-color undirected graph used for login verification after obtaining the user User. And store the adjacency matrix ; Step 4: When user logs in, prepare two identical graphs. Two copies of the image particle are sent to the server. Step 5: The server retrieves the corresponding dichromatic undirected graph used for verification by the user, based on the user's identity. Then, for the graph Measurement of the following entanglement witness operator : ,in It is the first graph state A stable component, , It is the vertex The set of adjacent points yields the entangled witness operator. Measured values ; For vertices Measuring Pauli Operator; For vertices Each point in the set of adjacent points Measuring Pauli Operator; Step Six: If the measured value If the graph is correctly prepared, the user's identity has been successfully authenticated; otherwise, the graph is incorrectly prepared and the user's identity authentication has failed.

2. The quantum privacy authentication method based on dichromatic graph entanglement witnessing as described in claim 1, characterized in that, In step one, When the adjacency matrix of a dichromatic undirected graph is: The dichromatic undirected graph is split into a vertex subset one. Vertex Subset 2 , where the vertex subset one There are no edges between the internal points; the vertex subset is two. There are no edges between the internal points.

3. The quantum privacy authentication method based on dichromatic graph entanglement witnessing as described in claim 1, characterized in that, In step three, the key At that time, by using the key All bits are stacked in order in a The adjacency matrix is ​​calculated from the upper triangular part of the matrix. for: Then restore the corresponding dichromatic image.

4. The quantum privacy authentication method based on dichromatic graph entanglement witnessing as described in claim 1, characterized in that, In step four, the steps for preparing two identical patterns are as follows: Let the two ground states of a qubit be... state and State, first prepare A state in superposition The particles, and then according to the dichroism diagram The edges between vertices apply entanglement gates to the corresponding particles. ,in and These are projections to the state. and Projection operator on, It is an identity operator. It is Pauli Z gate, It is a tensor product.

5. The quantum privacy authentication method based on dichromatic graph entanglement witnessing as described in claim 4, characterized in that, In step five, the measurement method is as follows: 1) For the first A graph state, let It is the first A set of shaders, for each vertex Measuring the stabilizer , obtain the measured value , , ; 2) For the first Each graph state is obtained through step 1) and each measurement value is represented by a graph state. , computation operator value , Among them, the identity operator The measured value is 1, which means each Multiplying gives the product , ; 3) Entanglement Witness Operator The measured value is .

6. A quantum privacy authentication system based on two-color graph entanglement witnessing, characterized in that, Includes the following modules: Dichromatic Undirected Graph Generation Module: When a user registers, the server generates a graph containing... A bicolor undirected graph with vertices. The dichromatic undirected graph Split into vertex subset one and vertex subset two A bicolor undirected graph in which no edges connect the vertices within each subset of vertices. The adjacency matrix is ; Key generation module: Server generates keys based on the adjacency matrix. Generate a key ,in It is the length of the key. key It is an adjacency matrix The non-trivial elements will be used to construct the adjacency matrix. The Middle OK Column elements Mapped to key The first in bits ,in ; Pre-shared module: Server and User use quantum key distribution to distribute the identity key generated in step two of the pre-shared process. Then the user will share the pre-shared identity key. Decode into the corresponding adjacency matrix The two-color undirected graph used for login verification after obtaining the user User. And store the adjacency matrix ; Graph preparation module: When a user logs in, prepares two identical graphs. Two copies of the image particle are sent to the server. Entangled Witness Operator Calculation Module: The Server retrieves the corresponding bicolor undirected graph used for verification by the User based on the User's identity. Then, for the graph Measurement of the following entanglement witness operator : ,in It is the first graph state A stable component, , It is the vertex The set of adjacent points yields the entangled witness operator. Measured values ; For vertices Measuring Pauli Operator; For vertices Each point in the set of adjacent points Measuring Pauli Operator; Pattern preparation and judgment module: If the measured value If the graph is correctly prepared, the user's identity has been successfully authenticated; otherwise, the graph is incorrectly prepared and the user's identity authentication has failed.

7. A quantum privacy authentication system based on dichromatic graph entanglement witnessing as described in claim 6, characterized in that, In the dichromatic undirected graph generation module When the adjacency matrix of a dichromatic undirected graph is: The dichromatic undirected graph is split into a vertex subset one. Vertex Subset 2 , where the vertex subset one There are no edges between the internal points; the vertex subset is two. There are no edges between the internal points.

8. A quantum privacy authentication system based on dichromatic graph entanglement witnessing as described in claim 6, characterized in that, In the pattern preparation module, the steps for preparing two identical patterns are as follows: Let the two ground states of a qubit be... state and State, first prepare A state in superposition The particles, and then according to the dichroism diagram The edges between vertices apply entanglement gates to the corresponding particles. ,in and These are projections to the state. and Projection operator on, It is an identity operator. It is Pauli Z gate, It is a tensor product.

9. A quantum privacy authentication system based on dichromatic graph entanglement witnessing as described in claim 8, characterized in that, In the entanglement witness operator calculation module, the measurement method is as follows: 1) For the first A graph state, let It is the first A set of shaders, for each vertex Measuring the stabilizer , obtain the measured value ; , ; 2) For the first Each graph state is obtained through step 1) and each measurement value is represented by a graph state. , computation operator value , Among them, the identity operator The measured value is 1, which means each Multiplying gives the product , ; 3) Entanglement Witness Operator The measured value is .

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the quantum privacy authentication method based on dichromatic graph entanglement witness as described in any one of claims 1-5.

Images