Singular value decomposition quantum algorithm for quantum biology

• URL: http://arxiv.org/abs/2309.17391v2
• Date: Tue, 7 May 2024 16:45:02 GMT
• Title: Singular value decomposition quantum algorithm for quantum biology
• Authors: Emily K. Oh, Timothy J. Krogmeier, Anthony W. Schlimgen, Kade Head-Marsden,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: There has been a recent interest in quantum algorithms for the modelling and prediction of non-unitary quantum dynamics using current quantum computers. The field of quantum biology is one area where these algorithms could prove to be useful, as biological systems are generally intractable to treat in their complete form, but amenable to an open quantum systems approach. Here we present the application of a recently developed singular value decomposition algorithm to two well-studied benchmark systems in quantum biology: excitonic energy transport through the Fenna-Matthews-Olson complex and the radical pair mechanism for avian navigation. We demonstrate that the singular value decomposition algorithm is capable of capturing accurate short- and long-time dynamics for these systems through implementation on a quantum simulator, and conclude that this algorithm has the potential to be an effective tool for the future study of systems relevant to quantum biology.

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 Algorithms and Applications for Open Quantum Systems [1.7717834336854132]
  We provide a succinct summary of the fundamental theory of open quantum systems. We then delve into a discussion on recent quantum algorithms. We conclude with a discussion of pertinent applications, demonstrating the applicability of this field to realistic chemical, biological, and material systems.
  arXiv  Detail & Related papers  (2024-06-07T19:02:22Z)
• 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 Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Quantum Simulation of the Radical Pair Dynamics of the Avian Compass [5.5047128171540205]
  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.
  arXiv  Detail & Related papers  (2022-11-28T15:12:34Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Variational Quantum Anomaly Detection: Unsupervised mapping of phase diagrams on a physical quantum computer [0.0]
  We propose variational quantum anomaly detection, an unsupervised quantum machine learning algorithm to analyze quantum data from quantum simulation. The algorithm is used to extract the phase diagram of a system with no prior physical knowledge. We show that it can be used with readily accessible devices nowadays and perform the algorithm on a real quantum computer.
  arXiv  Detail & Related papers  (2021-06-15T06:54:47Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Resource-efficient encoding algorithm for variational bosonic quantum simulations [0.0]
  In the Noisy Intermediate Scale Quantum (NISQ) era of quantum computing, quantum resources are limited. We present a resource-efficient quantum algorithm for bosonic ground and excited state computations.
  arXiv  Detail & Related papers  (2021-02-23T19:00:05Z)
• Real- and imaginary-time evolution with compressed quantum circuits [0.5089078998562184]
  We show that quantum circuits can provide a dramatically more efficient representation than current classical numerics. For quantum circuits, we perform both real- and imaginary-time evolution using an optimization algorithm that is feasible on near-term quantum computers.
  arXiv  Detail & Related papers  (2020-08-24T11:16:43Z)

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.