Avoiding dark states in open quantum systems by tailored initial correlations
arXiv:1204.0954 · doi:10.1103/PhysRevE.85.062102
Abstract
We study the transport of excitations on a V-shaped network of three coupled two-level systems that are subjected to an environment that induces incoherent hopping between the nodes. Two of the nodes are coupled to a source while the third node is coupled to a drain. A common feature of these networks is the existence of a dark-state that blocks the transport to the drain. Here we propose a means to avoid this state by a suitable choice of initial correlations, induced by a source that is common to both coupled nodes.
5 pages, 3 figures
References in corpus (14)
- Quantum Computation and Decision Trees
- Environment-Assisted Quantum Transport
- Highly efficient energy excitation transfer in light-harvesting complexes: The fundamental role of noise-assisted transport
- Coherent and Collective Quantum Optical Effects in Mesoscopic Systems
- Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
- Quantum stochastic walks: A generalization of classical random walks and quantum walks
- All-electronic coherent population trapping in quantum dots
- Dark states in the magnetotransport through triple quantum dots
- Counting statistics of coherent population trapping in quantum dots
- Environmental correlation effects on excitation energy transfer in photosynthetic light harvesting
- Trapping of Continuous-Time Quantum walks on Erdos-Renyi graphs
- Phonon-mediated decoherence in triple quantum dot interferometers
- Continuous-Time Quantum Walks and Trapping
- Transport efficiency in topologically disordered networks with environmentally induced diffusion
Cited by in corpus (5)
- Spin entangled two-particle dark state in quantum transport through coupled quantum dots
- Null-eigenvalue localization of quantum walks on real-world complex networks
- How to Suppress Dark States in Quantum Networks and Bio-Engineered Structures
- Enhanced Quantum Transport in Multiplex Networks
- Survival probability of the Grover walk on the ladder graph