Study of Adaptative Derivative-Assemble Pseudo-Trotter Ansatzes in VQE through qiskit API

• URL: http://arxiv.org/abs/2210.15438v1
• Date: Tue, 25 Oct 2022 16:53:14 GMT
• Title: Study of Adaptative Derivative-Assemble Pseudo-Trotter Ansatzes in VQE through qiskit API
• Authors: Max Alteg, Baptiste Chevalier, Octave Mestoudjian, Johan-Luca Rossi
• Abstract summary: Variational Quantum Algorithms (VQAs) were designed to answer the problem of Quantum Phase Estimation Algorithm. ADAPT-VQE determines a quasi-optimal ansatz with a minimal number of parameters. We will compare all of these algorithms on different criterions such as the number of parameters, the accuracy or the number of CNOT gate used on H2 and LiH molecules.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In order to answer the problem of Quantum Phase Estimation Algorithm been not suitable for NISQ devices, and allows one to outperform classical computers, Variational Quantum Algorithms (VQAs) were designed. Our subject of interest is the so-called Variational Quantum Eigensolver (VQE) algorithm and was originally designed to simulate electronic structures and to compute the ground state of a given molecule. VQE is made of two main components : an ansatz and a classical optimizer. The ansatz runs on the quantum device and aims to simulate the wavefunction, the parameters of the ansatz will be optimized until the expectation value is minimum. The very first ansatz that has originally been used is called UCCSD and it is based on Coupled Cluster Theory. The main issue considering UCCSD is the large amount of parameters to optimize and this leads us to the introduction of Adaptive Derivative-Assembled Pseudo-Trotter ansatz VQE (ADAPT-VQE) which determines a quasi-optimal ansatz with a minimal number of parameters. The key point of ADAPT-VQE is to grow the ansatz at every step, by adding operators chosen from a pre-determined pool of operators one-at-a-time, assuring that the maximal amount of correlation energy is recovered at each step. There exists different kind of ADAPT-VQE depending on the starting pool of operators as the fermionic-ADAPT, the qubit-ADAPT or even the qubit excitation based (QEB). Our goal is to implement the different types of ADAPT-VQE mentioned before. After a quick review of the theoretical background under all of these concepts, we will implement each algorithm using quiskit. We will also compare all of these algorithms on different criterions such as the number of parameters, the accuracy or the number of CNOT gate used on H2 and LiH molecules. Then we will have a small discussion about the results we obtained.

Related papers

• Optimization by Decoded Quantum Interferometry [43.55132675053983]
  We introduce a quantum algorithm for reducing classical optimization problems to classical decoding problems. We show that DQI achieves a better approximation ratio than any quantum-time classical algorithm known to us.
  arXiv  Detail & Related papers  (2024-08-15T17:47:42Z)
• Warm-Starting the VQE with Approximate Complex Amplitude Encoding [0.26217304977339473]
  The Variational Quantum Eigensolver (VQE) is a quantum algorithm to determine the ground state of quantum-mechanical systems. We propose a warm-starting technique, that utilizes an approximation to generate beneficial initial parameter values for the VQE. Such warm-starts open the path to fruitful combinations of classical approximation algorithms and quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-27T10:15: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)
• TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit ans\"atze [0.0]
  We introduce an algorithm called TETRIS-ADAPT-VQE, which iteratively builds up variational ans"atze a few operators at a time. It results in denser but significantly shallower circuits, without increasing the number of CNOT gates or variational parameters. These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware.
  arXiv  Detail & Related papers  (2022-09-21T18:00:02Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Classically optimal variational quantum algorithms [0.0]
  Hybrid quantum-classical algorithms, such as variational quantum algorithms (VQA), are suitable for implementation on NISQ computers. In this Letter we expand an implicit step of VQAs: the classical pre-computation subroutine which can non-trivially use classical algorithms to simplify, transform, or specify problem instance-specific variational quantum circuits.
  arXiv  Detail & Related papers  (2021-03-31T13:33:38Z)
• Improving the variational quantum eigensolver using variational adiabatic quantum computing [0.0]
  variational quantumsampling (VAQC) is a hybrid quantum-classical algorithm for finding a Hamiltonian minimum eigenvalue of a quantum circuit. We show that VAQC can provide more accurate solutions than "plain" VQE, for the evaluation.
  arXiv  Detail & Related papers  (2021-02-04T20:25:50Z)
• Simulating Many-Body Systems with a Projective Quantum Eigensolver [0.0]
  We present a new hybrid quantum-classical algorithm for optimizing unitary coupled-cluster wave functions. We also introduce a selected variant of PQE (SPQE) that uses an adaptive ansatz built from arbitrary-order particle-hole operators.
  arXiv  Detail & Related papers  (2021-01-31T00:31:12Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)

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.