The most efficient known quantum circuits for preparing unitary coupled cluster states and applying Trotter steps of the arbitrary basis electronic structure Hamiltonian involve interleaved sequences of Fermionic Gaussian circuits and Ising interaction-type circuits. These circuits arise from factorizing the two-body operators generating those unitaries as a sum of squared one-body operators that are simulated using product formulas. We introduce a numerical algorithm for performing this factorization that has an iteration complexity no worse than single particle basis transformations of the two-body operators and often results in many times fewer squared one-body operators in the sum of squares, compared to the analytical decompositions. As an application of this numerical procedure, we demonstrate that our protocol can be used to approximate generic unitary coupled cluster operators and prepare the necessary high-quality initial states for techniques (like ADAPT-VQE) that iteratively construct approximations to the ground state.
The most efficient known quantum circuits for preparing unitary coupled cluster states and applying Trotter steps of the arbitrary basis electronic structure Hamiltonian involve interleaved sequences of Fermionic Gaussian circuits and Ising interaction-type circuits. These circuits arise from factorizing the two-body operators generating those unitaries as a sum of squared one-body operators that are simulated using product formulas. We introduce a numerical algorithm for performing this factorization that has an iteration complexity no worse than single particle basis transformations of the two-body operators and often results in many times fewer squared one-body operators in the sum of squares, compared to the analytical decompositions. As an application of this numerical procedure, we demonstrate that our protocol can be used to approximate generic unitary coupled cluster operators and prepare the necessary high-quality initial states for techniques (like ADAPT-VQE) that iteratively construct approximations to the ground state.
The factorized form of the unitary coupled cluster Ansatz is a popular state preparation Ansatz for electronic structure calculations of molecules on quantum computers. It is often viewed as an approximation (based on the Trotter product formula) for the conventional unitary coupled cluster operator. In this work, we show that the factorized form is quite flexible, allowing one to range from a conventional configuration interaction, to conventional unitary coupled cluster, to efficient approximations that lie in between these two. The variational minimization of the energy often allows simpler factorized unitary coupled cluster approximations to achieve high accuracy, even if they do not accurately approximate the Trotter product formula. This is similar to how quantum approximate optimization algorithms can achieve high accuracy with a small number of levels.
Efficient quantum circuits are necessary for realizing quantum algorithms on noisy intermediate-scale quantum devices. Fermionic excitations entering unitary coupled-cluster (UCC) ansätze give rise to quantum circuits containing CNOT “staircases” whose number scales exponentially with the excitation rank. Recently, Yordanov et al. [ Phys. Rev. A 102, 062612 (2020); Commun. Phys. 4, 228 (2021)] constructed CNOT-efficient quantum circuits for both Fermionic- (FEB) and qubit-excitation-based (QEB) singles and doubles and illustrated their usefulness in adaptive derivative-assembled pseudo-Trotterized variational quantum eigensolver (ADAPT-VQE) simulations. In this work, we extend these CNOT-efficient quantum circuits to arbitrary excitation ranks. To illustrate the benefits of these compact FEB and QEB quantum circuits, we perform numerical simulations using the recently developed selected projective quantum eigensolver (SPQE) approach, which relies on an adaptive UCC ansatz built from arbitrary-order particle–hole excitation operators. We show that both FEB- and QEB-SPQE decrease the number of CNOT gates compared to traditional SPQE by factors as large as 15. At the same time, QEB-SPQE requires, in general, more ansatz parameters than FEB-SPQE, in particular those corresponding to higher-than-double excitations, resulting in quantum circuits with larger CNOT counts. Although ADAPT-VQE generates quantum circuits with fewer CNOTs than SPQE, SPQE requires orders of magnitude less residual element evaluations than gradient element evaluations in ADAPT-VQE.
In this work we investigate methods to improve the efficiency and scalability of quantum algorithms for quantum chemistry applications. We propose a transformation of the electronic structure Hamiltonian in the second quantization framework into the particle-hole picture, which offers a better starting point for the expansion of the system wave function. The state of the molecular system at study is parametrized so as to constrain the sampling of the corresponding wave function within the sector of the molecular Fock space that contains the desired solution. To this end, we explore different mapping schemes to encode the molecular ground state wave function in a quantum register. Taking advantage of known post-Hartree-Fock quantum chemistry approaches and heuristic Hilbert space search quantum algorithms, we propose a new family of quantum circuits based on exchange-type gates that enable accurate calculations while keeping the gate count (i.e., the circuit depth) low. The particle-hole implementation of the unitary coupled-cluster (UCC) method within the variational quantum eigensolver approach gives rise to an efficient quantum algorithm, named q-UCC, with important advantages compared to the straightforward translation of the classical coupled-cluster counterpart. In particular, we show how a single Trotter step in the expansion of the system wave function can accurately and efficiently reproduce the ground-state energy of simple molecular systems.
Abstract The quantum simulation of quantum chemistry is a promising application of quantum computers. However, for N molecular orbitals, the O(N4) O ( N 4 ) gate complexity of performing Hamiltonian and unitary Coupled Cluster Trotter steps makes simulation based on such primitives challenging. We substantially reduce the gate complexity of such primitives through a two-step low-rank factorization of the Hamiltonian and cluster operator, accompanied by truncation of small terms. Using truncations that incur errors below chemical accuracy allow one to perform Trotter steps of the arbitrary basis electronic structure Hamiltonian with O(N3) O ( N 3 ) gate complexity in small simulations, which reduces to O(N2) O ( N 2 ) gate complexity in the asymptotic regime; and unitary Coupled Cluster Trotter steps with O(N3) O ( N 3 ) gate complexity as a function of increasing basis size for a given molecule. In the case of the Hamiltonian Trotter step, these circuits have O(N2) O ( N 2 ) depth on a linearly connected array, an improvement over the O(N3) O ( N 3 ) scaling assuming no truncation. As a practical example, we show that a chemically accurate Hamiltonian Trotter step for a 50 qubit molecular simulation can be carried out in the molecular orbital basis with as few as 4000 layers of parallel nearest-neighbor two-qubit gates, consisting of fewer than 10 5 non-Clifford rotations. We also apply our algorithm to iron–sulfur clusters relevant for elucidating the mode of action of metalloenzymes.
The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons with relatively low-depth circuits, which are otherwise difficult to solve on classical computers. The variational eigenstate is constructed from a number of factorized unitary coupled-cluster terms applied onto an initial (single-reference) state. Current algorithms for applying one of these operators to a quantum state require a number of operations that scale exponentially with the rank of the operator. We exploit a hidden SU(2) symmetry to allow us to employ the linear combination of unitaries approach, Our Prepare subroutine uses n+2 ancilla qubits for a rank-n operator. Our Select(U^) scheme uses O(n)Cnot gates. This results in a full algorithm that scales like the cube of the rank of the operator n3, a significant reduction in complexity for rank five or higher operators. This approach, when combined with other algorithms for lower-rank operators (when compared to the standard implementation), will make the factorized form of the unitary coupled-cluster approach much more efficient to implement on all types of quantum computers.
Here we present an efficient and numerically stable procedure for compressing a correlation matrix into a set of local unitary single-particle gates, which leads to a very efficient way of forming the matrix product state (MPS) approximation of a pure fermionic Gaussian state, such as the ground state of a quadratic Hamiltonian. The procedure involves successively diagonalizing subblocks of the correlation matrix to isolate local states which are purely occupied or unoccupied. A small number of nearest-neighbor unitary gates isolate each local state. The MPS of this state is formed by applying the many-body version of these gates to a product state. We treat the simple case of compressing the correlation matrix of spinless free fermions with definite particle number in detail, although the procedure is easily extended to fermions with spin and more general BCS states (utilizing the formalism of Majorana modes). We also present a density matrix renormalization group--like algorithm to obtain the compressed correlation matrix directly from a hopping Hamiltonian. In addition, we discuss a slight variation of the procedure which leads to a simple construction of the multiscale entanglement renormalization ansatz of a fermionic Gaussian state, and present a simple picture of orthogonal wavelet transforms in terms of the gate structure we present in this paper. As a simple demonstration, we analyze the Su-Schrieffer-Heeger model (free fermions on a one-dimensional lattice with staggered hopping amplitudes).