Search NASA⌕ Search

SEARCH · Search NASA

Results for “exponential advantage”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Measurement of free chlorine levels in water using potentiometric responses of biofilms and applications for monitoring and managing the quality of potable water

We report residual free chlorine is not monitored continuously at scale in drinking water distribution systems because existing real-time sensor technologies require frequent maintenance, cleaning, and calibration, which makes these products too costly to be used throughout a distribution system. As a result, current measurement approaches require manual sampling, which is not feasible for the consistent monitoring of free chlorine because chlorine concentrations vary significantly throughout pipeline distribution and over time and space. This research presents an alternative and cost-effective method of predicting free chlorine levels in drinking water using graphite electrodes coated with naturally grown microbial biofilms. This Microbial Potentiometric Sensor (MPS) array was installed in a Continuously Mixed Batch Reactor (CMBR), and drinking water containing variable free chlorine concentrations. The chlorine concentrations were introduced in a controlled manner, and the MPS signals were monitored over time. MPS signals were measured from the change in Open Circuit Potential (OCP) across the MPS array in real-time. An empirically derived relationship between the normalized change in OCP and free chlorine was established by fitting individual and average MPS data to a decaying exponential growth function in order to predict free chlorine levels. The results show that free chlorine can be predicted with reasonable accuracy, with model validation showing an average absolute error of ±0.09 ppm below 1.1 ppm and ±0.30 ppm between 1.1 and 2.7 ppm. However, the accuracy of predictions was reduced at higher free chlorine levels. The researchers conclude that MPS systems may benefit drinking water distribution systems by measuring free chlorine. These advantages of the MPS are especially pronounced in the developing world because this system is inexpensive and does not require routine maintenance or cleaning. The system relies on a naturally forming and regenerating biofilm and an inexpensive potentiometric meter to produce stable measurements.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Classical Simulation of Boson Sampling Based on Graph Structure

Boson sampling is a fundamentally and practically important task that can be used to demonstrate quantum supremacy using noisy intermediate-scale quantum devices. In this Letter, we present classical sampling algorithms for single-photon and Gaussian input states that take advantage of a graph structure of a linear-optical circuit. The algorithms’ complexity grows as so-called treewidth, which is closely related to the connectivity of a given linear-optical circuit. Using the algorithms, we study approximated simulations for local Haar-random linear-optical circuits. For equally spaced initial sources, we show that, when the circuit depth is less than the quadratic in the lattice spacing, the efficient simulation is possible with an exponentially small error. Notably, right after this depth, photons start to interfere each other and the algorithms’ complexity becomes subexponential in the number of sources, implying that there is a sharp transition of its complexity. Finally, when a circuit is sufficiently deep enough for photons to typically propagate to all modes, the complexity becomes exponential as generic sampling algorithms. We numerically implement a likelihood test with a recent Gaussian boson sampling experiment and show that the treewidth-based algorithm with a limited treewidth renders a larger likelihood than the experimental data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Explicit Form for the Most General Lorentz Transformation Revisited

Explicit formulae for the 4×4 Lorentz transformation matrices corresponding to a pure boost and a pure three-dimensional rotation are very well known. Significantly less well known is the explicit formula for a general Lorentz transformation with arbitrary non-zero boost and rotation parameters. We revisit this more general formula by presenting two different derivations. The first derivation (which is somewhat simpler than previous ones appearing in the literature) evaluates the exponential of a 4×4 real matrix A, where A is a product of the diagonal matrix diag(+1,−1,−1,−1) and an arbitrary 4×4 real antisymmetric matrix. The formula for expA depends only on the eigenvalues of A and makes use of the Lagrange interpolating polynomial. The second derivation exploits the observation that the spinor product η†σ¯μχ transforms as a Lorentz four-vector, where χ and η are two-component spinors. The advantage of the latter derivation is that the corresponding formula for a general Lorentz transformation Λ reduces to the computation of the trace of a product of 2×2 matrices. Both computations are shown to yield equivalent expressions for Λ.

Science & Technology - Other Topics↗
DOE OSTI2022

Bosonic field digitization for quantum computers

Quantum simulation of quantum field theory is a flagship application of quantum computers that promises to deliver capabilities beyond classical computing. The realization of quantum advantage will require methods that can accurately predict error scaling as a function of the resolution and parameters of the model and that can be implemented efficiently on quantum hardware. In this paper, we address the representation of lattice bosonic fields in a discretized field amplitude basis, develop methods to predict error scaling, and present efficient qubit implementation strategies. A low-energy subspace of the bosonic Hilbert space, defined by a boson occupation number cutoff, can be represented with exponentially good accuracy by a low-energy subspace of a finite-size Hilbert space. The finite representation construction and the associated errors are directly related to the accuracy of the Nyquist-Shannon sampling and the finite Fourier transforms of the boson number states in the field and the conjugate-field bases. We analyze the relation between the boson mass, the discretization parameters used for wave function sampling, and the finite representation size. Numerical simulations of small size Φ 4 problems demonstrate that the boson mass optimizing the sampling of the ground state wave function is a good approximation to the optimal boson mass yielding the minimum low-energy subspace size. However, we find that accurate sampling of general wave functions does not necessarily result in accurate representation. Finally, we develop methods for validating and adjusting the discretization parameters to achieve more accurate simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Demonstration of the rodeo algorithm on a quantum computer

The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. This makes it a promising tool for studying the spectrum and structure of atomic nuclei as well as other fields of quantum many-body physics. The only requirement is that the initial state has sufficient overlap probability with the desired eigenstate. While it is exponentially faster than well-known algorithms such as phase estimation and adiabatic evolution for eigenstate preparation, it has yet to be implemented on an actual quantum device. In this work, we apply the rodeo algorithm to determine the energy levels of a random one-qubit Hamiltonian, resulting in a relative error of 0.08% using mid-circuit measurements on the IBM Q device Casablanca. This surpasses the accuracy of directly-prepared eigenvector expectation values using the same quantum device. We take advantage of the high-accuracy energy determination and use the Hellmann-Feynman theorem to compute eigenvector expectation values for a different random one-qubit observable. For the Hellmann-Feynman calculations, we find a relative error of 0.7%. Here, we conclude by discussing possible future applications of the rodeo algorithm for multi-qubit Hamiltonians.

algorithm↗
DOE OSTI2025

Detection of atomic oxygen and its electronic coherence decays using time-resolved ultrafast coherent Raman scattering

We report the detection of atomic oxygen and quantitative measurements of its electronic Raman coherence decays in flames and low-temperature plasmas using time-resolved hybrid femtosecond/picosecond coherent anti-Stokes Raman scattering (CARS). Atomic oxygen was detected using the Raman transitions between the spin–orbit coupled triplet ground states. Atomic oxygen was generated in an H 2 /O 2 /Ar diffusion flame and an O 2 /Ar pulsed plasma discharge. Single exponential decays were observed for the O( 3 P 2 )–O( 3 P 1 ) Raman transition at 158.3 cm −1 and the O( 3 P 2 )–O( 3 P 0 ) Raman transition at 227 cm −1 . From the decay measurements, the atomic O Raman linewidths were obtained from 25 to 150 Torr in non-equilibrium plasma and at 760 Torr in a flame. Enhanced signal-to-noise ratios (SNRs) of atomic oxygen and atomic to molecular oxygen signal contrasts were obtained by taking advantage of electronic triplet coherence beating. Enhancement of up to seven times in the atomic O SNR was observed. Furthermore, we also found that the dephasing rates of O 2 (v = 0–3, N = 37) were similar, which provides evidence for the assumption that vibrational excitation does not influence the dephasing of diatomic molecular rotational CARS transitions.

Atomic and molecular spectroscopy↗
DOE OSTI2021

Mutations in artificial self-replicating tiles: A step toward Darwinian evolution

Significance In nature, mutation is the first step of evolution, where it provides the genetic variation for the natural selection to act. Here we take a system of artificial self-replicating tiles, DNA origami, that exhibit templated reproduction. We can generate a small fraction of mutations by introducing a mismatch in hybridization between parent and daughter. We can modify the origami functionality to affect the growth rate of the mutated species, giving it less or more evolutionary advantage, and to become dominant in several generations. The introduction of mutations into an artificial self-replicating system provides new directions for research into self-assembly processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Scaling quantum approximate optimization on near-term hardware

The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers to potentially demonstrate computational advantage in solving combinatorial optimization problems. However, the viability of the QAOA depends on how its performance and resource requirements scale with problem size and complexity for realistic hardware implementations. Here, we quantify scaling of the expected resource requirements by synthesizing optimized circuits for hardware architectures with varying levels of connectivity. Assuming noisy gate operations, we estimate the number of measurements needed to sample the output of the idealized QAOA circuit with high probability. We show the number of measurements, and hence total time to solution, grows exponentially in problem size and problem graph degree as well as depth of the QAOA ansatz, gate infidelities, and inverse hardware graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Streaming Compression of Scientific Data via Weak-SINDy

Here, in this paper, a streaming weak-SINDy algorithm is developed specifically for compressing streaming scientific data. The production of scientific data, either via simulation or experiments, is undergoing a stage of exponential growth, which makes data compression important and often necessary for storing and utilizing large scientific data sets. As opposed to classical “offline” compression algorithms that perform compression on a readily available data set, streaming compression algorithms compress data “online” while the data generated from simulation or experiments is still flowing through the system. This feature makes streaming compression algorithms well suited for scientific data compression, where storing the full data set offline is often infeasible. This work proposes a new streaming compression algorithm, streaming weak-SINDy, which takes advantage of the underlying data characteristics during compression. The streaming weak-SINDy algorithm constructs feature matrices and target vectors in the online stage via a streaming integration method in a memory efficient manner. The feature matrices and target vectors are then used in the offline stage to build a model through a regression process that aims to recover equations that govern the evolution of the data. For compressing high-dimensional streaming data, we adopt a streaming proper orthogonal decomposition (POD) process to reduce the data dimension and then use the streaming weak-SINDy algorithm to compress the temporal data of the POD expansion. We propose modifications to the streaming weak-SINDy algorithm to accommodate the dynamically updated POD basis. By combining the built model from the streaming weak-SINDy algorithm and a small amount of data samples, the full data flow could be reconstructed accurately at a low memory cost, as shown in the numerical tests.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Learning Distributed Geometric Koopman Operator for Sparse Networked Dynamical Systems

Koopman operator theory provides an alternative to study nonlinear networked dynamical systems by mapping the state space to an abstract higher dimensional space where the system evolution is linear. Recent works show the application of graph neural networks (GNNs) to learn state to object-centric embeddings and achieve centralized block-wise computation of Koopman operator (KO) under additional assumptions on the underlying agents properties and constraints on the KO structure. However, the computational complexity of learning the Koopman increases exponentially for networked systems where the number of possible system states grows in a combinatorial fashion with the number of nodes. The learning challenge is further amplified for sparse networks by two factors: 1) sample sparsity for learning the Koopman operator in the non-linear space, and 2) the divergence in the dynamics of individual nodes or from one subgraph to another. Our work aims to address these challenge by formulating the representation learning of networked dynamical systems into a multi-agent paradigm and learning the Koopman operator in a distributive manner. The computational as well as performance advantages of distributed Koopman is predominant for sparse networks whereas for fully connected networks, it is shown to coincide with the centralized one. The empirical study on rope system, network of oscillators and a synthetic power system show comparable and superior performance along with computational benefits with the state-of-the-art methods.

Mukherjee, Sayak↗
DOE OSTI2026

Ether of Orbifolds

The orbifold lattice has been proposed as a route to practical quantum simulation of Yang--Mills theory, with claims of exponential speedup over all known approaches. Through analytical derivations, Monte Carlo simulation, and explicit circuit construction, we identify compounding costs entirely absent in Kogut--Susskind formulations: a mass-dependent Trotter overhead that scales as $m^4$, non-singlet contamination that grows as $m^2$ and worsens with penalty terms, and a mandatory mass extrapolation. Monte Carlo simulations of SU(3) establish a universal scaling: the continuum limit forces $m^2 \propto 1/a$, binding the Trotter step to the lattice spacing through a cost unique to orbifolds. For a fiducial $10^3$ calculation, the orbifold is $10^4$--$10^{10}$ times more expensive than every published alternative. These results indicate that the claimed computational advantages do not at present survive quantitative scrutiny.

Lamm, Henry [Fermilab] (ORCID:0000000330330791)↗
DOE OSTI2023

Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods

Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree–Fock and density functional theory but offer higher accuracy. Accordingly, quantum computers have been predominantly regarded as competitors to only the most accurate and costly classical methods for treating electron correlation. However, here we tighten bounds showing that certain first-quantized quantum algorithms enable exact time evolution of electronic systems with exponentially less space and polynomially fewer operations in basis set size than conventional real-time time-dependent Hartree–Fock and density functional theory. Although the need to sample observables in the quantum algorithm reduces the speedup, we show that one can estimate all elements of the k-particle reduced density matrix with a number of samples scaling only polylogarithmically in basis set size. We also introduce a more efficient quantum algorithm for first-quantized mean-field state preparation that is likely cheaper than the cost of time evolution. We conclude that quantum speedup is most pronounced for finite-temperature simulations and suggest several practically important electron dynamics problems with potential quantum advantage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

A Tensor Network-Based Quantum Algorithm for the Nonlinear 1D Burgers' Equation

In this work, we implement a tensor network-based quantum algorithm to solve unsteady, 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 compressible 1-dimensional (1D) Burgers' equation 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 to solve 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. Our framework is based on matrix product states (MPSs) and matrix product operators (MPOs). For example, the velocity field is represented by MPS, whereas the linear and nonlinear spatial differential terms of the velocity field are processed by MPOs. Our primary focus herein is to verify and validate the various tensor network components of the algorithm using solutions obtained by the classical algorithms on high performance computing (HPC) architectures. We use a classical time marching method to demonstrate the functionality of the tensor network operations to model the PDE and their robustness with the time evolution of the system. Our classical simulation results demonstrate the utility of tensor network-based operations in modeling nonlinear PDEs and highlight the necessity as well as potential advantages of using quantum simulations for these techniques.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗
DOE OSTI2020

Closing the Loops on Solar Photovoltaics Modules: An Agent-Based Modeling Approach for the Study of Circular Economy Strategies

Solar photovoltaics (PV) installed capacity have grown exponentially since the early 2000s (average annual growth rate of 50%). With 4,700 GW projected installed capacity by 2050, the volume of PV panels waste is also expected to become substantial. Though renewables are a sine qua non to the establishment of a truly circular economy (CE), the issue arising from their end-of-life management needs to be resolved. The management of PV end-of-life also represent a singular opportunity to create value, from recovered valuable, rare or critical materials (e.g. silver, tellurium, indium). Moreover, the PV case illustrates some of the current barriers to CE; for instance, the need for a common definition of waste (PV are defined as e-waste in the European Union but as general waste in the United States) and potential loss of innovations' advantages (PV average efficiency has continuously grown the past 10 years). In this study, an agent-based modeling (ABM) approach is proposed to simulate PV end-of-life management in the United States. The model explores how the decisions of the various actors involved in handling PV waste affect the quantities of PV that are reused, recycled, or land-filled. In the model, manufacturers, residential, and nonresidential PV owners, installers, and recyclers are represented by agents while governmental policies and regulations are treated as exogenous variables. PV-market data are used to define agents' characteristics (e.g., installed PV capacities or producing costs). Agents' decision rules draw on the literature related to industrial symbiosis (IS) and peoples' waste behaviors as they appear as the most widely used model to implement CE principles at a meso level. Specifically, the concepts of mutual trust between IS actors and knowledge about the IS philosophy are yielded to define the agents' decision process. The primary outputs of the ABM are the costs and volume of waste associated with each end-of-life pathway. Preliminaries results indicate recycling of residential PV is affected by the cost, perceived difficulty of recycling behaviors, and social norms. Moreover, the type of network connecting agents and the initial recycling rate strongly influence results. The model also highlights the crucial role of recycling behavior adoption: in case of early failure of PV, recycled volumes increase by about 40%. This represents an additional 5.7 billion USD from potential recovered silver. Finally, although results for the PV case are presented here, the developed ABM aims at being a general tool for the study of CE strategies and the CE transition. Furthermore, steps of this research include extending the model to encompass circular economy strategies (e.g., design for recycling or lifetime extension) and validating its general architecture from various case studies.

14 SOLAR ENERGY↗
DOE OSTI2025

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Scanning electrochemical probe microscopy investigation of two-dimensional materials

Research interests in two-dimensional (2D) materials have seen exponential growth owing to their unique and fascinating properties. The highly exposed lattice planes coupled with tunable electronic states of 2D materials have created manifold opportunities in the design of new platforms for energy conversion and sensing applications. Still, challenges in understanding the electrochemical (EC) characteristics of these materials arise from the complexity of both intrinsic and extrinsic heterogeneities that can obscure structure–activity correlations. Scanning EC probe microscopic investigations offer unique benefits in disclosing local EC reactivities at the nanoscale level that are otherwise inaccessible with macroscale methods. This review summarizes recent progress in applying techniques of scanning EC microscopy (SECM) and scanning EC cell microscopy (SECCM) to obtain distinctive insights into the fundamentals of 2D electrodes. We showcase the capabilities of EC microscopies in addressing the roles of defects, thickness, environments, strain, phase, stacking, and many other aspects in the heterogeneous electron transfer, ion transport, electrocatalysis, and photoelectrochemistry of representative 2D materials and their derivatives. Perspectives for the advantages, challenges, and future opportunities of scanning EC probe microscopy investigation of 2D structures are discussed.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Challenges in Tracking Waste Reduction Performance Improvement in Manufacturing Plants

The recently released Circularity Gap Report 2023 by Circle Economy Foundation found that the circularity score for the global economy is declining. This indicates that material extraction from virgin sources is climbing over earlier years. As per data released by US Geological Survey, material use in the US economy has increased exponentially with the expanding US economy over last century. EPA tracked municipal solid waste from 1960 to 2018 and found that 50% of the waste is destined for landfills. EPA estimates that US industry is responsible for 2.7 billion ton of solid non-hazardous waste annually in our mostly linear economy model. The circular economy framework aims at decoupling economic value generation from virgin materials extraction from nature. The linear model of material extraction and disposal at end of life is highly unsustainable. Manufacturing companies have realized this and in their commitments to sustainability are adopting ambitious waste reduction targets. Through Better Plants program US Department of Energy has established Waste Reduction Network where it is offering technical assistance to partners to achieve these ambitious waste reduction goals. Basic requirements of establishing a target include identifying a baseline, quantifying waste performance, and measuring progress over time. One problem faced by industry is the unstandardized metrics to quantify waste performance that may not be well suited to demonstrate progress. In this paper, we research methods traditionally used to measure waste performance and highlight advantages, gaps and limitations of each method. Suitability of the methods applicable to different manufacturing circumstances are also examined. Finally, we present a case study of a large manufacturer that faced inconsistencies in their tracked measurement metric. A solution was proposed to alter the methodology to enable more accurate waste performance tracking against a baseline.

Chaudhari, Subodh↗
DOE OSTI2022

Performance Evaluations of 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 towards 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 quantum add and quantum multiply within the given context. 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 performance trends in our results and speculate on possible future development within this computational paradigm.

97 MATHEMATICS AND COMPUTING↗