Strategies to simulate dephasing-assisted quantum transport on digital quantum computers

• URL: http://arxiv.org/abs/2111.02897v2
• Date: Wed, 12 Jan 2022 09:58:36 GMT
• Title: Strategies to simulate dephasing-assisted quantum transport on digital quantum computers
• Authors: Federico Gallina, Matteo Bruschi, Barbara Fresch
• Abstract summary: Environment-Assisted Quantum Transport (ENAQT) consists in the modulation and sometimes enhancement of the transfer efficiency by the interaction with an environment. We consider the problem of simulating the dynamics underlying ENAQT in a digital quantum computer. Two different quantum algorithms are introduced, the first one based on Hamiltonians and the second one based on a collision scheme.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Simulating charge and energy transfer in extended molecular networks requires an effective model to include the environment because it significantly affects the quantum dynamics. A prototypical effect known as Environment-Assisted Quantum Transport (ENAQT) consists in the modulation and sometimes enhancement of the transfer efficiency by the interaction with an environment. A simple description of this phenomenon is obtained by a quantum master equation describing a quantum walk over the molecular network in the presence of inter-site decoherence. We consider the problem of simulating the dynamics underlying ENAQT in a digital quantum computer. Two different quantum algorithms are introduced, the first one based on stochastic Hamiltonians and the second one based on a collision scheme. We test both algorithms by simulating ENAQT in a small molecular network on a quantum computer emulator and provide a comparative analysis of the two approaches. Both algorithms can be implemented in a memory efficient encoding with the number of required qubits scaling logarithmically with the size of the simulated system while the number of gates increases quadratically. We discuss the algorithmic quantum trajectories generated by the two simulation strategies showing that they realize distinct unravellings of the site-dephasing master equation. In our approach, the non-unitary dynamics of the open system is obtained through effective representations of the environment, paving the way to digital quantum simulations of quantum transport influenced by structured environments.

Related papers

• qHEOM: A Quantum Algorithm for Simulating Non-Markovian Quantum Dynamics Using the Hierarchical Equations of Motion [0.0]
  We introduce a quantum algorithm designed to simulate non-Markovian dynamics of open quantum systems. Our approach enables the implementation of arbitrary quantum master equations on noisy intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2024-11-18T20:41:10Z)
• An Efficient Classical Algorithm for Simulating Short Time 2D Quantum Dynamics [2.891413712995642]
  We introduce an efficient classical algorithm for simulating short-time dynamics in 2D quantum systems. Our results reveal the inherent simplicity in the complexity of short-time 2D quantum dynamics. This work advances our understanding of the boundary between classical and quantum computation.
  arXiv  Detail & Related papers  (2024-09-06T09:59:12Z)
• Low-Rank Variational Quantum Algorithm for the Dynamics of Open Quantum Systems [0.5755004576310334]
  A variational quantum algorithm is developed to simulate the real-time evolution of the density matrix governed by the Lindblad master equation. The algorithm encodes each pure state of the statistical mixture as a parametrized quantum circuit. Two variational Ans"atze are proposed, and their effectiveness is assessed in the simulation of the dynamics of a 2D dissipative transverse field Ising model.
  arXiv  Detail & Related papers  (2024-03-09T13:23:14Z)
• Non-adiabatic quantum dynamics with fermionic subspace-expansion algorithms on quantum computers [0.0]
  We introduce a novel computational framework for excited-states molecular quantum dynamics simulations. We calculate the required excited-state transition properties with different flavors of the quantum subspace expansion and quantum equation-of-motion algorithms. We show that only methods that can capture both weak and strong electron correlation effects can properly describe the non-adiabatic effects that tune the reactive event.
  arXiv  Detail & Related papers  (2024-02-23T15:09:19Z)
• Digital quantum simulation of non-perturbative dynamics of open systems with orthogonal polynomials [0.0]
  We propose the use of the Time Evolving Density operator with Orthogonal Polynomials Algorithm (TEDOPA) on a quantum computer. We show that exponential scalings of computational resources can potentially be avoided for time-evolution simulations of the systems considered in this work.
  arXiv  Detail & Related papers  (2022-03-28T11:16:33Z)
• Implementation of a two-stroke quantum heat engine with a collisional model [50.591267188664666]
  We put forth a quantum simulation of a stroboscopic two-stroke thermal engine in the IBMQ processor. The system consists of a quantum spin chain connected to two baths at their boundaries, prepared at different temperatures using the variational quantum thermalizer algorithm.
  arXiv  Detail & Related papers  (2022-03-25T16:55:08Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• 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)

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.