Quantum Nuclear Dynamics on a Distributed Set of Ion-Trap Quantum Computing Systems

Quantum nuclear dynamics with wavepacket time evolution is classically intractable and viewed as a promising avenue for quantum information processing. Here, we use IonQ, Inc.'s 11-qubit trapped-ion quantum computer, Harmony, to study the quantum wavepacket dynamics of a shared-proton within a short-strong hydrogen-bonded system. We also provide the first application of distributed quantum computing for chemical dynamics problems, where a distributed set of quantum processes is constructed using a tensor network formalism. For a range of initial states, we experimentally drive the ion-trap system to emulate the quantum nuclear wavepacket as it evolves along the potential surface generated from the electronic structure. Following the experimental creation of the nuclear wavepacket, we extract measurement observables such as its time-dependent spatial projection and its characteristic vibrational frequencies to good agreement with classical results. Vibrational eigenenergies obtained from quantum computation are in agreement with those obtained from classical simulations to within a fraction of a kilocalorie per mole, thus suggesting chemical accuracy. Our approach opens a new paradigm for studying the quantum chemical dynamics and vibrational spectra of molecules and also provides the first demonstration of parallel quantum computation on a distributed set of ion-trap quantum computers.

Qudit-based variational quantum eigensolver using photonic orbital angular momentum states

Solving the electronic structure problem is a notorious challenge in quantum chemistry and material science. Variational quantum eigensolver (VQE) is a promising hybrid classical-quantum algorithm for finding the lowest-energy configuration of a molecular system. However, it typically requires many qubits and quantum gates with substantial quantum circuit depth to accurately represent the electronic wave function of complex structures. Here, we propose an alternative approach to solve the electronic structure problem using VQE with a single qudit. Our approach exploits a high-dimensional orbital angular momentum state of a heralded single photon and notably reduces the required quantum resources compared to conventional multi-qubit-based VQE. We experimentally demonstrate that our single-qudit-based VQE can efficiently estimate the ground state energy of hydrogen (H2) and lithium hydride (LiH) molecular systems corresponding to two- and four-qubit systems, respectively. We believe that our scheme opens a pathway to perform a large-scale quantum simulation for solving more complex problems in quantum chemistry and material science.

Accurate Calculation of Interatomic Forces with Neural Networks Based on a Generative Transformer Architecture

Using neural networks to express electronic wave functions represents a new paradigm for solving the Schrödinger equation in quantum chemistry. For practical quantum chemistry simulations, one needs to know not only energies of molecules, but also accurate forces acting on constituent atoms. In this work, we achieve the accurate calculation of interatomic forces on QiankunNet, a platform that combines transformer-based deep neural networks with efficient batched autoregressive sampling. Our approach permits the application of the Hellmann-Feynman theorem to force calculations without introducing corrective Pulay terms. The results show that the calculated interatomic forces are in close agreement with those derived from the full configuration interaction method, irrespective of whether the system is a simple molecule or a strongly correlated electron system like a linear hydrogen chain. Furthermore, the calculated interatomic forces are employed for atomic relaxation in the torsional rotation process of ethylene, and the energy barrier obtained from the scanned potential energy surface is in excellent agreement with the experiment. Our work contributes to the application of artificial intelligence to broader quantum chemistry simulations, such as modeling challenging chemical transformations where electron correlations are difficult to describe.

Experimental Sample-Efficient Quantum State Tomography via Parallel Measurements

Quantum state tomography (QST) via local measurements on reduced density matrices (LQST) is a promising approach but becomes impractical for large systems. To tackle this challenge, we developed an efficient quantum state tomography method inspired by quantum overlapping tomography [Phys. Rev. Lett. 124, 100401 (2020)PRLTAO0031-900710.1103/PhysRevLett.124.100401], which utilizes parallel measurements (PQST). In contrast to LQST, PQST significantly reduces the number of measurements and offers more robustness against shot noise. Experimentally, we demonstrate the feasibility of PQST in a treelike superconducting qubit chip by designing high-efficiency circuits, preparing W states, ground states of Hamiltonians, and random states, and then reconstructing these density matrices using full quantum state tomography (FQST), LQST, and PQST. Our results show that PQST reduces measurement cost, achieving fidelities of 98.68% and 95.07% after measuring 75 and 99 observables for six-qubit and nine-qubit W states, respectively. Furthermore, the reconstruction of the largest density matrix of the 12-qubit W state is achieved with the similarity of 89.23% after just measuring 243 parallel observables, while 3^{12}=531 441 complete observables are needed for FQST. Consequently, PQST will be a useful tool for future tasks such as the reconstruction, characterization, benchmarking, and properties learning of states.

Self-Consistent Determination of Single-Impurity Anderson Model Using Hybrid Quantum-Classical Approach on a Spin Quantum Simulator

The accurate determination of the electronic structure of strongly correlated materials using first principle methods is of paramount importance in condensed matter physics, computational chemistry, and material science. However, due to the exponential scaling of computational resources, incorporating such materials into classical computation frameworks becomes prohibitively expensive. In 2016, Bauer et al. proposed a hybrid quantum-classical approach to correlated materials [B. Bauer et al., Hybrid quantum-classical approach to correlated materials, Phys. Rev. X 6, 031045 (2016).PRXHAE2160-330810.1103/PhysRevX.6.031045] that can efficiently tackle the electronic structure of complex correlated materials. Here, we experimentally demonstrate that approach to tackle the computational challenges associated with strongly correlated materials. By seamlessly integrating quantum computation into classical computers, we address the most computationally demanding aspect of the calculation, namely the computation of the Green's function, using a spin quantum processor. Furthermore, we realize a self-consistent determination of the single impurity Anderson model through a feedback loop between quantum and classical computations. A quantum phase transition in the Hubbard model from the metallic phase to the Mott insulator is observed as the strength of electron correlation increases. As the number of qubits with high control fidelity continues to grow, our experimental findings pave the way for solving even more complex models, such as strongly correlated crystalline materials or intricate molecules.

Information processing at the speed of light

In recent years, quantum computing has made significant strides, particularly in light-based technology. The introduction of quantum photonic chips has ushered in an era marked by scalability, stability, and cost-effectiveness, paving the way for innovative possibilities within compact footprints. This article provides a comprehensive exploration of photonic quantum computing, covering key aspects such as encoding information in photons, the merits of photonic qubits, and essential photonic device components including light squeezers, quantum light sources, interferometers, photodetectors, and waveguides. The article also examines photonic quantum communication and internet, and its implications for secure systems, detailing implementations such as quantum key distribution and long-distance communication. Emerging trends in quantum communication and essential reconfigurable elements for advancing photonic quantum internet are discussed. The review further navigates the path towards establishing scalable and fault-tolerant photonic quantum computers, highlighting quantum computational advantages achieved using photons. Additionally, the discussion extends to programmable photonic circuits, integrated photonics and transformative applications. Lastly, the review addresses prospects, implications, and challenges in photonic quantum computing, offering valuable insights into current advancements and promising future directions in this technology.

The Localized Active Space Method with Unitary Selective Coupled Cluster

We introduce a hybrid quantum-classical algorithm, the localized active space unitary selective coupled cluster singles and doubles (LAS-USCCSD) method. Derived from the localized active space unitary coupled cluster (LAS-UCCSD) method, LAS-USCCSD first performs a classical LASSCF calculation, then selectively identifies the most important parameters (cluster amplitudes used to build the multireference UCC ansatz) for restoring interfragment interaction energy using this reduced set of parameters with the variational quantum eigensolver method. We benchmark LAS-USCCSD against LAS-UCCSD by calculating the total energies of (H2)2, (H2)4, and trans-butadiene, and the magnetic coupling constant for a bimetallic compound [Cr2(OH)3(NH3)6]3+. For these systems, we find that LAS-USCCSD reduces the number of required parameters and thus the circuit depth by at least 1 order of magnitude, an aspect which is important for the practical implementation of multireference hybrid quantum-classical algorithms like LAS-UCCSD on near-term quantum computers.

Recent advances in computational prediction of molecular properties in food chemistry

The combination of food chemistry and computational simulation has brought many impacts to food research, moving from experimental chemistry to computer chemistry. This paper will systematically review in detail the important role played by computational simulations in the development of the molecular structure of food, mainly from the atomic, molecular, and multicomponent dimension. It will also discuss how different computational chemistry models can be constructed and analyzed to obtain reliable conclusions. From the calculation principle to case analysis, this paper focuses on the selection and application of quantum mechanics, molecular mechanics and coarse-grained molecular dynamics in food chemistry research. Finally, experiments and computations of food chemistry are compared and summarized to obtain the best balance between them. The above review and outlook will provide an important reference for the intersection of food chemistry and computational chemistry, and is expected to provide innovative thinking for structural research in food chemistry.

Machine learning on quantum experimental data toward solving quantum many-body problems

Advancements in the implementation of quantum hardware have enabled the acquisition of data that are intractable for emulation with classical computers. The integration of classical machine learning (ML) algorithms with these data holds potential for unveiling obscure patterns. Although this hybrid approach extends the class of efficiently solvable problems compared to using only classical computers, this approach has been only realized for solving restricted problems because of the prevalence of noise in current quantum computers. Here, we extend the applicability of the hybrid approach to problems of interest in many-body physics, such as predicting the properties of the ground state of a given Hamiltonian and classifying quantum phases. By performing experiments with various error-reducing procedures on superconducting quantum hardware with 127 qubits, we managed to acquire refined data from the quantum computer. This enabled us to demonstrate the successful implementation of theoretically suggested classical ML algorithms for systems with up to 44 qubits. Our results verify the scalability and effectiveness of the classical ML algorithms for processing quantum experimental data.

Localized Virtual Purification

Analog and digital quantum simulators can efficiently simulate quantum many-body systems that appear in natural phenomena. However, experimental limitations of near-term devices still make it challenging to perform the entire process of quantum simulation. The purification-based quantum simulation methods can alleviate the limitations in experiments such as the cooling temperature and noise from the environment, while this method has the drawback that it requires global entangled measurement with a prohibitively large number of measurements that scales exponentially with the system size. In this Letter, we propose that we can overcome these problems by restricting the entangled measurements to the vicinity of the local observables to be measured, when the locality of the system can be exploited. We provide theoretical guarantees that the global purification operation can be replaced with local operations under some conditions, in particular for the task of cooling and error mitigation. We furthermore give a numerical verification that the localized purification is valid even when conditions are not satisfied. Our method bridges the fundamental concept of locality with quantum simulators, and therefore is expected to open a path to unexplored quantum many-body phenomena.

Impact of quantum and neuromorphic computing on biomolecular simulations: Current status and perspectives

New high-performance computing architectures are becoming operative, in addition to exascale computers. Quantum computers (QC) solve optimization problems with unprecedented efficiency and speed, while neuromorphic hardware (NMH) simulates neural network dynamics. Albeit, at the moment, both find no practical use in all atom biomolecular simulations, QC might be exploited in the not-too-far future to simulate systems for which electronic degrees of freedom play a key and intricate role for biological function, whereas NMH might accelerate molecular dynamics simulations with low energy consumption. Machine learning and artificial intelligence algorithms running on NMH and QC could assist in the analysis of data and speed up research. If these implementations are successful, modular supercomputing could further dramatically enhance the overall computing capacity by combining highly optimized software tools into workflows, linking these architectures to exascale computers.

Simulating Chemistry on Bosonic Quantum Devices

Bosonic quantum devices offer a novel approach to realize quantum computations, where the quantum two-level system (qubit) is replaced with the quantum (an)harmonic oscillator (qumode) as the fundamental building block of the quantum simulator. The simulation of chemical structure and dynamics can then be achieved by representing or mapping the system Hamiltonians in terms of bosonic operators. In this Perspective, we review recent progress and future potential of using bosonic quantum devices for addressing a wide range of challenging chemical problems, including the calculation of molecular vibronic spectra, the simulation of gas-phase and solution-phase adiabatic and nonadiabatic chemical dynamics, the efficient solution of molecular graph theory problems, and the calculations of electronic structure.

Probing Quantum Efficiency: Exploring System Hardness in Electronic Ground State Energy Estimation

We consider the question of how correlated the system hardness is between classical algorithms of electronic structure theory in ground state estimation and quantum algorithms. To define the system hardness for classical algorithms, we employ empirical criterion based on the deviation of electronic energies produced by coupled cluster and configuration interaction methods from the exact ones along multiple bonds dissociation in a set of molecular systems. For quantum algorithms, we have selected the Variational Quantum Eigensolver (VQE) and Quantum Phase Estimation (QPE) methods. As characteristics of the system hardness for quantum methods, we analyzed circuit depths for the state preparation, the number of quantum measurements needed for the energy expectation value, and various cost characteristics for the Hamiltonian encodings via Trotter approximation and linear combination of unitaries (LCU). Our results show that the quantum resource requirements are mostly unaffected by classical hardness, with the only exception being the state preparation part, which contributes to both VQE and QPE algorithm costs. However, there are clear indications that constructing the initial state with a significant overlap with the true ground state is easier than obtaining the state with an energy expectation value within chemical precision. These results support optimism regarding the identification of a molecular system where a quantum algorithm excels over its classical counterpart, as quantum methods can maintain efficiency in classically challenging systems.

Quantum Computation of Conical Intersections on a Programmable Superconducting Quantum Processor

Conical intersections (CIs) are pivotal in many photochemical processes. Traditional quantum chemistry methods, such as the state-average multiconfigurational methods, face computational hurdles in solving the electronic Schrödinger equation within the active space on classical computers. While quantum computing offers a potential solution, its feasibility in studying CIs, particularly on real quantum hardware, remains largely unexplored. Here, we present the first successful realization of a hybrid quantum-classical state-average complete active space self-consistent field method based on the variational quantum eigensolver (VQE-SA-CASSCF) on a superconducting quantum processor. This approach is applied to investigate CIs in two prototypical systems─ethylene (C2H4) and triatomic hydrogen (H3). We illustrate that VQE-SA-CASSCF, coupled with ongoing hardware and algorithmic enhancements, can lead to a correct description of CIs on existing quantum devices. These results lay the groundwork for exploring the potential of quantum computing to study CIs in more complex systems in the future.

Realization of higher-order topological lattices on a quantum computer

Programmable quantum simulators may one day outperform classical computers at certain tasks. But at present, the range of viable applications with noisy intermediate-scale quantum (NISQ) devices remains limited by gate errors and the number of high-quality qubits. Here, we develop an approach that places digital NISQ hardware as a versatile platform for simulating multi-dimensional condensed matter systems. Our method encodes a high-dimensional lattice in terms of many-body interactions on a reduced-dimension model, thereby taking full advantage of the exponentially large Hilbert space of the host quantum system. With circuit optimization and error mitigation techniques, we measured on IBM superconducting quantum processors the topological state dynamics and protected mid-gap spectra of higher-order topological lattices, in up to four dimensions, with high accuracy. Our projected resource requirements scale favorably with system size and lattice dimensionality compared to classical computation, suggesting a possible route to useful quantum advantage in the longer term.

CS-count-optimal quantum circuits for arbitrary multi-qubit unitaries

In quantum computing there are quite a few universal gate sets, each having their own characteristics. In this paper we study the Clifford+CS universal fault-tolerant gate set. The CS gate is used is many applications and this gate set is an important alternative to Clifford+T. We introduce a generating set in order to represent any unitary implementable by this gate set and with this we derive a bound on the CS-count of arbitrary multi-qubit unitaries. Analysing the channel representation of the generating set elements, we inferJ n CS ⊂ J n T , where J n CS and J n T are the set of unitaries exactly implementable by the Clifford+CS and Clifford+T gate sets, respectively. We develop CS-count optimal synthesis algorithms for both approximately and exactly implementable multi-qubit unitaries. With the help of these we derive a CS-count-optimal circuit for Toffoli, implyingJ n Tof = J n CS , where J n Tof is the set of unitaries exactly implementable by the Clifford+Toffoli gate set. Such conclusions can have an important impact on resource estimates of quantum algorithms.

Quantum circuit for high order perturbation theory corrections

Perturbation theory (PT) might be one of the most powerful and fruitful tools for both physicists and chemists, which has led to a wide variety of applications. Over the past decades, advances in quantum computing provide opportunities for alternatives to classical methods. Recently, a general quantum circuit estimating the low order PT corrections has been proposed. In this article, we revisit the quantum circuits for PT calculations, and develop the methods for higher order PT corrections of eigenenergy, especially the 3rd and 4th order corrections. We present the feasible quantum circuit to estimate each term in these PT corrections. There are two the fundamental operations in the proposed circuit. One approximates the perturbation terms, the other approximates the inverse of unperturbed energy difference. The proposed method can be generalized to higher order PT corrections.

Many-excitation removal of a transmon qubit using a single-junction quantum-circuit refrigerator and a two-tone microwave drive

Achieving fast and precise initialization of qubits is a critical requirement for the successful operation of quantum computers. The combination of engineered environments with all-microwave techniques has recently emerged as a promising approach for the reset of superconducting quantum devices. In this work, we experimentally demonstrate the utilization of a single-junction quantum-circuit refrigerator (QCR) for an expeditious removal of several excitations from a transmon qubit. The QCR is indirectly coupled to the transmon through a resonator in the dispersive regime, constituting a carefully engineered environmental spectrum for the transmon. Using single-shot readout, we observe excitation stabilization times down to roughly 500 ns, a 20-fold speedup with QCR and a simultaneous two-tone drive addressing the e-f and f0-g1 transitions of the system. Our results are obtained at a 48-mK fridge temperature and without postselection, fully capturing the advantage of the protocol for the short-time dynamics and the drive-induced detrimental asymptotic behavior in the presence of relatively hot other baths of the transmon. We validate our results with a detailed Liouvillian model truncated up to the three-excitation subspace, from which we estimate the performance of the protocol in optimized scenarios, such as cold transmon baths and fine-tuned driving frequencies. These results pave the way for optimized reset of quantum-electric devices using engineered environments and for dissipation-engineered state preparation.

Quantum-centric high performance computing for quantum chemistry

High performance computing (HPC) is renowned for its capacity to tackle complex problems. Meanwhile, quantum computing (QC) provides a potential way to accurately and efficiently solve quantum chemistry problems. The emerging field of quantum-centric high performance computing (QCHPC), which merges these two powerful technologies, is anticipated to enhance computational capabilities for solving challenging problems in quantum chemistry. The implementation of QCHPC for quantum chemistry requires interdisciplinary research and collaboration across multiple fields, including quantum chemistry, quantum physics, computer science and so on. This perspective provides an introduction to the quantum algorithms that are suitable for deployment in QCHPC, focusing on conceptual insights rather than technical details. Parallel strategies to implement these algorithms on quantum-centric supercomputers are discussed. We also summarize high performance quantum emulating simulators, which are considered a viable tool to explore QCHPC. We conclude with challenges and outlooks in this field.

Toward Real Chemical Accuracy on Current Quantum Hardware Through the Transcorrelated Method

Quantum computing is emerging as a new computational paradigm with the potential to transform several research fields including quantum chemistry. However, current hardware limitations (including limited coherence times, gate infidelities, and connectivity) hamper the implementation of most quantum algorithms and call for more noise-resilient solutions. We propose an explicitly correlated Ansatz based on the transcorrelated (TC) approach to target these major roadblocks directly. This method transfers, without any approximation, correlations from the wave function directly into the Hamiltonian, thus reducing the resources needed to achieve accurate results with noisy quantum devices. We show that the TC approach allows for shallower circuits and improves the convergence toward the complete basis set limit, providing energies within chemical accuracy to experiment with smaller basis sets and, thus, fewer qubits. We demonstrate our method by computing bond lengths, dissociation energies, and vibrational frequencies close to experimental results for the hydrogen dimer and lithium hydride using two and four qubits, respectively. To demonstrate our approach's current and near-term potential, we perform hardware experiments, where our results confirm that the TC method paves the way toward accurate quantum chemistry calculations already on today's quantum hardware.

Quantum Algorithmic Approach to Multiconfigurational Valence Bond Theory: Insights from Interpretable Circuit Design

Efficient ways to prepare Fermionic ground states on quantum computers are in high demand, and different techniques have been developed over the past few years. Despite having a vast set of methods, it is still unclear which method performs well for which system. In this work, we combine interpretable circuit designs with an effective basis approach in order to optimize a multiconfigurational valence bond wave function. Based on selected model systems, we show how this leads to an explainable performance. We demonstrate that the developed methodology outperforms related methods in terms of the size of the effective basis, as well as individual quantum resources for the involved circuits.

Demonstration of the Effectiveness of the Cascaded Variational Quantum Eigensolver Using the Jastrow Ansatz for Molecular Calculations

We demonstrate how the cascaded variational quantum eigensolver (CVQE) can be applied to study molecular systems for the family of Jastrow ansatzes. Specifically, we applied CVQE to the water molecule. We find that CVQE has a number of advantages. In particular, our results show that CVQE requires 2 to 3 orders of magnitude fewer quantum computing (QC) executions than VQE for the water molecule. Furthermore, our results indicate that CVQE might provide some robustness against two-qubit gate errors given that the number of CNOT gates used in our calculation was ∼300 and the errors in the QC calculations are still comparable to those obtained by VQE.

Geometric Algebra Jordan-Wigner Transformation for Quantum Simulation

Quantum simulation qubit models of electronic Hamiltonians rely on specific transformations in order to take into account the fermionic permutation properties of electrons. These transformations (principally the Jordan-Wigner transformation (JWT) and the Bravyi-Kitaev transformation) correspond in a quantum circuit to the introduction of a supplementary circuit level. In order to include the fermionic properties in a more straightforward way in quantum computations, we propose to use methods issued from Geometric Algebra (GA), which, due to its commutation properties, are well adapted for fermionic systems. First, we apply the Witt basis method in GA to reformulate the JWT in this framework and use this formulation to express various quantum gates. We then rewrite the general one and two-electron Hamiltonian and use it for building a quantum simulation circuit for the Hydrogen molecule. Finally, the quantum Ising Hamiltonian, widely used in quantum simulation, is reformulated in this framework.

State Preparation in Quantum Algorithms for Fragment-Based Quantum Chemistry

State preparation for quantum algorithms is crucial for achieving high accuracy in quantum chemistry and competing with classical algorithms. The localized active space-unitary coupled cluster (LAS-UCC) algorithm iteratively loads a fragment-based multireference wave function onto a quantum computer. In this study, we compare two state preparation methods, quantum phase estimation (QPE) and direct initialization (DI), for each fragment. We test the two state preparation methods on three systems, ranging from a model system, a set of interacting hydrogen molecules, to more realistic chemical problems, like the C-C double bond breaking in transbutadiene and the spin ladder in a bimetallic system. We analyze the impact of QPE parameters, such as the number of ancilla qubits and Trotter steps, on the prepared state. We find a trade-off between the methods, where DI requires fewer resources for smaller fragments, while QPE is more efficient for larger fragments. Our resource estimates highlight the benefits of system fragmentation in state preparation for subsequent quantum chemical calculations. These findings have broad applications for preparing multireference quantum chemical wave functions on quantum circuits that can be used for realistic chemical applications.

The Dilemma of Quantum Neural Networks

The core of quantum machine learning is to devise quantum models with good trainability and low generalization error bounds than their classical counterparts to ensure better reliability and interpretability. Recent studies confirmed that quantum neural networks (QNNs) have the ability to achieve this goal on specific datasets. In this regard, it is of great importance to understand whether these advantages are still preserved on real-world tasks. Through systematic numerical experiments, we empirically observe that current QNNs fail to provide any benefit over classical learning models. Concretely, our results deliver two key messages. First, QNNs suffer from the severely limited effective model capacity, which incurs poor generalization on real-world datasets. Second, the trainability of QNNs is insensitive to regularization techniques, which sharply contrasts with the classical scenario. These empirical results force us to rethink the role of current QNNs and to design novel protocols for solving real-world problems with quantum advantages.

Simulating chemical reaction dynamics on quantum computer

The electronic energies of molecules have been successfully evaluated on quantum computers. However, more attention is paid to the dynamics simulation of molecules in practical applications. Based on the variational quantum eigensolver (VQE) algorithm, Fedorov et al. proposed a correlated sampling (CS) method and demonstrated the vibrational dynamics of H2 molecules [J. Chem. Phys. 154, 164103 (2021)]. In this study, we have developed a quantum approach by extending the CS method based on the VQE algorithm (labeled eCS-VQE) for simulating chemical reaction dynamics. First, the CS method is extended to the three-dimensional cases for calculation of first-order energy gradients, and then, it is further generalized to calculate the second-order gradients of energies. By calculating atomic forces and vibrational frequencies for H2, LiH, H+ + H2, and Cl- + CH3Cl systems, we have seen that the approach has achieved the CCSD level of accuracy. Thus, we have simulated dynamics processes for two typical chemical reactions, hydrogen exchange and chlorine substitution, and obtained high-precision reaction dynamics trajectories consistent with the classical methods. Our eCS-VQE approach, as measurement expectations and ground-state wave functions can be reused, is less demanding in quantum computing resources and is, therefore, a feasible means for the dynamics simulation of chemical reactions on the current noisy intermediate-scale quantum-era quantum devices.

Harvesting Chemical Understanding with Machine Learning and Quantum Computers

It is tenable to argue that nobody can predict the future with certainty, yet one can learn from the past and make informed projections for the years ahead. In this Perspective, we overview the status of how theory and computation can be exploited to obtain chemical understanding from wave function theory and density functional theory, and then outlook the likely impact of machine learning (ML) and quantum computers (QC) to appreciate traditional chemical concepts in decades to come. It is maintained that the development and maturation of ML and QC methods in theoretical and computational chemistry represent two paradigm shifts about how the Schrödinger equation can be solved. New chemical understanding can be harnessed in these two new paradigms by making respective use of ML features and QC qubits. Before that happens, however, we still have hurdles to face and obstacles to overcome in both ML and QC arenas. Possible pathways to tackle these challenges are proposed. We anticipate that hierarchical modeling, in contrast to multiscale modeling, will emerge and thrive, becoming the workhorse of in silico simulations in the next few decades.

Optimizing Shot Assignment in Variational Quantum Eigensolver Measurement

Variational quantum eigensolvers (VQEs) show promise for tackling complex quantum chemistry challenges and realizing quantum advantages. However, in VQE, the measurement step encounters difficulties due to errors in objective function evaluation, e.g., the energy of a quantum state. While increasing the number of measurement shots can mitigate measurement errors, this approach leads to higher costs. Strategies for shot assignment have been investigated, allowing for the allocation of varying shot numbers to different Hamiltonian terms and reducing measurement variance through term-specific insights. In this paper, we introduce a dynamic approach, the Variance-Preserved Shot Reduction (VPSR) method. This technique strives to minimize the total number of measurement shots while preserving the variance of measurements throughout the VQE process. Our numerical experiments on H2 and LiH molecular ground states demonstrate the effectiveness of VPSR in achieving VQE convergence with a notably lower shot count.

Stable quantum-correlated many-body states through engineered dissipation

Engineered dissipative reservoirs have the potential to steer many-body quantum systems toward correlated steady states useful for quantum simulation of high-temperature superconductivity or quantum magnetism. Using up to 49 superconducting qubits, we prepared low-energy states of the transverse-field Ising model through coupling to dissipative auxiliary qubits. In one dimension, we observed long-range quantum correlations and a ground-state fidelity of 0.86 for 18 qubits at the critical point. In two dimensions, we found mutual information that extends beyond nearest neighbors. Lastly, by coupling the system to auxiliaries emulating reservoirs with different chemical potentials, we explored transport in the quantum Heisenberg model. Our results establish engineered dissipation as a scalable alternative to unitary evolution for preparing entangled many-body states on noisy quantum processors.

Implementation of the Projective Quantum Eigensolver on a Quantum Computer

We study the performance of our previously proposed projective quantum eigensolver (PQE) on IBM's quantum hardware in conjunction with error mitigation techniques. For a single qubit model of H2, we find that we are able to obtain energies within 4 millihartree (2.5 kcal/mol) of the exact energy along the entire potential energy curve, with the accuracy limited by both the stochastic error and the inconsistent performance of the IBM devices. We find that an optimization algorithm using direct inversion of the iterative subspace can converge swiftly, even to excited states, but stochastic noise can prompt large parameter updates. For the 4-site transverse-field Ising model at its critical point, PQE with an appropriate application of qubit tapering can recover 99% of the correlation energy, even after discarding several parameters. The large number of CNOT gates needed for the additional parameters introduces a concomitant error that, on the IBM devices, results in a loss of accuracy despite the increased expressivity of the trial state. Error extrapolation techniques and tapering or postselection are recommended to mitigate errors in PQE hardware experiments.

Physics-Constrained Hardware-Efficient Ansatz on Quantum Computers That Is Universal, Systematically Improvable, and Size-Consistent

Variational wave function ansätze are at the heart of solving quantum many-body problems in physics and chemistry. Previous designs of hardware-efficient ansatz (HEA) on quantum computers are largely based on heuristics and lack rigorous theoretical foundations. In this work, we introduce a physics-constrained approach for designing HEA with rigorous theoretical guarantees by imposing a few fundamental constraints. Specifically, we require that the target HEA to be universal, systematically improvable, and size-consistent, which is an important concept in quantum many-body theories for scalability but has been overlooked in previous designs of HEA. We extend the notion of size-consistency to HEA and present a concrete realization of HEA that satisfies all these fundamental constraints while only requiring linear qubit connectivity. The developed physics-constrained HEA is superior to other heuristically designed HEA in terms of both accuracy and scalability, as demonstrated numerically for the Heisenberg model and some typical molecules. In particular, we find that restoring size-consistency can significantly reduce the number of layers needed to reach a certain accuracy. In contrast, the failure of other HEA to satisfy these constraints severely limits their scalability to larger systems with more than 10 qubits. Our work highlights the importance of incorporating physical constraints into the design of HEA for efficiently solving many-body problems on quantum computers.

Quantum many-body simulations on digital quantum computers: State-of-the-art and future challenges

Simulating quantum many-body systems is a key application for emerging quantum processors. While analog quantum simulation has already demonstrated quantum advantage, its digital counterpart has recently become the focus of intense research interest due to the availability of devices that aim to realize general-purpose quantum computers. In this perspective, we give a selective overview of the currently pursued approaches, review the advances in digital quantum simulation by comparing non-variational with variational approaches and identify hardware and algorithmic challenges. Based on this review, the question arises: What are the most promising problems that can be tackled with digital quantum simulation? We argue that problems of a qualitative nature are much more suitable for near-term devices then approaches aiming purely for a quantitative accuracy improvement.

Variational quantum eigensolver for closed-shell molecules with non-bosonic corrections

The realization of quantum advantage with noisy-intermediate-scale quantum (NISQ) machines has become one of the major challenges in computational sciences. Maintaining coherence of a physical system with more than ten qubits is a critical challenge that motivates research on compact system representations to reduce algorithm complexity. Toward this end, the variational quantum eigensolver (VQE) used to perform quantum simulations is considered to be one of the most promising algorithms for quantum chemistry in the NISQ era. We investigate reduced mapping of one spatial orbital to a single qubit to analyze the ground state energy in a way that the Pauli operators of qubits are mapped to the creation/annihilation of singlet pairs of electrons. To include the effect of non-bosonic (or non-paired) excitations, we introduce a simple correction scheme in the electron correlation model approximated by the geometrical mean of the bosonic (or paired) terms. Employing it in a VQE algorithm, we assess ground state energies of H2O, N2, and Li2O in good agreement with full configuration interaction (FCI) models respectively, using only 6, 8, and 12 qubits with quantum gate depths proportional to the squares of the qubit counts. With the adopted seniority-zero approximation that uses only one half of the qubit counts of a conventional VQE algorithm, we find that our non-bosonic correction method reaches reliable quantum chemistry simulations at least for the tested systems.

The electron density: a fidelity witness for quantum computation

There is currently no combination of quantum hardware and algorithms that can provide an advantage over conventional calculations of molecules or materials. However, if or when such a point is reached, new strategies will be needed to verify predictions made using quantum devices. We propose that the electron density, obtained through experimental or computational means, can serve as a robust benchmark for validating the accuracy of quantum computation of chemistry. An initial exploration into topological features of electron densities, facilitated by quantum computation, is presented here as a proof of concept. Additionally, we examine the effects of constraining and symmetrizing measured one-particle reduced density matrices on noise-driven errors in the electron density distribution. We emphasize the potential benefits and future need for high-quality electron densities derived from diffraction experiments for validating classically intractable quantum computations of materials.

Optical transmission of microwave control signal towards large-scale superconducting quantum computing

With the rapid development of superconducting quantum computing and the implementation of surface code, large-scale quantum computing is emerging as an urgent demand. In a superconducting computing system, the qubit is maintained in a cryogenic environment to avoid thermal excitation. Thus, the transmission of control signals, which are generated at room temperature, is needed. Typically, the transmission of these signals to the qubit relies on a coaxial cable wiring approach. However, in a large-scale computing system with hundreds or even thousands of qubits, the coaxial cables will pose great space and heat load to the dilution refrigerator. Here, to tackle this problem, we propose and demonstrate a direct-modulation-based optical transmission line. In our experiment, the average single-qubit XEB error and control error are measured as 0.139% and 0.014% separately, demonstrating the feasibility of the optical wiring approach and paving the way for large-scale superconducting quantum computing.

Toward Chemical Accuracy with Shallow Quantum Circuits: A Clifford-Based Hamiltonian Engineering Approach

Achieving chemical accuracy with shallow quantum circuits is a significant challenge in quantum computational chemistry, particularly for near-term quantum devices. In this work, we present a Clifford-based Hamiltonian engineering algorithm, namely CHEM, that addresses the trade-off between circuit depth and accuracy. Based on a variational quantum eigensolver and hardware-efficient ansatz, our method designs the Clifford-based Hamiltonian transformation that (1) ensures a set of initial circuit parameters corresponding to the Hartree-Fock energy can be generated, (2) effectively maximizes the initial energy gradient with respect to circuit parameters, (3) imposes negligible overhead for classical processing and does not require additional quantum resources, and (4) is compatible with any circuit topology. We demonstrate the efficacy of our approach using a quantum hardware emulator, achieving chemical accuracy for systems as large as 12 qubits with fewer than 30 two-qubit gates. Our Clifford-based Hamiltonian engineering approach offers a promising avenue for practical quantum computational chemistry on near-term quantum devices.

Reinforcement learning assisted recursive QAOA

In recent years, variational quantum algorithms such as the Quantum Approximation Optimization Algorithm (QAOA) have gained popularity as they provide the hope of using NISQ devices to tackle hard combinatorial optimization problems. It is, however, known that at low depth, certain locality constraints of QAOA limit its performance. To go beyond these limitations, a non-local variant of QAOA, namely recursive QAOA (RQAOA), was proposed to improve the quality of approximate solutions. The RQAOA has been studied comparatively less than QAOA, and it is less understood, for instance, for what family of instances it may fail to provide high-quality solutions. However, as we are tackling NP-hard problems (specifically, the Ising spin model), it is expected that RQAOA does fail, raising the question of designing even better quantum algorithms for combinatorial optimization. In this spirit, we identify and analyze cases where (depth-1) RQAOA fails and, based on this, propose a reinforcement learning enhanced RQAOA variant (RL-RQAOA) that improves upon RQAOA. We show that the performance of RL-RQAOA improves over RQAOA: RL-RQAOA is strictly better on these identified instances where RQAOA underperforms and is similarly performing on instances where RQAOA is near-optimal. Our work exemplifies the potentially beneficial synergy between reinforcement learning and quantum (inspired) optimization in the design of new, even better heuristics for complex problems.

Chemically Accurate Potential Curves for H2 Molecules Using Explicitly Correlated Qubit-ADAPT

With the recent advances in the development of devices capable of performing quantum computations, a growing interest in finding near-term applications has emerged in many areas of science. In the era of nonfault tolerant quantum devices, algorithms that only require comparably short circuits accompanied by high repetition rates are considered to be a promising approach for assisting classical machines with finding a solution on computationally hard problems. The ADAPT approach previously introduced in Nat. Commun. 10, 3007 (2019) extends the class of variational quantum eigensolver algorithms with dynamically growing ansätze in order to find approximations to the ground and excited state energies of molecules. In this work, the ADAPT algorithm has been combined with a first-quantized formulation for the hydrogen molecule in the Born-Oppenheimer approximation, employing the explicitly correlated basis functions introduced in J. Chem. Phys. 43, 2429 (1965). By the virtue of their explicit electronic correlation properties, it is shown in classically performed simulations that chemical accuracy (<1.6 mHa) can be reached for ground and excited state potential curves using reasonably short circuits.

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.

Simulating Z_{2} lattice gauge theory on a quantum computer

The utility of quantum computers for simulating lattice gauge theories is currently limited by the noisiness of the physical hardware. Various quantum error mitigation strategies exist to reduce the statistical and systematic uncertainties in quantum simulations via improved algorithms and analysis strategies. We perform quantum simulations of Z_{2} gauge theory with matter to study the efficacy and interplay of different error mitigation methods: readout error mitigation, randomized compiling, rescaling, and dynamical decoupling. We compute Minkowski correlation functions in this confining gauge theory and extract the mass of the lightest spin-1 state from fits to their time dependence. Quantum error mitigation extends the range of times over which our correlation function calculations are accurate by a factor of 6 and is therefore essential for obtaining reliable masses.

Fermionic Reduced Density Low-Rank Matrix Completion, Noise Filtering, and Measurement Reduction in Quantum Simulations

Fermionic reduced density matrices summarize the key observables in Fermionic systems. In electronic systems, the two-particle reduced density matrix (2-RDM) is sufficient to determine the energy and most physical observables of interest. Here, we consider the possibility of using matrix completion to reconstruct the two-particle reduced density matrix to chemical accuracy from partial information. We consider the case of noiseless matrix completion, where the partial information corresponds to a subset of the 2-RDM elements, as well as noisy completion, where the partial information corresponds to both a subset of elements and statistical noise in their values. Through experiments on a set of 24 molecular systems, we find that 2-RDM can be efficiently reconstructed from a reduced amount of information. In the case of noisy completion, this results in a multiple orders of magnitude reduction in the number of measurements needed to determine the 2-RDM with chemical accuracy. These techniques can be readily applied to both classical and quantum algorithms for quantum simulations.

Deep Neural Network Assisted Quantum Chemistry Calculations on Quantum Computers

The variational quantum eigensolver (VQE) is a widely employed method to solve electronic structure problems in the current noisy intermediate-scale quantum (NISQ) devices. However, due to inherent noise in the NISQ devices, VQE results on NISQ devices often deviate significantly from the results obtained on noiseless statevector simulators or traditional classical computers. The iterative nature of VQE further amplifies the errors in each loop. Recent works have explored ways to integrate deep neural networks (DNN) with VQE to mitigate iterative errors, albeit primarily limited to the noiseless statevector simulators. In this work, we trained DNN models across various quantum circuits and examined the potential of two DNN-VQE approaches, DNN1 and DNNF, for predicting the ground state energies of small molecules in the presence of device noise. We carefully examined the accuracy of the DNN1, DNNF, and VQE methods on both noisy simulators and real quantum devices by considering different ansatzes of varying qubit counts and circuit depths. Our results illustrate the advantages and limitations of both VQE and DNN-VQE approaches. Notably, both DNN1 and DNNF methods consistently outperform the standard VQE method in providing more accurate ground state energies in noisy environments. However, despite being more accurate than VQE, the energies predicted using these methods on real quantum hardware remain meaningful only at reasonable circuit depths (depth = 15, gates = 21). At higher depths (depth = 83, gates = 112), they deviate significantly from the exact results. Additionally, we find that DNNF does not offer any notable advantage over VQE in terms of speed. Consequently, our study recommends DNN1 as the preferred method for obtaining quick and accurate ground state energies of molecules on current quantum hardware, particularly for quantum circuits with lower depth and fewer qubits.

Graph-|Q⟩⟨C|: A Quantum Algorithm with Reduced Quantum Circuit Depth for Electronic Structure

The accurate determination of chemical properties is known to have a critical impact on multiple fundamental chemical problems but is deeply hindered by the steep algebraic scaling of electron correlation calculations and the exponential scaling of quantum nuclear dynamics. With the advent of new quantum computing hardware and associated developments in creating new paradigms for quantum software, this avenue has been recognized as perhaps one way to address exponentially complex challenges in quantum chemistry and molecular dynamics. In this paper, we discuss a new approach to drastically reduce the quantum circuit depth (by several orders of magnitude) and help improve the accuracy in the quantum computation of electron correlation energies for large molecular systems. The method is derived from a graph-theoretic approach to molecular fragmentation and enables us to create a family of projection operators that decompose quantum circuits into separate unitary processes. Some of these processes can be treated on quantum hardware and others on classical hardware in a completely asynchronous and parallel fashion. Numerical benchmarks are provided through the computation of unitary coupled-cluster singles and doubles (UCCSD) energies for medium-sized protonated and neutral water clusters using the new quantum algorithms presented here.

Circuit-Depth Reduction of Unitary-Coupled-Cluster Ansatz by Energy Sorting

Quantum computation represents a revolutionary approach to solving problems in quantum chemistry. However, due to the limited quantum resources in the current noisy intermediate-scale quantum (NISQ) devices, quantum algorithms for large chemical systems remain a major task. In this work, we demonstrate that the circuit depth of the unitary coupled cluster (UCC) and UCC-based ansatzes in the algorithm of the variational quantum eigensolver can be significantly reduced by an energy-sorting strategy. Specifically, subsets of excitation operators are first prescreened from the operator pool according to its contribution to the total energy. The quantum circuit ansatz is then iteratively constructed until convergence of the final energy to a typical accuracy. For demonstration, this method has been successfully applied to molecular and periodic systems. Particularly, a reduction of 50%-98% in the number of operators is observed while retaining the accuracy of the original UCCSD operator pools. This method can be straightforwardly extended to general parametric variational ansatzes.

Bridging physical intuition and hardware efficiency for correlated electronic states: the local unitary cluster Jastrow ansatz for electronic structure

A prominent goal in quantum chemistry is to solve the molecular electronic structure problem for ground state energy with high accuracy. While classical quantum chemistry is a relatively mature field, the accurate and scalable prediction of strongly correlated states found, e.g., in bond breaking and polynuclear transition metal compounds remains an open problem. Within the context of a variational quantum eigensolver, we propose a new family of ansatzes which provides a more physically appropriate description of strongly correlated electrons than a unitary coupled cluster with single and double excitations (qUCCSD), with vastly reduced quantum resource requirements. Specifically, we present a set of local approximations to the unitary cluster Jastrow wavefunction motivated by Hubbard physics. As in the case of qUCCSD, exactly computing the energy scales factorially with system size on classical computers but polynomially on quantum devices. The local unitary cluster Jastrow ansatz removes the need for SWAP gates, can be tailored to arbitrary qubit topologies (e.g., square, hex, and heavy-hex), and is well-suited to take advantage of continuous sets of quantum gates recently realized on superconducting devices with tunable couplers. The proposed family of ansatzes demonstrates that hardware efficiency and physical transparency are not mutually exclusive; indeed, chemical and physical intuition regarding electron correlation can illuminate a useful path towards hardware-friendly quantum circuits.

Problem-Dependent Power of Quantum Neural Networks on Multiclass Classification

Quantum neural networks (QNNs) have become an important tool for understanding the physical world, but their advantages and limitations are not fully understood. Some QNNs with specific encoding methods can be efficiently simulated by classical surrogates, while others with quantum memory may perform better than classical classifiers. Here we systematically investigate the problem-dependent power of quantum neural classifiers (QCs) on multiclass classification tasks. Through the analysis of expected risk, a measure that weighs the training loss and the generalization error of a classifier jointly, we identify two key findings: first, the training loss dominates the power rather than the generalization ability; second, QCs undergo a U-shaped risk curve, in contrast to the double-descent risk curve of deep neural classifiers. We also reveal the intrinsic connection between optimal QCs and the Helstrom bound and the equiangular tight frame. Using these findings, we propose a method that exploits loss dynamics of QCs to estimate the optimal hyperparameter settings yielding the minimal risk. Numerical results demonstrate the effectiveness of our approach to explain the superiority of QCs over multilayer Perceptron on parity datasets and their limitations over convolutional neural networks on image datasets. Our work sheds light on the problem-dependent power of QNNs and offers a practical tool for evaluating their potential merit.

Variational Quantum Simulators Based on Waveguide QED

Waveguide QED simulators are analog quantum simulators made by quantum emitters interacting with one-dimensional photonic band gap materials. One of their remarkable features is that they can be used to engineer tunable-range emitter interactions. Here, we demonstrate how these interactions can be a resource to develop more efficient variational quantum algorithms for certain problems. In particular, we illustrate their power in creating wave function Ansätze that capture accurately the ground state of quantum critical spin models (XXZ and Ising) with fewer gates and optimization parameters than other variational Ansätze based on nearest-neighbor or infinite-range entangling gates. Finally, we study the potential advantages of these waveguide Ansätze in the presence of noise. Overall, these results evidence the potential of using the interaction range as a variational parameter and place waveguide QED simulators as a promising platform for variational quantum algorithms.

Quantum Computation of Hydrogen Bond Dynamics and Vibrational Spectra

Calculating observable properties of chemical systems is often classically intractable and widely viewed as a promising application of quantum information processing. Here, we introduce a new framework for solving generic quantum chemical dynamics problems using quantum logic. We experimentally demonstrate a proof-of-principle instance of our method using the QSCOUT ion-trap quantum computer, where we experimentally drive the ion-trap system to emulate the quantum wavepacket dynamics corresponding to the shared-proton within an anharmonic hydrogen bonded system. Following the experimental creation and propagation of the shared-proton wavepacket on the ion-trap, we extract measurement observables such as its time-dependent spatial projection and its characteristic vibrational frequencies to spectroscopic accuracy (3.3 cm-1 wavenumbers, corresponding to >99.9% fidelity). Our approach introduces a new paradigm for studying the chemical dynamics and vibrational spectra of molecules and opens the possibility to describe the behavior of complex molecular processes with unprecedented accuracy.

Quantum computer-aided design for advanced superconducting qubit: Plasmonium

Complex quantum electronic circuits can be used to design noise-protected qubits, but their complexity may exceed the capabilities of classical simulation. In such cases, quantum computers are necessary for efficient simulation. In this work, we demonstrate the use of variational quantum computing on a transmon-based quantum processor to simulate a superconducting quantum electronic circuit and design a new type of qubit called "Plasmonium", which operates in the plasmon-transition regime. The fabricated Plasmonium qubits show a high two-qubit gate fidelity of 99.58(3)%, as well as a smaller physical size and larger anharmonicity compared to transmon qubits. These properties make Plasmonium a promising candidate for scaling up multi-qubit devices. Our results demonstrate the potential of using quantum computers to aid in the design of advanced quantum processors.

Fermionic Correlation Functions from Randomized Measurements in Programmable Atomic Quantum Devices

We provide an efficient randomized measurement protocol to estimate two- and four-point fermionic correlations in ultracold atom experiments. Our approach is based on combining random atomic beam splitter operations, which can be realized with programmable optical landscapes, with high-resolution imaging systems such as quantum gas microscopes. We illustrate our results in the context of the variational quantum eigensolver algorithm for solving quantum chemistry problems.