Optimization of the Qubit Coupled Cluster Ansatz on classical computers

• URL: http://arxiv.org/abs/2502.17587v1
• Date: Mon, 24 Feb 2025 19:11:40 GMT
• Title: Optimization of the Qubit Coupled Cluster Ansatz on classical computers
• Authors: Ilya G. Ryabinkin, Seyyed Mehdi Hosseini Jenab, Scott N. Genin,
• Abstract summary: We report two schemes for improving the amplitude optimisation in the iterative qubit coupled cluster (iQCC) method.<n>First scheme approximates the QCC unitary as a sum of generators coupled up to a given order.<n>Second scheme limits the size of the expansion space in which the QCC unitary is generated.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Immense interest in quantum computing has prompted development of electronic structure methods that are suitable for quantum hardware. However, the slow pace at which quantum hardware progresses, forces researchers to implement their ideas on classical computers despite the obvious loss of any "quantum advantage." As a result, the so-called quantum inspired methods emerge. They allow one to look at the electronic structure problem from a different angle; yet, to fully exploit their capacity, efficient implementations are highly desirable. Here we report two schemes for improving the amplitude optimisation in the iterative qubit coupled cluster (iQCC) method -- a variational quantum eigensolver-type approach which is based on the qubit coupled cluster (QCC) Ansatz. Our first scheme approximates the QCC unitary as a sum of symmetrical polynomials of generators up to a given order. The resulting energy expression allows for a flexible control of computational complexity via the order parameter. It also guaranties smoothness of trial energies and their derivatives, which is important for gradient-based optimization strategies. The second scheme limits the size of the expansion space in which the QCC unitary is generated. It provides better control of memory requirements, but in general may lead to the non-smooth variation of energy estimates upon changes in amplitudes. It can be used to extrapolate energies for a given set of amplitudes towards the exact QCC value. Both schemes allow for a larger number of generators to be included into the QCC form compared to the exact formulation. This reduces the number of iterations in the iQCC method and/or leads to higher accuracy. We assess capabilities of the new schemes to perform QCC amplitudes optimization for a few molecular systems: N$_2$ (16 qubits), H$_2$O (36 qubits), and tris(2-(2,4-difluorophenyl)pyridine) iridium(III), (80 qubits).

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)
• Evaluating Ground State Energies of Chemical Systems with Low-Depth Quantum Circuits and High Accuracy [6.81054341190257]
  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.
  arXiv  Detail & Related papers  (2024-02-21T17:45:03Z)
• Hungarian Qubit Assignment for Optimized Mapping of Quantum Circuits on Multi-Core Architectures [1.1288814203214292]
  Quantum computers are expected to adopt a modular approach, featuring clusters of tightly connected quantum bits with sparser connections between these clusters. Efficiently distributing qubits across multiple processing cores is critical for improving quantum computing systems' performance and scalability. We propose the Hungarian Qubit Assignment (HQA) algorithm, which leverages the Hungarian algorithm to improve qubit-to-core assignment.
  arXiv  Detail & Related papers  (2023-09-21T15:48:45Z)
• 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)
• 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)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Accelerated Convergence of Contracted Quantum Eigensolvers through a Quasi-Second-Order, Locally Parameterized Optimization [0.0]
  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.
  arXiv  Detail & Related papers  (2022-05-03T18:48:04Z)
• 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)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• 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)
• A posteriori corrections to the Iterative Qubit Coupled Cluster method to minimize the use of quantum resources in large-scale calculations [0.0]
  We present a variety of a posteriori corrections to the iQCC energies to reduce the number of iterations to achieve the desired accuracy. We demonstrate the utility and efficiency of our approach numerically on the examples of 10-qubit N$$ molecule, the 24-qubit H$$O stretch, and 56-qubit singlet-triplet gap calculations.
  arXiv  Detail & Related papers  (2020-09-28T20:57:32Z)
• MoG-VQE: Multiobjective genetic variational quantum eigensolver [0.0]
  Variational quantum eigensolver (VQE) emerged as a first practical algorithm for near-term quantum computers. Here, we propose the approach which can combine both low depth and improved precision. We observe nearly ten-fold reduction in the two-qubit gate counts as compared to the standard hardware-efficient ansatz.
  arXiv  Detail & Related papers  (2020-07-08T20:44:50Z)

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.