Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDecoherence and disorder in quantum walks: From ballistic spread to localization
414
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We investigate the impact of decoherence and static disorder on the dynamics of quantum particles moving in a periodic lattice. Our experiment relies on the photonic implementation of a one-dimensional quantum walk. The pure quantum evolution is characterized by a ballistic spread of a photons wave packet along 28 steps. By applying controlled time-dependent operations we simulate three different environmental influences on the system, resulting in a fast ballistic spread, a diffusive classical walk and the first Anderson localization in a discrete quantum walk architecture.
rate research
Read More
The phenomenon of localization usually happens due to the existence of disorder in a medium. Nevertheless, certain quantum systems allow dynamical localization solely due to the nature of internal interactions. We study a discrete time quantum walker which exhibits disorder free localization. The quantum walker moves on a one-dimensional lattice and interacts with on-site spins by coherently rotating them around a given axis at each step. Since the spins do not have dynamics of their own, the system poses the local spin components along the rotation axis as an extensive number of conserved moments. When the interaction is weak, the spread of the walker shows subdiffusive behaviour having downscaled ballistic tails in the evolving probability distribution at intermediate time scales. However, as the interaction gets stronger the walker gets exponentially localized in the complete absence of disorder in both lattice and initial state. Using a matrix-product-state ansatz, we investigate the relaxation and entanglement dynamics of the on-site spins due to their coupling with the quantum walker. Surprisingly, we find that even in the delocalized regime, entanglement growth and relaxation occur slowly unlike marjority of the other models displaying a localization transition.
Quantum walks have been shown to have impressive transport properties compared to classical random walks. However, imperfections in the quantum walk algorithm can destroy any quantum mechanical speed-up due to Anderson localization. We numerically study the effect of static disorder on a quantum walk on the glued trees graph. For small disorder, we find that the dominant effect is a type of quantum decay, and not quantum localization. For intermediate disorder, there is a crossover to diffusive transport, while a localization transition is observed at large disorder, in agreement with Anderson localization on the Cayley tree.
The time evolution of one- and two-dimensional discrete-time quantum walk with increase in disorder is studied. We use spatial, temporal and spatio-temporal broken periodicity of the unitary evolution as disorder to mimic the effect of disordered/random medium in our study. Disorder induces a dramatic change in the interference pattern leading to localization of the quantum walks in one- and two-dimensions. Spatial disorder results in the decreases of the particle and position entanglement in one-dimension and counter intuitively, an enhancement in entanglement with temporal and spatio-temporal disorder is seen. The study signifies that the Anderson localization of quantum state without compromising on the degree of entanglement could be implement in a large variety of physical settings where quantum walks has been realized. The study presented here could make it feasible to explore, theoretically and experimentally the interplay between disorder and entanglement. This also brings up a variety of intriguing questions relating to the negative and positive implications on algorithmic and other applications.
Computational advantages gained by quantum algorithms rely largely on the coherence of quantum devices and are generally compromised by decoherence. As an exception, we present a quantum algorithm for graph isomorphism testing whose performance is optimal when operating in the partially coherent regime, as opposed to the extremes of fully coherent or classical regimes. The algorithm builds on continuous-time quantum stochastic walks (QSWs) on graphs and the algorithmic performance is quantified by the distinguishing power (DIP) between non-isomorphic graphs. The QSW explores the entire graph and acquires information about the underlying structure, which is extracted by monitoring stochastic jumps across an auxiliary edge. The resulting counting statistics of stochastic jumps is used to identify the spectrum of the dynamical generator of the QSW, serving as a novel graph invariant, based on which non-isomorphic graphs are distinguished. We provide specific examples of non-isomorphic graphs that are only distinguishable by QSWs in the presence of decoherence.
Quantum walks have a host of applications, ranging from quantum computing to the simulation of biological systems. We present an intrinsically stable, deterministic implementation of discrete quantum walks with single photons in space. The number of optical elements required scales linearly with the number of steps. We measure walks with up to 6 steps and explore the quantum-to-classical transition by introducing tunable decoherence. Finally, we also investigate the effect of absorbing boundaries and show that decoherence significantly affects the probability of absorption.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
