Mapping renormalized coupled cluster methods to quantum computers through a compact unitary representation of non-unitary operators

• URL: http://arxiv.org/abs/2206.09005v2
• Date: Thu, 3 Nov 2022 22:15:21 GMT
• Title: Mapping renormalized coupled cluster methods to quantum computers through a compact unitary representation of non-unitary operators
• Authors: Bo Peng and Karol Kowalski
• Abstract summary: We propose a quantum algorithm for computing MMCC ground-state energies. We show the robustness of our approach over a broad class of test cases. We also outline the extension of MMCC formalism to the case of unitary CC wave function ansatz.
• Score: 6.822193536884916
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Non-unitary theories are commonly seen in the classical simulations of quantum systems. Among these theories, the method of moments of coupled-cluster equations (MMCCs) and the ensuing classes of the renormalized coupled-cluster (CC) approaches have evolved into one of the most accurate approaches to describe correlation effects in various quantum systems. The MMCC formalism provides an effective way for correcting energies of approximate CC formulations (parent theories) using moments, or CC equations, that are not used to determine approximate cluster amplitudes. In this paper, we propose a quantum algorithm for computing MMCC ground-state energies that provide two main advantages over classical computing or other quantum algorithms: (i) the possibility of forming superpositions of CC moments of arbitrary ranks in the entire Hilbert space and using an arbitrary form of the parent cluster operator for MMCC expansion; and (ii) significant reduction in the number of measurements in quantum simulation through a compact unitary representation for a generally non-unitary operator. We illustrate the robustness of our approach over a broad class of test cases, including ~40 molecular systems with varying basis sets encoded using 4~40 qubits, and exhibit the detailed MMCC analysis for the 8-qubit half-filled, four-site, single impurity Anderson model and 12-qubit hydrogen fluoride molecular system from the corresponding noise-free and noisy MMCC quantum computations. We also outline the extension of MMCC formalism to the case of unitary CC wave function ansatz.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Two-dimensional correlation propagation dynamics with a cluster discrete phase-space method [0.0]
  Nonequilibrium dynamics of highly-controlled quantum systems is a challenging issue in statistical physics. We develop a discrete phase-space approach for general SU($N$) spin systems that capture non-trivial quantum correlations inside each cluster. We demonstrate that the cluster discrete truncated Wigner approximation can reproduce key results in a recent experiment on the correlation propagation dynamics in a two dimensional Bose-Hubbard system.
  arXiv  Detail & Related papers  (2024-04-29T11:08:44Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• 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)
• Calculating non-linear response functions for multi-dimensional electronic spectroscopy using dyadic non-Markovian quantum state diffusion [68.8204255655161]
  We present a methodology for simulating multi-dimensional electronic spectra of molecular aggregates with coupling electronic excitation to a structured environment. A crucial aspect of our approach is that we propagate the NMQSD equation in a doubled system Hilbert space but with the same noise.
  arXiv  Detail & Related papers  (2022-07-06T15:30:38Z)
• Localized Quantum Chemistry on Quantum Computers [0.6649973446180738]
  Quantum chemistry calculations are typically limited by the computation cost that scales exponentially with the size of the system. We present a quantum algorithm that combines a localization of multireference wave functions of chemical systems with quantum phase estimation.
  arXiv  Detail & Related papers  (2022-03-03T20:52:22Z)
• 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)
• Reducing Unitary Coupled Cluster Circuit Depth by Classical Stochastic Amplitude Pre-Screening [0.0]
  Unitary Coupled Cluster (UCC) approaches are an appealing route to utilising quantum hardware to perform quantum chemistry calculations. We present a combined classical-quantum approach where a classical UCC pre-processing step is used to determine the important excitations in the UCC ansatz.
  arXiv  Detail & Related papers  (2021-08-24T18:34:14Z)
• Circuit-Depth Reduction of Unitary-Coupled-Cluster Ansatz by Energy Sorting [3.0998962250161783]
  Quantum computation represents a revolutionary approach for solving problems in quantum chemistry. Due to the limited quantum resources in the current noisy intermediate-scale quantum (NISQ) devices, quantum algorithms for large chemical systems remains a major task. In this work, we demonstrate that the circuit depth of the unitary coupled cluster (UCC) and UCC-based ansatzes can be significantly reduced by an energy-sorting strategy.
  arXiv  Detail & Related papers  (2021-06-29T09:51:19Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• 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)

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.