Elucidating reaction mechanisms on quantum computers

Simultaneously Optimizing Symmetry Shifts and Tensor Factorizations for Cost-Efficient Fault-Tolerant Quantum Simulations of Electronic Hamiltonians

In fault-tolerant quantum computing, the cost of calculating Hamiltonian eigenvalues using the quantum phase estimation algorithm is proportional to the constant scaling the Hamiltonian matrix block-encoded in a unitary circuit. We present a method to reduce this scaling constant for the electronic Hamiltonians represented as a linear combination of unitaries. Our approach combines the double tensor-factorization method of Burg et al. with the block-invariant symmetry shift method of Loaiza and Izmaylov. By extending the electronic Hamiltonian with appropriately parametrized symmetry operators and optimizing the tensor factorization parameters, our method achieves a 25% reduction in the block-encoding scaling constant compared to previous best techniques for industrially and biologically relevant molecules, including the nitrogenase cofactor (FeMoCo) and cytochrome P450. Benchmark calculations comparing our method with the original double-factorization method show a 75% reduction in the block-encoding scaling constant. The resulting savings in the number of non-Clifford T-gates, which are an essential resource for fault-tolerant quantum computation, are expected to accelerate the journey to the feasibility of practical Hamiltonian simulations.

Multiscale Embedding for Quantum Computing

We present a novel multiscale embedding scheme that links conventional QM/MM embedding and bootstrap embedding (BE) to allow simulations of large chemical systems on limited quantum devices. We also propose a mixed-basis BE scheme that facilitates BE calculations on extended systems using classical computers with limited memory resources. Benchmark data suggest the combination of these two strategies as a robust path in attaining the correlation energies of large realistic systems, combining the proven accuracy of BE with chemical and biological systems of interest in a lower computational cost method. Due to the flexible tunability of the resource requirements and systematic fragment construction, future developments in the realization of quantum computers naturally offer improved accuracy for multiscale BE calculations.

Calculating the Energy Profile of an Enzymatic Reaction on a Quantum Computer

Quantum computing (QC) provides a promising avenue for enabling quantum chemistry calculations, which are classically impossible due to computational complexity that increases exponentially with system size. As fully fault-tolerant algorithms and hardware, for which an exponential speedup is predicted, are currently out of reach, recent research efforts have been dedicated to developing and scaling algorithms for Noisy Intermediate-Scale Quantum (NISQ) devices to showcase the practical usefulness of such machines. To demonstrate the usefulness of NISQ devices in the field of chemistry, we apply our recently developed FAST-VQE algorithm and a state-of-the-art quantum gate reduction strategy based on propositional satisfiability together with standard optimization tools for the simulation of the rate-determining proton transfer step for CO2 hydration catalyzed by carbonic anhydrase resulting in the first application of a quantum computing device for the simulation of an enzymatic reaction. To this end, we have combined classical force field simulations with quantum mechanical methods on classical and quantum computers in a hybrid calculation approach. The presented technique significantly enhances the accuracy and capabilities of QC-based molecular modeling and finally pushes it into compelling and realistic applications. The framework is general and can be applied beyond the case of computational enzymology.

A quantum random access memory (QRAM) using a polynomial encoding of binary strings

Quantum algorithms claim significant speedup over their classical counterparts for solving many problems. An important aspect of many of these algorithms is the existence of a quantum oracle, which needs to be implemented efficiently in order to realize the claimed advantages in practice. A quantum random access memory (QRAM) is a promising architecture for realizing these oracles. In this paper we develop a new design for QRAM and implement it with Clifford+T circuit. We focus on optimizing the T-count and T-depth since non-Clifford gates are the most expensive to implement fault-tolerantly in most error correction schemes. Integral to our design is a polynomial encoding of bit strings and so we refer to this design as [Formula: see text]. Compared to the previous state-of-the-art bucket brigade architecture for QRAM, we achieve an exponential improvement in T-depth, while reducing T-count and keeping the qubit-count same. Specifically, if N is the number of memory locations to be queried, then [Formula: see text] has T-depth [Formula: see text], T-count [Formula: see text] and uses O(N) logical qubits, while the bucket brigade circuit has T-depth [Formula: see text], T-count O(N) and uses O(N) qubits. Combining two [Formula: see text] we design a quantum look-up-table, [Formula: see text], that has T-depth [Formula: see text], T-count [Formula: see text] and qubit count [Formula: see text]. A quantum look-up table (qLUT) or quantum read-only memory (QROM) has restricted functionality than a QRAM. For example, it cannot write into a memory location and the circuit needs to be compiled each time the contents of the memory change. The previous state-of-the-art CSWAP architecture has T-depth [Formula: see text], T-count [Formula: see text] and qubit count [Formula: see text]. Thus we achieve a double exponential improvement in T-depth while keeping the T-count and qubit-count asymptotically same. Additionally, with our polynomial encoding of bit strings, we develop a method to optimize the Toffoli-count of circuits, specially those consisting of multi-controlled-NOT gates.

Manipulations of a transmon qubit with a null-biased electro-optic fiber link

In recent years, significant progress has been made in the field of superconducting quantum circuits, particularly in improving the complexity of quantum processors for large-scale quantum computing and quantum simulation tasks. To enable the execution of quantum information processing tasks on large-scale quantum circuits containing millions of qubits, it is essential to minimize thermal effects on control and measurement lines, ensuring that circuit components are superconducting and that qubits are not significantly thermally excited. Recent studies have shown that a quadrature-biased electro-optic fiber link can operate qubits with a much reduced thermal load, thereby facilitating the simultaneous operation of a large number of qubits. Expanding on this, here we propose and demonstrate that coherent manipulations of superconducting qubits can also be achieved by setting the bias point of the electro-optic modulator at the null point instead of the quadrature point. Major advantages of our null-point bias method include further reduction of the thermal load and improvement of the signal-to-noise ratio, and relaxed requirement for experimental implementations. Simultaneous control of two qubits is also demonstrated using the proposed null-biased fiber-optic link, which is the first time to the best of our knowledge.

Massively Parallel Tensor Network State Algorithms on Hybrid CPU-GPU Based Architectures

The interplay of quantum and classical simulation and the delicate divide between them is in the focus of massively parallelized tensor network state (TNS) algorithms designed for high performance computing (HPC). In this contribution, we present novel algorithmic solutions together with implementation details to extend current limits of TNS algorithms on HPC infrastructure building on state-of-the-art hardware and software technologies. Benchmark results obtained via large-scale density matrix renormalization group (DMRG) simulations on single node multiGPU NVIDIA A100 system are presented for selected strongly correlated molecular systems addressing problems on Hilbert space dimensions up to 4.17 × 1035.

Global Minimization of Electronic Hamiltonian 1-Norm via Linear Programming in the Block Invariant Symmetry Shift (BLISS) Method

The cost of encoding a system Hamiltonian in a digital quantum computer as a linear combination of unitaries (LCU) grows with the 1-norm of the LCU expansion. The Block Invariant Symmetry Shift (BLISS) technique reduces this 1-norm by modifying the Hamiltonian action on only the undesired electron-number subspaces. Previously, BLISS required a computationally expensive nonlinear optimization that was not guaranteed to find the global minimum. Here, we introduce various reformulations of this optimization as a linear programming problem, which guarantees optimality and significantly reduces the computational cost. We apply BLISS to industrially relevant homogeneous catalysts in active spaces of up to 76 orbitals, finding substantial reductions in both the spectral range of the modified Hamiltonian and the 1-norms of Pauli and fermionic LCUs. Our linear programming techniques for obtaining the BLISS operator enable more efficient Hamiltonian simulation and, by reducing the Hamiltonian's spectral range, offer opportunities for improved LCU groupings to further reduce the 1-norm.

Modeling Heterogeneous Catalysis Using Quantum Computers: An Academic and Industry Perspective

Heterogeneous catalysis plays a critical role in many industrial processes, including the production of fuels, chemicals, and pharmaceuticals, and research to improve current catalytic processes is important to make the chemical industry more sustainable. Despite its importance, the challenge of identifying optimal catalysts with the required activity and selectivity persists, demanding a detailed understanding of the complex interactions between catalysts and reactants at various length and time scales. Density functional theory (DFT) has been the workhorse in modeling heterogeneous catalysis for more than three decades. While DFT has been instrumental, this review explores the application of quantum computing algorithms in modeling heterogeneous catalysis, which could bring a paradigm shift in our approach to understanding catalytic interfaces. Bridging academic and industrial perspectives by focusing on emerging materials, such as multicomponent alloys, single-atom catalysts, and magnetic catalysts, we delve into the limitations of DFT in capturing strong correlation effects and spin-related phenomena. The review also presents important algorithms and their applications relevant to heterogeneous catalysis modeling to showcase advancements in the field. Additionally, the review explores embedding strategies where quantum computing algorithms handle strongly correlated regions, while traditional quantum chemistry algorithms address the remainder, thereby offering a promising approach for large-scale heterogeneous catalysis modeling. Looking forward, ongoing investments by academia and industry reflect a growing enthusiasm for quantum computing's potential in heterogeneous catalysis research. The review concludes by envisioning a future where quantum computing algorithms seamlessly integrate into research workflows, propelling us into a new era of computational chemistry and thereby reshaping the landscape of modeling heterogeneous catalysis.

Cryogenic III-V and Nb electronics integrated on silicon for large-scale quantum computing platforms

Quantum computers now encounter the significant challenge of scalability, similar to the issue that classical computing faced previously. Recent results in high-fidelity spin qubits manufactured with a Si CMOS technology, along with demonstrations that cryogenic CMOS-based control/readout electronics can be integrated into the same chip or die, opens up an opportunity to break out the challenges of qubit size, I/O, and integrability. However, the power consumption of cryogenic CMOS-based control/readout electronics cannot support thousands or millions of qubits. Here, we show that III-V two-dimensional electron gas and Nb superconductor-based cryogenic electronics can be integrated with Si and operate at extremely low power levels, enabling the control and readout for millions of qubits. Our devices offer a unity gain cutoff frequency of 601 GHz, a unity power gain cutoff frequency of 593 GHz, and a low noise indication factorI D g m - 1 of 0.21 Vmm S - 1 at 4 K using more than 10 times less power consumption than CMOS.

Trapped-ion quantum simulation of electron transfer models with tunable dissipation

Electron transfer is at the heart of many fundamental physical, chemical, and biochemical processes essential for life. The exact simulation of these reactions is often hindered by the large number of degrees of freedom and by the essential role of quantum effects. Here, we experimentally simulate a paradigmatic model of molecular electron transfer using a multispecies trapped-ion crystal, where the donor-acceptor gap, the electronic and vibronic couplings, and the bath relaxation dynamics can all be controlled independently. By manipulating both the ground-state and optical qubits, we observe the real-time dynamics of the spin excitation, measuring the transfer rate in several regimes of adiabaticity and relaxation dynamics. Our results provide a testing ground for increasingly rich models of molecular excitation transfer processes that are relevant for molecular electronics and light-harvesting systems.

Workflow for practical quantum chemical calculations with a quantum phase estimation algorithm: electronic ground and π-π* excited states of benzene and its derivatives

Quantum computers are expected to perform full-configuration interaction calculations with less computational resources compared to classical ones, thanks to the use of quantum phase estimation (QPE) algorithms. However, only a limited number of QPE-based quantum chemical calculations have been reported even for numerical simulations on a classical computer, and the practical workflow for the QPE computation has not yet been established. In this paper, we report the QPE simulations of the electronic ground and the π-π* excited singlet state of benzene and its chloro- and nitro-derivatives as the representative industrially important systems, with the aid of GPGPU acceleration of quantum circuit simulations. We adopted the pseudo-natural orbitals obtained from the MP2 calculation as the basis for the wave function expansion, the CISD calculation within the active space to find the main electronic configurations to be included in the input wave function of the excited state, and the technique to reduce the truncation error of the calculated total energies. The proposed computational workflow is easily applicable to other molecules and can be a standard approach for performing QPE-based quantum chemical calculations of practical molecules.

Similarity between oxygen evolution in photosystem II and oxygen reduction in cytochrome c oxidase via proton coupled electron transfers. A unified view of the oxygenic life from four electron oxidation-reduction reactions

Basic concepts and theoretical foundations of broken symmetry (BS) and post BS methods for strongly correlated electron systems (SCES) such as electron-transfer (ET) diradical, multi-center polyradicals with spin frustration are described systematically to elucidate structures, bonding and reactivity of the high-valent transition metal oxo bonds in metalloenzymes: photosystem II (PSII) and cytochrome c oxidase (CcO). BS hybrid DFT (HDFT) and DLPNO coupled-cluster (CC) SD(T0) computations are performed to elucidate electronic and spin states of CaMn4Ox cluster in the key step for oxygen evolution, namely S4 [S3 with Mn(IV) = O + Tyr161-O radical] state of PSII and PM [Fe(IV) = O + HO-Cu(II) + Tyr161-O radical] step for oxygen reduction in CcO. The cycle of water oxidation catalyzed by the CaMn4Ox cluster in PSII and the cycle of oxygen reduction catalyzed by the CuA-Fea-Fea3-CuB cluster in CcO are examined on the theoretical grounds, elucidating similar concerted and/or stepwise proton transfer coupled electron transfer (PT-ET) processes for the four-electron oxidation in PSII and four-electron reduction in CcO. Interplay between theory and experiments have revealed that three electrons in the metal sites and one electron in tyrosine radical site are characteristic for PT-ET in these biological redox reaction systems, indicating no necessity of harmful Mn(V) = O and Fe(V) = O bonds with strong oxyl-radical character. Implications of the computational results are discussed in relation to design of artificial systems consisted of earth abundant transition metals for water oxidation.

Quantum algorithms for scientific computing

Quantum computing promises to provide the next step up in computational power for diverse application areas. In this review, we examine the science behind the quantum hype, and the breakthroughs required to achieve true quantum advantage in real world applications. Areas that are likely to have the greatest impact on high performance computing (HPC) include simulation of quantum systems, optimization, and machine learning. We draw our examples from electronic structure calculations and computational fluid dynamics which account for a large fraction of current scientific and engineering use of HPC. Potential challenges include encoding and decoding classical data for quantum devices, and mismatched clock speeds between classical and quantum processors. Even a modest quantum enhancement to current classical techniques would have far-reaching impacts in areas such as weather forecasting, aerospace engineering, and the design of 'green' materials for sustainable development. This requires significant effort from the computational science, engineering and quantum computing communities working together.

Tensor Network State Algorithms on AI Accelerators

We introduce novel algorithmic solutions for hybrid CPU-multiGPU tensor network state algorithms utilizing non-Abelian symmetries building on AI-motivated state-of-the-art hardware and software technologies. The presented numerical simulations on the FeMo cofactor, which plays a crucial role in converting atmospheric nitrogen to ammonia, are far beyond the scope of traditional approaches. Our large-scale SU(2) spin adapted density matrix renormalization group calculations up to bond dimension D = 216 on complete active space (CAS) size of 18 electrons in 18 orbitals [CAS(18, 18)] demonstrate that the current limit of exact solution, i.e. full-CI limit, can be achieved in fraction of time. Furthermore, benchmarks up to CAS(113, 76) demonstrate the utilization of NVIDIA's highly specialized AI accelerators via NVIDIA Tensor Cores, leading to performance around 115 TFLOPS on a single node supplied with eight NVIDIA A100 devices. As a consequence of reaching 71% of the full capacity of the hardware, the cubic scaling of computational time with bond dimension can be reduced to a linear form for a broad range of D values; thus, breaking the current computational limits of small CAS spaces in ab initio quantum chemistry and material science is becoming a reality. In comparison to strict U(1) implementations with matching accuracy, our solution has an estimated effective performance of 300-500 TFLOPS, which emphasizes the mutual need for both algorithmic and technological developments to push current frontiers on classical computation.

Subspace-Search Quantum Imaginary Time Evolution for Excited State Computations

Quantum systems in excited states are attracting significant interest with the advent of noisy intermediate-scale quantum (NISQ) devices. While ground states of small molecular systems are typically explored using hybrid variational algorithms like the variational quantum eigensolver (VQE), the study of excited states has received much less attention, partly due to the absence of efficient algorithms. In this work, we introduce the subspace search quantum imaginary time evolution (SSQITE) method, which calculates excited states using quantum devices by integrating key elements of the subspace search variational quantum eigensolver (SSVQE) and the variational quantum imaginary time evolution (VarQITE) method. The effectiveness of SSQITE is demonstrated through calculations of low-lying excited states of benchmark model systems including H2 and LiH molecules. A toy Hamiltonian is also employed to demonstrate that the robustness of VarQITE in avoiding local minima extends to its use in excited state algorithms. With this robustness in avoiding local minima, SSQITE shows promise for advancing quantum computations of excited states across a wide range of applications.

Parallel Implementation of the Density Matrix Renormalization Group Method Achieving a Quarter petaFLOPS Performance on a Single DGX-H100 GPU Node

We report cutting edge performance results on a single node hybrid CPU-multi-GPU implementation of the spin adapted ab initio Density Matrix Renormalization Group (DMRG) method on current state-of-the-art NVIDIA DGX-H100 architectures. We evaluate the performance of the DMRG electronic structure calculations for the active compounds of the FeMoco, the primary cofactor of nitrogenase, and cytochrome P450 (CYP) enzymes with complete active space (CAS) sizes of up to 113 electrons in 76 orbitals [CAS(113, 76)] and 63 electrons in 58 orbitals [CAS(63, 58)], respectively. We achieve 246 teraFLOPS of sustained performance, an improvement of more than 2.5× compared to the performance achieved on the DGX-A100 architectures and an 80× acceleration compared to an OpenMP parallelized implementation on a 128-core CPU architecture. Our work highlights the ability of tensor network algorithms to efficiently utilize high-performance multi-GPU hardware and shows that the combination of tensor networks with modern large-scale GPU accelerators can pave the way toward solving some of the most challenging problems in quantum chemistry and beyond.

Size-consistency and orbital-invariance issues revealed by VQE-UCCSD calculations with the FMO scheme

The fragment molecular orbital (FMO) scheme is one of the popular fragmentation-based methods and has the potential advantage of making the circuit shallow for quantum chemical calculations on quantum computers. In this study, we used a GPU-accelerated quantum simulator (cuQuantum) to perform the electron correlation part of the FMO calculation as unitary coupled-cluster singles and doubles (UCCSD) with the variational quantum eigensolver (VQE) for hydrogen-bonded (FH)  3 and (FH)  2 -H  2 O systems with the STO-3G basis set. VQE-UCCSD calculations were performed using both canonical and localized MO sets, and the results were examined from the point of view of size-consistency and orbital-invariance affected by the Trotter error. It was found that the use of localized MO leads to better results, especially for (FH)  2 -H  2 O. The GPU acceleration was substantial for the simulations with larger numbers of qubits, and was about a factor of 6.7-7.7 for 18 qubit systems.

Scalable Atomic Arrays for Spin-Based Quantum Computers in Silicon

Semiconductor spin qubits combine excellent quantum performance with the prospect of manufacturing quantum devices using industry-standard metal-oxide-semiconductor (MOS) processes. This applies also to ion-implanted donor spins, which further afford exceptional coherence times and large Hilbert space dimension in their nuclear spin. Here multiple strategies are demonstrated and integrated to manufacture scale-up donor-based quantum computers. 31PF2 molecule implants are used to triple the placement certainty compared to 31P ions, while attaining 99.99% confidence in detecting the implant. Similar confidence is retained by implanting heavier atoms such as 123Sb and 209Bi, which represent high-dimensional qudits for quantum information processing, while Sb2 molecules enable deterministic formation of closely-spaced qudits. The deterministic formation of regular arrays of donor atoms with 300 nm spacing is demonstrated, using step-and-repeat implantation through a nano aperture. These methods cover the full gamut of technological requirements for the construction of donor-based quantum computers in silicon.

Ab initio extended Hubbard model of short polyenes for efficient quantum computing

We propose introducing an extended Hubbard Hamiltonian derived via the ab initio downfolding method, which was originally formulated for periodic materials, toward efficient quantum computing of molecular electronic structure calculations. By utilizing this method, the first-principles Hamiltonian of chemical systems can be coarse-grained by eliminating the electronic degrees of freedom in higher energy space and reducing the number of terms of electron repulsion integral from O(N4) to O(N2). Our approach is validated numerically on the vertical excitation energies and excitation characters of ethylene, butadiene, and hexatriene. The dynamical electron correlation is incorporated within the framework of the constrained random phase approximation in advance of quantum computations, and the constructed models capture the trend of experimental and high-level quantum chemical calculation results. As expected, the L1-norm of the fermion-to-qubit mapped model Hamiltonians is significantly lower than that of conventional ab initio Hamiltonians, suggesting improved scalability of quantum computing. Those numerical outcomes and the results of the simulation of excited-state sampling demonstrate that the ab initio extended Hubbard Hamiltonian may hold significant potential for quantum chemical calculations using quantum computers.

Sweet-spot operation of a germanium hole spin qubit with highly anisotropic noise sensitivity

Spin qubits defined by valence band hole states are attractive for quantum information processing due to their inherent coupling to electric fields, enabling fast and scalable qubit control. Heavy holes in germanium are particularly promising, with recent demonstrations of fast and high-fidelity qubit operations. However, the mechanisms and anisotropies that underlie qubit driving and decoherence remain mostly unclear. Here we report the highly anisotropic heavy-hole g-tensor and its dependence on electric fields, revealing how qubit driving and decoherence originate from electric modulations of the g-tensor. Furthermore, we confirm the predicted Ising-type hyperfine interaction and show that qubit coherence is ultimately limited by 1/f charge noise, where f is the frequency. Finally, operating the qubit at low magnetic field, we measure a dephasing time ofT 2 *  = 17.6 μs, maintaining single-qubit gate fidelities well above 99% even at elevated temperatures of T > 1 K. This understanding of qubit driving and decoherence mechanisms is key towards realizing scalable and highly coherent hole qubit arrays.

Reducing the Runtime of Fault-Tolerant Quantum Simulations in Chemistry through Symmetry-Compressed Double Factorization

Quantum phase estimation based on qubitization is the state-of-the-art fault-tolerant quantum algorithm for computing ground-state energies in chemical applications. In this context, the 1-norm of the Hamiltonian plays a fundamental role in determining the total number of required iterations and also the overall computational cost. In this work, we introduce the symmetry-compressed double factorization (SCDF) approach, which combines a CDF of the Hamiltonian with the symmetry shift technique, significantly reducing the 1-norm value. The effectiveness of this approach is demonstrated numerically by considering various benchmark systems, including the FeMoco molecule, cytochrome P450, and hydrogen chains of different sizes. To compare the efficiency of SCDF to other methods in absolute terms, we estimate Toffoli gate requirements, which dominate the execution time on fault-tolerant quantum computers. For the systems considered here, SCDF leads to a sizable reduction of the Toffoli gate count in comparison to other variants of DF or even tensor hypercontraction, which is usually regarded as the most efficient approach for qubitization.

Multi-site integrated optical addressing of trapped ions

One of the most effective ways to advance the performance of quantum computers and quantum sensors is to increase the number of qubits or quantum resources in the system. A major technical challenge that must be solved to realize this goal for trapped-ion systems is scaling the delivery of optical signals to many individual ions. In this paper we demonstrate an approach employing waveguides and multi-mode interferometer splitters to optically address multiple 171Yb+ ions in a surface trap by delivering all wavelengths required for full qubit control. Measurements of hyperfine spectra and Rabi flopping were performed on the E2 clock transition, using integrated waveguides for delivering the light needed for Doppler cooling, state preparation, coherent operations, and detection. We describe the use of splitters to address multiple ions using a single optical input per wavelength and use them to demonstrate simultaneous Rabi flopping on two different transitions occurring at distinct trap sites. This work represents an important step towards the realization of scalable integrated photonics for atomic clocks and trapped-ion quantum information systems.

Seeking a quantum advantage with trapped-ion quantum simulations of condensed-phase chemical dynamics

Simulating the quantum dynamics of molecules in the condensed phase represents a longstanding challenge in chemistry. Trapped-ion quantum systems may serve as a platform for the analog-quantum simulation of chemical dynamics that is beyond the reach of current classical-digital simulation. To identify a 'quantum advantage' for these simulations, performance analysis of both analog-quantum simulation on noisy hardware and classical-digital algorithms is needed. In this Review, we make a comparison between a noisy analog trapped-ion simulator and a few choice classical-digital methods on simulating the dynamics of a model molecular Hamiltonian with linear vibronic coupling. We describe several simple Hamiltonians that are commonly used to model molecular systems, which can be simulated with existing or emerging trapped-ion hardware. These Hamiltonians may serve as stepping stones towards the use of trapped-ion simulators for systems beyond the reach of classical-digital methods. Finally, we identify dynamical regimes in which classical-digital simulations seem to have the weakest performance with respect to analog-quantum simulations. These regimes may provide the lowest hanging fruit to make the most of potential quantum advantages.

Estimation of Electrostatic Interaction Energies on a Trapped-Ion Quantum Computer

We present the first hardware implementation of electrostatic interaction energies by using a trapped-ion quantum computer. As test system for our computation, we focus on the reduction of NO to N2O catalyzed by a nitric oxide reductase (NOR). The quantum computer is used to generate an approximate ground state within the NOR active space. To efficiently measure the necessary one-particle density matrices, we incorporate fermionic basis rotations into the quantum circuit without extending the circuit length, laying the groundwork for further efficient measurement routines using factorizations. Measurements in the computational basis are then used as inputs for computing the electrostatic interaction energies on a classical computer. Our experimental results strongly agree with classical noise-less simulations of the same circuits, finding electrostatic interaction energies within chemical accuracy despite hardware noise. This work shows that algorithms tailored to specific observables of interest, such as interaction energies, may require significantly fewer quantum resources than individual ground state energies would require in the straightforward supermolecular approach.

Calculating Potential Energy Surfaces with Quantum Computers by Measuring Only the Density Along Adiabatic Transitions

We show that chemically accurate potential energy surfaces (PESs) can be generated from quantum computers by measuring only the density along an adiabatic transition between different molecular geometries. In lieu of using phase estimation, the energy is evaluated by performing line-integration using the inverted real-space time-dependent density functional theory Kohn-Sham (KS) potential obtained from the geometry-varying densities of the full wave function. The accuracy of this method depends on the validity of the adiabatic evolution itself and the potential inversion process (which is theoretically exact but can be numerically unstable), whereas the total evolution time is the defining factor for the precision of phase estimation. We examine the method with a one-dimensional system of two electrons for both the ground and first triplet states in first quantization, as well as the ground state of three- and four-electron systems in second quantization. It is shown that few accurate measurements can be utilized to obtain chemical accuracy across the full potential energy curve, with a shorter propagation time than may be required using phase estimation for a similar accuracy. We also show that an accurate potential energy curve can be calculated by making many imprecise density measurements (using a few shots) along the time evolution and smoothing the resulting density evolution. Finally, it is important to note that the method is able to classically provide a check of its own accuracy by comparing the density resulting from a time-independent KS calculation using the inverted potential with the measured density. This can be used to determine whether longer adiabatic evolution times are required to satisfy the adiabatic theorem.

Solvent Distribution Effects on Quantum Chemical Calculations with Quantum Computers

We present a combination of three-dimensional reference interaction site model self-consistent field (3D-RISM-SCF) theory and the variational quantum eigensolver (VQE) to consider the solvent distribution effects within the framework of quantum-classical hybrid computing. The present method, 3D-RISM-VQE, does not include any statistical errors from the solvent configuration sampling owing to the analytical treatment of the statistical solvent distribution. We apply 3D-RISM-VQE to compute the spatial distribution functions of solvent water around a water molecule, the potential and Helmholtz energy curves of NaCl, and to analyze the Helmholtz energy component and related properties of H2O and NH4+. Moreover, we utilize 3D-RISM-VQE to analyze the extent to which solvent effects alter the efficiency of quantum calculations compared with calculations in the gas phase using the L1-norms of molecular electronic Hamiltonians. Our results demonstrate that the efficiency of quantum chemical calculations on a quantum computer in solution is virtually the same as that in the gas phase.

High-threshold and low-overhead fault-tolerant quantum memory

The accumulation of physical errors1-3 prevents the execution of large-scale algorithms in current quantum computers. Quantum error correction4 promises a solution by encoding k logical qubits onto a larger number n of physical qubits, such that the physical errors are suppressed enough to allow running a desired computation with tolerable fidelity. Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm5. We present an end-to-end quantum error correction protocol that implements fault-tolerant memory on the basis of a family of low-density parity-check codes6. Our approach achieves an error threshold of 0.7% for the standard circuit-based noise model, on par with the surface code7-10 that for 20 years was the leading code in terms of error threshold. The syndrome measurement cycle for a length-n code in our family requires n ancillary qubits and a depth-8 circuit with CNOT gates, qubit initializations and measurements. The required qubit connectivity is a degree-6 graph composed of two edge-disjoint planar subgraphs. In particular, we show that 12 logical qubits can be preserved for nearly 1 million syndrome cycles using 288 physical qubits in total, assuming the physical error rate of 0.1%, whereas the surface code would require nearly 3,000 physical qubits to achieve said performance. Our findings bring demonstrations of a low-overhead fault-tolerant quantum memory within the reach of near-term quantum processors.

Benford's Law and distributions for better drug design

INTRODUCTION

Modern drug discovery incorporates various tools and data, heralding the beginning of the data-driven drug design (DD) era. The distributions of chemical and physical data used for Artificial Intelligence (AI)/Machine Learning (ML) and to drive DD have thus become highly important to be understood and used effectively.

AREAS COVERED

The authors perform a comprehensive exploration of the statistical distributions driving the data-intensive era of drug discovery, including Benford's Law in AI/ML-based DD.

EXPERT OPINION

As the relevance of data-driven discovery escalates, we anticipate meticulous scrutiny of datasets utilizing principles like Benford's Law to enhance data integrity and guide efficient resource allocation and experimental planning. In this data-driven era of the pharmaceutical and medical industries, addressing critical aspects such as bias mitigation, algorithm effectiveness, data stewardship, effects, and fraud prevention are essential. Harnessing Benford's Law and other distributions and statistical tests in DD provides a potent strategy to detect data anomalies, fill data gaps, and enhance dataset quality. Benford's Law is a fast method for data integrity and quality of datasets, the backbone of AI/ML and other modeling approaches, proving very useful in the design process.

Applications of noisy quantum computing and quantum error mitigation to "adamantaneland": a benchmarking study for quantum chemistry

The field of quantum computing has the potential to transform quantum chemistry. The variational quantum eigensolver (VQE) algorithm has allowed quantum computing to be applied to chemical problems in the noisy intermediate-scale quantum (NISQ) era. Applications of VQE have generally focused on predicting absolute energies instead of chemical properties that are relative energy differences and that are most interesting to chemists studying a chemical problem. We address this shortcoming by constructing a molecular benchmark data set in this work containing isomers of C10H16 and carbocationic rearrangements of C10H15+, calculated at a high-level of theory. Using the data set, we compared noiseless VQE simulations to conventionally performed density functional and wavefunction theory-based methods to understand the quality of results. We also investigated the effectiveness of a quantum state tomography-based error mitigation technique in applications of VQE under noise (simulated and real). Our findings reveal that the use of quantum error mitigation is crucial in the NISQ era and advantageous to yield almost noiseless quality results.

Variational Quantum Eigensolver Boosted by Adiabatic Connection

In this work, we integrate the variational quantum eigensolver (VQE) with the adiabatic connection (AC) method for efficient simulations of chemical problems on near-term quantum computers. Orbital-optimized VQE methods are employed to capture the strong correlation within an active space, and classical AC corrections recover the dynamical correlation effects comprising electrons outside of the active space. On two challenging strongly correlated problems, namely, the dissociation of N2 and the electronic structure of the tetramethyleneethane biradical, we show that the combined VQE-AC approach enhances the performance of VQE dramatically. Moreover, since the AC corrections do not bring any additional requirements on quantum resources or measurements, they can actually boost the VQE algorithms. Our work paves the way toward quantum simulations of real-life problems on near-term quantum computers.

Towards near-term quantum simulation of materials

Determining the ground and excited state properties of materials is considered one of the most promising applications of quantum computers. On near-term hardware, the limiting constraint on such simulations is the requisite circuit depths and qubit numbers, which currently lie well beyond near-term capabilities. Here we develop a quantum algorithm which reduces the estimated cost of material simulations. For example, we obtain a circuit depth improvement by up to 6 orders of magnitude for a Trotter layer of time-dynamics simulation in the transition-metal oxide SrVO3 compared with the best previous quantum algorithms. We achieve this by introducing a collection of connected techniques, including highly localised and physically compact representations of materials Hamiltonians in the Wannier basis, a hybrid fermion-to-qubit mapping, and an efficient circuit compiler. Combined together, these methods leverage locality of materials Hamiltonians and result in a design that generates quantum circuits with depth independent of the system's size. Although the requisite resources for the quantum simulation of materials are still beyond current hardware, our results show that realistic simulation of specific properties may be feasible without necessarily requiring fully scalable, fault-tolerant quantum computers, providing quantum algorithm design incorporates deeper understanding of the target materials and applications.

Predicting the FCI Energy of Large Systems to Chemical Accuracy from Restricted Active Space Density Matrix Renormalization Group Calculations

We theoretically derive and validate with large scale simulations a remarkably accurate power law scaling of errors for the restricted active space density matrix renormalization group (DMRG-RAS) method [J. Phys. Chem. A 126, 9709] in electronic structure calculations. This yields a new extrapolation method, DMRG-RAS-X, which reaches chemical accuracy for strongly correlated systems such as the chromium dimer, dicarbon up to a large cc-pVQZ basis and even a large chemical complex such as the FeMoco with significantly lower computational demands than those of previous methods. The method is free of empirical parameters, performed robustly and reliably in all examples we tested, and has the potential to become a vital alternative method for electronic structure calculations in quantum chemistry and more generally for the computation of strong correlations in nuclear and condensed matter physics.

Quantum computing for chemistry and physics applications from a Monte Carlo perspective

This Perspective focuses on the several overlaps between quantum algorithms and Monte Carlo methods in the domains of physics and chemistry. We will analyze the challenges and possibilities of integrating established quantum Monte Carlo solutions into quantum algorithms. These include refined energy estimators, parameter optimization, real and imaginary-time dynamics, and variational circuits. Conversely, we will review new ideas for utilizing quantum hardware to accelerate the sampling in statistical classical models, with applications in physics, chemistry, optimization, and machine learning. This review aims to be accessible to both communities and intends to foster further algorithmic developments at the intersection of quantum computing and Monte Carlo methods. Most of the works discussed in this Perspective have emerged within the last two years, indicating a rapidly growing interest in this promising area of research.

The quantum house of cards

Quantum computers have been proposed to solve a number of important problems such as discovering new drugs, new catalysts for fertilizer production, breaking encryption protocols, optimizing financial portfolios, or implementing new artificial intelligence applications. Yet, to date, a simple task such as multiplying 3 by 5 is beyond existing quantum hardware. This article examines the difficulties that would need to be solved for quantum computers to live up to their promises. I discuss the whole stack of technologies that has been envisioned to build a quantum computer from the top layers (the actual algorithms and associated applications) down to the very bottom ones (the quantum hardware, its control electronics, cryogeny, etc.) while not forgetting the crucial intermediate layer of quantum error correction.

Quantum Flow Algorithms for Simulating Many-Body Systems on Quantum Computers

We conducted quantum simulations of strongly correlated systems using the quantum flow (QFlow) approach, which enables sampling large subspaces of the Hilbert space through coupled variational problems in reduced dimensionality active spaces. Our QFlow algorithms significantly reduce circuit complexity and pave the way for scalable and constant-circuit-depth quantum computing. Our simulations show that QFlow can optimize the collective number of wave function parameters without increasing the required qubits using active spaces having an order of magnitude fewer number of parameters.

The Nature of the Chemical Bonds of High-Valent Transition-Metal Oxo (M=O) and Peroxo (MOO) Compounds: A Historical Perspective of the Metal Oxyl-Radical Character by the Classical to Quantum Computations

This review article describes a historical perspective of elucidation of the nature of the chemical bonds of the high-valent transition metal oxo (M=O) and peroxo (M-O-O) compounds in chemistry and biology. The basic concepts and theoretical backgrounds of the broken-symmetry (BS) method are revisited to explain orbital symmetry conservation and orbital symmetry breaking for the theoretical characterization of four different mechanisms of chemical reactions. Beyond BS methods using the natural orbitals (UNO) of the BS solutions, such as UNO CI (CC), are also revisited for the elucidation of the scope and applicability of the BS methods. Several chemical indices have been derived as the conceptual bridges between the BS and beyond BS methods. The BS molecular orbital models have been employed to explain the metal oxyl-radical character of the M=O and M-O-O bonds, which respond to their radical reactivity. The isolobal and isospin analogy between carbonyl oxide R2C-O-O and metal peroxide LFe-O-O has been applied to understand and explain the chameleonic chemical reactivity of these compounds. The isolobal and isospin analogy among Fe=O, O=O, and O have also provided the triplet atomic oxygen (3O) model for non-heme Fe(IV)=O species with strong radical reactivity. The chameleonic reactivity of the compounds I (Cpd I) and II (Cpd II) is also explained by this analogy. The early proposals obtained by these theoretical models have been examined based on recent computational results by hybrid DFT (UHDFT), DLPNO CCSD(T0), CASPT2, and UNO CI (CC) methods and quantum computing (QC).

Development of zero-noise extrapolated projective quantum algorithm for accurate evaluation of molecular energetics in noisy quantum devices

The recently developed Projective Quantum Eigensolver (PQE) offers an elegant procedure to evaluate the ground state energies of molecular systems in quantum computers. However, the noise in available quantum hardware can result in significant errors in computed outcomes, limiting the realization of quantum advantage. Although PQE comes equipped with some degree of inherent noise resilience, any practical implementation with apposite accuracy would require additional routines to eliminate or mitigate the errors further. In this work, we propose a way to enhance the efficiency of PQE by developing an optimal framework for introducing Zero Noise Extrapolation (ZNE) in the nonlinear iterative procedure that outlines the PQE, leading to the formulation of ZNE-PQE. Moreover, we perform a detailed analysis of how various components involved in it affect the accuracy and efficiency of the reciprocated energy convergence trajectory. Additionally, we investigate the underlying mechanism that leads to the improvements observed in ZNE-PQE over conventional PQE by performing a comparative analysis of their residue norm landscape. This approach is expected to facilitate practical applications of quantum computing in fields related to molecular sciences, where it is essential to determine molecular energies accurately.

Fermionic quantum processing with programmable neutral atom arrays

Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics.-5.4pc]Please note that the spelling of the following author names in the manuscript differs from the spelling provided in the article metadata: D. González-Cuadra, D. Bluvstein, M. Kalinowski, R. Kaubruegger, N. Maskara, P. Naldesi, T. V. Zache, A. M. Kaufman, M. D. Lukin, H. Pichler, B. Vermersch, Jun Ye, and P. Zoller. The spelling provided in the manuscript has been retained; please confirm. Although qubit-based quantum computers can potentially tackle this problem more efficiently than classical devices, encoding nonlocal fermionic statistics introduces an overhead in the required resources, limiting their applicability on near-term architectures. In this work, we present a fermionic quantum processor, where fermionic models are locally encoded in a fermionic register and simulated in a hardware-efficient manner using fermionic gates. We consider in particular fermionic atoms in programmable tweezer arrays and develop different protocols to implement nonlocal gates, guaranteeing Fermi statistics at the hardware level. We use this gate set, together with Rydberg-mediated interaction gates, to find efficient circuit decompositions for digital and variational quantum simulation algorithms, illustrated here for molecular energy estimation. Finally, we consider a combined fermion-qubit architecture, where both the motional and internal degrees of freedom of the atoms are harnessed to efficiently implement quantum phase estimation as well as to simulate lattice gauge theory dynamics.

Self-Healing of Trotter Error in Digital Adiabatic State Preparation

Adiabatic time evolution can be used to prepare a complicated quantum many-body state from one that is easier to synthesize and Trotterization can be used to implement such an evolution digitally. The complex interplay between nonadiabaticity and digitization influences the infidelity of this process. We prove that the first-order Trotterization of a complete adiabatic evolution has a cumulative infidelity that scales as O(T^{-2}δt^{2}) instead of O(T^{2}δt^{2}) expected from general Trotter error bounds, where δt is the time step and T is the total time. This result suggests a self-healing mechanism and explains why, despite increasing T, infidelities for fixed-δt digitized evolutions still decrease for a wide variety of Hamiltonians. It also establishes a correspondence between the quantum approximate optimization algorithm and digitized quantum annealing.

Linear-Scaling Quantum Circuits for Computational Chemistry

We have recently constructed compact, CNOT-efficient, quantum circuits for Fermionic and qubit excitations of arbitrary many-body rank [Magoulas, I.; Evangelista, F. A. J. Chem. Theory Comput. 2023, 19, 822]. Here, we present approximations of these circuits that substantially reduce the CNOT counts even further. Our preliminary numerical data, using the selected projective quantum eigensolver approach, show up to a 4-fold reduction in CNOTs. At the same time, there is practically no loss of accuracy in the energies compared to the parent implementation, while the ensuing symmetry breaking is essentially negligible.

Performance Analysis of a Repetition Cat Code Architecture: Computing 256-bit Elliptic Curve Logarithm in 9 Hours with 126 133 Cat Qubits

Cat qubits provide appealing building blocks for quantum computing. They exhibit a tunable noise bias yielding an exponential suppression of bit flips with the average photon number and a protection against the remaining phase errors can be ensured by a simple repetition code. We here quantify the cost of a repetition code and provide valuable guidance for the choice of a large scale architecture using cat qubits by realizing a performance analysis based on the computation of discrete logarithms on an elliptic curve with Shor's algorithm. By focusing on a 2D grid of cat qubits with neighboring connectivity, we propose to implement 2-qubit gates via lattice surgery and Toffoli gates with off-line fault-tolerant preparation of magic states through projective measurements and subsequent gate teleportations. All-to-all connectivity between logical qubits is ensured by routing qubits. Assuming a ratio between single- and two-photon losses of 10^{-5} and a cycle time of 500 ns, we show concretely that such an architecture can compute a 256-bit elliptic curve logarithm in 9 h with 126 133 cat qubits and on average 19 photons by cat state. We give the details of the realization of Shor's algorithm so that the proposed performance analysis can be easily reused to guide the choice of architecture for others platforms.

Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods

Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree-Fock and density functional theory but offer higher accuracy. Accordingly, quantum computers have been predominantly regarded as competitors to only the most accurate and costly classical methods for treating electron correlation. However, here we tighten bounds showing that certain first-quantized quantum algorithms enable exact time evolution of electronic systems with exponentially less space and polynomially fewer operations in basis set size than conventional real-time time-dependent Hartree-Fock and density functional theory. Although the need to sample observables in the quantum algorithm reduces the speedup, we show that one can estimate all elements of the k-particle reduced density matrix with a number of samples scaling only polylogarithmically in basis set size. We also introduce a more efficient quantum algorithm for first-quantized mean-field state preparation that is likely cheaper than the cost of time evolution. We conclude that quantum speedup is most pronounced for finite-temperature simulations and suggest several practically important electron dynamics problems with potential quantum advantage.

Complete Active Space Methods for NISQ Devices: The Importance of Canonical Orbital Optimization for Accuracy and Noise Resilience

To avoid the scaling of the number of qubits with the size of the basis set, one can divide the molecular space into active and inactive regions, which is also known as complete active space methods. However, selecting the active space alone is not enough to accurately describe quantum mechanical effects such as correlation. This study emphasizes the importance of optimizing the active space orbitals to describe correlation and improve the basis-dependent Hartree-Fock energies. We will explore classical and quantum computation methods for orbital optimization and compare the chemically inspired ansatz, UCCSD, with the classical full CI approach for describing the active space in both weakly and strongly correlated molecules. Finally, we will investigate the practical implementation of a quantum CASSCF, where hardware-efficient circuits must be used and noise can interfere with accuracy and convergence. Additionally, we will examine the impact of using canonical and noncanonical active orbitals on the convergence of the quantum CASSCF routine in the presence of noise.

Measuring Electron Correlation: The Impact of Symmetry and Orbital Transformations

In this perspective, the various measures of electron correlation used in wave function theory, density functional theory and quantum information theory are briefly reviewed. We then focus on a more traditional metric based on dominant weights in the full configuration solution and discuss its behavior with respect to the choice of the N-electron and the one-electron basis. The impact of symmetry is discussed, and we emphasize that the distinction among determinants, configuration state functions and configurations as reference functions is useful because the latter incorporate spin-coupling into the reference and should thus reduce the complexity of the wave function expansion. The corresponding notions of single determinant, single spin-coupling and single configuration wave functions are discussed and the effect of orbital rotations on the multireference character is reviewed by analyzing a simple model system. In molecular systems, the extent of correlation effects should be limited by finite system size and in most cases the appropriate choices of one-electron and N-electron bases should be able to incorporate these into a low-complexity reference function, often a single configurational one.

Evaluating the evidence for exponential quantum advantage in ground-state quantum chemistry

Due to intense interest in the potential applications of quantum computing, it is critical to understand the basis for potential exponential quantum advantage in quantum chemistry. Here we gather the evidence for this case in the most common task in quantum chemistry, namely, ground-state energy estimation, for generic chemical problems where heuristic quantum state preparation might be assumed to be efficient. The availability of exponential quantum advantage then centers on whether features of the physical problem that enable efficient heuristic quantum state preparation also enable efficient solution by classical heuristics. Through numerical studies of quantum state preparation and empirical complexity analysis (including the error scaling) of classical heuristics, in both ab initio and model Hamiltonian settings, we conclude that evidence for such an exponential advantage across chemical space has yet to be found. While quantum computers may still prove useful for ground-state quantum chemistry through polynomial speedups, it may be prudent to assume exponential speedups are not generically available for this problem.

Molecular Energy Landscapes of Hardware-Efficient Ansätze in Quantum Computing

Rapid advances in quantum computing have opened up new opportunities for solving the central electronic structure problem in computational chemistry. In the noisy intermediate-scale quantum (NISQ) era, where qubit coherence times are limited, it is essential to exploit quantum algorithms with sufficiently short quantum circuits to maximize qubit efficiency. The procedural construction of hardware-efficient ansätze provides one approach to design such circuits. However, refining the accuracy of the global minimum by increasing circuit depth may lead to a proliferation of local minima that hinders global optimization. To investigate this phenomenon, we explore the energy landscapes of hardware-efficient circuits to identify ground-state energies of the hydrogen, lithium hydride, and beryllium hydride molecules. We also propose a simple dimensionality reduction procedure that reduces quantum gate depth while retaining high accuracy for the global minimum, simplifying the energy landscape, and hence speeding up optimization from both software and hardware perspectives.

Suppressing quantum errors by scaling a surface code logical qubit

Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 ± 0.016)% compared to (3.028 ± 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 × 10-6 logical error per cycle floor set by a single high-energy event (1.6 × 10-7 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation.

Quantum computing in pharma: A multilayer embedding approach for near future applications

Quantum computers are special purpose machines that are expected to be particularly useful in simulating strongly correlated chemical systems. The quantum computer excels at treating a moderate number of orbitals within an active space in a fully quantum mechanical manner. We present a quantum phase estimation calculation on F₂ in a (2,2) active space on Rigetti's Aspen-11 QPU. While this is a promising start, it also underlines the need for carefully selecting the orbital spaces treated by the quantum computer. In this work, a scheme for selecting such an active space automatically is described and simulated results obtained using both the quantum phase estimation (QPE) and variational quantum eigensolver (VQE) algorithms are presented and combined with a subtractive method to enable accurate description of the environment. The active occupied space is selected from orbitals localized on the chemically relevant fragment of the molecule, while the corresponding virtual space is chosen based on the magnitude of interactions with the occupied space calculated from perturbation theory. This protocol is then applied to two chemical systems of pharmaceutical relevance: the enzyme [Fe] hydrogenase and the photosenzitizer temoporfin. While the sizes of the active spaces currently amenable to a quantum computational treatment are not enough to demonstrate quantum advantage, the procedure outlined here is applicable to any active space size, including those that are outside the reach of classical computation.

Efficient fully-coherent quantum signal processing algorithms for real-time dynamics simulation

Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the simulation of electronic dynamics, which plays an essential role in chemical reactions, non-equilibrium dynamics, and material design. These systems are time-dependent, which requires that the corresponding simulation algorithm can be successfully concatenated with itself over different time intervals to reproduce the overall coherent quantum dynamics of the system. In this paper, we quantify such simulation algorithms by the property of being fully-coherent: the algorithm succeeds with arbitrarily high success probability 1 - δ while only requiring a single copy of the initial state. We subsequently develop fully-coherent simulation algorithms based on quantum signal processing (QSP), including a novel algorithm that circumvents the use of amplitude amplification while also achieving a query complexity additive in time t, ln(1/δ), and ln(1/ϵ) for error tolerance ϵ: Θ‖H‖|t|+ln(1/ϵ)+ln(1/δ). Furthermore, we numerically analyze these algorithms by applying them to the simulation of the spin dynamics of the Heisenberg model and the correlated electronic dynamics of an H₂ molecule. Since any electronic Hamiltonian can be mapped to a spin Hamiltonian, our algorithm can efficiently simulate time-dependent ab initio electronic dynamics in the circuit model of quantum computation. Accordingly, it is also our hope that the present work serves as a bridge between QSP-based quantum algorithms and chemical dynamics, stimulating a cross-fertilization between these exciting fields.