Investigation of Perturbation Theory with Variational Quantum Algorithm

• URL: http://arxiv.org/abs/2212.14575v1
• Date: Fri, 30 Dec 2022 07:30:05 GMT
• Title: Investigation of Perturbation Theory with Variational Quantum Algorithm
• Authors: H.Davoodi Yeganeh
• Abstract summary: Variational Quantum Algorithms are among the most promising systems to implement quantum computing. In this paper, we investigate perturbation theory with these algorithms and prospect the possibility of using the variational quantum algorithm to simulate quantum dynamics in perturbation theory.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational Quantum Algorithms are among the most promising systems to implement quantum computing under the Noisy-Intermediate Scale Quantum (NISQ) technology. In variational quantum algorithm, wavefunction represented by a parametrized ansatz and variational parameters are updated iteratively with a classical computer based on the measurement outputs from the quantum computer. In this paper, we investigate perturbation theory with these algorithms and prospect the possibility of using the variational quantum algorithm to simulate quantum dynamics in perturbation theory. We illustrate the use of algorithms with detailed examples which are in good agreement with analytical calculations

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)
• Lecture Notes on Quantum Algorithms in Open Quantum Systems [0.0]
  These lecture notes aim to provide a clear and comprehensive introduction to using open quantum system theory for quantum algorithms. The main arguments are Variational Quantum Algorithms, Quantum Error Correction, Dynamical Decoupling and Quantum Error Mitigation.
  arXiv  Detail & Related papers  (2024-06-17T15:00:25Z)
• 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)
• An introduction to variational quantum algorithms for combinatorial optimization problems [0.0]
  This tutorial provides a mathematical description of the class of Variational Quantum Algorithms. We introduce precisely the key aspects of these hybrid algorithms on the quantum side and the classical side. We devote a particular attention to QAOA, detailing the quantum circuits involved in that algorithm, as well as the properties satisfied by its possible guiding functions.
  arXiv  Detail & Related papers  (2022-12-22T14:27:52Z)
• Review of Ansatz Designing Techniques for Variational Quantum Algorithms [0.0]
  In the NISQ era, variable-component subcircuits enable applications of quantum computing. Existing research has improved the accuracy and efficiency of Variational Quantum Algorithm.
  arXiv  Detail & Related papers  (2022-12-07T07:09:09Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• 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)
• 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)
• 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)
• Approximating the quantum approximate optimization algorithm with digital-analog interactions [0.0]
  We show that the digital-analog paradigm is suited to the variational quantum approximate optimisation algorithm. We observe regimes of single-qubit operation speed in which the considered variational algorithm provides a significant improvement over non-variational counterparts.
  arXiv  Detail & Related papers  (2020-02-27T16:01:40Z)

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.