Search NASASearch

SEARCH · Search NASA

Results for “Variational Quantum Algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^(8) determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

Quantum Computing

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^(8) determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

Quantum Computing

Wildfire Segmentation From Remotely Sensed Data Using Quantum-Compatible Conditional Vector Quantized-Variational Autoencoders

Wildfires represent a critical environmental hazard with multifaceted implications for ecosystems, communities, and public health [1]. The escalating frequency and intensity of wildfires globally have intensified the urgency for robust segmentation methodologies to facilitate effective mitigation, response, and recovery strategies [2]. Accurate wildfire segmentation is pivotal for delineating fire boundaries, assessing progression patterns, and prioritizing resource allocation during emergency scenarios. Furthermore, precise segmentation enables stakeholders, including policymakers, environmental scientists, and emergency responders, to formulate evidence-based strategies, thereby minimizing socio-economic disruptions and ecological degradation. Consequently, advancing wildfire segmentation techniques through innovative technological interventions remains a paramount research imperative. Although foundational in wildfire segmentation, traditional deterministic models exhibit inherent limitations that compromise their efficacy in dynamic and uncertain environments. These models often operate on rigid algorithms prioritizing deterministic classifications, thereby overlooking the inherent complexities and uncertainties associated with wildfire behavior and satellite data variability. Such deterministic frameworks tend to produce oversimplified representations that fail to capture the intricate nuances of evolving fire dynamics, spatial heterogeneity, and environmental interactions [1]. Consequently, the deterministic approach’s propensity for uncertainty collapsing [1, 3] hampers the accuracy, reliability, and applicability of segmentation outcomes in real-world scenarios. Contrastingly, stochastic models offer a more nuanced and adaptable framework for wildfire segmentation. By integrating probabilistic elements into the modeling paradigm, stochastic approaches, particularly probabilistic approaches such as variational auto encoders (VAEs) [4], facilitate comprehensive uncertainty assessment, enabling researchers to quantify and incorporate uncertainties into segmentation outcomes effectively. This probabilistic nature empowers stochastic models to encapsulate variability, account for data inconsistencies, and adapt to evolving environmental conditions, enhancing segmentation accuracy, reliability, and robustness. Embracing stochastic methodologies thus catalyzes advancements in wildfire science by fostering a more holistic, adaptive, and resilient segmentation framework. Despite VAEs demonstrating significant promise in various applications, they come with inherent limitations that have garnered attention within the machine learning community. One of the primary drawbacks lies in their reliance on static priors, which essentially assume a fixed distribution for latent variables, thereby limiting the model’s flexibility to capture complex data structures effectively [5]. This static nature leads to suboptimal representations, especially when dealing with complex and high-dimensional data. Additionally, VAEs often struggle with generating sharp and realistic samples, a phenomenon commonly referred to as mode collapse [5, 7, 6]. Furthermore, the optimization process in VAEs, which involves balancing the reconstruction loss and the regularization term, can sometimes be challenging to fine-tune [7]. In recent efforts to address these shortcomings, alternative approaches like Vector Quantized Variational Auto encoders(VQ-VAEs) [7], address the challenges by incorporating discrete latent variables and leveraging techniques that enhance the quality and diversity of generated samples while maintaining efficient training dynamics. VQ-VAEs propose a dynamic prior distribution generation mechanism that diverges from the static priors commonly associated with traditional VAEs. This dynamic approach allows for more adaptive and context-aware latent variable representations, thereby potentially capturing complex data structures more effectively. Unlike autoregressive prior models such as PixelCNN, which, despite their ability to model dependencies across data dimensions, suffer from significant computational inefficiencies and lack flexibility in handling diverse datasets. In our work, we propose to use a generative quantum-compatible approach to help alleviate the shortcomings of autoregressive prior model in VQ-VAEs. Restricted Boltzmann Machines (RBMs) are a viable alternative prior model that can learn prior distributions in a faster and more flexible manner. In this research endeavor, we meticulously curate a state-of-the-art dataset leveraging satellite MODIS data in conjunction with VIIRS fire masks, derived from Fire Radiative Power (FRP), thereby encapsulating diverse wildfire scenarios and environmental contexts. We developed a conditional VQ-VAE architecture with the RBM prior model that is trained in a supervised manner for segmenting wildfire masks. This innovative approach synergistically harnesses deep learning capabilities, enabling the generation of segmentation maps characterized by heightened precision, granularity, and contextual relevance. Furthermore, replacing the autoregressive prior learning method proposed by the original VQ-VAE with a prior density approximation via quantum-compatible RBM facilitates expedited inference processes, augments flexibility in prior sampling, optimizes computational efficiency and establishes a groundbreaking benchmark in wildfire segmentation methodologies.

quantum machine learning

Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation

Recently, the makespan-minimization problem of compiling a general class of quantum algorithms into near-term quantum processors has been introduced to the AI community. The research demonstrated that temporal planning is a strong solution approach for the studied class of quantum circuit compilation (QCC) problems. In this paper, we explore the use of methods from operations research, specifically constraint programming (CP), as an alternative and complementary approach to temporal planning. We also extend previous work by introducing two new problem variations that incorporate important characteristics identified by the quantum computing community. We apply temporal planning and CP to the baseline and extended QCC problems as both stand-alone and hybrid approaches. The hybrid method uses solutions found by temporal planning to warm-start CP, leveraging the ability of temporal planning to find satisficing solutions to problems with a high degree of task optionality, an area that CP typically struggles with. These solutions are then used to seed the CP formulation which significantly benefits from inferred bounds on planning horizon and task counts provided by the warm-start. Our extensive empirical evaluation indicates that while stand-alone CP is not competitive with temporal planning, except for the smallest problems, CP in a hybrid setting is beneficial for all temporal planners in all problem classes.

quantum circuit compilation

Advancing quantum simulations of the nuclear shell model with Gray-code–based resource-efficient protocols

Background: Some of the computational limitations in solving the nuclear many-body problem could be overcome by utilizing quantum computers. The nuclear shell-model calculations providing deeper insights into the properties of atomic nuclei are one such case with high demand for resources, as the size of the Hilbert space grows exponentially with the number of particles involved. Quantum algorithms are being developed to overcome these challenges and advance such calculations. Purpose: To develop quantum circuits for the nuclear shell-model, leveraging the capabilities of noisy intermediate-scale quantum (NISQ) devices. Here, we aim to minimize resource requirements (specifically in terms of qubits and gates) and strive to reduce the impact of noise by employing relevant mitigation techniques. Methods: We achieve noise resilience by designing an optimized Ansatz for the variational quantum eigensolver (VQE) based on Givens rotations and incorporating qubit-ADAPT-VQE in combination with variational quantum deflation (VQD) to compute ground and excited states, incorporating the zero-noise extrapolation mitigation technique. Furthermore, the qubit requirements are significantly reduced by mapping the basis states to qubits using Gray-code encoding and generalizing transformations of fermionic operators to efficiently represent many-body states. Results: By employing the resource-efficient protocols, we achieve the ground and excited state energy levels of 38 Ar and 6 Li with better accuracy. These energy levels are presented for noiseless simulations, noisy conditions, and after applying noise mitigation techniques. Results are compared for Jordan-Wigner and Gray-code encoding using VQE, qubit-ADAPT-VQE, and VQD. Conclusions: Our work highlights the potential of resource-efficient protocols to leverage the full potential of NISQ devices in scaling the nuclear shell model calculations, offering a pathway toward more complex quantum simulations in nuclear physics. This approach establishes a framework for studying other nuclear systems with improved quantum resource efficiency, marking a significant advancement in applying quantum computing to realistic nuclear physics applications.

Physics - Nuclear physics and radiation physics

Quantum Computing for Energy-Related Applications

Growing interest in quantum computing and simulations have created opportunities for its deployment to improve processes pertaining to energy production, distribution, and consumption. While quantum computing is considered as a paradigm shift in our basic understanding of physical computation, effective implementation of quantum computing in energy applications also depends on progress and development in the dimensions of both quantum computing hardware and quantum computing algorithms. To fully address the status and future challenges of quantum information science (QIS) applied within the energy sector, in this presentation, we firstly summarize recent advancements on the applications of quantum computing to energy infrastructure and materials, complex energy system processes, advanced manufacturing, and energy system security. Then, we will demonstrate the results of quantum computing both on a simulator and a quantum device accessing from OLCF. Our first example is to use the variational quantum eigensolver (VQE) with a unitary coupled cluster with singles and doubles (UCCSD) ansatz to simulate a series of LixHyq molecules (q=-1, 0, +1). The obtained results showed that the quantum computing VQE-UCCSD is comparable to classical CCSD for small systems like LiH with respect to full configuration interaction (FCI). Targeting on CO2 capture application, our second example is to use VQE to quantify molecular vibrational energies and reaction pathways between CO2 and a simplified amine-based solvent model—NH3 to form H2NCOOH. This research showcases quantum computing applications in the study of CO2 capture reactions.

Duan, Yuhua

Estimating Eigenenergies from Quantum Dynamics: A Unified Noise-Resilient Measurement-Driven Approach

Ground state energy estimation in physical, chemical, and materials sciences is one of the most promising applications of quantum computing. In this work, we introduce a new hybrid approach that finds the eigenenergies by collecting real-time measurements and post-processing them using the machinery of dynamic mode decomposition (DMD). From the perspective of quantum dynamics, we establish that our approach can be formally understood as a stable variational method on the function space of observables available from a quantum many-body system. We also provide strong theoretical and numerical evidence that our method converges rapidly even in the presence of a large degree of perturbative noise, and show that the method bears an isomorphism to robust matrix factorization methods developed independently across various scientific communities. Our numerical benchmarks on spin and molecular systems demonstrate an accelerated convergence and a favorable resource reduction over state-of-the-art algorithms. The DMD-centric strategy can systematically mitigate noise and stands out as a leading hybrid quantum-classical eigensolver.

Shen, Yizhi

Role of electron correlation on the adenine dimer interaction for non-equilibrium geometries: a benchmark Quantum Monte Carlo study

The accurate description of non-covalent interactions is critical for understanding the structure, dynamics, and eventual function of biomolecules. The adenine dimer serves as a benchmark system for computational methods due to its role in nucleic acid structures and its rich conformational landscape. In this study, we employ benchmark diffusion quantum Monte Carlo (DMC) methods to investigate the relative energies and role of electron correlation on a set of adenine dimer conformations generated via a search of the potential energy landscape using the global optimizer algorithm. Relative DMC energies are compared against a wide range of density functional theory (DFT) approximation results. We find that although most of the DFT functionals perform well for low-energy structures, their accuracy varies significantly for higher-energy conformations, including stacked and T-shaped structures. A large fraction of the variation is due to the treatment of the van der Waals interaction. BLYP, B3LYP, and PBE0 significantly improve with added D4 dispersion, while the recent r2SCAN-D4 and ωB97M-V functionals show the least scatter and closest agreement with the DMC. These findings highlight the delicate nature of these interactions in biomolecular systems and provide guidance for simulations of their structure and dynamics and for the development of machine learned interatomic potentials.

Washburn, Laurel [ORNL] (ORCID:0000000324179335)

Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers

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

97 MATHEMATICS AND COMPUTING

The quantum dynamics of electronically nonadiabatic chemical reactions

Considerable progress was achieved on the quantum mechanical treatment of electronically nonadiabatic collisions involving energy transfer and chemical reaction in the collision of an electronically excited atom with a molecule. In the first step, a new diabatic representation for the coupled potential energy surfaces was created. A two-state diabatic representation was developed which was designed to realistically reproduce the two lowest adiabatic states of the valence bond model and also to have the following three desirable features: (1) it is more economical to evaluate; (2) it is more portable; and (3) all spline fits are replaced by analytic functions. The new representation consists of a set of two coupled diabatic potential energy surfaces plus a coupling surface. It is suitable for dynamics calculations on both the electronic quenching and reaction processes in collisions of Na(3p2p) with H2. The new two-state representation was obtained by a three-step process from a modified eight-state diatomics-in-molecules (DIM) representation of Blais. The second step required the development of new dynamical methods. A formalism was developed for treating reactions with very general basis functions including electronically excited states. Our formalism is based on the generalized Newton, scattered wave, and outgoing wave variational principles that were used previously for reactive collisions on a single potential energy surface, and it incorporates three new features: (1) the basis functions include electronic degrees of freedom, as required to treat reactions involving electronic excitation and two or more coupled potential energy surfaces; (2) the primitive electronic basis is assumed to be diabatic, and it is not assumed that it diagonalizes the electronic Hamiltonian even asymptotically; and (3) contracted basis functions for vibrational-rotational-orbital degrees of freedom are included in a very general way, similar to previous prescriptions for locally adiabatic functions in various quantum scattering algorithms.

Truhlar, Donald G.

Sparse non-Markovian Noise Modeling of Transmon-Based Multi-Qubit Operations

The influence of noise on quantum dynamics is one of the main factors preventing current quantum processors from performing accurate quantum computations. Sufficient noise characterization and modeling can provide key insights into the effect of noise on quantum algorithms and inform the design of targeted error protection protocols. However, constructing effective noise models that are sparse in model parameters, yet predictive can be challenging. In this work, we present an approach for effective noise modeling of multi-qubit operations on transmon-based devices. Through a comprehensive characterization of seven devices offered by the IBM Quantum Platform, we show that the model can capture and predict a wide range of single- and two-qubit behaviors, including non-Markovian effects resulting from spatiotemporally correlated noise sources. The model’s predictive power is further highlighted through multi-qubit dynamical decoupling demonstrations and an implementation of the variational quantum eigensolver. As a training proxy for the hardware, we show that the model can predict expectation values within a relative error of 0.5%; this is a sevenfold improvement over default hardware noise models. Through these demonstrations, we highlight key error sources in superconducting qubits and illustrate the utility of reduced noise models for predicting hardware dynamics.

open quantum systems & decoherence

Towards a Quantum Algorithm for the Incompressible Nonlinear Navier-Stokes Equations

In this work, we present novel concepts for quantum algorithms to solve transient, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the incompressible Navier-Stokes equations as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts solving nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. We propose a new framework based on matrix product states (MPSs) and matrix product operators (MPOs), in addition to the Krylov subspace methods. For example, the solution variables of the Navier-Stokes equations are represented by MPSs, and the linear and nonlinear terms are processed by MPOs. The time evolution of the operators is attained by a fast-forwarding algorithm using Krylov subspace methods. Furthermore, we discuss various techniques for efficient encoding of MPSs, measurement reduction for MPOs, and use of tensor operations to treat multi-variate, multi-physics characteristics of Navier-Stokes.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000

Counterdiabatic Driving with Performance Guarantees

Counterdiabatic (CD) driving has the potential to speed up adiabatic quantum state preparation by suppressing unwanted excitations. However, existing approaches either require intractable classical computations or are based on approximations that do not have performance guarantees. We propose and analyze a nonvariational, system-agnostic CD expansion method and analytically show that it converges exponentially quickly in the expansion order. In finite systems, the required resources scale inversely with the spectral gap, which we argue is asymptotically optimal. To extend our method to the thermodynamic limit and suppress errors stemming from high-frequency transitions, we leverage finite-time adiabatic protocols. In particular, we show that a time determined by the quantum speed limit is sufficient to prepare the desired ground state, without the need to optimize the adiabatic trajectory. Numerical tests of our method on the quantum Ising chain show that our method can outperform state-of-the-art variational CD approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

An improved guess for the variational calculation of charge-transfer excitations in large systems

Ab initio quantum-chemical methods that perform well for computing the electronic ground state are not straightforwardly transferable to electronically excited states, particularly in large molecular systems. Wave function theory offers high accuracy, but is often prohibitively expensive. Methods based on time-dependent density functional theory (TD-DFT) are crucially sensitive to the chosen exchange-correlation functional (XCF) parameterization, and system-specific tuning protocols were therefore proposed to address the method's robustness. Methods based on the variational relaxation of the excited-state electron density showcased promising results for the calculation of charge-transfer excitations, but the complex shape of the electronic hypersurface makes convergence to a specific excited state much more difficult than for the ground state when standard variational techniques are applied. We address the latter aspect by providing suitable initial guesses, which we obtain by two separate constrained algorithms. Combined with the squared-gradient minimization algorithm for all-electrons relaxation in a freeze-and-release scheme (FRZ-SGM), we demonstrate that orbital-optimized density functional theory (OO-DFT) calculations can reliably converge to the charge-transfer states of interest even for large molecular systems. We test the FRZ-SGM method on a phenothiazine-anthraquinone CT excitation in a supramolecular Pd(II) coordination cage complex as a function of the cage conformation. This compound has been studied experimentally prior to our work. We compare this freeze-and-release scheme to two XCF reparameterizations, which were recently proposed as low-cost TD-DFT-based alternatives to variational methods. Two dye-semiconductor complexes, which were previously investigated in the context of photovoltaic applications, serve as a second example to investigate the convergence and stability of the FRZ-SGM approach. Our results demonstrate that FRZ-SGM provides reliable convergence for charge-transfer excited states and avoids variational collapse to lower-lying electronic states, whereas time-dependent DFT calculations with an adequate tuning procedure for the range-separation parameter provide a computationally efficient initial estimate of the corresponding energies, with a computational cost comparable to that of configuration-interaction singles (CIS) calculations.

Bogo, Nicola

Alternating and Gaussian Fermionic Isometric Tensor Network States

Isometric tensor networks in two dimensions enable efficient and accurate study of quantum many-body states, yet the effect of the isometric restriction on the represented quantum states is not fully understood. We address this question in two main contributions. First, we introduce an improved variant of isometric tensor network states (isoTNS) in two dimensions, where the isometric arrows on the columns of the network alternate between pointing upward and downward; hence the name alternating isometric tensor network states. Second, we introduce a numerical tool—the isometric Gaussian fermionic TNS (isoGfTNS)—that incorporates isometric constraints into the framework of Gaussian fermionic tensor network states. We demonstrate in numerous ways that alternating isoTNSs represent many-body ground states of two-dimensional quantum systems significantly better than the original isoTNSs. First, we show that the entanglement in an isoTNS is mediated along the isometric arrows and that alternating isoTNSs mediate entanglement more efficiently than conventional isoTNSs. Second, alternating isoTNSs correspond to a deeper, and thus more representative, sequential-circuit construction of depth 𝒪⁢(𝐿𝑥 ⋅𝐿𝑦) compared to the original isoTNSs of depth 𝒪⁢(𝐿𝑥 +𝐿𝑦). Third, using the Gaussian framework and gradient-based energy minimization, we provide numerical evidence of better bond-dimension scaling and variational energy of alternating isoGfTNSs for ground states of various free-fermionic models, including the Fermi surface, the band insulator, and the 𝑝𝑥 +𝑖⁢𝑝𝑦 mean-field superconductor. Finally, benchmarking on the transverse-field Ising model, we demonstrate that an alternating isoTNS provides substantially improved performance and stability relative to the original isoTNS for the ground-state search algorithm in interacting systems.

Wu, Yantao [Chinese Academy of Sciences, Beijing (

Electronic structure theory with molecular point group symmetries on quantum annealers

Quantum computation has the potential to revolutionize quantum chemistry through major speedups in computation times and an exponential reduction in computational resources. Here, we combine the symmetry-adapted Jordan–Wigner encoding based on the full Boolean symmetry group $\mathbb{Z}$$^{k}_{2}$ with our new implementation of the Xia–Bian–Kais (XBK) method for improving the efficiency of electronic structure theory calculations on quantum annealers, particularly by reducing the number of qubits needed to achieve the same accuracy. By providing a more extensive symmetry-adapted encoding (SAE) than previous work, we are able to simulate molecules larger than those previously reported that have been studied using methods developed for quantum annealers and without using an active space. We calculated the potential energy surfaces of H 2 , LiH, He 2 , H 2 O, O 2 , N 2 , Li 2 , F 2 , CO, BH 3 , NH 3 , and CH 4 , with the largest molecule in the STO-6G basis set requiring 16 qubits with our SAE, and compared them with full configuration interaction results. The application of SAE to the XBK method provides an exponential reduction in the size of the Hilbert space and scales well with the size of the problem. It does not introduce significant additional errors for even or large values of a key variational parameter that determines the number of ancilla qubits used in the XBK method’s Hamiltonian embedding, or for certain molecules such as He 2 and H 2 O. Here, we provide an explanation for this behavior and a recommendation on the usage of our method. In addition, we briefly discuss the potential of extracting electronic excited states from our method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Scaling Properties of Algorithms in Nanotechnology

At the present time, several technologies are pressing the limits of microminiature manufacturing. In semiconductor technology, for example, the Intel Pentium Pro (which is used in the Department of Energy's ASCI 'red' parallel supercomputer system) and the DEC Alpha 21164 (which is used in the CRAY T3E) both are fabricated using 0.35 micron process technology. Recently Texas Instruments (TI) announced the availability of 0.25 micron technology chips by the end of 1996 and plans to have 0.18 micron devices in production within two years. However, some significant challenges lie down the road. These include the skyrocketing cost of manufacturing plants, the 0.1 micron foreseeable limit of the photolithography process, quantum effects, data communication bandwidth limitations, heat dissipation, and others. Some related microminiature technologies include micro-electromechanical systems (MEMS), opto-electronic devices, quantum computing, biological computing, and others. All of these technologies require the fabrication of devices whose sizes are approaching the nanometer level. As such they are often collectively referred to with the name 'nanotechnology'. Clearly nanotechnology in this general sense is destined to be a very important technology of the 21st century. The ultimate dream in this arena is 'molecular nanotechnology', in other words the fabrication of devices and materials with most or all atoms and molecules in a pre-programmed position, possibly placed there by 'nano-robots'. This futuristic capability will probably not be achieved for at least two decades. However, it appears that somewhat less ambitious variations of molecular nanotechnology, such as devices and materials based on 'buckyballs' and 'nanotubes' may be realized significantly sooner, possibly within ten years or so. Even at the present time, semiconductor devices are approaching the regime where quantum chemical effects must be considered in design.

Saini, Subhash

Thermal Weight Determination and Interstate Coupling in State-Averaged ADAPT-VQE

Characterizing electronic thermal states at low temperatures is an important but challenging task in quantum chemistry and condensed matter physics, making it a prime candidate for a useful application in quantum computing. One of the most successful methods for state preparation on quantum computers is the Adaptive, Problem-Tailored (ADAPT) Variational Quantum Eigensolver (VQE), which has recently been generalized to treat excited states within a state-averaged framework as well as Gibbs states. In this work, we introduce Helmholtz-Optimized Thermal (HOT) ADAPT-VQE, an ancilla-free strategy for preparing Gibbs states that directly minimizes the Helmholtz free energy by targeting the dominant eigenstates of the thermal ensemble. We demonstrate the usefulness of HOT-ADAPT-VQE by predicting the free energy of two model systems with strongly correlated ground states: (1) the Fe 2+ cation in a magnetic field and (2) a [Cu 2 O 7 ] 10– fragment of the Mott insulator La 2 CuO 4 . Our results demonstrate that HOT-ADAPT-VQE significantly improves upon Gibbs-state estimates from multistate variants of ADAPT-VQE, often with substantially shallower quantum circuits, making it a promising candidate for thermal-state calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH