Transport efficiency of continuous-time quantum walks on graphs
- URL: http://arxiv.org/abs/2011.13794v2
- Date: Tue, 12 Jan 2021 10:45:29 GMT
- Title: Transport efficiency of continuous-time quantum walks on graphs
- Authors: Luca Razzoli, Matteo G. A. Paris, Paolo Bordone
- Abstract summary: Continuous-time quantum walk describes the propagation of a quantum particle evolving continuously in time on a graph.
We investigate the transport properties of graphs with different regularity, symmetry, and connectivity.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure.
We introduce a new class of manifold, named soft manifold, that can solve this situation.
Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
arXiv Detail & Related papers (2023-11-29T12:48:33Z) - Controlled transport in chiral quantum walks on graphs [0.26288598724791834]
We investigate novel transport properties of chiral continuous-time quantum walks (CTQWs) on graphs.
Phase plays a key role in controlling both asymmetric transport and directed complete transport among the chains in the Y-junction graph.
Our results demonstrate that the interplay of these phase shifts leads to the observed enhancement and suppression of quantum transport.
arXiv Detail & Related papers (2023-08-24T03:02:30Z) - Entanglement, quantum correlators and connectivity in graph states [0.0]
This work contributes to a deeper understanding of the entanglement and connectivity properties of graph states.
It offers valuable insights for quantum information processing and quantum computing applications.
arXiv Detail & Related papers (2023-08-15T10:42:07Z) - Perturbed graphs achieve unit transport efficiency without environmental
noise [0.0]
Transport of an excitation through a network corresponds to continuous-time quantum walk on a graph.
We show that it is possible to enhance the transport efficiency without environmental noise, using only a minimal perturbation of the graph.
arXiv Detail & Related papers (2022-05-19T09:16:31Z) - Key graph properties affecting transport efficiency of flip-flop Grover
percolated quantum walks [0.0]
We study quantum walks with the flip-flop shift operator and the Grover coin.
We show how the position of the source and sink together with the graph geometry and its modifications affect transport.
This gives us a deep insight into processes where elongation or addition of dead-end subgraphs may surprisingly result in enhanced transport.
arXiv Detail & Related papers (2022-02-19T11:55:21Z) - Interplay between transport and quantum coherences in free fermionic
systems [58.720142291102135]
We study the quench dynamics in free fermionic systems.
In particular, we identify a function, that we dub emphtransition map, which takes the value of the stationary current as input and gives the value of correlation as output.
arXiv Detail & Related papers (2021-03-24T17:47:53Z) - Time-Dependent Dephasing and Quantum Transport [68.8204255655161]
We show that non-Markovian dephasing assisted transport manifests only in the non-symmetric configuration.
We find similar results by considering a controllable and experimentally implementable system.
arXiv Detail & Related papers (2021-02-20T22:44:08Z) - Hyperbolic Graph Embedding with Enhanced Semi-Implicit Variational
Inference [48.63194907060615]
We build off of semi-implicit graph variational auto-encoders to capture higher-order statistics in a low-dimensional graph latent representation.
We incorporate hyperbolic geometry in the latent space through a Poincare embedding to efficiently represent graphs exhibiting hierarchical structure.
arXiv Detail & Related papers (2020-10-31T05:48:34Z) - GraphOpt: Learning Optimization Models of Graph Formation [72.75384705298303]
We propose an end-to-end framework that learns an implicit model of graph structure formation and discovers an underlying optimization mechanism.
The learned objective can serve as an explanation for the observed graph properties, thereby lending itself to transfer across different graphs within a domain.
GraphOpt poses link formation in graphs as a sequential decision-making process and solves it using maximum entropy inverse reinforcement learning algorithm.
arXiv Detail & Related papers (2020-07-07T16:51:39Z) - Continuous-time quantum walks in the presence of a quadratic
perturbation [55.41644538483948]
We address the properties of continuous-time quantum walks with Hamiltonians of the form $mathcalH= L + lambda L2$.
We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry.
arXiv Detail & Related papers (2020-05-13T14:53:36Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.