In this paper, we propose a novel many-body approach for determining the amplitudes of generalized operators in a projection-based formalism. To implicitly account for the effects of higher-order excitations, we begin with the well-established double-exponential coupled-cluster (CC) ansatz, parametrized by both one- and two-body excitation operators, complemented by a set of vacuum-annihilating two-body generalized operators with effective excitation rank of one. A systematic formalism is developed that effectively bypasses the constraints due to the vacuum-annihilation property of the generalized operators toward a set of closed-form residual equations for their optimization. Such a strategy requires the removal of the underlying redundancy in high-rank excited determinants, generated due to the presence of the generalized operators in the ansatz, by projecting them onto an internally contracted lower-dimensional manifold. This many-body formalism is integrated with the near-term projective quantum eigensolver (PQE) framework that leverages the conventional CC-like residual minimization to iteratively decouple the excited manifold from the reference. With the application of several molecular systems within PQE architecture, we demonstrate that the developed methodology enables us to achieve similar accuracy to the disentangled unitary coupled cluster with singles, doubles, and triples ansatz while utilizing an order of magnitude fewer quantum resources. Furthermore, when simulated under stochastic Gaussian noise or depolarizing hardware noise, our method shows significantly improved noise resilience compared to the other members of PQE family and the state-of-the-art variational quantum eigensolver.
In this paper, we propose a novel many-body approach for determining the amplitudes of generalized operators in a projection-based formalism. To implicitly account for the effects of higher-order excitations, we begin with the well-established double-exponential coupled-cluster (CC) ansatz, parametrized by both one- and two-body excitation operators, complemented by a set of vacuum-annihilating two-body generalized operators with effective excitation rank of one. A systematic formalism is developed that effectively bypasses the constraints due to the vacuum-annihilation property of the generalized operators toward a set of closed-form residual equations for their optimization. Such a strategy requires the removal of the underlying redundancy in high-rank excited determinants, generated due to the presence of the generalized operators in the ansatz, by projecting them onto an internally contracted lower-dimensional manifold. This many-body formalism is integrated with the near-term projective quantum eigensolver (PQE) framework that leverages the conventional CC-like residual minimization to iteratively decouple the excited manifold from the reference. With the application of several molecular systems within PQE architecture, we demonstrate that the developed methodology enables us to achieve similar accuracy to the disentangled unitary coupled cluster with singles, doubles, and triples ansatz while utilizing an order of magnitude fewer quantum resources. Furthermore, when simulated under stochastic Gaussian noise or depolarizing hardware noise, our method shows significantly improved noise resilience compared to the other members of PQE family and the state-of-the-art variational quantum eigensolver.
Determination of molecular energetics and properties is one of the core challenges in the near-term quantum computing. To this end, hybrid quantum-classical algorithms are preferred for Noisy Intermediate Scale Quantum (NISQ) architectures. The Projective Quantum Eigensolver (PQE) is one such algorithms that optimizes the parameters of the chemistry-inspired unitary coupled cluster (UCC) ansatz using a conventional coupled cluster-like residual minimization. Such a strategy involves the projection of the Schrodinger equation on to linearly independent basis towards the parameter optimization, restricting the ansatz is solely defined in terms of the excitation operators. This warrants the inclusion of high-rank operators for strongly correlated systems, leading to increased utilization of quantum resources. In this manuscript, we develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework that can be efficiently implemented in a quantum computer with manageable quantum resources. Such a strategy requires the removal of the underlying redundancy in high-rank excited determinants, generated due to the presence of the generalized operators in the ansatz, by projecting them on to an internally contracted lower dimensional manifold. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples (SDT) ansatz, while utilizing an order of magnitude fewer quantum gates. Furthermore, when simulated under stochastic Gaussian noise or depolarizing hardware noise, our method shows significantly improved noise resilience compared to the other members of PQE family and the state-of-the-art variational quantum eigensolver.
Quantum computers hold immense potential in the field of chemistry, ushering new frontiers to solve complex many-body problems that are beyond the reach of classical computers. However, noise in the current quantum hardware limits their applicability to large chemical systems. This work encompasses the development of a projective formalism that aims to compute ground-state energies of molecular systems accurately using noisy intermediate scale quantum (NISQ) hardware in a resource-efficient manner. Our approach is reliant upon the formulation of a bipartitely decoupled parameterized ansatz within the disentangled unitary coupled cluster framework based on the principles of nonlinear dynamics and synergetics. Such decoupling emulates total parameter optimization in a lower dimensional manifold, while a mutual synergistic relationship among the parameters is exploited to ensure characteristic accuracy via a non-iterative energy correction. Without any pre-circuit measurements, our method leads to a highly compact fixed-depth ansatz with shallower circuits and fewer expectation value evaluations. Through analytical and numerical demonstrations, we establish the method's superior performance under noise while concurrently ensuring requisite accuracy in future fault-tolerant systems. This approach enables rapid exploration of emerging chemical spaces by the efficient utilization of near-term quantum hardware resources.
In this paper, we have developed a unitary variant of a double exponential coupled cluster theory, which is capable of handling molecular strong correlation with arbitrary electronic complexity. With the Hartree-Fock determinant taken as the reference, we introduce a sequential product of parameterized unitary Ansätze. While the first unitary, containing the excitation operators, acts directly on the reference determinant, the second unitary, containing a set of rank-two, vacuum-annihilating scattering operators, has nontrivial action only on certain entangled states. We demonstrate the theoretical bottleneck of such an implementation in a classical computer, whereas the same is implemented in the hybrid quantum-classical variational quantum eigensolver framework with a reasonably shallow quantum circuit without any additional approximation. We have further introduced a number of variants of the proposed Ansatz with different degrees of sophistication by judiciously approximating the scattering operators. With a number of applications on strongly correlated molecules, we have shown that all our schemes can perform uniformly well throughout the molecular potential energy surface without significant additional implementation cost over the conventional unitary coupled cluster approach with single and double excitations.
The recently developed Projective Quantum Eigensolver (PQE) offers an elegant procedure to evaluate the ground state energies of molecular systems in quantum computers. However, the noise in available quantum hardware can result in significant errors in computed outcomes, limiting the realization of quantum advantage. Although PQE comes equipped with some degree of inherent noise resilience, any practical implementation with apposite accuracy would require additional routines to eliminate or mitigate the errors further. In this work, we propose a way to enhance the efficiency of PQE by developing an optimal framework for introducing Zero Noise Extrapolation (ZNE) in the nonlinear iterative procedure that outlines the PQE, leading to the formulation of ZNE-PQE. Moreover, we perform a detailed analysis of how various components involved in it affect the accuracy and efficiency of the reciprocated energy convergence trajectory. Additionally, we investigate the underlying mechanism that leads to the improvements observed in ZNE-PQE over conventional PQE by performing a comparative analysis of their residue norm landscape. This approach is expected to facilitate practical applications of quantum computing in fields related to molecular sciences, where it is essential to determine molecular energies accurately.
In this study, we study the projective quantum eigensolver (PQE) approach, a hybrid quantum-classical algorithm that, by optimizing a unitary coupled cluster wave function, aims at computing the ground state of many-body systems. Instead of trying to minimize the energy of the system like the variational quantum eigensolver (VQE), PQE uses projections of the Schrödinger equation to efficiently bring the trial state closer to an eigenstate of the Hamiltonian. In this study, we provide a mathematical study of the algorithm. We derive a bound relating off-diagonal coefficients (residues) of the Hamiltonian to the energy error of the algorithm and the overlap achieved by the obtained wavefunction. These bounds not only give formal guarantees to PQE, but they also allow us to formulate a well-informed convergence criterion for residue-based optimizers. We then study the classical optimization itself and derive convergence guarantees under certain conditions. We propose a new residue-based optimizer, with numerical evidence of the superiority of this new approach for H4, H6, BeH2, and LiH dissociation curves over both the optimization introduced in Stair and Evangelista [PRX Quantum 2, 030301 (2021)] and VQE optimized using the Broyden-Fletcher-Goldfarb-Shanno method.
This thesis deals with selected aspects of a new implementation of many-body methods which can be formulated in the framework of second quantization, in particular the coupled-cluster (CC) method with arbitrary excitation level. Coupled-cluster is one of the most successful and widely used quantum chemical methods for accurate calculations on small to medium-sized molecules. Since it employs a nonlinear parametrization of the wave function, its implementation is rather difficult, in particular if higher (i.e. more than double) excitations are to be included. The latter is necessary to obtain highly accurate results and also as a prerequisite for the generalization to multi-reference cases. The implementation described here has a twofold focus. One is on generality and flexibility regarding the method to be implemented, the other is on efficiency. To achieve flexibility, it is useful to have a machinery which automatically derives working equations for a given method. We realize this by applying techniques of second quantization. This work treats in particular the last step of this procedure, namely the simplification of the resulting equations by the identification of equivalent terms. The algorithm used here is based on the interpretation of algebraic terms as graphs. The derived CC equations then have to be solved iteratively. The efficiency of the program is mainly determined by the evaluation of the occurring expressions, which has to be done in each iteration step. The evaluation is split up in a sequence of tensor contractions. Their generic implementation is complicated by the particular structure of the involved tensors. We reduce each contraction to a sequence of matrix multiplications, which requires a previous data rearranging. But since matrix multiplication is the most efficient operation on modern computers, this additional effort pays off. Preliminary tests show that our program is at least as fast as the most efficient general coupled-cluster implementation so far, and the relation is expected to improve for calculations with larger basis sets where the matrix multiplication becomes the time-determining step. Finally, we give an outlook to possible further developments. In particular, the preparation of the equations before the actual evaluation (factorization) offers much potential for optimizations which we do not exploit at the moment, in contrast to the program with which we compare, which employs at least a partial optimization at this point.