Accelerated Convergence of Contracted Quantum Eigensolvers through a Quasi-Second-Order, Locally Parameterized Optimization

• URL: http://arxiv.org/abs/2205.01726v1
• Date: Tue, 3 May 2022 18:48:04 GMT
• Title: Accelerated Convergence of Contracted Quantum Eigensolvers through a Quasi-Second-Order, Locally Parameterized Optimization
• Authors: Scott E. Smart and David A. Mazziotti
• Abstract summary: A contracted quantum eigensolver (CQE) finds a solution to the many-electron Schr"odinger equation on a quantum computer. In this work, we accelerate the convergence of the CQE and its wavefunction ansatz via tools from classical optimization theory.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A contracted quantum eigensolver (CQE) finds a solution to the many-electron Schr\"odinger equation by solving its integration (or contraction) to the 2-electron space -- a contracted Schr\"odinger equation (CSE) -- on a quantum computer. When applied to the anti-Hermitian part of the CSE (ACSE), the CQE iterations optimize the wave function with respect to a general product ansatz of two-body exponential unitary transformations that can exactly solve the Schr\"odinger equation. In this work, we accelerate the convergence of the CQE and its wavefunction ansatz via tools from classical optimization theory. By treating the CQE algorithm as an optimization in a local parameter space, we can apply quasi-second-order optimization techniques, such as quasi-Newton approaches or non-linear conjugate gradient approaches. Practically these algorithms result in superlinear convergence of the wavefunction to a solution of the ACSE. Convergence acceleration is important because it can both minimize the accumulation of noise on near-term intermediate-scale quantum (NISQ) computers and achieve highly accurate solutions on future fault-tolerant quantum devices. We demonstrate the algorithm, as well as some heuristic implementations relevant for cost-reduction considerations, comparisons with other common methods such as variational quantum eigensolvers, and a fermionic-encoding-free form of the CQE.

Related papers

• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Boundary Treatment for Variational Quantum Simulations of Partial Differential Equations on Quantum Computers [1.6318838452579472]
  The paper presents a variational quantum algorithm to solve initial-boundary value problems described by partial differential equations. The approach uses classical/quantum hardware that is well suited for quantum computers of the current noisy intermediate-scale quantum era.
  arXiv  Detail & Related papers  (2024-02-28T18:19:33Z)
• Quantum Circuit Optimization through Iteratively Pre-Conditioned Gradient Descent [0.4915744683251151]
  iteratively preconditioned gradient descent (IPG) for optimizing quantum circuits and demonstrate performance speedups for state preparation and implementation of quantum algorithmics. We show an improvement in fidelity by a factor of $104$ for preparing a 4-qubit W state and a maximally entangled 5-qubit GHZ state compared to other commonly used classicals tuning the same ansatz. We also show gains for optimizing a unitary for a quantum Fourier transform using IPG, and report results of running such optimized circuits on IonQ's quantum processing unit (QPU)
  arXiv  Detail & Related papers  (2023-09-18T17:30:03Z)
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization [41.94295877935867]
  We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-08-29T17:53:08Z)
• Verifiably Exact Solution of the Electronic Schr\"odinger Equation on Quantum Devices [0.0]
  We present an algorithm that yields verifiably exact solutions of the many-electron Schr"odinger equation. We demonstrate the algorithm on both quantum simulators and noisy quantum computers.
  arXiv  Detail & Related papers  (2023-03-01T19:00:00Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• 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)
• Continuous black-box optimization with quantum annealing and random subspace coding [2.839269856680851]
  A black-box optimization algorithm such as Bayesian optimization finds extremum of an unknown function by alternating inference of the underlying function and optimization of an acquisition function. In a high-dimensional space, such algorithms perform poorly due to the difficulty of acquisition function optimization. We apply quantum annealing to overcome the difficulty in the continuous black-box optimization.
  arXiv  Detail & Related papers  (2021-04-30T06:19:07Z)
• 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)

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.