Search NASA⌕ Search

SEARCH · Search NASA

Results for “universal quantum computing”

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 613 records · Page 34

Association Kinetics for Perfluorinated n -Alkyl Radicals

Radical-radical reaction channels are important in the pyrolysis and oxidation chemistry of perfluoroalkyl substances (PFAS). In particular, unimolecular dissociation reactions within unbranched n-perfluoroalkyl chains, and their corresponding reverse barrierless association reactions, are expected to be significant contributors to the gas-phase thermal decomposition of families of species such as perfluorinated carboxylic acids and perfluorinated sulfonic acids. Unfortunately, experimental data for these reactions are scarce and uncertain. Furthermore, obtaining reliable theoretical predictions for such reactions is a laborious and computationally intensive task. Here, in this work, the chemical kinetics of the various association/decomposition reactions producing/decomposing the C 2 -C 4 series of unbranched n-perfluoroalkanes (C 2 F 6 , C 3 F 8 , and C 4 F 10 ) are examined using state-of-the-art ab initio transition-state-theory-based master-equation calculations. The variable-reaction-coordinate transition-state theory (VRC-TST) formalism is employed in computing the microcanonical and canonical rates for the association reactions. Reaction thermochemistry is obtained via composite quantum chemistry calculations and the laddering of error-canceling reaction schemes via a connectivity-based hierarchy approach employing ANL1/ANL0-style reference energies. Lennard-Jones collision model parameters for the considered systems were estimated by a direct dynamics approach, and collisional energy transfer parameters were obtained from analogies to systems of similar size and heavy-atom connectivity. A one-dimensional master equation approach was used to convert the microcanonical rate coefficients from the VRC-TST analysis into temperature- and pressure-dependent rate constants for the association reactions and the reverse dissociation reactions. The data are reported in standardized formats for usage in comprehensive chemical kinetic models for PFAS thermal destruction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗

Astigmatism-free 3D optical tweezer control for rapid atom rearrangement

Reconfigurable neutral-atom arrays are a promising platform for quantum computing, quantum simulation, and quantum metrology, but atom transport using frequency-chirped acousto-optic deflectors (AODs) is limited by chirp-induced acoustic lensing and trajectory distortion. We address these limitations using a three-dimensional acousto-optic deflector lens (3D-AODL), a design predicted to reduce long-range transport times by more than a factor of two. We further introduce fading-Shepard waveforms that circumvent finite AOD bandwidth, enabling sustained axial displacement. We demonstrate unrestricted three-dimensional optical-tweezer motion over a 200 μm × 200 μm × 136 μm volume with velocities exceeding 4.2 m/s. Arbitrary three-dimensional control of optical-tweezer trajectories enables rapid atom rearrangement and dynamical engineering of optical potentials in tweezer arrays and optical lattices. This capability advances quantum control and atom manipulation in neutral-atom quantum processors by enabling faster rearrangement, higher clock rates, and scalable sorting in complex geometries.

Lu, Yue-Hui [University of California, Berkeley, C↗

Entropy and Gravitation—From Black Hole Computers to Dark Energy and Dark Matter

We show that the concept of entropy and the dynamics of gravitation provide the linchpin in a unified scheme to understand the physics of black hole computers, spacetime foam, dark energy, dark matter and the phenomenon of turbulence. We use three different methods to estimate the foaminess of spacetime, which, in turn, provides a back-door way to derive the Bekenstein-Hawking formula for black hole entropy and the holographic principle. Generalizing the discussion for a static spacetime region to the cosmos, we find a component of dark energy (resembling an effective positive cosmological constant of the correct magnitude) in the current epoch of the universe. The conjunction of entropy and gravitation is shown to give rise to a phenomenological model of dark matter, revealing the natural emergence, in galactic and cluster dynamics, of a critical acceleration parameter related to the cosmological constant; the resulting mass profiles are consistent with observations. Unlike ordinary matter, the quanta of the dark sector are shown to obey infinite statistics. This property of dark matter may lead to some non-particle phenomenology and may explain why dark matter particles have not been detected in dark matter search experiments. We also show that there are deep similarities between the problem of “quantum gravity” (more specifically, the holographic spacetime foam) and turbulence.

79 ASTRONOMY AND ASTROPHYSICS↗

CHEMREASONER: Heuristic Search over a Large Language Model’s Knowledge Space using Quantum-Chemical Feedback

The discovery of new catalysts is essential for the design of new and more efficient chemical processes in order to transition to a sustainable future. We introduce an AI-guided computational screening framework unifying linguistic reasoning with quantum-chemistry based feedback from 3D atomistic representations. Our approach formulates catalyst discovery as an uncertain environment where an agent actively searches for highly effective catalysts via the iterative combination of large language model (LLM)-derived hypotheses and atomistic graph neural network (GNN)-derived feedback. Identified catalysts in intermediate search steps undergo structural evaluation based on spatial orientation, reaction pathways, and stability. Scoring functions based on adsorption energies and barriers steer the exploration in the LLM's knowledge space toward energetically favorable, high-efficiency catalysts. We introduce planning methods that automatically guide the exploration without human input, providing competitive performance against expert-enumerated chemical descriptor-based implementations. By integrating language-guided reasoning with computational chemistry feedback, our work pioneers AI-accelerated, trustworthy catalyst discovery.

artificial intelligence↗

Competing ionization and dissociation: Extension of the energy-dependent frame transformation to the gerade symmetry of H 2

This article solves two major tasks that frequently arise in the theory of electron collisions with a target molecular cation. First, it extends the energy-dependent frame transformation (EDFT) treatment, which is needed to map fixed-nuclei electron-molecule scattering matrices into an energy-dependent laboratory-frame scattering matrix with vibrational channel indices. The EDFT mapping can now be carried out even when the target molecule possesses multiple low-energy potential curves, significantly transcending previous applications. Second, it implements a method to extract the rest of the full laboratory-frame scattering matrix, i.e., the columns and rows describing input and/or output dissociation channels. The treatment is benchmarked in this article against the essentially exact solution of a refined two-dimensional model of the singlet gerade Σ symmetry of H 2 . Our tests demonstrate that the theory accurately maps fixed-nuclei scattering information, of the type provided by existing electron-molecule computer codes, into a laboratory-frame scattering matrix that includes both ionization and dissociation. Furthermore, this treatment can provide a general framework applicable to a broad class of electron collision processes involving diatomic target ions, suitable for an accurate description of challenging processes such as dissociative recombination.

74 ATOMIC AND MOLECULAR PHYSICS↗

Operator bases, S-matrices, and their partition functions

Relativistic quantum systems that admit scattering experiments are quantitatively described by effective field theories, where S-matrix kinematics and symmetry considerations are encoded in the operator spectrum of the EFT. Here in this paper we use the S-matrix to derive the structure of the EFT operator basis, providing complementary descriptions in (i) position space utilizing the conformal algebra and cohomology and (ii) momentum space via an algebraic formulation in terms of a ring of momenta with kinematics implemented as an ideal. These frameworks systematically handle redundancies associated with equations of motion (on-shell) and integration by parts (momentum conservation). We introduce a partition function, termed the Hilbert series, to enumerate the operator basis — correspondingly, the S-matrix — and derive a matrix integral expression to compute the Hilbert series. The expression is general, easily applied in any spacetime dimension, with arbitrary field content and (linearly realized) symmetries. In addition to counting, we discuss construction of the basis. Simple algorithms follow from the algebraic formulation in momentum space. We explicitly compute the basis for operators involving up to n = 5 scalar fields. This construction universally applies to fields with spin, since the operator basis for scalars encodes the momentum dependence of n-point amplitudes. We discuss in detail the operator basis for non-linearly realized symmetries. In the presence of massless particles, there is freedom to impose additional structure on the S- matrix in the form of soft limits. The most naÏve implementation for massless scalars leads to the operator basis for pions, which we confirm using the standard CCWZ formulation for non-linear realizations. Finally, although primarily discussed in the language of EFT, some of our results — conceptual and quantitative — may be of broader use in studying conformal field theories as well as the AdS/CFT correspondence.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Computing an Optimal Entanglement Path with Throughput and Fidelity Considerations

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing a end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics to be NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

Xue, Guoliang [Arizona State University]↗

Pressure–Modulated Luminescence Enhancement and Quenching in a Hydrogen–Bonded Organic Framework

Light emission in the solid state is central for illumination, sensing, and imaging applications. Unlike luminescence in dilute solutions, where the excited states are unimolecular in nature, intermolecular interaction plays a significant role in the quantum yield of solid-state luminophores, manifested as competing aggregation-caused quenching (ACQ) and aggregation-induced enhancement (AIE). Both effects are extensively studied in various systems; however, it remains unclear how their competition depends on molecular conformation and intermolecular stacking. Here the direct observation of pressure-modulated AIE-ACQ competition in a crystalline hydrogen-bonded organic framework (HOF) is reported. Using in situ spectroscopies and computational modeling, the intramolecular vibration and intermolecular π–π stacking directly responsible for the non-radiative decay of the excited state are identified. The extent of these two contributions is modulated by hydrostatic pressure and guest molecules in the HOF pores. Furthermore, this work demonstrates a physically neat model system to understand and control solid-state luminescence, and a potential material platform for piezoluminescent sensing.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Lattice QCD Calculation of the Subtraction Function in Forward Compton Amplitude

The subtraction function plays a pivotal role in calculations involving the forward Compton amplitude, which is crucial for predicting the Lamb shift in muonic atoms, as well as the proton-neutron mass difference. In this Letter, we present a lattice QCD calculation of the subtraction function using two domain wall fermion gauge ensembles near the physical pion mass. We utilize a recently proposed subtraction point, demonstrating its advantage in mitigating statistical and systematic uncertainties by eliminating the need for ground-state subtraction. Our results reveal significant contributions from N⁢π intermediate states to the subtraction function. Incorporating these contributions, we compute the proton, neutron, and nucleon isovector subtraction functions at photon momentum transfer Q 2 ϵ[0,2] GeV 2 . For the proton subtraction function, we compare our lattice results with chiral perturbation theory prediction at low Q 2 and with the results from the perturbative operator-product expansion at high Q 2 . Finally, using these subtraction functions as input, we determine their contribution to two-photon exchange effects in the Lamb shift and isovector nucleon electromagnetic self-energy.

74 ATOMIC AND MOLECULAR PHYSICS↗

Enhancing the efficiency of time-dependent density functional theory calculations of dynamic response properties

X-ray Thomson scattering (XRTS) constitutes an essential technique for diagnosing material properties under extreme conditions, such as high pressures and intense laser heating. Time-dependent density functional theory (TDDFT) is one of the most accurate available ab initio methods for modeling XRTS spectra, as well as a host of other dynamic material properties. However, strong thermal excitations, along with the need to account for variations in temperature and density as well as the finite size of the detector significantly increase the computational cost of TDDFT simulations compared to ambient conditions. In this work, we present a broadly applicable method for optimizing and enhancing the efficiency of TDDFT calculations. Our approach is based on a one-to-one mapping between the dynamic structure factor and the imaginary time density–density correlation function, which naturally emerges in Feynman’s path integral formulation of quantum many-body theory. Specifically, we combine rigorous convergence tests in the imaginary time domain with a constraints-based attenuation of narrow-band fluctuations to improve the efficiency of TDDFT modeling without the introduction of any significant bias. As a result, we can report a speed-up by up to an order of magnitude, thus substantially reducing the burden of computational cost required for XRTS analysis.

Moldabekov, Zhandos A. [Helmholtz-Zentrum Dresden-↗

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↗

Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems

Strongly-correlated quantum many-body systems are difficult to study and simulate classically. We recently proposed a variational quantum eigensolver (VQE) based on the multiscale entanglement renormalization ansatz (MERA) with tensors constrained to certain Trotter circuits. Here, we determine the scaling of computation costs for various critical spin chains which substantiates a polynomial quantum advantage in comparison to classical MERA simulations based on exact energy gradients or variational Monte Carlo. Algorithmic phase diagrams suggest an even greater separation for higher-dimensional systems. Hence, the Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. Furthermore, we show how the convergence can be substantially improved by building up the MERA layer by layer in the initialization stage and by scanning through the phase diagram during optimization. For the Trotter circuits being composed of single-qubit and two-qubit rotations, it is experimentally advantageous to have small rotation angles. We find that the average angle amplitude can be reduced considerably with negligible effect on the energy accuracy. Benchmark simulations suggest that the structure of the Trotter circuits for the TMERA tensors is not decisive; in particular, brick-wall circuits and parallel random-pair circuits yield very similar energy accuracies.

Miao, Qiang [Duke Quantum Center, Duke University,↗

The Singlet–Triplet Gap of Cyclobutadiene: The CIPSI-Driven CC( P ; Q ) Study

An accurate determination of singlet−triplet gaps in biradicals, including cyclobutadiene in the automerization barrier region where one has to balance the substantial nondynamical many-electron correlation effects characterizing the singlet ground state with the predominantly dynamical correlations of the lowest-energy triplet, remains a challenge for many quantum chemistry methods. High-level coupled-cluster (CC) approaches, such as the CC method with a full treatment of singly, doubly, and triply excited clusters (CCSDT), are often capable of providing reliable results, but routine application of such methods is hindered by their high computational costs. We have recently proposed a practical alternative to converging the CCSDT energetics at small fractions of the computational effort, even when electron correlations become stronger and connected triply excited clusters are larger and nonperturbative, by merging the CC(P;Q) moment expansions with the selected configuration interaction methodology abbreviated as CIPSI. We demonstrate that one can accurately approximate the highly accurate CCSDT potential surfaces characterizing the lowest singlet and triplet states of cyclobutadiene along the automerization coordinate and the gap between them using tiny fractions of triply excited cluster amplitudes identified with the help of relatively inexpensive CIPSI Hamiltonian diagonalizations.

Basis sets↗

Virtualization of the ATLAS software environment on a shared HPC system

The shared HPC cluster NEMO at the University of Freiburg has been made available to local ATLAS users through the provisioning of virtual machines incorporating the ATLAS software environment analogously to a WLCG center. This concept allows to run both data analysis and production on the HPC host system which is connected to the existing Tier2/Tier3 infrastructure. Schedulers of the two clusters were integrated in a dynamic, on-demand way. An automatically generated, fully functional virtual machine image provides access to the local user environment. The performance in the virtualized environment is evaluated for typical High-Energy Physics applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Field–potential finite-difference time-domain (FiPo FDTD) technique for computational electromagnetics

Modeling light–matter interactions at the nanoscale requires accurate handling of coupled quantum and electromagnetic systems. This coupling requires information about the electric scalar potential Φ and the magnetic vector potential A, which are not typically calculated in standard computational electromagnetics implementations. To that end, we have developed a field–potential finite-difference time-domain (FiPo FDTD) algorithm, which solves a set of first-order equations for Φ and A alongside equations for the electric and magnetic fields E and H. The FiPo Basic code is essentially conventional FDTD, but with an added module that calculates the potentials. The FiPo Hybrid code self-consistently calculates both fields and potentials and is particularly suitable for coupling with quantum electronic transport solvers because it can be sourced by the potentials themselves. To terminate the domain and mimic infinite space, we have derived and implemented a convolutional perfectly matched layer (CPML) absorbing boundary condition for FiPo FDTD whose performance is on par with state-of-the-art CPMLs for standard FDTD. We present FiPo simulation results on several example systems.

Avazpour, L. [University of Wisconsin-Madison, WI ↗

Compact fiber-coupled narrowband two-mode squeezed light source

Quantum correlated states of light, such as squeezed states, are a fundamental resource for the development of quantum technologies, as they are needed for applications in quantum metrology, quantum computation, and quantum communications. It is thus critical to develop compact, efficient, and robust sources to generate such states. Here, we report on a compact, narrowband, fiber-coupled source of two-mode squeezed states of light at 795 nm based on four-wave mixing (FWM) in an 85 Rb atomic vapor. The source is designed in a small modular form factor, with two input fiber-coupled beams, the seed and pump beams required for the FWM, and two output fibers, one for each of the modes of the squeezed state. The system is optimized for low pump power (135 mW) to achieve a maximum intensity-difference squeezing of 4.4 dB after the output of fibers at an analysis frequency of 1 MHz. Furthermore, the narrowband nature of the source makes it ideal for atomic-based quantum sensing and quantum networking configurations that rely on atomic quantum memories. Such a source paves the way for a versatile and portable platform for applications in quantum information science.

Jain, Umang [University of Oklahoma, Norman, OK (U↗

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗