Sampling a rare protein transition with a hybrid classical-quantum computing algorithm

• URL: http://arxiv.org/abs/2311.15891v1
• Date: Mon, 27 Nov 2023 14:58:29 GMT
• Title: Sampling a rare protein transition with a hybrid classical-quantum computing algorithm
• Authors: Danial Ghamari, Roberto Covino, Pietro Faccioli
• Abstract summary: Simulating spontaneous structural rearrangements in macromolecules with Molecular Dynamics (MD) is an outstanding challenge. Conventional supercomputers can access time intervals up to tens of $mu$s, while many key events occur on exponentially longer time scales. We employ a path-sampling paradigm combining machine learning (ML) with quantum computing to address this issue.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Simulating spontaneous structural rearrangements in macromolecules with classical Molecular Dynamics (MD) is an outstanding challenge. Conventional supercomputers can access time intervals up to tens of $\mu$s, while many key events occur on exponentially longer time scales. Transition path sampling techniques have the advantage of focusing the computational power on barrier-crossing trajectories, but generating uncorrelated transition paths that explore diverse conformational regions remains an unsolved problem. We employ a path-sampling paradigm combining machine learning (ML) with quantum computing (QC) to address this issue. We use ML on a classical computer to perform a preliminary uncharted exploration of the conformational space. The data set generated in this exploration is then post-processed to obtain a network representation of the reactive kinetics. Quantum annealing machines can exploit quantum superposition to encode all the transition pathways in this network in the initial quantum state and ensure the generation of completely uncorrelated transition paths. In particular, we resort to the DWAVE quantum computer to perform an all-atom simulation of a protein conformational transition that occurs on the ms timescale. Our results match those of a special purpose supercomputer designed to perform MD simulations. These results highlight the role of biomolecular simulation as a ground for applying, testing, and advancing quantum technologies.

Related papers

• 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)
• Quantum Extreme Learning of molecular potential energy surfaces and force fields [5.13730975608994]
  A quantum neural network is used to learn the potential energy surface and force field of molecular systems. This particular supervised learning routine allows for resource-efficient training, consisting of a simple linear regression performed on a classical computer. We have tested a setup that can be used to study molecules of any dimension and is optimized for immediate use on NISQ devices. Compared to other supervised learning routines, the proposed setup requires minimal quantum resources, making it feasible for direct implementation on quantum platforms.
  arXiv  Detail & Related papers  (2024-06-20T18:00:01Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Quantum Simulation of Dissipative Energy Transfer via Noisy Quantum Computer [0.40964539027092917]
  We propose a practical approach to simulate the dynamics of an open quantum system on a noisy computer. Our method leverages gate noises on the IBM-Q real device, enabling us to perform calculations using only two qubits. In the last, to deal with the increasing depth of quantum circuits when doing Trotter expansion, we introduced the transfer tensor method(TTM) to extend our short-term dynamics simulation.
  arXiv  Detail & Related papers  (2023-12-03T13:56:41Z)
• Quantum Computing Simulation of a Mixed Spin-Boson Hamiltonian and Its Performance for a Cavity Quantum Electrodynamics Problem [0.0]
  We present a methodology for simulating a phase transition in a pair of cavities that permit photon hopping. We find that the simulation can be performed with a modest amount of quantum resources.
  arXiv  Detail & Related papers  (2023-10-17T15:25:35Z)
• Quantum Classical Algorithm for the Study of Phase Transitions in the Hubbard Model via Dynamical Mean-Field Theory [0.0]
  We propose a workflow that synergizes quantum computing, many-body theory, and quantum machine learning for studying strongly correlated systems. We generate a database of zero-temperature wavefunctions of the Hubbard model within the DMFT approximation. We then use a QML algorithm to distinguish between the metallic phase and the Mott insulator phase to capture the metal-to-Mott insulator phase transition.
  arXiv  Detail & Related papers  (2023-08-02T19:11:04Z)
• Sampling Rare Conformational Transitions with a Quantum Computer [0.0]
  We introduce a machine learning algorithm and MD simulations implemented on a classical computer with adiabatic quantum computing. We derive a rigorous low-resolution representation of the system's dynamics, based on a small set of molecular configurations. Our results provide a new paradigm for MD simulations to integrate machine learning and quantum computing.
  arXiv  Detail & Related papers  (2022-01-27T19:46:06Z)
• 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)
• 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)
• Computing molecular excited states on a D-Wave quantum annealer [52.5289706853773]
  We demonstrate the use of a D-Wave quantum annealer for the calculation of excited electronic states of molecular systems. These simulations play an important role in a number of areas, such as photovoltaics, semiconductor technology and nanoscience.
  arXiv  Detail & Related papers  (2021-07-01T01:02:17Z)
• Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale [57.84751206630535]
  We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators. By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
  arXiv  Detail & Related papers  (2021-04-21T13:26:42Z)

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.