Perturbed graphs achieve unit transport efficiency without environmental noise

Abstract

Coherent transport of an excitation through a network corresponds to continuous-time quantum walk on a graph, and the transport properties of the system may be radically different depending on the graph and on the initial state. The transport efficiency, i.e., the integrated probability of trapping at a certain vertex, is a measure of the success rate of the transfer process. Purely coherent quantum transport is known to be less efficient than the observed excitation transport, e.g., in biological systems, and there is evidence that environmental noise is indeed crucial for excitation transport. At variance with this picture, we here address purely coherent transport on highly symmetric graphs, and show analytically that it is possible to enhance the transport efficiency without environmental noise, i.e., using only a minimal perturbation of the graph. In particular, we show that adding an extra weight to one or two edges, depending on whether the initial state is localized or in a superposition of two vertex states, breaks the inherent symmetries of the graph and may be sufficient to achieve unit transport efficiency. We also briefly discuss the conditions to obtain a null transport efficiency, i.e., to avoid trapping.

19 pages, 4 figures, accepted version

References in corpus (22)

• Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
• Universal computation by quantum walk
• Dephasing assisted transport: Quantum networks and biomolecules
• Environment-Assisted Quantum Transport
• Spatial search by quantum walk
• Highly efficient energy excitation transfer in light-harvesting complexes: The fundamental role of noise-assisted transport
• Perfect Transfer of Arbitrary States in Quantum Spin Networks
• Efficiency of energy transfer in a light-harvesting system under quantum coherence
• Survival Probabilities in Coherent Exciton Transfer with Trapping
• Quantum transport on small-world networks: A continuous-time quantum walk approach
• Transport and Quantum Walk of Nonclassical Light in Coupled Waveguides
• Efficiency of quantum and classical transport on graphs
• Quantum walks on graphs representing the firing patterns of a quantum neural network
• Dynamics of continuous-time quantum walks in restricted geometries
• Transport properties of continuous-time quantum walks on Sierpinski fractals
• On the optimality of spatial search by continuous-time quantum walk
• Coherent transport on Apollonian networks and continuous-time quantum walks
• Coherent dynamics on hierarchical systems
• Generalized quantum-classical correspondence for random walks on graphs
• Quantum walks on complex networks with connection instabilities and community structure
• Quantum-classical distance as a tool to design optimal chiral quantum walk
• Role of symmetry in quantum search via continuous-time quantum walk