Modular Cluster Circuits for the Variational Quantum Eigensolver
- URL: http://arxiv.org/abs/2305.04425v3
- Date: Mon, 28 Aug 2023 11:50:02 GMT
- Title: Modular Cluster Circuits for the Variational Quantum Eigensolver
- Authors: Seyed Ehsan Ghasempouri and Gerhard W. Dueck and Stijn De Baerdemacker
- Abstract summary: In the present work, we introduce a modular 2-qubit cluster circuit that allows for the design of a shallow-depth quantum circuit.
The design was tested on the H2, (H2) and LiH molecules, as well as the finite-size transverse-field Ising model.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The variational quantum eigensolver (VQE) algorithm recently became a popular
method to compute quantum chemical properties of molecules on noisy
intermediate scale quantum (NISQ) devices. In order to avoid noise accumulation
from the NISQ device in the circuit, it is important to keep the so-called
quantum depth of the circuit at a minimum, defined as the minimum number of
quantum gates that need to be operated sequentially. In the present work, we
introduce a modular 2-qubit cluster circuit that allows for the design of a
shallow-depth quantum circuit compared to previously proposed architectures
without loss of chemical accuracy. Moreover, by virtue of the simplicity of the
cluster circuit, it is possible to assign a valence bond chemical
interpretation to the cluster circuit. The design was tested on the H2, (H2)2
and LiH molecules, as well as the finite-size transverse-field Ising model, as
the latter provides additional insights in the construction of the circuit in a
resonating valence bond picture.
Related papers
- Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - A circuit-generated quantum subspace algorithm for the variational quantum eigensolver [0.0]
We propose combining quantum subspace techniques with the variational quantum eigensolver (VQE)
In our approach, the parameterized quantum circuit is divided into a series of smaller subcircuits.
The sequential application of these subcircuits to an initial state generates a set of wavefunctions that we use as a quantum subspace to obtain high-accuracy groundstate energies.
arXiv Detail & Related papers (2024-04-09T18:00:01Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Resource-Efficient Quantum Circuits for Molecular Simulations: A Case
Study of Umbrella Inversion in Ammonia [1.439738350540859]
We develop a novel quantum circuit that reduces the required circuit depth and number of two-qubit entangling gates by about 60%.
Even in the presence of device noise, these novel shallower circuits yielded substantially low error rates.
arXiv Detail & Related papers (2023-12-07T11:30:09Z) - Molecular Symmetry in VQE: A Dual Approach for Trapped-Ion Simulations
of Benzene [0.2624902795082451]
Near-term strategies hinge on the use of variational quantum eigensolver (VQE) algorithms combined with a suitable ansatz.
We employ several circuit optimization methods tailored for trapped-ion quantum devices to enhance the feasibility of intricate chemical simulations.
These methods, when applied to a benzene molecule simulation, enabled the construction of an 8-qubit circuit with 69 two-qubit entangling operations.
arXiv Detail & Related papers (2023-08-01T17:03:10Z) - 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) - 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) - Simulating the Mott transition on a noisy digital quantum computer via
Cartan-based fast-forwarding circuits [62.73367618671969]
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model.
Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models.
This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
arXiv Detail & Related papers (2021-12-10T17:32:15Z) - An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian
Simulation [55.41644538483948]
Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates.
We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions.
The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
arXiv Detail & Related papers (2021-08-06T19:38:03Z) - Variational Quantum Eigensolver with Reduced Circuit Complexity [3.1158760235626946]
We present a novel approach to reduce quantum circuit complexity in VQE for electronic structure calculations.
Our algorithm, called ClusterVQE, splits the initial qubit space into subspaces (qubit clusters) which are further distributed on individual quantum circuits.
The new algorithm simultaneously reduces the number of qubits and circuit depth, making it a potential leader for quantum chemistry simulations on NISQ devices.
arXiv Detail & Related papers (2021-06-14T17:23:46Z) - Variational quantum compiling with double Q-learning [0.37798600249187286]
We propose a variational quantum compiling (VQC) algorithm based on reinforcement learning (RL)
An agent is trained to sequentially select quantum gates from the native gate alphabet and the qubits they act on by double Q-learning.
It can reduce the errors of quantum algorithms due to decoherence process and gate noise in NISQ devices.
arXiv Detail & Related papers (2021-03-22T06:46:35Z)
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.