Search

Solving the electronic Schrodinger equation for strongly correlated ground states is a long-standing challenge. We present quantum algorithms for the variational optimization of wavefunctions correlated by products of unitary operators, such as Local Unitary Cluster Jastrow (LUCJ) ansatzes, using stochastic reconfiguration and the linear method. While an implementation on classical computing hardware would require exponentially growing compute cost, the cost (number of circuits and shots) of our quantum algorithms is polynomial in system size. We find that classical simulations of optimization with the linear method consistently find lower energy solutions than with the L-BFGS-B optimizer across the dissociation curves of the notoriously difficult N$_2$ and C$_2$ dimers; LUCJ predictions of the ground-state energies deviate from exact diagonalization by 1 kcal/mol or less at all points on the potential energy curve. While we do characterize the effect of shot noise on the LM optimization, these noiseless results highlight the critical but often overlooked role that optimization techniques must play in attacking the electronic structure problem (on both classical and quantum hardware), for which even mean-field optimization is formally NP hard. We also discuss the challenge of obtaining smooth curves in these strongly correlated regimes, and propose a number of quantum-friendly solutions ranging from symmetry-projected ansatz forms to a symmetry-constrained optimization algorithm.

The estimation of low energies of many-body systems is a cornerstone of computational quantum sciences. Variational quantum algorithms can be used to prepare ground states on pre-fault-tolerant quantum processors, but their lack of convergence guarantees and impractical number of cost function estimations prevent systematic scaling of experiments to large systems. Alternatives to variational approaches are needed for large-scale experiments on pre-fault-tolerant devices. Here, we use a superconducting quantum processor to compute eigenenergies of quantum many-body systems on two-dimensional lattices of up to 56 sites, using the Krylov quantum diagonalization algorithm, an analog of the well-known classical diagonalization technique. We construct subspaces of the many-body Hilbert space using Trotterized unitary evolutions executed on the quantum processor, and classically diagonalize many-body interacting Hamiltonians within those subspaces. These experiments show that quantum diagonalization algorithms are poised to complement their classical counterpart at the foundation of computational methods for quantum systems., Comment: 25 pages, 13 figures

A universal quantum computer can be used as a simulator capable of predicting properties of diverse quantum systems. Electronic structure problems in chemistry offer practical use cases around the hundred-qubit mark. This appears promising since current quantum processors have reached these sizes. However, mapping these use cases onto quantum computers yields deep circuits, and for for pre-fault-tolerant quantum processors, the large number of measurements to estimate molecular energies leads to prohibitive runtimes. As a result, realistic chemistry is out of reach of current quantum computers in isolation. A natural question is whether classical distributed computation can relieve quantum processors from parsing all but a core, intrinsically quantum component of a chemistry workflow. Here, we incorporate quantum computations of chemistry in a quantum-centric supercomputing architecture, using up to 6400 nodes of the supercomputer Fugaku to assist a Heron superconducting quantum processor. We simulate the N$_2$ triple bond breaking in a correlation-consistent cc-pVDZ basis set, and the active-space electronic structure of [2Fe-2S] and [4Fe-4S] clusters, using 58, 45 and 77 qubits respectively, with quantum circuits of up to 10570 (3590 2-qubit) quantum gates. We obtain our results using a class of quantum circuits that approximates molecular eigenstates, and a hybrid estimator. The estimator processes quantum samples, produces upper bounds to the ground-state energy and wavefunctions supported on a polynomial number of states. This guarantees an unconditional quality metric for quantum advantage, certifiable by classical computers at polynomial cost. For current error rates, our results show that classical distributed computing coupled to quantum processors can produce good approximate solutions for practical problems beyond sizes amenable to exact diagonalization.

Modeling chemical reactions with quantum chemical methods is challenging when the electronic structure varies significantly throughout the reaction, as well as when electronic excited states are involved. Multireference methods such as complete active space self-consistent field (CASSCF) can handle these multiconfigurational situations. However, even if the size of needed active space is affordable, in many cases the active space does not change consistently from reactant to product, causing discontinuities in the potential energy surface. The localized active space SCF (LASSCF) is a cheaper alternative to CASSCF for strongly correlated systems with weakly correlated fragments. The method is used for the first time to study a chemical reaction, namely the bond dissociation of a mono-, di-, and triphenylsulfonium cation. LASSCF calculations generate smooth potential energy scans more easily than the corresponding, more computationally expensive, CASSCF calculations, while predicting similar bond dissociation energies. Our calculations suggest a homolytic bond cleavage for di- and triphenylsulfonium, and a heterolytic pathway for monophenylsulfonium.

The simulation of chemical reactions is an anticipated application of quantum computers. Using a Diels-Alder reaction as a test case, in this study we explore the potential applications of quantum algorithms and hardware in investigating chemical reactions. Our specific goal is to calculate the activation barrier of a reaction between ethylene and cyclopentadiene forming a transition state. To achieve this goal, we use quantum algorithms for near-term quantum hardware (entanglement forging and quantum subspace expansion) and classical post-processing (many-body perturbation theory) in concert. We conduct simulations on IBM quantum hardware using up to 8 qubits, and compute accurate activation barriers in the reaction between cyclopentadiene and ethylene by accounting for both static and dynamic electronic correlation. This work illustrates a hybrid quantum-classical computational workflow to study chemical reactions on near-term quantum devices, showcasing the potential of quantum algorithms and hardware in accurately calculating activation barriers.

Quantum systems subject to random unitary evolution and measurements at random points in spacetime exhibit entanglement phase transitions which depend on the frequency of these measurements. Past work has experimentally observed entanglement phase transitions on near-term quantum computers, but the characterization approach using entanglement entropy is not scalable due to exponential overhead of quantum state tomography and post selection. Recently, an alternative protocol to detect entanglement phase transitions using linear cross-entropy was proposed which eliminates both bottlenecks. Here, we report the demonstration of this protocol in systems with one-dimensional and all-to-all connectivities on IBM's quantum hardware on up to 22 qubits, a regime which is presently inaccessible if post-selection is required. We demonstrate a collapse of the data into a scale-invariant form with critical exponents agreeing with theory within uncertainty. Our demonstration paves the way for studies of measurement-induced entanglement phase transitions and associated critical phenomena on larger near-term quantum systems., Comment: 23 pages, 15 figures

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their simulation, analysis, and data resources. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions., Comment: 65 pages, 15 figures; comments welcome

Quantum subspace methods (QSMs) are a class of quantum computing algorithms where the time-independent Schrodinger equation for a quantum system is projected onto a subspace of the underlying Hilbert space. This projection transforms the Schrodinger equation into an eigenvalue problem determined by measurements carried out on a quantum device. The eigenvalue problem is then solved on a classical computer, yielding approximations to ground- and excited-state energies and wavefunctions. QSMs are examples of hybrid quantum-classical methods, where a quantum device supported by classical computational resources is employed to tackle a problem. QSMs are rapidly gaining traction as a strategy to simulate electronic wavefunctions on quantum computers, and thus their design, development, and application is a key research field at the interface between quantum computation and electronic structure. In this review, we provide a self-contained introduction to QSMs, with emphasis on their application to the electronic structure of molecules. We present the theoretical foundations and applications of QSMs, and we discuss their implementation on quantum hardware, illustrating the impact of noise on their performance., Comment: 34 pages, 11 figures

Green's function methods lead to ab initio, systematically improvable simulations of molecules and materials while providing access to multiple experimentally observable properties such as the density of states and the spectral function. The calculation of the exact one-particle Green's function remains a significant challenge for classical computers and was attempted only on very small systems. Here, we present a hybrid quantum-classical algorithm to calculate the imaginary-time one-particle Green's function. The proposed algorithm combines variational quantum eigensolver and quantum subspace expansion to calculate Green's function in Lehmann's representation. We demonstrate the validity of this algorithm by simulating H$_2$ and H$_4$ on quantum simulators and on IBM's quantum devices.

The computation of excited electronic states is an important application for quantum computers. In this work, we simulate the excited state spectra of four aromatic heterocycles on IBM superconducting quantum computers, focusing on active spaces of $\pi \to \pi^*$ and $n \to \pi^*$ excitations. We approximate the ground state with the entanglement forging method, a qubit reduction technique that maps a spatial orbital to a single qubit, rather than two qubits. We then determine excited states using the quantum subspace expansion method. We showcase these algorithms on quantum hardware using up to 8 qubits and employing readout and gate error mitigation techniques. Our results demonstrate a successful application of quantum computing in the simulation of active-space electronic wavefunctions of substituted aromatic heterocycles, and outline challenges to be overcome in elucidating the optical properties of organic molecules with hybrid quantum-classical algorithms.

We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time evolution does not require quantum state tomography during its runtime, and unlike standard adiabatic state preparation, the final Hamiltonian is not the system Hamiltonian. Instead, the algorithm obtains the adiabatic Hamiltonian by integrating a classical differential equation that ensures that one follows the imaginary time evolution state trajectory. We introduce some heuristics that allow this protocol to be implemented on quantum architectures with limited resources. We explore the performance of this algorithm via classical simulations in a one-dimensional spin model and highlight essential features that determine its cost, performance, and implementability for longer times, and compare to the original quantum imaginary time evolution for ground-state preparation. More generally, our algorithm expands the range of states accessible to adiabatic state preparation methods beyond those that are expressed as ground-states of simple explicit Hamiltonians.

Many-body entangled quantum spin systems exhibit emergent phenomena such as topological quantum spin liquids with distinct excitation spectra accessed in inelastic neutron scattering (INS) experiments. Here we simulate the dynamics of a quantum spin dimer, the basic quantum unit of emergent many-body spin systems. While canonical Trotterization methods require deep circuits precluding long time-scale simulations, we demonstrate 'direct' Resource-Efficient Fast-forwarding (REFF) measurements with short-depth circuits that can be used to capture longer time dynamics on quantum hardware. The temporal evolution of the 2-spin correlation coefficients enabled the calculation of the dynamical structure factor $S(\mathbf{Q},\omega)$ - the key component of the neutron scattering cross-section. We simulate the triplet gap and the triplet splitting of the quantum dimer with sufficient fidelity to compare to experimental neutron data. Our results on current circuit hardware pave an important avenue to benchmark, or even predict, the outputs of the costly INS experiments., Comment: 24 pages, 3 tables, 16 figures, main text and supplementary materials

Variational approaches, such as variational Monte Carlo (VMC) or the variational quantum eigensolver (VQE), are powerful techniques to tackle the ground-state many-electron problem. Often, the family of variational states is not invariant under the reparametrization of the Hamiltonian by single-particle basis transformations. As a consequence, the representability of the ground-state wave function by the variational ansatz strongly dependents on the choice of the single-particle basis. In this manuscript we study the joint optimization of the single-particle basis, together with the variational state in the VMC (with neural quantum states) and VQE (with hardware-efficient circuits) approaches. We show that the joint optimization of the single-particle basis with the variational state parameters yields significant improvements in the expressive power and optimization landscape in a variety of chemistry and condensed matter systems. We also realize the first active-space calculation using neural quantum states, where the single-particle basis transformations are applied to all of the orbitals in the basis set.

The performance of computational methods for many-body physics and chemistry is strongly dependent on the choice of basis used to cast the problem; hence, the search for better bases and similarity transformations is important for progress in the field. So far, tools from theoretical quantum information have been not thoroughly explored for this task. Here we take a step in this direction by presenting efficiently computable Clifford similarity transformations for quantum chemistry Hamiltonians, 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 computation 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 ones 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., Comment: 14 pages, 11 figures

We propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements. Compared to previous real-time evolution quantum Krylov subspace methods, our approach expresses the time evolution operator, $e^{-i\hat{H} \tau}$, as a linear combination of unitaries and subsequently uses a stochastic sampling procedure to reduce circuit depth requirements. While our methodology applies to any Hamiltonian with fast-forwardable subcomponents, we focus on its application to the explicitly double-factorized electronic-structure Hamiltonian. To demonstrate the potential of the proposed rQKD algorithm, we provide numerical benchmarks for a variety of molecular systems with circuit-based statevector simulators, achieving ground state energy errors of less than 1~kcal~mol$^{-1}$ with circuit depths orders of magnitude shallower than those required for low-rank deterministic Trotter-Suzuki decompositions.

Advances in quantum computation for electronic structure, and particularly heuristic quantum algorithms, create an ongoing need to characterize the performance and limitations of these methods. Here we discuss some potential pitfalls connected with the use of hardware-efficient Ansatze in variational quantum simulations of electronic structure. We illustrate that hardware-efficient Ansatze may break Hamiltonian symmetries and yield non-differentiable potential energy curves, in addition to the well-known difficulty of optimizing variational parameters. We discuss the interplay between these limitations by carrying out a comparative analysis of hardware-efficient Ansatze versus unitary coupled cluster and full configuration interaction, and of second- and first-quantization strategies to encode fermionic degrees of freedom to qubits. Our analysis should be useful in understanding potential limitations and in identifying possible areas of improvement in hardware-efficient Ansatze., Comment: 16 pages, 9 figures, supplemental information included as an ancillary file

The computational description of correlated electronic structure, and particularly of excited states of many-electron systems, is an anticipated application for quantum devices. An important ramification is to determine the dominant molecular fragmentation pathways in photo-dissociation experiments of light-sensitive compounds, like sulfonium-based photo-acid generators used in photolithography. Here we simulate the static and dynamic electronic structure of the H$_3$S$^+$ molecule, taken as a minimal model of a triply-bonded sulfur cation, on a superconducting quantum processor of the IBM Falcon architecture. To this end, we generalize a qubit reduction technique termed entanglement forging or EF [A. Eddins et al., Phys. Rev. X Quantum, 3, 010309 (2022)], currently restricted to the evaluation of ground-state energies, to the treatment of molecular properties. While, in a conventional quantum simulation, a qubit represents a spin-orbital, within EF a qubit represents a spatial orbital, reducing the number of required qubits by half. We combine the generalized EF with quantum subspace expansion [W. Colless et al, Phys. Rev. X 8, 011021 (2018)], a technique used to project the time-independent Schrodinger equation for ground and excited states in a subspace. To enable experimental demonstration of this algorithmic workflow, we deploy a sequence of error-mitigation techniques. We compute dipole structure factors and partial atomic charges along the ground- and excited-state potential energy curves, revealing the occurrence of homo- and heterolytic fragmentation. This study is an important step toward the computational description of photo-dissociation on near-term quantum devices, as it can be generalized to other photodissociation processes and naturally extended in different ways to achieve more realistic simulations., Comment: 13 pages, 7 figures

We present an algorithm that uses block encoding on a quantum computer to exactly construct a Krylov space, which can be used as the basis for the Lanczos method to estimate extremal eigenvalues of Hamiltonians. While the classical Lanczos method has exponential cost in the system size to represent the Krylov states for quantum systems, our efficient quantum algorithm achieves this in polynomial time and memory. The construction presented is exact in the sense that the resulting Krylov space is identical to that of the Lanczos method, so the only approximation with respect to the exact method is due to finite sample noise. This is possible because, unlike previous quantum Krylov methods, our algorithm does not require simulating real or imaginary time evolution. We provide an explicit error bound for the resulting ground state energy estimate in the presence of noise. For our method to be successful efficiently, the only requirement on the input problem is that the overlap of the initial state with the true ground state must be $\Omega(1/\text{poly}(n))$ for $n$ qubits., Comment: 33 pages, 9 figures; minor corrections and new numerics included in this version

Sampling from complicated probability distributions is a hard computational problem arising in many fields, including statistical physics, optimization, and machine learning. Quantum computers have recently been used to sample from complicated distributions that are hard to sample from classically, but which seldom arise in applications. Here we introduce a quantum algorithm to sample from distributions that pose a bottleneck in several applications, which we implement on a superconducting quantum processor. The algorithm performs Markov chain Monte Carlo (MCMC), a popular iterative sampling technique, to sample from the Boltzmann distribution of classical Ising models. In each step, the quantum processor explores the model in superposition to propose a random move, which is then accepted or rejected by a classical computer and returned to the quantum processor, ensuring convergence to the desired Boltzmann distribution. We find that this quantum algorithm converges in fewer iterations than common classical MCMC alternatives on relevant problem instances, both in simulations and experiments. It therefore opens a new path for quantum computers to solve useful--not merely difficult--problems in the near term.

Modeling electronic systems is an important application for quantum computers. In the context of materials science, an important open problem is the computational description of chemical reactions on surfaces. In this work, we outline a workflow to model the adsorption and reaction of molecules on surfaces using quantum computing algorithms. We develop and compare two local embedding methods for the systematic determination of active spaces. These methods are automated and based on the physics of molecule-surface interactions and yield systematically improvable active spaces. Furthermore, to reduce the quantum resources required for the simulation of the selected active spaces using quantum algorithms, we introduce a technique for exact and automated circuit simplification. This technique is applicable to a broad class of quantum circuits and critical to enable demonstration on near-term quantum devices. We apply the proposed combination of active-space selection and circuit simplification to the dissociation of water on a magnesium surface using classical simulators and quantum hardware. Our study identifies reactions of molecules on surfaces, in conjunction with the proposed algorithmic workflow, as a promising research direction in the field of quantum computing applied to materials science., Comment: 24 pages, 6 figures plus supplementary information

Ergodic quantum many-body systems undergoing unitary dynamics evolve towards increasingly entangled states characterized by an extensive scaling of entanglement entropy with system volume. At the other extreme, quantum systems repeatedly measured may be stabilized in a measurement eigenstate, a phenomenon known as the quantum Zeno effect. Recently, the intermediate regime in which unitary evolution is interspersed with quantum measurements has become of interest. Numerical studies have reported the existence of distinct phases characterized by volume- and area-law entanglement entropy scaling for infrequent and frequent measurement rates, respectively, separated by a critical measurement rate. The experimental investigation of these dynamic quantum phases of matter on near-term quantum hardware is challenging due to the need for repeated high-fidelity mid-circuit measurements and fine control over the evolving unitaries. Here, we report the realization of a measurement-induced entanglement transition on superconducting quantum processors with mid-circuit readout capability. We directly observe extensive and sub-extensive scaling of entanglement entropy in the volume- and area-law phases, respectively, by varying the rate of projective measurements. We further demonstrate phenomenological critical behavior of the transition by performing a data collapse for different system sizes. Our work paves the way for the use of mid-circuit measurement as an effective resource for quantum simulation on near-term quantum computers, for instance by facilitating the study of dynamic and long-range entangled quantum phases., Comment: 10 pages, 4 figures; supplementary material 7 pages, 6 figures

Quantum simulations of the hydroxide anion and hydroxyl radical are reported, employing variational quantum algorithms for near-term quantum devices. The energy of each species is calculated along the dissociation curve, to obtain information about the stability of the molecular species being investigated. It is shown that simulations restricted to valence spaces incorrectly predict the hydroxyl radical to be more stable than the hydroxide anion. Inclusion of dynamical electron correlation from non-valence orbitals is demonstrated, through the integration of the variational quantum eigensolver and quantum subspace expansion methods in the workflow of N-electron valence perturbation theory, and shown to correctly predict the hydroxide anion to be more stable than the hydroxyl radical, provided that basis sets with diffuse orbitals are also employed. Finally, we calculate the electron affinity of the hydroxyl radical using an aug-cc-pVQZ basis on IBM's quantum devices., Comment: 12 pages, 6 figures

The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wavefunctions that are relevant in the behavior of the system under study. Hamiltonian symmetries are an important instrument, to classify relevant many-particle wavefunctions, and to improve the efficiency of numerical simulations. In this work, quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers are presented. Two different strategies are discussed and compared: exact recursive construction of total spin eigenfunctions based on the addition theorem of angular momentum, and heuristic approximation of total spin eigenfunctions based on the variational optimization of a suitable cost function. The construction of these quantum circuits is illustrated in detail, and the preparation of total spin eigenfunctions is demonstrated on IBM quantum devices, focusing on 3- and 5-spin systems on graphs with triangle connectivity., Comment: 15 pages, 14 figures, 6 tables

Digital quantum computers provide a computational framework for solving the Schr\"{o}dinger equation for a variety of many-particle systems. Quantum computing algorithms for the quantum simulation of these systems have recently witnessed remarkable growth, notwithstanding the limitations of existing quantum hardware, especially as a tool for electronic structure computations in molecules. In this review, we provide a self-contained introduction to emerging algorithms for the simulation of Hamiltonian dynamics and eigenstates, with emphasis on their applications to the electronic structure in molecular systems. Theoretical foundations and implementation details of the method are discussed, and their strengths, limitations, and recent advances are presented., Comment: 42 pages, 18 figures

The determination of optimal open-pit profiles is a well-studied combinatorial optimization problem, with profound technical and conceptual relevance in computational mining. The ongoing evolution of quantum computing hardware and the recent advances of heuristic quantum algorithms make it worthwhile to explore the solution of the open-pit mining problem on quantum computers. In this work, we cast the open-pit mining problem as a Hamiltonian ground-state search problem, which in turn we solve with a dedicated implementation of the variational quantum eigensolver algorithm, and we propose a domain decomposition approach to extend the reach of today's small scale quantum hardware. The procedure is demonstrated on IBMQ devices using four qubits. This is the first example, to the best of our knowledge, of open-pit profile calculations being performed on quantum hardware., Comment: 12 pages, 12 figures

Quantum computers are promising for simulations of chemical and physical systems, but the limited capabilities of today's quantum processors permit only small, and often approximate, simulations. Here we present a method, classical entanglement forging, that harnesses classical resources to capture quantum correlations and double the size of the system that can be simulated on quantum hardware. Shifting some of the computation to classical post-processing allows us to represent ten spin-orbitals on five qubits of an IBM Quantum processor to compute the ground state energy of the water molecule in the most accurate simulation to date. We discuss conditions for applicability of classical entanglement forging and present a roadmap for scaling to larger problems.

We demonstrate a method that merges the quantum filter diagonalization (QFD) approach for hybrid quantum/classical solution of the time-independent electronic Schr\"odinger equation with a low-rank double factorization (DF) approach for the representation of the electronic Hamiltonian. In particular, we explore the use of sparse "compressed" double factorization (C-DF) truncation of the Hamiltonian within the time-propagation elements of QFD, while retaining a similarly compressed but numerically converged double-factorized representation of the Hamiltonian for the operator expectation values needed in the QFD quantum matrix elements. Together with significant circuit reduction optimizations and number-preserving post-selection/echo-sequencing error mitigation strategies, the method is found to provide accurate predictions for low-lying eigenspectra in a number of representative molecular systems, while requiring reasonably short circuit depths and modest measurement costs. The method is demonstrated by experiments on noise-free simulators, decoherence- and shot-noise including simulators, and real quantum hardware.

Quantum simulation on emerging quantum hardware is a topic of intense interest. While many studies focus on computing ground state properties or simulating unitary dynamics of closed systems, open quantum systems are an interesting target of study owing to their ubiquity and rich physical behavior. However, their non-unitary dynamics are also not natural to simulate on digital quantum devices. Here, we report algorithms for the digital quantum simulation of the dynamics of open quantum systems governed by a Lindblad equation using adaptations of the quantum imaginary time evolution (QITE) algorithm. We demonstrate the algorithms on IBM Quantum's hardware with simulations of the spontaneous emission of a two level system and the dissipative transverse field Ising model. Our work advances efforts to simulate the dynamics of open quantum systems on quantum hardware., Comment: 31 pages, 6 figures, 1 table

We present accurate many-body results of the electronic densities in several solid materials, including Si, NaCl, and Cu. These results are obtained using the ab initio auxiliary-field quantum Monte Carlo (AFQMC) method working in a plane-wave basis with norm-conserving, multiple-projector pseudopotentials. AFQMC has been shown to be an excellent many-body total energy method. Computation of observables and correlation functions other than the ground-state energy requires back-propagation, whose adaption and implementation in the plane-wave basis AFQMC framework are discussed in the present paper. This development allows us to compute correlation functions, electronic densities and interatomic forces, paving the way for geometry optimizations and calculations of thermodynamic properties in solids. Finite supercell size effects are considerably more subtle in the many-body framework than in independent-electron calculations. We analyze the convergence of the electronic density, and obtain best estimates for the thermodynamic limit. The densities from several typical density functionals are benchmarked against our near-exact results. The electronic densities we have obtained can also be used to help construct improved density functionals., Comment: 14 pages, 13 figures

Quantum simulations of molecular systems on quantum computers often employ minimal basis sets of Gaussian orbitals. In comparison with more realistic basis sets, quantum simulations employing minimal basis sets require fewer qubits and quantum gates, but yield results of lower accuracy. A natural strategy to achieve more accurate results is to increase the basis set size, which in turn requires increasing the number of qubits and quantum gates. Here we explore the use of intrinsic atomic orbitals (IAOs) in quantum simulations of molecules, to improve the accuracy of energies and properties at the same computational cost required by a minimal basis. We investigate ground-state energies and one- and two-body density operators in the framework of the variational quantum eigensolver, employing and comparing different Ans\"{a}tze. We also demonstrate the use of this approach in the calculation of ground- and excited-states energies of small molecules by a combination of quantum algorithms, using IBM Quantum computers., Comment: 14 pages, 14 figures. Published in Physical Review A

Developing scalable quantum algorithms to study finite-temperature physics of quantum many-body systems has attracted considerable interest due to recent advancements in quantum hardware. However, such algorithms in their present form require resources that exceed the capabilities of current quantum computers except for a limited range of system sizes and observables. Here, we report calculations of finite-temperature properties including energies, static and dynamical correlation functions, and excitation spectra of spin Hamiltonians with up to four sites on five-qubit IBM Quantum devices. These calculations are performed using the quantum imaginary time evolution (QITE) algorithm and made possible by several algorithmic improvements, including a method to exploit symmetries that reduces the quantum resources required by QITE, circuit optimization procedures to reduce circuit depth, and error mitigation techniques to improve the quality of raw hardware data. Our work demonstrates that the ansatz-independent QITE algorithm is capable of computing diverse finite-temperature observables on near-term quantum devices., Comment: 14 pages, 10 figures

A quantum chemistry study of the first singlet (S1) and triplet (T1) excited states of phenylsulfonyl-carbazole compounds, proposed as useful thermally activated delayed fluorescence (TADF) emitters for organic light emitting diode (OLED) applications, was performed with the quantum Equation-Of-Motion Variational Quantum Eigensolver (qEOM-VQE) and Variational Quantum Deflation (VQD) algorithms on quantum simulators and devices. These quantum simulations were performed with double zeta quality basis sets on an active space comprising the highest occupied and lowest unoccupied molecular orbitals (HOMO, LUMO) of the TADF molecules. The differences in energy separations between S1 and T1 ($\Delta E_{st}$) predicted by calculations on quantum simulators were found to be in excellent agreement with experimental data. Differences of 16 and 88 mHa with respect to exact energies were found for excited states by using the qEOM-VQE and VQD algorithms, respectively, to perform simulations on quantum devices without error mitigation. By utilizing error mitigation by state tomography to purify the quantum states and correct energy values, the large errors found for unmitigated results could be improved to differences of, at most, 3 mHa with respect to exact values. Consequently, excellent agreement could be found between values of $\Delta E_{st}$ predicted by quantum simulations and those found in experiments., Comment: 18 pages, 14 figures

Quantum simulations of electronic structure with a transformed Hamiltonian that includes some electron correlation effects are demonstrated. The transcorrelated Hamiltonian used in this work is efficiently constructed classically, at polynomial cost, by an approximate similarity transformation with an explicitly correlated two-body unitary operator. This Hamiltonian is Hermitian, includes no more than two-particle interactions, and is free of electron-electron singularities. We investigate the effect of such a transformed Hamiltonian on the accuracy and computational cost of quantum simulations by focusing on a widely used solver for the Schrodinger equation, namely the variational quantum eigensolver method, based on the unitary coupled cluster with singles and doubles (q-UCCSD) Ansatz. Nevertheless, the formalism presented here translates straightforwardly to other quantum algorithms for chemistry. Our results demonstrate that a transcorrelated Hamiltonian, paired with extremely compact bases, produces explicitly correlated energies comparable to those from much larger bases. For the chemical species studied here, explicitly correlated energies based on an underlying 6-31G basis had cc-pVTZ quality. The use of the very compact transcorrelated Hamiltonian reduces the number of CNOT gates required to achieve cc-pVTZ quality by up to two orders of magnitude, and the number of qubits by a factor of three., Comment: 13 pages, 7 figures

We study the isentropic evolution of the matter produced in relativistic heavy-ion collisions for various values of the entropy-per-baryon ratio of interest for the ongoing and future experimental searches for the critical endpoint (CEP) in the QCD phase diagram: these includes the current Beam-Energy-Scan (BES) program at RHIC and the fixed-target collisions foreseen for the near future at various facilities. We describe the hot-dense matter through two different effective Lagrangians: the PNJL (Polyakov-Nambu-Jona-Lasinio) and the PQM (Polyakov-quark-meson) models. We focus on quantities expected to have a direct experimental relevance: the speed of sound, responsible for the collective acceleration of the fireball, and the generalized susceptibilities, connected to the cumulants of the distributions of conserved charges. In principle, they should affect the momentum spectra and the event-by-event fluctuations of the yields of identified particles. Taking realistic values for the initial temperature and the entropy-per-baryon ratio we study the temporal evolution of the above quantities looking for differences along isentropic trajectories covering different regions of the QCD phase diagram, passing far or close to the CEP or even intersecting the first-order critical line.

PYSCF is a Python-based general-purpose electronic structure platform that both supports first-principles simulations of molecules and solids, as well as accelerates the development of new methodology and complex computational workflows. The present paper explains the design and philosophy behind PYSCF that enables it to meet these twin objectives. With several case studies, we show how users can easily implement their own methods using PYSCF as a development environment. We then summarize the capabilities of PYSCF for molecular and solid-state simulations. Finally, we describe the growing ecosystem of projects that use PYSCF across the domains of quantum chemistry, materials science, machine learning and quantum information science.

As we begin to reach the limits of classical computing, quantum computing has emerged as a technology that has captured the imagination of the scientific world. While for many years, the ability to execute quantum algorithms was only a theoretical possibility, recent advances in hardware mean that quantum computing devices now exist that can carry out quantum computation on a limited scale. Thus it is now a real possibility, and of central importance at this time, to assess the potential impact of quantum computers on real problems of interest. One of the earliest and most compelling applications for quantum computers is Feynman's idea of simulating quantum systems with many degrees of freedom. Such systems are found across chemistry, physics, and materials science. The particular way in which quantum computing extends classical computing means that one cannot expect arbitrary simulations to be sped up by a quantum computer, thus one must carefully identify areas where quantum advantage may be achieved. In this review, we briefly describe central problems in chemistry and materials science, in areas of electronic structure, quantum statistical mechanics, and quantum dynamics, that are of potential interest for solution on a quantum computer. We then take a detailed snapshot of current progress in quantum algorithms for ground-state, dynamics, and thermal state simulation, and analyze their strengths and weaknesses for future developments., Comment: 33 pages, 21 figures

Quantum chemistry simulations of some industrially relevant molecules are reported, employing variational quantum algorithms for near-term quantum devices. The energies and dipole moments are calculated along the dissociation curves for lithium hydride (LiH), hydrogen sulfide, lithium hydrogen sulfide and lithium sulfide. In all cases we focus on the breaking of a single bond, to obtain information about the stability of the molecular species being investigated. We calculate energies and a variety of electrostatic properties of these molecules using classical simulators of quantum devices, with up to 21 qubits for lithium sulfide. Moreover, we calculate the ground-state energy and dipole moment along the dissociation pathway of LiH using IBM quantum devices. This is the first example, to the best of our knowledge, of dipole moment calculations being performed on quantum hardware., Comment: 7 pages, 10 figures

Accurate and predictive computations of the quantum-mechanical behavior of many interacting electrons in realistic atomic environments are critical for the theoretical design of materials with desired properties, and require solving the grand-challenge problem of the many-electron Schrodinger equation. An infinite chain of equispaced hydrogen atoms is perhaps the simplest realistic model for a bulk material, embodying several central themes of modern condensed matter physics and chemistry, while retaining a connection to the paradigmatic Hubbard model. Here we report a combined application of cutting-edge computational methods to determine the properties of the hydrogen chain in its quantum-mechanical ground state. Varying the separation between the nuclei leads to a rich phase diagram, including a Mott phase with quasi long-range antiferromagnetic order, electron density dimerization with power-law correlations, an insulator-to-metal transition and an intricate set of intertwined magnetic orders., Comment: 9 pages, 5 figures, supplemental information included as ancillary file

We describe the ground- and excited-state electronic structure of bulk MnO and NiO, two prototypical correlated electron materials, using coupled cluster theory with single and double excitations (CCSD). As a corollary, this work also reports the first implementation of unrestricted periodic ab initio equation-of motion CCSD. Starting from a Hartree-Fock reference, we find fundamental gaps of 3.46 eV and 4.83 eV for MnO and NiO respectively for the 16 unit supercell, slightly overestimated compared to experiment, although finite-size scaling suggests that the gap is more severely overestimated in the thermodynamic limit. From the character of the correlated electronic bands we find both MnO and NiO to lie in the intermediate Mott/charge-transfer insulator regime, although NiO appears as a charge transfer insulator when only the fundamental gap is considered. While the lowest quasiparticle excitations are of metal 3d and O 2p character in most of the Brillouin zone, near the {\Gamma} point, the lowest conduction band quasiparticles are of s character. Our study supports the potential of coupled cluster theory to provide high level many-body insights into correlated solids.