Transport Efficiency of Continuous-Time Quantum Walks on Graphs
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 dep...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-01-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/23/1/85 |
_version_ | 1797414099378765824 |
---|---|
author | Luca Razzoli Matteo G. A. Paris Paolo Bordone |
author_facet | Luca Razzoli Matteo G. A. Paris Paolo Bordone |
author_sort | Luca Razzoli |
collection | DOAJ |
description | 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 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 that is 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. |
first_indexed | 2024-03-09T05:27:13Z |
format | Article |
id | doaj.art-4db9915e9f4a412b8ab2b8a184a2b112 |
institution | Directory Open Access Journal |
issn | 1099-4300 |
language | English |
last_indexed | 2024-03-09T05:27:13Z |
publishDate | 2021-01-01 |
publisher | MDPI AG |
record_format | Article |
series | Entropy |
spelling | doaj.art-4db9915e9f4a412b8ab2b8a184a2b1122023-12-03T12:35:22ZengMDPI AGEntropy1099-43002021-01-012318510.3390/e23010085Transport Efficiency of Continuous-Time Quantum Walks on GraphsLuca Razzoli0Matteo G. A. Paris1Paolo Bordone2Dipartimento di Scienze Fisiche, Informatiche e Matematiche, Università di Modena e Reggio Emilia, I-41125 Modena, ItalyQuantum Technology Lab, Dipartimento di Fisica Aldo Pontremoli, Università Degli Studi di Milano, I-20133 Milano, ItalyDipartimento di Scienze Fisiche, Informatiche e Matematiche, Università di Modena e Reggio Emilia, I-41125 Modena, ItalyContinuous-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 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 that is 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.https://www.mdpi.com/1099-4300/23/1/85transport on graphquantum walktransport efficiencyconnectivity |
spellingShingle | Luca Razzoli Matteo G. A. Paris Paolo Bordone Transport Efficiency of Continuous-Time Quantum Walks on Graphs Entropy transport on graph quantum walk transport efficiency connectivity |
title | Transport Efficiency of Continuous-Time Quantum Walks on Graphs |
title_full | Transport Efficiency of Continuous-Time Quantum Walks on Graphs |
title_fullStr | Transport Efficiency of Continuous-Time Quantum Walks on Graphs |
title_full_unstemmed | Transport Efficiency of Continuous-Time Quantum Walks on Graphs |
title_short | Transport Efficiency of Continuous-Time Quantum Walks on Graphs |
title_sort | transport efficiency of continuous time quantum walks on graphs |
topic | transport on graph quantum walk transport efficiency connectivity |
url | https://www.mdpi.com/1099-4300/23/1/85 |
work_keys_str_mv | AT lucarazzoli transportefficiencyofcontinuoustimequantumwalksongraphs AT matteogaparis transportefficiencyofcontinuoustimequantumwalksongraphs AT paolobordone transportefficiencyofcontinuoustimequantumwalksongraphs |