Role-Based Network Embedding via Quantum Walk with Weighted Features Fusion

Role-based network embedding aims to embed role-similar nodes into a similar embedding space,which is widely used in graph mining tasks such as role classification and detection.Roles are sets of nodes in graph networks with similar structural patterns and functions.However,the rolesimilar nodes may be far away or even disconnected from each other.Meanwhile,the neighborhood node features and noise also affect the result of the role-based network embedding,which are also challenges of current network embedding work.In this paper,we propose a Role-based network Embedding via Quantum walk with weighted Features fusion(REQF),which simultaneously considers the influence of global and local role information,node features,and noise.Firstly,we capture the global role information of nodes via quantum walk based on its superposition property which emphasizes the local role information via biased quantum walk.Secondly,we utilize the quantum walkweighted characteristic function to extract and fuse features of nodes and their neighborhood by different distributions which contain role information implicitly.Finally,we leverage the Variational Auto-Encoder(VAE)to reduce the effect of noise.We conduct extensive experiments on seven real-world datasets,and the results show that REQF is more effective at capturing role information in the network,which outperforms the best baseline by up to 14.6% in role classification,and 23% in role detection on average.

Stationary Measures of Three-State Quantum Walks with Defect on the One-Dimension Lattice

In this paper, we focus on the space-inhomogeneous three-state on the one-dimension lattice, a one-phase model and a two-phase model include. By using the transfer matrices method by Endo et al., we calculate the stationary measure for initial state concrete eigenvalue. Finally we found the transfer matrices method is more effective for the three-state quantum walks than the method obtained by Kawai et al.

Quantum walk search algorithm for multi-objective searching with iteration auto-controlling on hypercube

Shenvi et al.have proposed a quantum algorithm based on quantum walking called Shenvi-Kempe-Whaley(SKW)algorithm,but this search algorithm can only search one target state and use a specific search target state vector.Therefore,when there are more than two target nodes in the search space,the algorithm has certain limitations.Even though a multiobjective SKW search algorithm was proposed later,when the number of target nodes is more than two,the SKW search algorithm cannot be mapped to the same quotient graph.In addition,the calculation of the optimal target state depends on the number of target states m.In previous studies,quantum computing and testing algorithms were used to solve this problem.But these solutions require more Oracle calls and cannot get a high accuracy rate.Therefore,to solve the above problems,we improve the multi-target quantum walk search algorithm,and construct a controllable quantum walk search algorithm under the condition of unknown number of target states.By dividing the Hilbert space into multiple subspaces,the accuracy of the search algorithm is improved from p_(c)=(1/2)-O(1/n)to p_(c)=1-O(1/n).And by adding detection gate phase,the algorithm can stop when the amplitude of the target state becomes the maximum for the first time,and the algorithm can always maintain the optimal number of iterations,so as to reduce the number of unnecessary iterations in the algorithm process and make the number of iterations reach t_(f)=(π/2)(?).

Efficient quantum private comparison protocol based on one direction discrete quantum walks on the circle

We propose an efficient quantum private comparison protocol firstly based on one direction quantum walks.With the help of one direction quantum walk,we develop a novel method that allows the semi-honest third party to set a flag to judge the comparing result,which improves the qubit efficiency and the maximum quantity of the participants’secret messages.Besides,our protocol can judge the size of the secret messages,not only equality.Furthermore,the quantum walks particle is disentangled in the initial state.It only requires a quantum walks operator to move,making our proposed protocol easy to implement and reducing the quantum resources.Through security analysis,we prove that our protocol can withstand well-known attacks and brute-force attacks.Analyses also reveal that our protocol is correct and practical.

High winding number of topological phase in non-unitary periodic quantum walk

Topological phases and their associated multiple edge states are studied by constructing a one-dimensional non-unitary multi-period quantum walk with parity-time symmetry.It is shown that large topological numbers can be obtained when choosing an appropriate time frame.The maximum value of the winding number can reach the number of periods in the one-step evolution operator.The validity of the bulk-edge correspondence is confirmed,while for an odd-period quantum walk and an even-period quantum walk,they have different configurations of the 0-energy edge state andπ-energy edge state.On the boundary,two kinds of edge states always coexist in equal amount for the odd-period quantum walk,however three cases including equal amount,unequal amount or even only one type may occur for the even-period quantum walk.

Quantum Hierarchical Agglomerative Clustering Based on One Dimension Discrete Quantum Walk with Single-Point Phase Defects

As an important branch of machine learning,clustering analysis is widely used in some fields,e.g.,image pattern recognition,social network analysis,information security,and so on.In this paper,we consider the designing of clustering algorithm in quantum scenario,and propose a quantum hierarchical agglomerative clustering algorithm,which is based on one dimension discrete quantum walk with single-point phase defects.In the proposed algorithm,two nonclassical characters of this kind of quantum walk,localization and ballistic effects,are exploited.At first,each data point is viewed as a particle and performed this kind of quantum walk with a parameter,which is determined by its neighbors.After that,the particles are measured in a calculation basis.In terms of the measurement result,every attribute value of the corresponding data point is modified appropriately.In this way,each data point interacts with its neighbors and moves toward a certain center point.At last,this process is repeated several times until similar data points cluster together and form distinct classes.Simulation experiments on the synthetic and real world data demonstrate the effectiveness of the presented algorithm.Compared with some classical algorithms,the proposed algorithm achieves better clustering results.Moreover,combining quantum cluster assignment method,the presented algorithm can speed up the calculating velocity.

Finding tree symmetries using continuous-time quantum walk

Quantum walk, the quantum counterpart of random walk, is an important model and widely studied to develop new quantum algorithms. This paper studies the relationship between the continuous-time quantum walk and the symmetry of a graph, especially that of a tree. Firstly, we prove in mathematics that the symmetry of a graph is highly related to quantum walk. Secondly, we propose an algorithm based on the continuous-time quantum walk to compute the symmetry of a tree. Our algorithm has better time complexity O（N3） than the current best algorithm. Finally, through testing three types of 10024 trees, we find that the symmetry of a tree can be found with an extremely high efficiency with the help of the continuous-time quantum walk.

The entanglement of deterministic aperiodic quantum walks

We study the entanglement between the internal(coin)and the external(position)degrees of freedom in the dynamic and the static deterministic aperiodic quantum walks(QWs).For the dynamic(static)aperiodic QWs,the coin depends on the time(position)and takes two coins C(α)and C(β)arranged in the two classes of generalized Fibonacci(GF)and the Thue–Morse(TM)sequences.We found that for the dynamic QWs,the entanglement of three kinds of the aperiodic QWs are close to the maximal value,which are all much larger than that of the homogeneous QWs.Further,the first class of GF(1st GF)QWs can achieve the maximum entangled state,which is similar to that of the dynamic disordered QWs.And the entanglement of 1st GF QWs is greater than that of the TM QWs,being followed closely by the entanglement of the second class of GF(2nd GF)QWs.For the static QWs,the entanglement of three kinds of the aperiodic QWs are also close to the maximal value and 1st GF QWs can achieve the maximum entangled state.The entanglement of the TM QWs is between1st GF QWs and 2nd GF QWs.However,the entanglement of the static disordered QWs is less than that of three kinds of the aperiodic QWs.This is different from those of the dynamic QWs.From these results,we can conclude that the dynamic and static 1st GF QWs can also be considered as maximal entanglement generators.

Localization and recurrence of a quantum walk in a periodic potential on a line

We present a numerical study of a model of quantum walk in a periodic potential on a line. We take the simple view that different potentials have different affects on the way in which the coin state of the walker is changed. For simplicity and definiteness, we assume that the walker＇s coin state is unaffected at sites without the potential, and rotated in an unbiased way according to the Hadamard matrix at sites with the potential. This is the simplest and most natural model of a quantum walk in a periodic potential with two coins. Six generic cases of such quantum walks are studied numerically. It is found that, of the six cases, four cases display significant localization effect where the walker is confined in the neighborhood of the origin for a sufficiently long time. Associated with such a localization effect is the recurrence of the probability of the walker returning to the neighborhood of the origin.

Localization of quantum walks on finite graphs

We analyze the localization of quantum walks on a one-dimensional finite graph using vector-distance. We first vectorize the probability distribution of a quantum walker in each node. Then we compute out the probability distribution vectors of quantum walks in infinite and finite graphs in the presence of static disorder respectively, and get the distance between these two vectors. We find that when the steps taken are small and the boundary condition is tight, the localization between the infinite and finite cases is greatly different. However, the difference is negligible when the steps taken are large or the boundary condition is loose. It means quantum walks on a one-dimensional finite graph may also suffer from localization in the presence of static disorder. Our approach and results can be generalized to analyze the localization of quantum walks in higher-dimensional cases.

Irreversibility of a quantum walk induced by controllable decoherence employing random unitary operations

Quantum walk is different from random walk in reversibility and interference. Observation of the reduced reversibility in a realistic quantum walk is of scientific interest in understanding the unique quantum behavior. We propose an idea to experimentally investigate the decoherence-induced irreversibility of quantum walks with trapped ions in phase space via the average fidelity decay. By introducing two controllable decoherence sources, i.e., the phase damping channel （i.e., dephasing） and the high temperature amplitude reservoir （i.e., dissipation）, in the intervals between the steps of quantum walk, we find that the high temperature amplitude reservoir shows more detrimental effects than the phase damping channel on quantum walks. Our study also shows that the average fidelity decay works better than the position variance for characterizing the transition from quantum walks to random walk. Experimental feasibility to monitor the irreversibility is justified using currently available techniques.

Disorder and decoherence in coined quantum walks

This article aims to provide a review on quantum walks. Starting form a basic idea of discrete-time quantum walks, we will review the impact of disorder and decoherence on the properties of quantum walks. The evolution of the standard quantum walks is deterministic and disorder introduces randomness to the whole system and change interference pattern leading to the localization effect. Whereas, decoherence plays the role of transmitting quantum walks to classical random walks.

Experimental realization of one-dimensional optical quantum walks

We analyze the process of a discrete-time quantum walk over 4 steps and 5 positions with linear optics elements. The quantum walk is characterized by a ballistic spread of wavepackets along 4 steps. By employing different initial coin states, we observe non-Gaussian distribution of the walkers＇ finial position, which characterizes a quadratic enhancement of the spread of photon wavepackets compared to a classical random walk. By introducing controllable decoherence, we observe the quantum-to-classical transmission in a quantum walk architecture.

Non-Markovian decoherent quantum walks

Quantum walks act in obviously different ways from their classical counterparts, but decoherence will lessen and close this gap between them. To understand this process, it is necessary to investigate the evolution of quantum walks under different decoherence situations. In this article, we study a non-Markovian decoherent quantum walk on a line. In a short time regime, the behavior of the walk deviates from both ideal quantum walks and classical random walks. The position variance as a measure of the quantum walk collapses and revives for a short time, and tends to have a linear relation with time. That is, the walker’s behavior shows a diffusive spread over a long time limit, which is caused by non-Markovian dephasing affecting the quantum correlations between the quantum walker and his coin. We also study both quantum discord and measurement-induced disturbance as measures of the quantum correlations, and observe both collapse and revival in the short time regime, and the tendency to be zero in the long time limit. Therefore, quantum walks with non-Markovian decoherence tend to have diffusive spreading behavior over long time limits, while in the short time regime they oscillate between ballistic and diffusive spreading behavior, and the quantum correlation collapses and revives due to the memory effect.

Disordered quantum walks in two-dimensional lattices

The properties of the two-dimensional quantum walk with point, line, and circle disorders in phase are reported.Localization is observed in the two-dimensional quantum walk with certain phase disorder and specific initial coin states.We give an explanation of the localization behavior via the localized stationary states of the unitary operator of the walker＋ coin system and the overlap between the initial state of the whole system and the localized stationary states.

Search algorithm on strongly regular graphs based on scattering quantum walks

Janmark, Meyer, and Wong showed that continuous-time quantum walk search on known families of strongly regular graphs（SRGs） with parameters（N, k, λ, μ） achieves full quantum speedup. The problem is reconsidered in terms of scattering quantum walk, a type of discrete-time quantum walks. Here, the search space is confined to a low-dimensional subspace corresponding to the collapsed graph of SRGs. To quantify the algorithm＇s performance, we leverage the fundamental pairing theorem, a general theory developed by Cottrell for quantum search of structural anomalies in star graphs.The search algorithm on the SRGs with k scales as N satisfies the theorem, and results can be immediately obtained, while search on the SRGs with k scales as√N does not satisfy the theorem, and matrix perturbation theory is used to provide an analysis. Both these cases can be solved in O（√N） time steps with a success probability close to 1. The analytical conclusions are verified by simulation results on two SRGs. These examples show that the formalism on star graphs can be applied more generally.

One-dimensional lazy quantum walks and occupancy rate

In this paper, we discuss the properties of lazy quantum walks. Our analysis shows that the lazy quantum walks have O（tn） order of the n-th moment of the corresponding probability distribution, which is the same as that for normal quantum walks. The lazy quantum walk with a discrete Fourier transform （DFT） coin operator has a similar probability distribution concentrated interval to that of the normal Hadamard quantum walk. Most importantly, we introduce the concepts of occupancy number and occupancy rate to measure the extent to which the walk has a （relatively） high probability at every position in its range. We conclude that the lazy quantum walks have a higher occupancy rate than other walks such as normal quantum walks, classical walks, and lazy classical walks.

A Highly Secured Image Encryption Scheme using Quantum Walk and Chaos

The use of multimedia data sharing has drastically increased in the past few decades due to the revolutionary improvements in communication technologies such as the 4th generation(4G)and 5th generation(5G)etc.Researchers have proposed many image encryption algorithms based on the classical random walk and chaos theory for sharing an image in a secure way.Instead of the classical random walk,this paper proposes the quantum walk to achieve high image security.Classical random walk exhibits randomness due to the stochastic transitions between states,on the other hand,the quantum walk is more random and achieve randomness due to the superposition,and the interference of the wave functions.The proposed image encryption scheme is evaluated using extensive security metrics such as correlation coefficient,entropy,histogram,time complexity,number of pixels change rate and unified average intensity etc.All experimental results validate the proposed scheme,and it is concluded that the proposed scheme is highly secured,lightweight and computationally efficient.In the proposed scheme,the values of the correlation coefficient,entropy,mean square error(MSE),number of pixels change rate(NPCR),unified average change intensity(UACI)and contrast are 0.0069,7.9970,40.39,99.60%,33.47 and 10.4542 respectively.

Probe of topological invariants using quantum walks of a trapped ion in coherent state space

We present a protocol to realize topological discrete-time quantum walks,which comprise a sequence of spindependent flipping displacement operations and quantum coin tossing operations,with a single trapped ion.It is demonstrated that the information of bulk topological invariants can be extracted by measuring the average projective phonon number when the walk takes place in coherent state space.Interestingly,the specific chiral symmetry owned by our discrete-time quantum walks simplifies the measuring process.Furthermore,we prove the robustness of such bulk topological invariants by introducing dynamical disorder and decoherence.Our work provides a simple method to measure bulk topological features in discrete-time quantum walks,which can be experimentally realized in the system of single trapped ions.

Disorder in parity-time symmetric quantum walks

We experimentally investigate the impact of static disorder and dynamic disorder on the non-unitary dynamics of parity-time(PT)-symmetric quantum walks.Via temporally alternating photon losses in an interferometric network,we realize the passive PT-symmetric quantum dynamics for single photons.Controllable coin operations allow us to simulate different environmental influences,which result in three different behaviors of quantum walkers:a standard ballistic spread,a diffusive behavior,and a localization,respectively,in a PT-symmetric quantum walk architecture.