PANSATZ: Pulse-based Ansatz for Variational Quantum Algorithms

• URL: http://arxiv.org/abs/2212.12911v1
• Date: Sun, 25 Dec 2022 14:31:34 GMT
• Title: PANSATZ: Pulse-based Ansatz for Variational Quantum Algorithms
• Authors: Dekel Meirom, Steven H. Frankel
• Abstract summary: We develop and implement a novel pulse-based ansatz for noisy quantum computers. We find the ground-state energy associated with the electron configuration problem. We show that this ansatz has structured adaptivity to the entanglement level required by the problem.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We develop and implement a novel pulse-based ansatz, which we call PANSATZ, for more efficient and accurate implementations of variational quantum algorithms (VQAs) on today's noisy intermediate-scale quantum (NISQ) computers. Our approach is applied to quantum chemistry. Specifically, finding the ground-state energy associated with the electron configuration problem, using the variational quantum eigensolver (VQE) algorithm for several molecules. We manage to achieve chemical accuracy both in simulation for several molecules and on one of IBM's NISQ devices for the $H_2$ molecule in the STO-3G basis. Our results are compared to a gate-based ansatz and show significant latency reduction - up to $7\times$ shorter ansatz schedules. We also show that this ansatz has structured adaptivity to the entanglement level required by the problem.

Related papers

• Benchmarking Variational Quantum Eigensolvers for Entanglement Detection in Many-Body Hamiltonian Ground States [37.69303106863453]
  Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. We use a specific class of VQA named variational quantum eigensolvers (VQEs) to benchmark them at entanglement witnessing and entangled ground state detection. Quantum circuits whose structure is inspired by the Hamiltonian interactions presented better results on cost function estimation than problem-agnostic circuits.
  arXiv  Detail & Related papers  (2024-07-05T12:06:40Z)
• 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)
• Variational quantum eigensolver for closed-shell molecules with non-bosonic corrections [6.3235499003745455]
  We introduce a simple correction scheme in the electron correlation model approximated by the geometrical mean of the bosonic terms. We find our non-bosonic correction method reaches reliable quantum chemistry simulations at least for the tested systems.
  arXiv  Detail & Related papers  (2023-10-11T16:47:45Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers [0.471876092032107]
  Variational quantum eigensolvers (VQE) are among the most promising approaches for solving electronic structure problems on quantum computers. A critical challenge for VQE in practice is that one needs to strike a balance between the expressivity of the VQE ansatz versus the number of quantum gates required to implement the ansatz. We run end-to-end VQE algorithms with up to 12 qubits and 72 variational parameters - the largest full VQE simulation with a correlated wave function on quantum hardware.
  arXiv  Detail & Related papers  (2022-12-05T18:40:54Z)
• Differentiable matrix product states for simulating variational quantum computational chemistry [6.954927515599816]
  We propose a parallelizable classical simulator for variational quantum eigensolver(VQE) Our simulator seamlessly integrates the quantum circuit evolution into the classical auto-differentiation framework. As applications, we use our simulator to study commonly used small molecules such as HF, LiH and H$$O, as well as larger molecules CO$$, BeH$ and H$_4$ with up to $40$ qubits.
  arXiv  Detail & Related papers  (2022-11-15T08:36:26Z)
• VQE Method: A Short Survey and Recent Developments [5.9640499950316945]
  The variational quantum eigensolver (VQE) is a method that uses a hybrid quantum-classical computational approach to find eigenvalues and eigenvalues of a Hamiltonian. VQE has been successfully applied to solve the electronic Schr"odinger equation for a variety of small molecules. Modern quantum computers are not capable of executing deep quantum circuits produced by using currently available ansatze.
  arXiv  Detail & Related papers  (2021-03-15T16:25:36Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• Gate-free state preparation for fast variational quantum eigensolver simulations: ctrl-VQE [0.0]
  VQE is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers. We propose an alternative algorithm where the quantum circuit used for state preparation is removed entirely and replaced by a quantum control routine. As with VQE, the objective function optimized is the expectation value of the qubit-mapped molecular Hamiltonian.
  arXiv  Detail & Related papers  (2020-08-10T17:53:09Z)

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.