Transport efficiency of continuous-time quantum walks on graphs
arXiv:2011.13794 · doi:10.3390/e23010085
Abstract
Continuous-time quantum walk describes the propagation of a quantum particle (or an excitation) evolving continuously in time on a graph. As such, it provides a natural framework for modeling transport processes, e.g., in light-harvesting systems. In particular, the transport properties strongly depend on the initial state and on the specific features of the graph under investigation. In this paper, we address the role of graph topology, and investigate the transport properties of graphs with different regularity, symmetry, and connectivity. We neglect disorder and decoherence, and assume a single trap vertex accountable for the loss processes. In particular, for each graph, we analytically determine the subspace of states having maximum transport efficiency. Our results provide a set of benchmarks for environment-assisted quantum transport, and suggest that connectivity is a poor indicator for transport efficiency. Indeed, we observe some specific correlations between transport efficiency and connectivity for certain graphs, but in general they are uncorrelated.
References in corpus (36)
- Quantum Computation and Decision Trees
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- Perfect state transfer in quantum spin networks
- 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
- An example of the difference between quantum and classical random walks
- Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
- Efficiency of energy transfer in a light-harvesting system under quantum coherence
- Experimental Implementation of the Quantum Random-Walk Algorithm
- Experimental Two-dimensional Quantum Walk on a Photonic Chip
- Limits of quantum speedup in photosynthetic light harvesting
- Survival Probabilities in Coherent Exciton Transfer with Trapping
- Quantum Walk of Two Interacting Bosons
- Efficient Quantum Walk on a Quantum Processor
- Coherent exciton transport in dendrimers and continuous-time quantum walks
- Quantum transport on small-world networks: A continuous-time quantum walk approach
- Global Symmetry is Unnecessary for Fast Quantum Search
- Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs
- Connectivity is a Poor Indicator of Fast Quantum Search
- Transport and Quantum Walk of Nonclassical Light in Coupled Waveguides
- Efficiency of quantum and classical transport on graphs
- Laplacian versus Adjacency Matrix in Quantum Walk Search
- Slow transport by continuous time quantum walks
- Dynamics of continuous-time quantum walks in restricted geometries
- Transport properties of continuous-time quantum walks on Sierpinski fractals
- Quantum Logic with Interacting Bosons in 1D
- Coherent transport on Apollonian networks and continuous-time quantum walks
- Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
- Coherent dynamics on hierarchical systems
- Continuous-Time Quantum Walks and Trapping
- Disorder-assisted quantum transport in suboptimal decoherence regimes
- Diagrammatic Approach to Quantum Search
- Probing the sign of on-site Hubbard interaction by two-particle quantum walks
Cited by in corpus (11)
- Spatial Search on Johnson Graphs by Continuous-Time Quantum Walk
- Quantum-classical distance as a tool to design optimal chiral quantum walk
- Swift chiral quantum walks
- Quantum transport efficiency in noisy random-removal and small-world networks
- Identifying network topologies via quantum walk distributions
- Enhanced quantum transport in chiral quantum walks
- Scalable Structure For Chiral Quantum Routing
- Optimal quantum transport on a ring via locally monitored chiral quantum walks
- Decoherence and classicalization of continuous-time quantum walks on graphs
- Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems
- Perturbed graphs achieve unit transport efficiency without environmental noise