Ab initio quantum chemistry with neural-network wavefunctions.

Deep learning methods outperform human capabilities in pattern recognition and data processing problems and now have an increasingly important role in scientific discovery. A key application of machine learning in molecular science is to learn potential energy surfaces or force fields from ab initio solutions of the electronic Schrödinger equation using data sets obtained with density functional theory, coupled cluster or other quantum chemistry (QC) methods. In this Review, we discuss a complementary approach using machine learning to aid the direct solution of QC problems from first principles. Specifically, we focus on quantum Monte Carlo methods that use neural-network ansatzes to solve the electronic Schrödinger equation, in first and second quantization, computing ground and excited states and generalizing over multiple nuclear configurations. Although still at their infancy, these methods can already generate virtually exact solutions of the electronic Schrödinger equation for small systems and rival advanced conventional QC methods for systems with up to a few dozen electrons.

Hierarchical Clifford Transformations to Reduce Entanglement in Quantum Chemistry Wave Functions.

The performance of computational methods for many-body physics and chemistry is strongly dependent on the choice of the basis used to formulate the problem. Hence, the search for similarity transformations that yield better bases is important for progress in the field. So far, tools from theoretical quantum information have not been thoroughly explored for this task. Here we take a step in this direction by presenting efficiently computable Clifford similarity transformations for the molecular electronic structure Hamiltonian, which expose bases with reduced entanglement in the corresponding molecular ground states. These transformations are constructed via block-diagonalization of a hierarchy of truncated molecular Hamiltonians, preserving the full spectrum of the original problem. We show that the bases introduced here allow for more efficient classical and quantum computations of ground-state properties. First, we find a systematic reduction of bipartite entanglement in molecular ground states as compared to standard problem representations. This entanglement reduction has implications in classical numerical methods, such as those based on the density matrix renormalization group. Then, we develop variational quantum algorithms that exploit the structure in the new bases, showing again improved results when the hierarchical Clifford transformations are used.

Analytic Theory for the Dynamics of Wide Quantum Neural Networks.

Parametrized quantum circuits can be used as quantum neural networks and have the potential to outperform their classical counterparts when trained for addressing learning problems. To date, much of the results on their performance on practical problems are heuristic in nature. In particular, the convergence rate for the training of quantum neural networks is not fully understood. Here, we analyze the dynamics of gradient descent for the training error of a class of variational quantum machine learning models. We define wide quantum neural networks as parametrized quantum circuits in the limit of a large number of qubits and variational parameters. Then, we find a simple analytic formula that captures the average behavior of their loss function and discuss the consequences of our findings. For example, for random quantum circuits, we predict and characterize an exponential decay of the residual training error as a function of the parameters of the system. Finally, we validate our analytic results with numerical experiments.

Reducing Qubit Requirements for Quantum Simulations Using Molecular Point Group Symmetries.

Simulating molecules is believed to be one of the early stage applications for quantum computers. Current state-of-the-art quantum computers are limited in size and coherence; therefore, optimizing resources to execute quantum algorithms is crucial. In this work, we develop the second quantization representation of spatial symmetries, which are then transformed to their qubit operator representation. These qubit operator representations are used to reduce the number of qubits required for simulating molecules. We present our results for various molecules and elucidate a formal connection of this work with a previous technique that analyzed generic Z2 Pauli symmetries.

Fermionic neural-network states for ab-initio electronic structure.

Neural-network quantum states have been successfully used to study a variety of lattice and continuous-space problems. Despite a great deal of general methodological developments, representing fermionic matter is however still early research activity. Here we present an extension of neural-network quantum states to model interacting fermionic problems. Borrowing techniques from quantum simulation, we directly map fermionic degrees of freedom to spin ones, and then use neural-network quantum states to perform electronic structure calculations. For several diatomic molecules in a minimal basis set, we benchmark our approach against widely used coupled cluster methods, as well as many-body variational states. On some test molecules, we systematically improve upon coupled cluster methods and Jastrow wave functions, reaching chemical accuracy or better. Finally, we discuss routes for future developments and improvements of the methods presented.

Error mitigation extends the computational reach of a noisy quantum processor.

Quantum computation, a paradigm of computing that is completely different from classical methods, benefits from theoretically proved speed-ups for certain problems and can be used to study the properties of quantum systems1. Yet, because of the inherently fragile nature of the physical computing elements (qubits), achieving quantum advantages over classical computation requires extremely low error rates for qubit operations, as well as substantial physical qubits, to realize fault tolerance via quantum error correction2,3. However, recent theoretical work4,5 has shown that the accuracy of computation (based on expectation values of quantum observables) can be enhanced through an extrapolation of results from a collection of experiments of varying noise. Here we demonstrate this error mitigation protocol on a superconducting quantum processor, enhancing its computational capability, with no additional hardware modifications. We apply the protocol to mitigate errors in canonical single- and two-qubit experiments and then extend its application to the variational optimization6-8 of Hamiltonians for quantum chemistry and magnetism9. We effectively demonstrate that the suppression of incoherent errors helps to achieve an otherwise inaccessible level of accuracy in the variational solutions using our noisy processor. These results demonstrate that error mitigation techniques will enable substantial improvements in the capabilities of near-term quantum computing hardware.

Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets.

Quantum computers can be used to address electronic-structure problems and problems in materials science and condensed matter physics that can be formulated as interacting fermionic problems, problems which stretch the limits of existing high-performance computers. Finding exact solutions to such problems numerically has a computational cost that scales exponentially with the size of the system, and Monte Carlo methods are unsuitable owing to the fermionic sign problem. These limitations of classical computational methods have made solving even few-atom electronic-structure problems interesting for implementation using medium-sized quantum computers. Yet experimental implementations have so far been restricted to molecules involving only hydrogen and helium. Here we demonstrate the experimental optimization of Hamiltonian problems with up to six qubits and more than one hundred Pauli terms, determining the ground-state energy for molecules of increasing size, up to BeH2. We achieve this result by using a variational quantum eigenvalue solver (eigensolver) with efficiently prepared trial states that are tailored specifically to the interactions that are available in our quantum processor, combined with a compact encoding of fermionic Hamiltonians and a robust stochastic optimization routine. We demonstrate the flexibility of our approach by applying it to a problem of quantum magnetism, an antiferromagnetic Heisenberg model in an external magnetic field. In all cases, we find agreement between our experiments and numerical simulations using a model of the device with noise. Our results help to elucidate the requirements for scaling the method to larger systems and for bridging the gap between key problems in high-performance computing and their implementation on quantum hardware.