Unleashed from Constrained Optimization: Quantum Computing for Quantum
Chemistry Employing Generator Coordinate Method
- URL: http://arxiv.org/abs/2312.07691v1
- Date: Tue, 12 Dec 2023 19:36:51 GMT
- Title: Unleashed from Constrained Optimization: Quantum Computing for Quantum
Chemistry Employing Generator Coordinate Method
- Authors: Muqing Zheng, Bo Peng, Ang Li, Xiu Yang, Karol Kowalski
- Abstract summary: Hybrid quantum-classical approaches offer potential solutions for quantum chemistry problems.
But they also introduce challenges such as the barren plateau and the exactness of the ansatze.
In this work, we highlight the interconnection between constrained optimization and generalized eigenvalue problems.
- Score: 10.6794560287257
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Hybrid quantum-classical approaches offer potential solutions for quantum
chemistry problems, but they also introduce challenges such as the barren
plateau and the exactness of the ansatze. These challenges often manifest as
constrained optimization problems without a guarantee of identifying global
minima. In this work, we highlight the interconnection between constrained
optimization and generalized eigenvalue problems, using a unique class of
non-orthogonal and overcomplete basis sets generated by Givens rotation-type
canonical transformations on a reference state. Employing the generator
coordinate approach, we represent the wave function in terms of these basis
sets. The ensuing generalized eigenvalue problem yields rigorous lower bounds
on energy, outperforming the conventional variational quantum eigensolver (VQE)
that employs the same canonical transformations in its ansatze. Our approach
effectively tackles the barren plateau issue and the heuristic nature of
numerical minimizers in the standard VQE, making it ideal for intricate quantum
chemical challenges. For real-world applications, we propose an adaptive scheme
for selecting these transformations, emphasizing the linear expansion of the
non-orthogonal basis sets. This ensures a harmonious balance between accuracy
and efficiency in hybrid quantum-classical simulations. Our analysis and
suggested methodology further broaden the applications of quantum computing in
quantum chemistry. Notably, they pave the way for alternative strategies in
excited state computation and Hamiltonian downfolding, laying the groundwork
for sophisticated quantum simulations in chemistry.
Related papers
- 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) - Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering [0.13108652488669736]
Hamiltonian simulation is a domain where quantum computers have the potential to outperform classical counterparts.
One of the main challenges of such quantum algorithms is up-scaling the system size.
We present an approach to improve the scalability of eigenspace filtering for the ground state preparation of a given Hamiltonian.
arXiv Detail & Related papers (2024-01-17T09:52:24Z) - A Quantum Approach for Stochastic Constrained Binary Optimization [2.6803492658436032]
Quantum-based algorithms have been shown to generate high-quality solutions to hard problems.
This work puts forth quantum vectors to cope with binary quadratically constrained programs.
The method builds upon dual decomposition and entails solving a sequence of judiciously modified standard VQE tasks.
arXiv Detail & Related papers (2023-01-04T04:24:26Z) - 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) - A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
We propose a hybrid quantum-classical algorithm for robust fitting.
Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs.
We present results obtained using an actual quantum computer.
arXiv Detail & Related papers (2022-01-25T05:59:24Z) - 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) - Quantum computing for classical problems: Variational Quantum
Eigensolver for activated processes [0.0]
This paper reports the development and implementation of a Variational Quantum Eigensolver procedure to solve the Fokker-Planck-Smoluchowski eigenvalue problem.
We show that such an algorithm, typically adopted to address quantum chemistry problems, can be applied effectively to classical systems paving the way to new applications of quantum computers.
arXiv Detail & Related papers (2021-07-27T18:16:16Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves.
We find both methods provide good estimates of the energy and ground state.
gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
arXiv Detail & Related papers (2020-11-02T19:52:04Z) - 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) - Variational Quantum Eigensolver for Frustrated Quantum Systems [0.0]
A variational quantum eigensolver, or VQE, is designed to determine a global minimum in an energy landscape specified by a quantum Hamiltonian.
Here we consider the performance of the VQE technique for a Hubbard-like model describing a one-dimensional chain of fermions.
We also study the barren plateau phenomenon for the Hamiltonian in question and find that the severity of this effect depends on the encoding of fermions to qubits.
arXiv Detail & Related papers (2020-05-01T18:00:01Z)
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.