Quick Navigation
Topics
Trapped Ion Quantum Computing
Quantum Simulation
Floquet engineering of continuous-time quantum walks: towards the simulation of complex and next-to-nearest neighbor couplings
arXiv
Authors: Leonardo Novo, Sofia Ribeiro
Year
2020
Paper ID
18838
Status
Preprint
Abstract Read
~2 min
Abstract Words
169
Citations
N/A
Abstract
The formalism of continuous-time quantum walks on graphs has been widely used in the study of quantum transport of energy and information, as well as in the development of quantum algorithms. In experimental settings, however, there is limited control over the coupling coefficients between the different nodes of the graph (which are usually considered to be real-valued), thereby restricting the types of quantum walks that can be implemented. In this work, we apply the idea of Floquet engineering in the context of continuous-time quantum walks, i.e., we define periodically-driven Hamiltonians which can be used to simulate the dynamics of certain target continuous-time quantum walks. We focus on two main applications: i) simulating quantum walks that break time-reversal symmetry due to complex coupling coefficients; ii) increasing the connectivity of the graph by simulating the presence of next-to-nearest neighbor couplings. Our work provides explicit simulation protocols that may be used for directing quantum transport, engineering the dispersion relation of one-dimensional quantum walks or investigating quantum dynamics in highly connected structures.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2020 reference point for readers tracking recent quantum research.
- The formalism of continuous-time quantum walks on graphs has been widely used in the study of quantum transport of energy and information, as well as in the development of...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.