Glued trees algorithm under phase damping

DOI10.1016/J.PHYSLETA.2013.11.034MaRDI QIDQ1786639zbMATH OpenOpenAlexWikidataFDO

Authors G. Richomme

Publication date 24 September 2018

Published in Physics Letters. A (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1303.5319

zbMATH Keywords

decoherencequantum algorithmsquantum walks

Mathematics Subject Classification ID

Quantum computation (81P68) Open systems, reduced dynamics, master equations, decoherence (81S22) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Abstract: We study the behaviour of the glued trees algorithm described by Childs et al. in [STOC `03, Proc. 35th ACM Symposium on Theory of Computing (2004) 59] under decoherence. We consider a discrete time reformulation of the continuous time quantum walk protocol and apply a phase damping channel to the coin state, investigating the effect of such a mechanism on the probability of the walker appearing on the target vertex of the graph. We pay particular attention to any potential advantage coming from the use of weak decoherence for the spreading of the walk across the glued trees graph.

Recommendations

• Dynamics regularization with tree-like structures
• Conflict-resolving tree algorithm stable to incomplete interference damping
• Glauber dynamics on trees and hyperbolic graphs
• Global recursive dynamics of articulated tree structures
• Essentially non-oscillatory adaptive tree methods
• Tree Algorithms in Wavelet Approximations by Helmholtz Potential Operators
• A Differential Approach for Staged Trees
• Glued Matrices and the MRRR Algorithm
• Glauber dynamics on trees: Boundary conditions and mixing time
• Fast Implicit Simulation of Flexible Trees

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Mixing and decoherence in quantum walks on cycles
• Transmitting qudits through larger quantum channels

Cited in

(3)

• Strong edge geodetic problem in networks
• Central limit theorem for reducible and irreducible open quantum walks
• An analytical study of quantum walk through glued-tree graphs

This page was built for publication: Glued trees algorithm under phase damping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786639)