Efficient Application of the Factorized form of the Unitary Coupled-Cluster Ansatz for the Variational Quantum Eigensolver Algorithm by Using Linear Combination of Unitaries
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.
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.
The factorized form of the unitary coupled-cluster (UCC) approximation is one of the most promising methodologies to prepare trial states for strongly correlated systems within the variational quantum eigensolver framework. The factorized form of the UCC Ansatz can be systematically applied to a reference state to generate the desired entanglement. The difficulty associated with such an approach is the requirement of simultaneously entangling a growing number of qubits, which quickly exceeds the hardware limitations of today's quantum machines. In particular, while circuits for singles and double excitations can be performed on current hardware, higher-rank excitations require too many gate operations. In this work, we propose a set of schemes that trade off using extra qubits for a reduced gate depth to decompose high-rank UCC excitation operators into significantly lower depth circuits. These results will remain useful even when fault-tolerant machines are available to reduce the overall state-preparation circuit depth.
The factorized form of unitary coupled cluster theory (UCC) is a promising wave-function ansatz for the variational quantum eigensolver algorithm. Here, we present a quantum inspired algorithm for UCC based on an exact operator identity for the individual UCC factors. We implement this algorithm for calculations of the H10 linear chain and the H2O molecule with single and double ζ basis sets to provide insights about UCC as a wave-function ansatz. We find that as an electronic structure method, UCC could potentially be valuable for strongly correlated systems, for which conventional coupled cluster theory has difficulties. On quantum computers, the factorized form of UCC can also serve as an initial state preparation method for the quantum phase-estimation algorithm, since it yields higher overlap with the ground state than many other common variational ansatzes. This classical algorithm for UCC also enables widespread testing of the technique, which will be useful for benchmarking quantum computations.
The factorized form of unitary coupled cluster theory (UCC) is a promising wave-function ansatz for the variational quantum eigensolver algorithm. Here, we present a quantum-inspired classical algorithm for UCC based on an exact operator identity for the individual UCC factors. We implement this algorithm for calculations of the H 10 linear chain and the H 2 O molecule with single and double ζ basis sets to provide insights into UCC as a wave-function ansatz. We find that for weakly correlated molecules, the factorized form of the UCC provides similar accuracy to conventional coupled cluster theory (CC); for strongly correlated molecules, where CC often breaks down, UCC significantly outperforms the configuration interaction (CI) ansatz. As a result, the factorized form of the UCC is an accurate, efficient, and reliable electronic structure method in both the weakly and strongly correlated regions. This classical algorithm now allows robust benchmarking of anticipated results from quantum computers and application of coupled-cluster techniques to more strongly correlated molecules.
A unitary coupled cluster (UCC) form for the wave function in the variational quantum eigensolver has been suggested as a systematic way to go beyond the mean-field approximation and include electron correlation in solving quantum chemistry problems on a quantum computer. Although being exact in the limit of including all possible coupled cluster excitations, practically, the accuracy of this approach depends on the number and type of terms are included in the wave function parametrization. Another difficulty of UCC is a growth of the number of simultaneously entangled qubits even at the fixed Fermionic excitation rank. Not all quantum computing architectures can cope with this growth. To address both problems, we introduce a qubit coupled cluster (QCC) method that starts directly in the qubit space and uses energy response estimates for ranking the importance of individual entanglers for the variational energy minimization. Also, we provide an exact factorization of a unitary rotation of more than two qubits to a product of two-qubit unitary rotations. Thus, the QCC method with the factorization technique can be limited to only two-qubit entanglement gates and allows for very efficient use of quantum resources in terms of the number of coupled cluster operators. The method performance is illustrated by calculating ground-state potential energy curves of H 2 and LiH molecules with chemical accuracy, ≤1 kcal/mol, and a symmetric water dissociation curve.
The Coupled Cluster (CC) method is used to compute the electronic correlation energy in atoms and molecules and often leads to highly accurate results. However, due to its single-reference nature, standard CC in its projected form fails to describe quantum states characterized by strong electronic correlations and multi-reference projective methods become necessary. On the other hand, quantum algorithms for the solution of many-electron problems have also emerged recently. The quantum unitary variant of CC (UCC) with singles and doubles (q-UCCSD) is a popular wavefunction Ansatz for the variational quantum eigensolver algorithm. The variational nature of this approach can lead to significant advantages compared to its classical equivalent in the projected form, in particular, for the description of strong electronic correlation. However, due to the large number of gate operations required in q-UCCSD, approximations need to be introduced in order to make this approach implementable in a state-of-the-art quantum computer. In this work, we evaluate several variants of the standard q-UCCSD Ansatz in which only a subset of excitations is included. In particular, we investigate the singlet and pair q-UCCD approaches combined with orbital optimization. We show that these approaches can capture the dissociation/distortion profiles of challenging systems, such as H4, H2O, and N2 molecules, as well as the one-dimensional periodic Fermi–Hubbard chain. These results promote the future use of q-UCC methods for the solution of challenging electronic structure problems in quantum chemistry.
Development of resource-friendly quantum algorithms remains highly desirable for noisy intermediate-scale quantum computing. Based on the variational quantum eigensolver (VQE) with unitary coupled-cluster Ansatz, we demonstrate that partitioning of the Hilbert space made possible by the point-group symmetry of the molecular systems greatly reduces the number of variational operators by confining the variational search within a subspace. In addition, we found that instead of including all subterms for each excitation operator, a single-term representation suffices to reach required accuracy for various molecules tested, resulting in an additional shortening of the quantum circuit by a factor of 4–8. With these strategies, VQE calculations on a noise-free quantum simulator achieve energies within a few meVs of those obtained with the full unitary coupled-cluster Ansatz with single and double excitations for the H4-square, H4-chain, and H6-hexagon molecules, while the number of cnot gates, a measure of the quantum-circuit depth, is reduced by a factor of as large as 35. Furthermore, we introduced an efficient “score” parameter to rank the excitation operators, so that the operators causing larger energy reduction can be applied first. Using the H4 square and H4 chain as examples, We demonstrated on noisy quantum simulators that the first few variational operators can bring the energy within the chemical accuracy, while additional operators do not improve the energy since the accumulative noise outweighs the gain from the expansion of the variational Ansatz.