Mobility edges and localization characteristics in one-dimensional quasiperiodic quantum walk

We construct a one-dimensional quasiperiodic quantum walk to investigate the localization–delocalization transition.The inverse participation ratio and Lyapunov exponent are employed as two indexes to determine the mobility edge, a critical energy to distinguish the energy regions of extended and localized states. The analytical solution of mobility edge is obtained by the Lyapunov exponents in global theory, and the consistency of the two indexes is confirmed. We further study the dynamic characteristics of the quantum walk and show that the probabilities are localized to some specific lattice sites with time evolution. This phenomenon is explained by the effective potential of the Hamiltonian which corresponds to the phase in the coin operator of the quantum walk.

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.

Large Signal Modulation Characteristics in the Transition Regime for Two-State Lasing Quantum Dot Lasers

Large-signal modulation capability, as an important performance indicator, is directly related to the high-speed optical communication technology involved. We experimentally and theoretically investigate the large-signal modulation characteristics of the simultaneous ground-state （GS） and the excited-state （ES） lasing in InAs/OaAs quantum dot laser diodes. The large-signal modulation capability of total light intensity in the transition regime from OS lasing to two-state lasing is unchanged as the bias-current increases. However, GS and ES large-signal eye diagrams show obvious variations during the transition. Relaxation oscillations and large-signal eye diagrams for OS, ES, and total light intensities are numerically simulated and analyzed in detail by using a rate-equation model. The -ndings show that a complementary relationship between the light intensities for OS and ES lasing exists in both the transition regime and the two-state lasing regime, leading to a much smaller overshooting power and a shorter settling time for the total light intensity. Therefore, the eye diagrams of GS or ES lasing are diffuse whereas those of total light intensity are constant as the bias-current increases in the transition regime.

Optimized quantum random-walk search algorithm for multi-solution search

This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q. For a given q, we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value.

Decoherence in optimized quantum random-walk search algorithm

This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the optimized quantum random-walk search algorithm with decoherence is depicted through defining the shift operator which includes the possibility of broken links. For a given database size, we obtain the maximum success rate of the algorithm and the required number of iterations through numerical simulations and analysis when the algorithm is in the presence of decoherence. Then the computational complexity of the algorithm with decoherence is obtained. The results show that the ultimate effect of broken-link-type decoherence on the optimized quantum random-walk search algorithm is negative.

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 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.

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.

Alternative Coins for Quantum Random Walk Search Optimized for a Hypercube

The present paper is focused on non-uniform quantum coins for the quantum random walk search algorithm. This is an alternative to the modification of the shift operator, which divides the search space into two parts. This method changes the quantum coins, while the shift operator remains unchanged and sustains the hypercube topology. The results discussed in this paper are obtained by both theoretical calculations and numerical simulations.

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.

The effect of phase fluctuation and beam splitter fluctuation on two-photon quantum random walk

In the optical quantum random walk system,phase nuctuation and Deam splitter uuctuation are two unavoldable decoherence factors.These two factors degrade the performance of quantum random walk by destroying coherence,and even degrade it into a classical one.We propose a scheme for the simulation of quantum random walk using phase shifters,tunable beam splitters,and photodetectors.This proposed scheme enables us to analyze the effect of phase fluctuation and beam splitter fluctuation on two-photon quantum random walk.Furthermore,it is helpful to guide the control of phase fluctuation and beam snlitter fluctuation in the exneriment.

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.

Effects of systematic phase errors on optimized quantum random-walk search algorithm

This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this algorithm, a model of the algorithm with phase errors is established, and the relationship between the success rate of the algorithm, the database size, the number of iterations, and the phase error is determined. For a given database size, we obtain both the maximum success rate of the algorithm and the required number of iterations when phase errors are present in the algorithm. Analyses and numerical simulations show that the optimized quantum random-walk search algorithm is more robust against phase errors than Grover＇s algorithm.

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.

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.

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.

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.