Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOrder from chaos in quantum walks on cyclic graphs
74
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
It has been shown classically that combining two chaotic random walks can yield an ordered(periodic) walk. Our aim in this paper is to find a quantum analog for this rather counter-intuitive result. We study chaotic and periodic nature of cyclic quantum walks and focus on a unique situation wherein a periodic quantum walk on a 3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph. We extend our results to even-numbered cyclic graphs, specifically a 4-cycle graph too. Our results will be relevant in quantum cryptography and quantum chaos control.
rate research
Read More
In this theoretical study, we analyze quantum walks on complex networks, which model network-based processes ranging from quantum computing to biology and even sociology. Specifically, we analytically relate the average long time probability distribution for the location of a unitary quantum walker to that of a corresponding classical walker. The distribution of the classical walker is proportional to the distribution of degrees, which measures the connectivity of the network nodes and underlies many methods for analyzing classical networks including website ranking. The quantum distribution becomes exactly equal to the classical distribution when the walk has zero energy and at higher energies the difference, the so-called quantumness, is bounded by the energy of the initial state. We give an example for which the quantumness equals a Renyi entropy of the normalized weighted degrees, guiding us to regimes for which the classical degree-dependent result is recovered and others for which quantum effects dominate.
A continuous-time quantum walk is investigated on complex networks with the characteristic property of community structure, which is shared by most real-world networks. Motivated by the prospect of viable quantum networks, I focus on the effects of network instabilities in the form of broken links, and examine the response of the quantum walk to such failures. It is shown that the reconfiguration of the quantum walk is determined by the community structure of the network. In this context, quantum walks based on the adjacency and Laplacian matrices of the network are compared, and their responses to link failures is analyzed.
The non-integrability of quantum systems, often associated with chaotic behavior, is a concept typically applied to cases with a high-dimensional Hilbert space Among different indicators signaling this behavior, the study of the long-time oscillations of the out-of-time-ordered correlator (OTOC) appears as a versatile tool, that can be adapted to the case of systems with a small number of degrees of freedom. Using such an approach, we consider the oscillations observed after the scrambling time in the measurement of OTOCs of local operators for an Ising spin chain on a nuclear magnetic resonance quantum simulator [J. Li,et al, Phys. Rev. X 7, 031011 (2017)]. We show that the systematic of the OTOC oscillations describes qualitatively well, in a chain with only 4 spins, the integrability-to-chaos transition inherited from the infinite chain.
The symmetries associated with discrete-time quantum walks (DTQWs) and the flexibilities in controlling their dynamical parameters allow to create a large number of topological phases. An interface in position space, which separates two regions with different topological numbers, can, for example, be effectively modelled using different coin parameters for the walk on either side of the interface. Depending on the neighbouring numbers, this can lead to localized states in one-dimensional configurations and here we carry out a detailed study into the strength of such localized states. We show that it can be related to the amount of entanglement created by the walks, with minima appearing for strong localizations. This feature also persists in the presence of small amounts of $sigma_x$ (bit flip) noise.
We address continuous-time quantum walks on graphs in the presence of time- and space-dependent noise. Noise is modeled as generalized dynamical percolation, i.e. classical time-dependent fluctuations affecting the tunneling amplitudes of the walker. In order to illustrate the general features of the model, we review recent results on two paradigmatic examples: the dynamics of quantum walks on the line and the effects of noise on the performances of quantum spatial search on the complete and the star graph. We also discuss future perspectives, including extension to many-particle quantum walk, to noise model for on-site energies and to the analysis of different noise spectra. Finally, we address the use of quantum walks as a quantum probe to characterize defects and perturbations occurring in complex, classical and quantum, networks.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
