Floquet engineering of continuous-time quantum walks: towards the simulation of complex and next-to-nearest neighbor couplings

• URL: http://arxiv.org/abs/2012.00448v2
• Date: Mon, 8 Feb 2021 17:54:08 GMT
• Title: Floquet engineering of continuous-time quantum walks: towards the simulation of complex and next-to-nearest neighbor couplings
• Authors: Leonardo Novo, Sofia Ribeiro
• Abstract summary: We apply the idea of Floquet engineering in the context of continuous-time quantum walks on graphs. We define periodically-driven Hamiltonians which can be used to simulate the dynamics of certain target quantum walks. 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Amplification of quantum transfer and quantum ratchet [56.47577824219207]
  We study a model of amplification of quantum transfer and making it directed which we call the quantum ratchet model. The ratchet effect is achieved in the quantum control model with dissipation and sink, where the Hamiltonian depends on vibrations in the energy difference synchronized with transitions between energy levels. Amplitude and frequency of the oscillating vibron together with the dephasing rate are the parameters of the quantum ratchet which determine its efficiency.
  arXiv  Detail & Related papers  (2023-12-31T14:04:43Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Quantum Computation of Phase Transition in Interacting Scalar Quantum Field Theory [0.0]
  It has been demonstrated that the critical point of the phase transition in scalar quantum field theory can be approximated via a Gaussian Effective Potential (GEP) We perform quantum computations with various lattice sizes and obtain evidence of a transition from a symmetric to a symmetry-broken phase. We implement the ten-site case on IBM quantum hardware using the Variational Quantum Eigensolver (VQE) algorithm to minimize the GEP.
  arXiv  Detail & Related papers  (2023-03-04T14:11:37Z)
• On-the-fly Tailoring towards a Rational Ansatz Design for Digital Quantum Simulations [0.0]
  It is imperative to develop low depth quantum circuits that are physically realizable in quantum devices. We develop a disentangled ansatz construction protocol that can dynamically tailor an optimal ansatz. The construction of the ansatz may potentially be performed in parallel quantum architecture through energy sorting and operator commutativity prescreening.
  arXiv  Detail & Related papers  (2023-02-07T11:22:01Z)
• Simulation of interaction-induced chiral topological dynamics on a digital quantum computer [3.205614282399206]
  Chiral edge states are sought-after as paradigmatic topological states relevant to quantum information processing and electron transport. We demonstrate chiral topological propagation that is induced by suitably designed interactions, instead of flux or spin-orbit coupling. By taking advantage of the quantum nature of the platform, we circumvented difficulties from the limited qubit number and gate fidelity in present-day noisy intermediate-scale quantum (NISQ)-era quantum computers.
  arXiv  Detail & Related papers  (2022-07-28T18:00:29Z)
• Quantum-classical distance as a tool to design optimal chiral quantum walk [0.0]
  Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation and quantum spatial search. We argue that the quantum-classical distance, a figure of merit introduced to capture the difference in dynamics between a CTQW and its classical counterpart, guides the optimization of parameters of the Hamiltonian.
  arXiv  Detail & Related papers  (2021-06-22T11:38:58Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.