Anonymous communication scheme based on quantum walk on Cayley graph

Abstract

Information security is the cornerstone and lifeblood of national security in the information society, and anonymous quantum communication is one of the important ways to protect information security. Using quantum walk randomness to effectively solve sensitive problems such as leakage of identity information. In this paper, an anonymous communication scheme based on quantum walks on the Cayley graph is proposed. First, both parties in the communication hide their identity information, and the sender Alice anonymously selects the receiver Bob through logic or operation. Secondly, the trusted third party and the communicating parties use the BB84 protocol to generate and distribute the security key. Alice encrypts the information sequence according to the security key to obtain the blind information; Bob uses the joint Bell state measurement and security key to sign and the trusted third party verifies the signature information. Third, the trusted third party calculates the position probability distribution function of Bob’s quantum walk via the Fourier transform, converts the position information corresponding to the maximum probability into a confirmation frame and sends it to Alice; Alice uses the quantum compression algorithm by decreasing dimensions to reduce the number of transmitted information bits(the length of the information bit can be reduced by up to 37.5%) and uses the security key to complete the information encryption and then transmit the information to the location indicated by the confirmation frame. Bob uses quantum walks to search the location node to obtain the transmission information and complete the anonymous quantum communication. Finally, the security analysis of the scheme is carried out, and the numerical simulation results of the Cayley graph of 200 nodes are given. At the 10-step walk, the maximal probability of the 6th node is 45.31%. According to the simulation results, the probability that Bob is eavesdropped on the specific location at his 10-step walk during the communication of this scheme is approximately 6 × 10<sup>–7</sup>%, so the receiver can avoid the identity information from the eavesdropping with a high probability, and the quantum network anonymity protocol is not broken.

Based on Quantum Topological Stabilizer Color Code Morphism Neural Network Decoder

“…Since the vertices of the [6]-color code are trivalent and each face has X and Z stabilizers, the eigenvalue of the three adjacent stabilizers of the wrong qubit will be − 1. is information can then be used for error correction. It is shown in Figure 4.…”

“…(1 ) color code C projection to surface code S (2 ) While defects e exist do (3 ) from S to get the observation P of e (4 ) greedy strategy selects the action a corresponding to the error e (5 ) perform action a on e (6 ) calculate the value r of performing action a on e (7 ) obtain the observation results O′ after the action a is executed (8 ) save the tuple (P, a, r, O′) (9 ) update deep neural Q network (10 ) end while (11 ) For systems with different Hamming distances, the point where the logical error rate is equal to the physical error rate is called level-1 pseudo-threshold, which is obtained by fitting the pseudo-threshold to the following formula [30]:…”

“…Color code is a kind of quantum error correction topological coding. As an important part of quantum computing, error correction provides the guarantee of quantum information transmission for the new theory in the field of quantum information [1][2][3] and quantum computing [4][5][6][7]. To ensure that the information of the quantum state will not change after transmission or can still be corrected after error, we must find a fast and accurate method of error correction qubits to protect the quantum information from irresistible external interference and ensure that the information transmission can be completed within the decoherence time.…”

Determining quantum topological semion code decoder performance and error correction effectiveness with reinforcement learning

“…Quantum computing and quantum information have made tremendous progress over the years, and technologies based on quantum communication and quantum error correction (QEC) are developing rapidly [1][2][3][4]. The robustness of quantum memory to outer noise and noise removal is an extremely significant resource for quantum fault tolerance [5][6][7][8][9].…”

Effects of initial states on the quantum correlations in the generalized Grover search algorithm*

“…[9][10][11] Subsequently, correlations as an important source are important to quantum communication and so on. [12][13][14][15] And quantum coherence related to correlations is also regarded as a fundamental resource in quantum information processing. [16][17][18][19] Recently, there are many works offering a set of elaborates that quantum entanglement is the key to reducing the time complexity from O(N) to O( √ N) in the Grover search algorithm.…”