Evaluating Ground State Energies of Chemical Systems with Low-Depth Quantum Circuits and High Accuracy

• URL: http://arxiv.org/abs/2402.13960v1
• Date: Wed, 21 Feb 2024 17:45:03 GMT
• Title: Evaluating Ground State Energies of Chemical Systems with Low-Depth Quantum Circuits and High Accuracy
• Authors: Shuo Sun, Chandan Kumar, Kevin Shen, Elvira Shishenina and Christian B. Mendl
• Abstract summary: We develop an enhanced Variational Quantum Eigensolver (VQE) ansatz based on the Qubit Coupled Cluster (QCC) approach. We evaluate our enhanced QCC ansatz on two distinct quantum hardware, IBM Kolkata and Quantinuum H1-1.
• Score: 6.81054341190257
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Solving electronic structure problems is considered one of the most promising applications of quantum computing. However, due to limitations imposed by the coherence time of qubits in the Noisy Intermediate Scale Quantum (NISQ) era or the capabilities of early fault-tolerant quantum devices, it is vital to design algorithms with low-depth circuits. In this work, we develop an enhanced Variational Quantum Eigensolver (VQE) ansatz based on the Qubit Coupled Cluster (QCC) approach, which demands optimization over only $n$ parameters rather than the usual $n+2m$ parameters, where $n$ represents the number of Pauli string time evolution gates $e^{-itP}$, and $m$ is the number of qubits involved. We evaluate the ground state energies of $\mathrm{O_3}$, $\mathrm{Li_4}$, and $\mathrm{Cr_2}$, using CAS(2,2), (4,4) and (6,6) respectively in conjunction with our enhanced QCC ansatz, UCCSD (Unitary Coupled Cluster Single Double) ansatz, and canonical CCSD method as the active space solver, and compare with CASCI results. Finally, we assess our enhanced QCC ansatz on two distinct quantum hardware, IBM Kolkata and Quantinuum H1-1.

Related papers

• Quantum Wasserstein Compilation: Unitary Compilation using the Quantum Earth Mover's Distance [2.502222151305252]
  We present a quantum Wasserstein compilation (QWC) cost function based on the quantum Wasserstein distance of order 1. An estimation method based on measurements of local Pauli-observable is utilized in a generative adversarial network to learn a given quantum circuit.
  arXiv  Detail & Related papers  (2024-09-09T17:46:40Z)
• Non-Iterative Disentangled Unitary Coupled-Cluster based on Lie-algebraic structure [0.0]
  Fixed Unitary Coupled-Cluster (UCC) ans"atze are attractive for performing quantum chemistry Variational Quantumsolver (VQE) computations. We introduce $k$-NI-DUCC, a fixed and Non-iterative Disentangled Unitary Coupled-Cluster compact ansatz.
  arXiv  Detail & Related papers  (2024-08-26T14:19:53Z)
• High-Entanglement Capabilities for Variational Quantum Algorithms: The Poisson Equation Case [0.07366405857677226]
  This research attempts to resolve problems by utilizing the IonQ Aria quantum computer capabilities. We propose a decomposition of the discretized equation matrix (DPEM) based on 2- or 3-qubit entanglement gates and is shown to have $O(1)$ terms with respect to system size. We also introduce the Globally-Entangling Ansatz which reduces the parameter space of the quantum ansatz while maintaining enough expressibility to find the solution.
  arXiv  Detail & Related papers  (2024-06-14T16:16:50Z)
• 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)
• Accurate and precise quantum computation of valence two-neutron systems [0.0]
  We introduce a quantum algorithm to accurately and precisely compute the ground state of two-neutron systems. Our experiments using real quantum devices also show the pivotal role of the circuit layout design, attuned to the connectivity of the qubits.
  arXiv  Detail & Related papers  (2024-04-02T06:54:13Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• 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)
• 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)
• Halving the cost of quantum multiplexed rotations [0.0]
  We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls. Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
  arXiv  Detail & Related papers  (2021-10-26T06:49:44Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.