Searcharxiv⌕ Search

arXiv subjects

Tamás Kiss

Publications and source records attributed to Tamás Kiss.

26 records · Page 2Linked to original sources

Exponential Sensitivity and its Cost in Quantum Physics

State selective protocols, like entanglement purification, lead to an essentially non-linear quantum evolution, unusual in naturally occurring quantum processes. Sensitivity to initial states in quantum systems, stemming from such non-linear dynamics, is a promising perspective for applications. Here we demonstrate that chaotic behaviour is a rather generic feature in state selective protocols: exponential sensitivity can exist for all initial states in an experimentally realisable optical scheme. Moreover, any complex rational polynomial map, including the example of the Mandelbrot set, can be directly realised. In state selective protocols, one needs an ensemble of initial states, the size of which decreases with each iteration. We prove that exponential sensitivity to initial states in any quantum system have to be related to downsizing the initial ensemble also exponentially. Our results show that magnifying initial differences of quantum states (a Schrödinger microscope) is possible, however, there is a strict bound on the number of copies needed.

quant-ph↗

Strongly trapped two-dimensional quantum walks

Discrete time quantum walks (DTQWs) are nontrivial generalizations of random walks with a broad scope of applications. In particular, they can be used as computational primitives, and they are suitable tools for simulating other quantum systems. DTQWs usually spread ballistically due to their quantumness. In some cases, however, they can remain localized at their initial state (trapping). The trapping and other fundamental properties of DTQWs are determined by the choice of the coin operator. We introduce and analyze an up to now uncharted type of walks driven by a coin class leading to strong trapping, complementing the known list of walks. This class of walks exhibit a number of exciting properties with the possible applications ranging from light pulse trapping in a medium to topological effects and quantum search.

quant-ph↗

Time evolution of continuous-time quantum walks on dynamical percolation graphs

We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments edges of the graph appear or disappear with a given probability. We focus on the case when the time interval between subsequent changes of the graph tends to zero. We derive explicit formulae for the general evolution in this limit. We find that the percolation in this limit causes an effective time rescaling. Independently of the graph and the initial state of the walk, the time is rescaled by the probability of keeping and edge. Both the individual trajectories for a single system and average properties with a superoperator formalism are discussed. We give an analytical proof for our theorem and we also present results from numerical simulations of the phenomena for different graphs.

quant-ph↗

Transport properties of continuous-time quantum walks on Sierpinski fractals

We model quantum transport, described by continuous-time quantum walks (CTQW), on deterministic Sierpinski fractals, differentiating between Sierpinski gaskets and Sierpinski carpets, along with their dual structures. The transport efficiencies are defined in terms of the exact and the average return probabilities, as well as by the mean survival probability when absorbing traps are present. In the case of gaskets, localization can be identified already for small networks (generations). For carpets, our numerical results indicate a trend towards localization, but only for relatively large structures. The comparison of gaskets and carpets further implies that, distinct from the corresponding classical continuous-time random walk, the spectral dimension does not fully determine the evolution of the CTQW.

quant-ph↗

Discrete time quantum walks on percolation graphs

Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear and disappear randomly in each step during the time evolution. The resulting open system dynamics is hard to treat numerically in general. We shortly review the literature on this problem. We then present our method to solve the evolution on finite percolation graphs in the long time limit, applying the asymptotic methods concerning random unitary maps. We work out the case of one dimensional chains in detail and provide a concrete, step by step numerical example in order to give more insight into the possible asymptotic behavior. The results about the case of the two-dimensional integer lattice are summarized, focusing on the Grover type coin operator.

quant-ph↗

Percolation induced effects in 2D coined quantum walks: analytic asymptotic solutions

Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the long-time behaviour appears untreatable with direct numerical methods. We develop novel analytic methods based on the theory of random unitary operations which help us to determine explicitly the asymptotic dynamics of quantum walks on 2D finite integer lattices with percolation. Based on this theory we find new unexpected features of percolated walks like asymptotic position inhomogeneity or special directional symmetry breaking.

quant-ph↗

Asymptotic dynamics of coined quantum walks on percolation graphs

Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation. Openness of the system's dynamics creates decoherence, leading to strong mixing. We present a method to analytically solve the asymptotic dynamics of coined, percolated quantum walks for a general graph structure. For the case of a circle and a linear graph we derive the explicit form of the asymptotic states. We find that a rich variety of asymptotic evolutions occur: not only the fully mixed state, but other stationary states; stable periodic and quasiperiodic oscillations can emerge, depending on the coin operator, the initial state, and the topology of the underlying graph.

quant-ph↗

Quantum walk on the line with quantum rings

We propose a scheme to implement the one-dimensional coined quantum walk with electrons transported through a two-dimensional network of spintronic semiconductor quantum rings. The coin degree of freedom is represented by the spin of the electron, while the discrete position of the walker corresponds to the label of the rings in one of the spatial directions in the network. We assume that Rashba-type spin-orbit interaction is present in the rings, the strength of which can be tuned by an external electric field. The geometry of the device, together with the appropriate spin-orbit interaction strengths, ensure the realization of the coin-toss (i.e. spin-flip) and the step operator.

cond-mat.mes-hall↗