Simulating quantum dynamics: Evolution of algorithms in the HPC context

• URL: http://arxiv.org/abs/2005.04681v2
• Date: Thu, 20 Aug 2020 17:50:14 GMT
• Title: Simulating quantum dynamics: Evolution of algorithms in the HPC context
• Authors: I. Meyerov, A. Liniov, M. Ivanchenko, S. Denisov
• Abstract summary: We overview the evolution of the algorithms used to simulate dynamics of quantum systems. Our mini-review is based on a literature survey and our experience in implementing different types of algorithms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Due to complexity of the systems and processes it addresses, the development of computational quantum physics is influenced by the progress in computing technology. Here we overview the evolution, from the late 1980s to the current year 2020, of the algorithms used to simulate dynamics of quantum systems. We put the emphasis on implementation aspects and computational resource scaling with the model size and propagation time. Our mini-review is based on a literature survey and our experience in implementing different types of algorithms.

Related papers

• Simulation of Quantum Computers: Review and Acceleration Opportunities [0.0]
  Quantum computing has the potential to revolutionize multiple fields by solving complex problems that can not be solved in reasonable time with current classical computers. Currently, the most practical way to develop and test quantum algorithms is to use classical simulators of quantum computers. This review provides an overview of the components of a quantum computer, the levels at which these components and the whole quantum computer can be simulated, and an analysis of different state-of-the-art acceleration approaches.
  arXiv  Detail & Related papers  (2024-10-16T15:19:12Z)
• 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 Circuit Synthesis and Compilation Optimization: Overview and Prospects [59.07692103357675]
  This survey explores the feasibility of an integrated design and optimization scheme that spans from the algorithmic level to quantum hardware.<n>It becomes more possible to reduce manual design costs, enhance the precision and efficiency of execution, and facilitate the implementation and validation of the superiority of quantum algorithms on hardware.
  arXiv  Detail & Related papers  (2024-06-30T15:50:10Z)
• Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study [11.29246196323319]
  We describe NASA's work in assessing and advancing the potential of quantum computing. We discuss advances in algorithms, both near- and longer-term, and the results of our explorations on current hardware and with simulations. This work also includes physics-inspired classical algorithms that can be used at application scale today.
  arXiv  Detail & Related papers  (2024-06-21T19:05:42Z)
• 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)
• Quantum algorithms for scientific computing [0.0]
  Areas that are likely to have the greatest impact on high performance computing include simulation of quantum systems, optimization, and machine learning. Even a modest quantum enhancement to current classical techniques would have far-reaching impacts in areas such as weather forecasting, aerospace engineering, and the design of "green" materials for sustainable development.
  arXiv  Detail & Related papers  (2023-12-22T18:29:31Z)
• The QUATRO Application Suite: Quantum Computing for Models of Human Cognition [49.038807589598285]
  We unlock a new class of applications ripe for quantum computing research -- computational cognitive modeling. We release QUATRO, a collection of quantum computing applications from cognitive models.
  arXiv  Detail & Related papers  (2023-09-01T17:34:53Z)
• Towards quantum-enabled cell-centric therapeutics [2.3677262918873745]
  We discuss the transformational changes we expect from the use of quantum computation for HCLS research. We identify and elaborate open problems in cell engineering, tissue modeling, perturbation modeling, and bio-topology.
  arXiv  Detail & Related papers  (2023-07-11T19:02:37Z)
• A Herculean task: Classical simulation of quantum computers [4.12322586444862]
  This work reviews the state-of-the-art numerical simulation methods that emulate quantum computer evolution under specific operations. We focus on the mainstream state-vector and tensor-network paradigms while briefly mentioning alternative methods.
  arXiv  Detail & Related papers  (2023-02-17T13:59:53Z)
• 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)
• 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)
• Spiking Neural Networks Hardware Implementations and Challenges: a Survey [53.429871539789445]
  Spiking Neural Networks are cognitive algorithms mimicking neuron and synapse operational principles. We present the state of the art of hardware implementations of spiking neural networks. We discuss the strategies employed to leverage the characteristics of these event-driven algorithms at the hardware level.
  arXiv  Detail & Related papers  (2020-05-04T13:24:00Z)

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.