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.
The computation of molecular excitation energies is essential for predicting photo-induced reactions of chemical and technological interest. While the classical computing resources needed for this task scale poorly, quantum algorithms emerge as promising alternatives. In particular, the extension of the variational quantum eigensolver algorithm to the computation of the excitation energies is an attractive option. However, there is currently a lack of such algorithms for correlated molecular systems that is amenable to near-term, noisy hardware. In this work, we propose an extension of the well-established classical equation of motion approach to a quantum algorithm for the calculation of molecular excitation energies on noisy quantum computers. In particular, we demonstrate the efficiency of this approach in the calculation of the excitation energies of the LiH molecule on an IBM Quantum computer.
The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups.
Variational quantum algorithms, a popular heuristic for near-term quantum computers, utilize parameterized quantum circuits which naturally express Lie groups. It has been postulated that many properties of variational quantum algorithms can be understood by studying their corresponding groups, chief among them the presence of vanishing gradients or barren plateaus, but a theoretical derivation has been lacking. Using tools from the representation theory of compact Lie groups, we formulate a theory of barren plateaus for parameterized quantum circuits whose observables lie in their dynamical Lie algebra, covering a large variety of commonly used ansätze such as the Hamiltonian Variational Ansatz, Quantum Alternating Operator Ansatz, and many equivariant quantum neural networks. Our theory provides, for the first time, the ability to compute the exact variance of the gradient of the cost function of the quantum compound ansatz, under mixing conditions that we prove are commonplace.
Quantum alternating operator ansatz (QAOA) has a strong connection to the adiabatic algorithm, which it can approximate with sufficient depth. However, it is unclear to what extent the lessons from the adiabatic regime apply to QAOA as executed in practice with small to moderate depth. In this paper, we demonstrate that the intuition from the adiabatic algorithm applies to the task of choosing the QAOA initial state. Specifically, we observe that the best performance is obtained when the initial state of QAOA is set to be the ground state of the mixing Hamiltonian, as required by the adiabatic algorithm. We provide numerical evidence using the examples of constrained portfolio optimization problems with both low (p ≤ 3) and high (p = 100) QAOA depth. Additionally, we successfully apply QAOA with XY mixer to portfolio optimization on a trapped-ion quantum processor using 32 qubits and discuss our findings in near-term experiments.
Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers1,2, realizing this potential remains a challenge. An example is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy3. Certified randomness has many applications but is impossible to achieve solely by classical computation. Here we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the Internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations4,5: a client generates quantum ‘challenge’ circuits using a small randomness seed, sends them to an untrusted quantum server to execute and verifies the results of the server. We analyse the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of 1.1 × 1018 floating-point operations per second across multiple supercomputers, we certify 71,313 bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of present-day quantum computers.