Quantum Simulation of the Radical Pair Dynamics of the Avian Compass
- URL: http://arxiv.org/abs/2211.15427v1
- Date: Mon, 28 Nov 2022 15:12:34 GMT
- Title: Quantum Simulation of the Radical Pair Dynamics of the Avian Compass
- Authors: Yiteng Zhang, Zixuan Hu, Yuchen Wang, and Sabre Kais
- Abstract summary: We apply a unitary-dilation-based quantum algorithm to simulating the dynamics of the radical pair mechanism in the avian compass.
This work is the first application of any quantum algorithm to simulating the radical pair mechanism in the avian compass.
- Score: 5.5047128171540205
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The simulation of open quantum dynamics on quantum circuits has attracted
wide interests recently with a variety of quantum algorithms developed and
demonstrated. Among these, one particular design of a unitary-dilation-based
quantum algorithm is capable of simulating general and complex physical
systems. In this paper, we apply this quantum algorithm to simulating the
dynamics of the radical pair mechanism in the avian compass. This application
is demonstrated on the IBM QASM quantum simulator. This work is the first
application of any quantum algorithm to simulating the radical pair mechanism
in the avian compass, which not only demonstrates the generality of the quantum
algorithm, but also opens new opportunities for studying the avian compass with
quantum computing devices.
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) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Towards Quantum Simulation of Non-Markovian Open Quantum Dynamics: A Universal and Compact Theory [10.708145906104205]
We introduce the dissipaton-embedded quantum master equation in second quantization (DQME-SQ)
This exact and compact theory offers two key advantages: representability by quantum circuits and universal applicability to any Gaussian environment.
We demonstrate these capabilities through digital quantum simulations of non-Markovian dissipative dynamics in both bosonic and fermionic environments.
arXiv Detail & Related papers (2024-01-30T18:46:30Z) - Singular value decomposition quantum algorithm for quantum biology [0.0]
We present the application of a recently developed singular value decomposition algorithm to two benchmark systems in quantum biology.
We demonstrate that the algorithm is capable of capturing accurate short- and long-time dynamics for these systems through implementation on a quantum simulator.
arXiv Detail & Related papers (2023-09-29T16:52:10Z) - 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 molecules using the VQE algorithm on Qiskit [0.0]
We provide the implementation of the Variational Quantum Eigensolver algorithm for finding the ground state energy of a hydrogen molecule on Qiskit library for python.
arXiv Detail & Related papers (2022-01-08T15:05:32Z) - 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) - 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) - A general quantum algorithm for open quantum dynamics demonstrated with
the Fenna-Matthews-Olson complex [0.0]
We develop a quantum algorithm to simulate any dynamical process represented by either the operator sum representation or the Lindblad master equation.
We demonstrate the quantum algorithm by simulating the dynamics of the Fenna-Matthews-Olson complex on the IBM QASM quantum simulator.
arXiv Detail & Related papers (2021-01-13T19:00:02Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z)
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.