Variational Quantum Simulation of Chemical Dynamics with Quantum Computers

• URL: http://arxiv.org/abs/2110.06143v1
• Date: Tue, 12 Oct 2021 16:28:52 GMT
• Title: Variational Quantum Simulation of Chemical Dynamics with Quantum Computers
• Authors: Chee-Kong Lee, Chang-Yu Hsieh, Shengyu Zhang, Liang Shi
• Abstract summary: We present variational simulations of real-space quantum dynamics suitable for implementation in Noisy Intermediate-Scale Quantum (NISQ) devices. Motivated by the insights that most chemical dynamics occur in the low energy subspace, we propose a subspace expansion method.
• Score: 23.13347792805101
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Classical simulation of real-space quantum dynamics is challenging due to the exponential scaling of computational cost with system dimensions. Quantum computer offers the potential to simulate quantum dynamics with polynomial complexity; however, existing quantum algorithms based on the split-operator techniques require large-scale fault-tolerant quantum computers that remain elusive in the near future. Here we present variational simulations of real-space quantum dynamics suitable for implementation in Noisy Intermediate-Scale Quantum (NISQ) devices. The Hamiltonian is first encoded onto qubits using a discrete variable representation (DVR) and binary encoding scheme. We show that direct application of real-time variational quantum algorithm based on the McLachlan's principle is inefficient as the measurement cost grows exponentially with the qubit number for general potential energy and extremely small time-step size is required to achieve accurate results. Motivated by the insights that most chemical dynamics occur in the low energy subspace, we propose a subspace expansion method by projecting the total Hamiltonian, including the time-dependent driving field, onto the system low-energy eigenstate subspace using quantum computers, the exact quantum dynamics within the subspace can then be solved classically. We show that the measurement cost of the subspace approach grows polynomially with dimensionality for general potential energy. Our numerical examples demonstrate the capability of our approach, even under intense laser fields. Our work opens the possibility of simulating chemical dynamics with NISQ hardware.

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)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Simulation of open quantum systems on universal quantum computers [15.876768787615179]
  We present an innovative and scalable method to simulate open quantum systems using quantum computers. We define an adjoint density matrix as a counterpart of the true density matrix, which reduces to a mixed-unitary quantum channel. accurate long-time simulation can also be achieved as the adjoint density matrix and the true dissipated one converges to the same state.
  arXiv  Detail & Related papers  (2024-05-31T09:07:27Z)
• 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)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• 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)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Holographic dynamics simulations with a trapped ion quantum computer [0.0]
  We demonstrate and benchmark a new scalable quantum simulation paradigm. Using a Honeywell trapped ion quantum processor, we simulate the non-integrable dynamics of the self-dual kicked Ising model. Results suggest that quantum tensor network methods, together with state-of-the-art quantum processor capabilities, enable a viable path to practical quantum advantage in the near term.
  arXiv  Detail & Related papers  (2021-05-19T18:00:02Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Quantum simulation of open quantum systems in heavy-ion collisions [0.0]
  We present a framework to simulate the dynamics of hard probes such as heavy quarks or jets in a hot, strongly-coupled quark-gluon plasma (QGP) on a quantum computer. Our work demonstrates the feasibility of simulating open quantum systems on current and near-term quantum devices.
  arXiv  Detail & Related papers  (2020-10-07T18:00:02Z)
• Digital Quantum Simulation of Non-Equilibrium Quantum Many-Body Systems [0.0]
  Digital quantum simulation uses the capabilities of quantum computers to determine the dynamics of quantum systems. Here we use the IBM quantum computers to simulate the non-equilibrium dynamics of few spin and fermionic systems.
  arXiv  Detail & Related papers  (2020-09-15T22:29:04Z)

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.