Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum computing models”

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 91 records · Page 5

Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route toward a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted-sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting-qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges—relevant to signed, unsigned, modular and non-modular versions—that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.

Computational models↗

Boltzmann machine modeling of layered MoS 2 synthesis on a quantum annealer

Two-dimensional layered materials are usually synthesized by chemical vapor deposition (CVD). Here we use the Restricted Boltzmann Machine (RBM) and its enhancement called Limited Boltzmann Machine (LBM) on a quantum computer to model the chemical vapor deposition (CVD) growth data for a MoS 2 monolayer. The CVD data for Boltzmann machines are generated by reactive molecular dynamics (RMD) simulations. The Boltzmann machines give insight into the semiconducting (2H) and metallic (1T) phases and defects generated during the CVD growth of MoS 2 . We compare the performances of the two types of Boltzmann machine models, i.e. RBM versus augmented topologies with limited intra-layer coupling between the hidden units (LBM). We show that limited topologies have a performance advantage over restricted topologies. We examine connectivity within our topological variants, explore hardware qubit mapping schemes, and discuss what performance differences may imply about locality within the data without prior knowledge.

36 MATERIALS SCIENCE↗

A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers

Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power.In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation.The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware.This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.

97 MATHEMATICS AND COMPUTING↗

A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers

Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power. In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation. The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware. This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.

Potok, Thomas E↗

Universal programmable quantum circuit schemes to emulate an operator

Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we present a new quantum circuit design technique resulting in two general programmable circuit schemes. The circuit schemes can be used to simulate any given operator by setting the angle values in the circuit. This provides a fixed circuit design whose angles are determined from the elements of the given matrix-which can be non-unitary-in an efficient way. We also give both the classical and quantum complexity analysis for these circuits and show that the circuits require a few classical computations. For the electronic structure simulation on a quantum computer, one has to perform the following steps: prepare the initial wave function of the system; present the evolution operator U=e{sup -iHt} for a given atomic and molecular Hamiltonian H in terms of quantum gates array and apply the phase estimation algorithm to find the energy eigenvalues. Thus, in the circuit model of quantum computing for quantum chemistry, a crucial step is presenting the evolution operator for the atomic and molecular Hamiltonians in terms of quantum gate arrays. Since the presented circuit designs are independent from the matrix decomposition techniques and the global optimization processes used to find quantum circuits for a given operator, high accuracy simulations can be done for the unitary propagators of molecular Hamiltonians on quantum computers. As an example, we show how to build the circuit design for the hydrogen molecule.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Measuring the Loschmidt Amplitude for Finite-Energy Properties of the Fermi-Hubbard Model on an Ion-Trap Quantum Computer

Calculating the equilibrium properties of condensed-matter systems is one of the promising applications of near-term quantum computing. Recently, hybrid quantum-classical time-series algorithms have been proposed to efficiently extract these properties from a measurement of the Loschmidt amplitude ⟨ ψ | e − i H ^ t | ψ ⟩ from initial states | ψ ⟩ and a time evolution under the Hamiltonian H ^ up to short times t . In this work, we study the operation of this algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a 16 -site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We assess the effect of noise on the Loschmidt amplitude and implement algorithm-specific error-mitigation techniques. By using a thus-motivated error model, we numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies. Finally, we estimate the resources needed for scaling up the algorithm. Published by the American Physical Society 2024

Physics↗

Subtleties in the trainability of quantum machine learning models

A new paradigm for data science has emerged, with quantum data, quantum models, and quantum computational devices. This field, called quantum machine learning (QML), aims to achieve a speedup over traditional machine learning for data analysis. However, its success usually hinges on efficiently training the parameters in quantum neural networks, and the field of QML is still lacking theoretical scaling results for their trainability. Some trainability results have been proven for a closely related field called variational quantum algorithms (VQAs). While both fields involve training a parametrized quantum circuit, there are crucial differences that make the results for one setting not readily applicable to the other. In this work, we bridge the two frameworks and show that gradient scaling results for VQAs can also be applied to study the gradient scaling of QML models. Our results indicate that features deemed detrimental for VQA trainability can also lead to issues such as barren plateaus in QML. Consequently, our work has implications for several QML proposals in the literature. In addition, we provide theoretical and numerical evidence that QML models exhibit further trainability issues not present in VQAs, arising from the use of a training dataset. We refer to these as dataset-induced barren plateaus. These results are most relevant when dealing with classical data, as here the choice of embedding scheme (i.e., the map between classical data and quantum states) can greatly affect the gradient scaling.

97 MATHEMATICS AND COMPUTING↗

Fast-forwarding quantum evolution

We investigate the problem of fast-forwarding quantum evolution, whereby the dynamics of certain quantum systems can be simulated with gate complexity that is sublinear in the evolution time. We provide a definition of fast-forwarding that considers the model of quantum computation, the Hamiltonians that induce the evolution, and the properties of the initial states. Our definition accounts for any asymptotic complexity improvement of the general case and we use it to demonstrate fast-forwarding in several quantum systems. In particular, we show that some local spin systems whose Hamiltonians can be taken into block diagonal form using an efficient quantum circuit, such as those that are permutation-invariant, can be exponentially fast-forwarded. We also show that certain classes of positive semidefinite local spin systems, also known as frustration-free, can be polynomially fast-forwarded, provided the initial state is supported on a subspace of sufficiently low energies. Last, we show that all quadratic fermionic systems and number-conserving quadratic bosonic systems can be exponentially fast-forwarded in a model where quantum gates are exponentials of specific fermionic or bosonic operators, respectively. Our results extend the classes of physical Hamiltonians that were previously known to be fast-forwarded, while not necessarily requiring methods that diagonalize the Hamiltonians efficiently. We further develop a connection between fast-forwarding and precise energy measurements that also accounts for polynomial improvements.

97 MATHEMATICS AND COMPUTING↗

Purification of Zirconium Tetrachloride from UNF Cladding

The overarching objective of this project was to design and demonstrate (laboratory scale) a sublimation-based purification protocol to obtain pure zirconium chloride (ZrCl 4 ) from impure feeds derived from the direct chlorination of Zircaloy cladding materials. To achieve this objective the following goals were identified. (1) Design, construct and test an apparatus capable of subliming and purifying ZrCl 4 at room pressure and temperatures between 600 and 700K (sublimation point of ZrCl 4 606 K). (2) Investigate reactions that may be used to chemically alter the makeup of the impure ZrCl 4 feed materials to enhance their removal from ZrCl 4 in the sublimation-purification process. (3) Computationally model the reactions of metal chlorides in the gas phase under sublimation conditions (1 atm, 600 K) to determine if oligomers are formed and, if formed, how they would influence sublimation-based purification strategies. All experimental investigations performed as part of this project used stable (non-radioactive) compounds and materials as surrogates for the impure ZrCl 4 feedstocks that would be derived from the direct chlorination of Zircaloy claddings from spent nuclear fuel rods. No radiologically active materials were used at any time in this project. The impure ZrCl 4 feedstocks used in this study were derived from the direct chlorination of virgin Zircaloy claddings (Zirc-2, -4 and high Nb). The main goals of the project have been achieved during the three year period of this NEUP sponsored project. The impurities of greatest concern in the feedstocks were identified as the chloride salts of the alloying metals originally found in Zircaloy (Fe, Nb) and radiological contaminants (Cs, Sr, and Sb). A series of prototype sublimation apparatuses and heating arrangements were designed, constructed and tested. A general batch-sublimator design was identified and a 1.0 kg batch sublimator/oven system was fabricated from glass. Purification protocols developed on small scale runs were found to scale to 1.0 kg batches without problem. Purification factor ranges (PFs: wt% final / wt% initial ) for the impurity chlorides identified above have been measured: Fe (40 – 500); Nb (10 – 70); Cs (520 – 5000); Sr (250 – 1900); Sb (220 – 2300). Removal of iron is sensitive to the partial pressure of hydrogen (in nitrogen) flowing through the system. Lower PFs are obtained when the hydrogen partial pressure is lower. Lower flows are required to raise the iron PF. Removal of niobium is very sensitive to the endpoint determination of the forerun. When judged properly (color change yellow to white in sublimate) reasonable PFs (500) can be achieved. However, as discussed in the conclusions section, endpoint determination can be difficult and significantly lower PFs may be obtained when the endpoint is not correctly identified. Several methods of obtaining quantitative cesium, strontium and antimony PFs were investigated, the best being ICP-MS. The results reported here reflect very limited access to and ICP-MS instrument during the course of this project. It should be noted that, while significantly reduced amounts of antimony are observed in the product, antimony is also found in the exhaust trap after the condenser. Quantum chemical computational modeling studies of the reactions of metal chlorides in the gas phase provided important information about a chemical transport mechanism that could defeat sublimation-based purification strategies. Many metal chlorides are known to oligomerize in the gas phase to reduce their coordinative unsaturation. Dimerization of ZrCl 4 with iron or niobium chlorides would provide a mechanism by which both metal impurities could be carried over with the product during sublimation of the bulk material. Computational modeling conclusively showed that under sublimation conditions in the gas phase, dimerization reactions are not favored thermodynamically due to a significant entropic penalty for the reaction. Therefore, consistent with experimental observations, sublimation-based purification strategies remain viable. The experimental part of the report concludes with a short discussion of the issues that still remain in developing a technologically relevant Zircaloy recycling strategy. The final section of the report is a summary of the quantum chemical investigation of the reactions of metal chlorides in the gas phase under sublimation conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Simulating large one-dimensional neutral-atom quantum systems

While abstract models of quantum computation assume a closed system of two-level states, practical quantum devices inevitably couple to the environment in some way, creating sources of noise. Understanding the tolerance to noise of specific quantum algorithms run on specific devices is important for determining the feasibility of quantum computing in the current noisy intermediate-scale quantum era. Of particular interest is understanding the noise sensitivity of these devices as more qubits are added to the system. Classical simulations are a useful tool to understand the effects of this noise, but direct classical simulations of open quantum systems are burdened by an exponentially growing cost in the number of qubits and a large local Hilbert space dimension. For onedimensional, shallow circuits, using tensor networks can replace this exponential cost with a linear one and simulate far wider systems than what would normally be available. In this paper, we describe a tensor network simulation of a neutral atom quantum system under the presence of noise, while introducing a purity-preserving truncation technique that compromises between the simplicity of the matrix product state and the positivity of the matrix product density operator. We apply this simulation to a near-optimized iteration of the quantum approximate optimization algorithm on a transverse field Ising model in order to investigate the influence of large system sizes on the performance of the algorithm. We find that while circuits with a large number of qubits fail more often under noise that depletes the qubit population, their outputs on a successful measurement are just as robust under Rydberg atom dissipation or qubit dephasing as smaller systems. However, such circuits might not perform as well under coherent multiqubit errors such as Rydberg atom crosstalk. We also find that the optimized parameters are especially robust to noise, suggesting that a noisier quantum system can be used to find the optimal parameters before switching to a cleaner system for measurements of observables.

Allen, James↗

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

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

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

El Agente: An autonomous agent for quantum chemistry

Computational chemistry tools are widely used to study the behavior of chemical phenomena. Yet, the complexity of these tools can make them inaccessible to non-specialists and challenging even for experts. In this work, we introduce El Agente Q, an LLM-based multi-agent system that dynamically generates and executes quantum chemistry workflows from natural language user prompts. The system is built on a novel cognitive architecture featuring a hierarchical memory framework that enables flexible task decomposition, adaptive tool selection, post-analysis, and autonomous file handling and submission. El Agente Q is benchmarked on six university-level course exercises and two case studies, demonstrating robust problem-solving performance (averaging >87% task success) and adaptive error handling through in situ debugging. It also supports longer-term, multi-step task execution for more complex workflows, while maintaining transparency through detailed action trace logs. Together, these capabilities lay the foundation for increasingly autonomous and accessible quantum chemistry.

agentic systems↗

Position-specific isotope effects during alkaline hydrolysis of 2,4-dinitroanisole resolved by compound-specific isotope analysis, 13 C NMR, and density-functional theory

Compound-specific isotope analysis (CSIA), position-specific isotope analysis (PSIA), and computational modeling (e.g., quantum mechanical models; reactive-transport models) are increasingly being used to monitor and predict biotic and abiotic transformations of organic contaminants in the field. However, identifying the isotope effect(s) associated with a specific transformation remains challenging in many cases. We describe and interpret the position-specific isotope effects of C and N associated with a SN 2 Ar reaction mechanism by a combination of CSIA and PSIA using quantitative 13 C nuclear magnetic resonance spectrometry, and density-functional theory, using 2,4-dinitroanisole (DNAN) as a model compound. The position-specific 13 C enrichment factor of O–C 1 bond at the methoxy group attachment site (ε C1 ) was found to be approximately -41‰, a diagnostic value for transformation of DNAN to its reaction products 2,4-dinitrophenol and methanol. Theoretical kinetic isotope effects calculated for DNAN isotopologues agreed well with the position-specific isotope effects measured by CSIA and PSIA. This combination of measurements and theoretical predictions demonstrates a useful tool for evaluating degradation efficiencies and/or mechanisms of organic contaminants and may promote new and improved applications of isotope analysis in laboratory and field investigations.

13C NMR↗

Mediated homogenization

Homogenization protocols model the quantum mechanical evolution of a system to a fixed state independently from its initial configuration by repeatedly coupling it with a collection of identical ancillas. Here we analyze these protocols within the formalism of 'relaxing' channels providing an easy-to-check sufficient condition for homogenization. In this context we describe mediated homogenization schemes where a network of connected qudits relaxes to a fixed state by only partially interacting with a bath. We also study configurations which allow us to introduce entanglement among the elements of the network. Finally we analyze the effect of having competitive configurations with two different baths and we prove the convergence to dynamical equilibrium for Heisenberg chains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Using measurement-induced disturbance to characterize correlations as classical or quantum

In contrast to the seminal entanglement-separability paradigm widely used in quantum information theory, we introduce a quantum-classical dichotomy in order to classify and quantify statistical correlations in bipartite states. This is based on the idea that while in the classical description of nature measurements can be carried out without disturbance, in the quantum description, generic measurements often disturb the system and the disturbance can be exploited to quantify the quantumness of correlations therein. It turns out that certain separable states still possess correlations of a quantum nature and indicates that quantum correlations are more general than entanglement. The results are illustrated in the Werner states and the isotropic states, and are applied to quantify the quantum advantage of the model of quantum computation proposed by Knill and Laflamme [Phys. Rev. Lett. 81, 5672 (1998)].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement sudden death as an indicator of fidelity in a four-qubit cluster state

I explore the entanglement evolution of a four-qubit cluster state in a dephasing environment concentrating on the phenomenon of entanglement sudden death (ESD). Specifically, I ask whether the onset of ESD has an effect on the utilization of this cluster state as a means of implementing a single-qubit rotation in the measurement-based cluster state model of quantum computation. To do this, I compare the evolution of the entanglement to the fidelity, a measure of how accurately the desired state (after the measurement-based operations) is achieved. I find that ESD does not cause a change in behavior or discontinuity in the fidelity but may indicate for certain states when the fidelity goes to 0.5.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entangled phase of simultaneous fermion and exciton condensations realized

Fermion-exciton condensates (FECs)—computationally and theoretically predicted states that simultaneously exhibit the character of superconducting states and exciton condensates—are novel quantum states whose properties may involve a hybridization of superconductivity and the dissipationless flow of energy. Here, we exploit prior investigations of superconducting states and exciton condensates on quantum devices to identify a tuneable quantum state preparation entangling the wave functions of the individual condensate states. Utilizing this state preparation, we prepare a variety of FEC states on quantum computers—realizing strongly correlated FEC states on current, noisy intermediate-scale quantum devices—and verify the presence of the dual condensate via postmeasurement analysis. This confirmation of the previously predicted condensate state on quantum devices as well as the form of its wave function motivates further theoretical and experimental exploration of the properties, applications, and stability of FECs.

36 MATERIALS SCIENCE↗