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.

Simulation of Chemical Reactions on a Quantum Computer.

Studying chemical reactions, particularly in the gas phase, relies heavily on computing scattering matrix elements. These elements are essential for characterizing molecular reactions and accurately determining reaction probabilities. However, the intricate nature of quantum interactions poses challenges, necessitating the use of advanced mathematical models and computational approaches to tackle the inherent complexities. In this study, we develop and apply a quantum computing algorithm for the calculation of scattering matrix elements. In our approach, we employ the time-dependent method based on the Møller operator formulation where the S-matrix element between the respective reactant and product channels is determined through the time correlation function of the reactant and product Møller wavepackets. We successfully apply our quantum algorithm to calculate scattering matrix elements for 1D semi-infinite square well potential and on the colinear hydrogen exchange reaction. As we navigate the complexities of quantum interactions, this quantum algorithm is general and emerges as a promising avenue, shedding light on new possibilities for simulating chemical reactions on quantum computers.

Walking with the Atoms in a Chemical Bond: A Perspective Using Quantum Phase Transition.

Phase transitions happen at critical values of the controlling parameters, such as the critical temperature in classical phase transitions, and system critical parameters in the quantum case. However, true criticality happens only at the thermodynamic limit, when the number of particles goes to infinity with constant density. To perform the calculations for the critical parameters, a finite-size scaling approach was developed to extrapolate information from a finite system to the thermodynamic limit. With the advancement in the experimental and theoretical work in the field of ultra-cold systems, particularly trapping and controlling single atomic and molecular systems, one can ask: do finite systems exhibit quantum phase transition? To address this question, finite-size scaling for finite systems was developed to calculate the quantum critical parameters. The recent observation of a quantum phase transition in a single trapped 171 Yb+ ion indicates the possibility of quantum phase transitions in finite systems. This perspective focuses on examining chemical processes at ultra-cold temperatures, as quantum phase transitions-particularly the formation and dissociation of chemical bonds-are the basic processes for understanding the whole of chemistry.

Physics-Inspired Quantum Simulation of Resonating Valence Bond States─A Prototypical Template for a Spin-Liquid Ground State.

Spin liquids─an emergent, exotic collective phase of matter─have garnered enormous attention in recent years. While experimentally many prospective candidates have been proposed and realized, theoretically modeling real materials that display such behavior may pose serious challenges due to the inherently high correlation content of such phases. Over the last few decades, the second-quantum revolution has been the harbinger of a novel computational paradigm capable of initiating a foundational evolution in computational physics. In this report, we strive to use the power of the latter to study a prototypical model, a spin-1/2-unit cell of a Kagome antiferromagnet. Extended lattices of such unit cells are known to possess a magnetically disordered spin-liquid ground state. We employ robust classical numerical techniques such as the density-matrix renormalization group (DMRG) to identify the nature of the ground state through a matrix-product state (MPS) formulation. We subsequently use the gained insight to construct an auxiliary Hamiltonian with reduced measurables and also design an ansatz that is modular and gate-efficient. With robust error-mitigation strategies, we are able to demonstrate that the said ansatz is capable of accurately representing the target ground state even on a real IBMQ backend within 1% accuracy in energy. Since the protocol is linearly scaling O(n) in the number of unit cells, gate requirements, and the number of measurements, it is straightforwardly extendable to larger Kagome lattices that can pave the way for efficient construction of spin-liquid ground states on a quantum device.

Mapping Molecular Hamiltonians into Hamiltonians of Modular cQED Processors.

We introduce a general method based on the operators of the Dyson-Masleev transformation to map the Hamiltonian of an arbitrary model system into the Hamiltonian of a circuit Quantum Electrodynamics (cQED) processor. Furthermore, we introduce a modular approach to programming a cQED processor with components corresponding to the mapping Hamiltonian. The method is illustrated as applied to quantum dynamics simulations of the Fenna-Matthews-Olson (FMO) complex and the spin-boson model of charge transfer. Beyond applications to molecular Hamiltonians, the mapping provides a general approach to implement any unitary operator in terms of a sequence of unitary transformations corresponding to powers of creation and annihilation operators of a single bosonic mode in a cQED processor.

Quantum Machine Learning Predicting ADME-Tox Properties in Drug Discovery.

In the drug discovery paradigm, the evaluation of absorption, distribution, metabolism, and excretion (ADME) and toxicity properties of new chemical entities is one of the most critical issues, which is a time-consuming process, immensely expensive, and poses formidable challenges in pharmaceutical R&D. In recent years, emerging technologies like artificial intelligence (AI), big data, and cloud technologies have garnered great attention to predict the ADME and toxicity of molecules. Currently, the blend of quantum computation and machine learning has attracted considerable attention in almost every field ranging from chemistry to biomedicine and several engineering disciplines as well. Quantum computers have the potential to bring advances in high-throughput experimental techniques and in screening billions of molecules by reducing development costs and time associated with the drug discovery process. Motivated by the efficiency of quantum kernel methods, we proposed a quantum machine learning (QML) framework consisting of a classical support vector classifier algorithm with a kernel-based quantum classifier. To demonstrate the feasibility of the proposed QML framework, the simplified molecular input line entry system (SMILES) notation-based string kernel, combined with a quantum support vector classifier, is used for the evaluation of chemical/drug ADME-Tox properties. The proposed quantum machine learning framework is validated and assessed via large-scale simulations. Based on our results from numerical simulations, the quantum model achieved the best performance as compared to classical counterparts in terms of the area under the curve of the receiver operating characteristic curve (AUC ROC; 0.80-0.95) for predicting outcomes on ADME-Tox data sets for small molecules, with a different number of features. The deployment of the proposed framework in the pharmaceutical industry would be extremely valuable in making the best decisions possible.

Simulating Open Quantum System Dynamics on NISQ Computers with Generalized Quantum Master Equations.

We present a quantum algorithm based on the generalized quantum master equation (GQME) approach to simulate open quantum system dynamics on noisy intermediate-scale quantum (NISQ) computers. This approach overcomes the limitations of the Lindblad equation, which assumes weak system-bath coupling and Markovity, by providing a rigorous derivation of the equations of motion for any subset of elements of the reduced density matrix. The memory kernel resulting from the effect of the remaining degrees of freedom is used as input to calculate the corresponding non-unitary propagator. We demonstrate how the Sz.-Nagy dilation theorem can be employed to transform the non-unitary propagator into a unitary one in a higher-dimensional Hilbert space, which can then be implemented on quantum circuits of NISQ computers. We validate our quantum algorithm as applied to the spin-boson benchmark model by analyzing the impact of the quantum circuit depth on the accuracy of the results when the subset is limited to the diagonal elements of the reduced density matrix. Our findings demonstrate that our approach yields reliable results on NISQ IBM computers.

Toward perturbation theory methods on a quantum computer.

Perturbation theory, used in a wide range of fields, is a powerful tool for approximate solutions to complex problems, starting from the exact solution of a related, simpler problem. Advances in quantum computing, especially over the past several years, provide opportunities for alternatives to classical methods. Here, we present a general quantum circuit estimating both the energy and eigenstates corrections that is far superior to the classical version when estimating second-order energy corrections. We demonstrate our approach as applied to the two-site extended Hubbard model. In addition to numerical simulations based on qiskit, results on IBM's quantum hardware are also presented. Our work offers a general approach to studying complex systems with quantum devices, with no training or optimization process needed to obtain the perturbative terms, which can be generalized to other Hamiltonian systems both in chemistry and physics.

Analogy between Boltzmann Machines and Feynman Path Integrals.

Machine learning has had a significant impact on multiple areas of science, technology, health, and computer and information sciences. Through the advent of quantum computing, quantum machine learning has developed as a new and important avenue for the study of complex learning problems. Yet there is substantial debate and uncertainty in regard to the foundations of machine learning. Here, we provide a detailed exposition of the mathematical connections between a general machine learning approach called Boltzmann machines and Feynman's description of quantum and statistical mechanics. In Feynman's description, quantum phenomena arise from an elegant, weighted sum over (or superposition of) paths. Our analysis shows that Boltzmann machines and neural networks have a similar mathematical structure. This allows the interpretation that the hidden layers in Boltzmann machines and neural networks are discrete versions of path elements and allows a path integral interpretation of machine learning similar to that in quantum and statistical mechanics. Since Feynman paths are a natural and elegant depiction of interference phenomena and the superposition principle germane to quantum mechanics, this analysis allows us to interpret the goal in machine learning as finding an appropriate combination of paths, and accumulated path-weights, through a network, that cumulatively captures the correct properties of an x-to-y map for a given mathematical problem. We are forced to conclude that neural networks are naturally related to Feynman path-integrals and hence may present one avenue to be considered as quantum problems. Consequently, we provide general quantum circuit models applicable to both Boltzmann machines and Feynman path integrals.

Characterizing quantum circuits with qubit functional configurations.

We develop a systematic framework for characterizing all quantum circuits with qubit functional configurations. The qubit functional configuration is a mathematical structure that can classify the properties and behaviors of quantum circuits collectively. Major benefits of classifying quantum circuits in this way include: 1. All quantum circuits can be classified into corresponding types; 2. Each type characterizes important properties (such as circuit complexity) of the quantum circuits belonging to it; 3. Each type contains a huge collection of possible quantum circuits allowing systematic investigation of their common properties. We demonstrate the theory's application to analyzing the hardware-efficient ansatzes of variational quantum algorithms. For potential applications, the functional configuration theory may allow systematic understanding and development of quantum algorithms based on their functional configuration types.

Hamiltonian Learning from Time Dynamics Using Variational Algorithms.

The Hamiltonian of a quantum system governs the dynamics of the system via the Schrodinger equation. In this paper, the Hamiltonian is reconstructed in the Pauli basis using measurables on random states forming a time series data set. The time propagation is implemented through Trotterization and optimized variationally with gradients computed on the quantum circuit. We validate our output by reproducing the dynamics of unseen observables on a randomly chosen state not used for the optimization. Unlike existing techniques that try and exploit the structure/properties of the Hamiltonian, our scheme is general and provides freedom with regard to what observables or initial states can be used while still remaining efficient with regard to implementation. We extend our protocol to doing quantum state learning where we solve the reverse problem of doing state learning given time series data of observables generated against several Hamiltonian dynamics. We show results on Hamiltonians involving XX, ZZ couplings along with transverse field Ising Hamiltonians and propose an analytical method for the learning of Hamiltonians consisting of generators of the SU(3) group. This paper is likely to pave the way toward using Hamiltonian learning for time series prediction within the context of quantum machine learning algorithms.

Quantum Simulation of the Radical Pair Dynamics of the Avian Compass.

The simulation of open quantum dynamics on quantum circuits has attracted wide interests recently with a variety of quantum algorithms developed and demonstrated. Among these, one particular design of a unitary-dilation-based quantum algorithm is capable of simulating general and complex physical systems. In this paper, we apply this quantum algorithm to simulating the dynamics of the radical pair mechanism in the avian compass. This application is demonstrated on the IBM QASM quantum simulator. This work is the first application of any quantum algorithm to simulating the radical pair mechanism in the avian compass, which not only demonstrates the generality of the quantum algorithm but also opens new opportunities for studying the avian compass with quantum computing devices.

Magnetic phases of spatially modulated spin-1 chains in Rydberg excitons: Classical and quantum simulations.

In this work, we study the magnetic phases of a spatially modulated chain of spin-1 Rydberg excitons. Using the Density Matrix Renormalization Group (DMRG) technique, we study various magnetic and topologically nontrivial phases using both single-particle properties, such as local magnetization and quantum entropy, and many-body ones, such as pair-wise Néel and long-range string correlations. In particular, we investigate the emergence and robustness of the Haldane phase, a topological phase of anti-ferromagnetic spin-1 chains. Furthermore, we devise a hybrid quantum algorithm employing restricted Boltzmann machine to simulate the ground state of such a system that shows very good agreement with the results of exact diagonalization and DMRG.

Variational approach to quantum state tomography based on maximal entropy formalism.

Quantum state tomography is an integral part of quantum computation and offers the starting point for the validation of various quantum devices. One of the central tasks in the field of state tomography is to reconstruct, with high fidelity, the quantum states of a quantum system. From an experiment on a real quantum device, one can obtain the mean measurement values of different operators. With such data as input, in this report we employ the maximal entropy formalism to construct the least biased mixed quantum state that is consistent with the given set of expectation values. Even though, in principle, the reported formalism is quite general and should work for an arbitrary set of observables, in practice we shall demonstrate the efficacy of the algorithm on an informationally complete (IC) set of Hermitian operators. Such a set possesses the advantage of uniquely specifying a single quantum state from which the experimental measurements have been sampled and hence renders the rare opportunity not only to construct a least-biased quantum state but even replicate the exact state prepared experimentally within a preset tolerance. The primary workhorse of the algorithm is reconstructing an energy function which we designate as the effective Hamiltonian of the system, and parameterizing it with Lagrange multipliers, according to the formalism of maximal entropy. These parameters are thereafter optimized variationally so that the reconstructed quantum state of the system converges to the true quantum state within an error threshold. To this end, we employ a parameterized quantum circuit and a hybrid quantum-classical variational algorithm to obtain such a target state, making our recipe easily implementable on a near-term quantum device.

Realization of Heisenberg models of spin systems with polar molecules in pendular states.

We show that ultra-cold polar diatomic or linear molecules, oriented in an external electric field and mutually coupled by dipole-dipole interactions, can be used to realize the exact Heisenberg XYZ, XXZ and XY models without invoking any approximation. The two lowest lying excited pendular states coupled by microwave or radio-frequency fields are used to encode the pseudo-spin. We map out the general features of the models by evaluating the models constants as functions of the molecular dipole moment, rotational constant, strength and direction of the external field as well as the distance between molecules. We calculate the phase diagram for a linear chain of polar molecules based on the Heisenberg models and discuss their drawbacks, advantages, and potential applications.

Statistical Properties of Bit Strings Sampled from Sycamore Random Quantum Circuits.

Quantum supremacy has been recently reported for random circuit sampling on the Sycamore processor with 53 qubits. Here, we analyze the statistical properties of bit strings sampled from random quantum circuits. In contrast to classical random bit strings, bit strings sampled from Sycamore random circuits give rise to heat maps with stripe patterns at specific qubits, have more bit 1 than 0, and do not pass the NIST random number tests. The difference between the Sycamore bit strings and classical random bit strings is also demonstrated by the Marchenko-Pastur distribution and the Girko circular law of random matrices. The calculation of Wasserstein distances shows that the Sycamore bit strings are farther from bit strings sampled from Haar-measure random quantum circuits than classical random bit strings. Our results show that random matrices and Wasserstein distances could be used to analyze the performance of quantum computers.

Quantum machine learning for chemistry and physics.

Machine learning (ML) has emerged as a formidable force for identifying hidden but pertinent patterns within a given data set with the objective of subsequent generation of automated predictive behavior. In recent years, it is safe to conclude that ML and its close cousin, deep learning (DL), have ushered in unprecedented developments in all areas of physical sciences, especially chemistry. Not only classical variants of ML, even those trainable on near-term quantum hardwares have been developed with promising outcomes. Such algorithms have revolutionized materials design and performance of photovoltaics, electronic structure calculations of ground and excited states of correlated matter, computation of force-fields and potential energy surfaces informing chemical reaction dynamics, reactivity inspired rational strategies of drug designing and even classification of phases of matter with accurate identification of emergent criticality. In this review we shall explicate a subset of such topics and delineate the contributions made by both classical and quantum computing enhanced machine learning algorithms over the past few years. We shall not only present a brief overview of the well-known techniques but also highlight their learning strategies using statistical physical insight. The objective of the review is not only to foster exposition of the aforesaid techniques but also to empower and promote cross-pollination among future research in all areas of chemistry which can benefit from ML and in turn can potentially accelerate the growth of such algorithms.

Geometrical picture of the electron-electron correlation at the large-D limit.

In electronic structure calculations, the correlation energy is defined as the difference between the mean field and the exact solution of the non relativistic Schrödinger equation. Such an error in the different calculations is not directly observable as there is no simple quantum mechanical operator, apart from correlation functions, that correspond to such quantity. Here, we use the dimensional scaling approach, in which the electrons are localized at the large-dimensional scaled space, to describe a geometric picture of the electronic correlation. Both, the mean field, and the exact solutions at the large-D limit have distinct geometries. Thus, the difference might be used to describe the correlation effect. Moreover, correlations can be also described and quantified by the entanglement between the electrons, which is a strong correlation without a classical analog. Entanglement is directly observable and it is one of the most striking properties of quantum mechanics and bounded by the area law for local gapped Hamiltonians of interacting many-body systems. This study opens up the possibility of presenting a geometrical picture of the electron-electron correlations and might give a bound on the correlation energy. The results at the large-D limit and at D = 3 indicate the feasibility of using the geometrical picture to get a bound on the electron-electron correlations.

A quantum encryption design featuring confusion, diffusion, and mode of operation.

Quantum cryptography-the application of quantum information processing and quantum computing techniques to cryptography has been extensively investigated. Two major directions of quantum cryptography are quantum key distribution (QKD) and quantum encryption, with the former focusing on secure key distribution and the latter focusing on encryption using quantum algorithms. In contrast to the success of the QKD, the development of quantum encryption algorithms is limited to designs of mostly one-time pads (OTP) that are unsuitable for most communication needs. In this work we propose a non-OTP quantum encryption design utilizing a quantum state creation process to encrypt messages. As essentially a non-OTP quantum block cipher the method stands out against existing methods with the following features: 1. complex key-ciphertext relation (i.e. confusion) and complex plaintext-ciphertext relation (i.e. diffusion); 2. mode of operation design for practical encryption on multiple blocks. These features provide key reusability and protection against eavesdropping and standard cryptanalytic attacks.