Search NASA⌕ Search

SEARCH · Search NASA

Results for “operator exponential”

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 271 records · Page 15

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Theorem on extensive spectral degeneracy for systems with rigid higher symmetries in general dimensions

We establish, in the spirit of the Lieb-Schultz-Mattis theorem, lower bounds on the spectral degeneracy of quantum systems with higher (gaugelike) symmetries with rather generic physical boundary conditions in an arbitrary number of spatial dimensions. Contrary to applying twists or equivalent adiabatic operations, we exploit the effects of modified boundary conditions. We find that when a general choice of boundary geometry is immaterial in determining spectral degeneracies while approaching the thermodynamic limit, systems that exhibit rigid noncommuting gaugelike symmetries, such as the orbital compass model, must have an exponential (in the size of the boundary) degeneracy of each of their spectral levels.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

High-Speed Nonpolar InGaN/GaN Superluminescent Diode With 2.5 GHz Modulation Bandwidth

We demonstrate a superluminescent diode fabricated on a nonpolar m-plane GaN substrate by employing a linearly tapered waveguide design. A high electrical -3dB modulation bandwidth ( f\n 3dB \n) of 2.5 GHz at a current density of 30 kA/cm\n 2 \n is achieved. The high modulation bandwidth is attributed to the shorter carrier recombination lifetime, the linear gain curve in the nonpolar m-plane quantum wells, and the ability to operate at high current densities while effectively suppressing lasing. We derive a general expression for the -3dB bandwidth as a function of current density for SLDs using a similar approach to that for laser diodes. The -3dB bandwidth of a nonpolar superluminescent diode increases exponentially with current density. The experimental results are consistent with the derived expression for f\n 3dB \n vs. current density.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Characterizations of linear sufficient statistics

A surjective bounded linear operator T from a Banach space X to a Banach space Y must be a sufficient statistic for a dominated family of probability measures defined on the Borel sets of X. These results were applied, so that they characterize linear sufficient statistics for families of the exponential type, including as special cases the Wishart and multivariate normal distributions. The latter result was used to establish precisely which procedures for sampling from a normal population had the property that the sample mean was a sufficient statistic.

Peters, B. C., Jr.↗

The second generation intelligent user interface for the crustal dynamics data information system

For the past decade, operations and research projects that support a major portion of NASA's overall mission have experienced a dramatic increase in the volume of generated data and resultant information that is unparalleled in the history of the agency. The effect of such an increase is that most of the science and engineering disciplines are undergoing an information glut, which has occurred, not only because of the amount, but also because of the type of data being collected. This information glut is growing exponentially and is expected to grow for the foreseeable future. Consequently, it is becoming physically and intellectually impossible to identify, access, modify, and analyze the most suitable information. Thus, the dilemma arises that the amount and complexity of information has exceeded and will continue to exceed, using present information systems, the ability of all the scientists and engineers to understand and take advantage of this information. As a result of this information problem, NASA has initiated the Intelligent Data Management (IDM) project to design and develop Advanced Information Management Systems (AIMS). The first effort of the Project was the prototyping of an Intelligent User Interface (IUI) to an operational scientific database using expert systems, natural language processing, and graphics technologies. An overview of the IUI formulation and development for the second phase is presented.

Short, Nicholas, Jr.↗

Modeling impurity concentrations in liquid argon detectors

Impurities in noble liquid detectors used for neutrino and dark matter experiments can significantly impact the quality of data. We present an experimentally verified model for describing the dynamics of impurity distributions in liquid argon (LAr) detectors. The model considers sources, sinks, and transport of impurities within and between the gas and liquid argon phases. Measurements of oxygen concentrations in a 20-L LAr multi-purpose test stand are compared to calculations made with this model to show that an accurate description of the concentrations under various operational conditions can be obtained. A result of this analysis is a determination of Henry’s coefficient for oxygen in LAr. Additionally, these calculations also show that some processes have small effects on the impurity dynamics and excluding them yields a solution as a sum of two exponential terms. This solution provides a simple way to extract Henry’s coefficient with negligible approximation error. It is applied to the data and the Henry’s coefficient for oxygen in LAr is obtained as 0.84 +0.09 -0.05 , consistent with literature results. Finally, based on the analysis of the data with the model, we further suggest that, for a large liquid argon detector, barriers to flow (“baffles”) installed in the gas phase to restrict flow can help reduce the ultimate impurity concentration in the LAr.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Qualitative Features Extraction from Sensor Data using Short-time Fourier Transform

The information gathered from sensors is used to determine the health of a sensor. Once a normal mode of operation is established any deviation from the normal behavior indicates a change. This change may be due to a malfunction of the sensor(s) or the system (or process). The step-up and step-down features, as well as sensor disturbances are assumed to be exponential. An RC network is used to model the main process, which is defined by a step-up (charging), drift, and step-down (discharging). The sensor disturbances and spike are added while the system is in drift. The system runs for a period of at least three time-constants of the main process every time a process feature occurs (e.g. step change). The Short-Time Fourier Transform of the Signal is taken using the Hamming window. Three window widths are used. The DC value is removed from the windowed data prior to taking the FFT. The resulting three dimensional spectral plots provide good time frequency resolution. The results indicate distinct shapes corresponding to each process.

Amini, Abolfazl M.↗

Real-Time System Verification by Kappa-Induction

We report the first formal verification of a reintegration protocol for a safety-critical, fault-tolerant, real-time distributed embedded system. A reintegration protocol increases system survivability by allowing a node that has suffered a fault to regain state consistent with the operational nodes. The protocol is verified in the Symbolic Analysis Laboratory (SAL), where bounded model checking and decision procedures are used to verify infinite-state systems by k-induction. The protocol and its environment are modeled as synchronizing timeout automata. Because k-induction is exponential with respect to k, we optimize the formal model to reduce the size of k. Also, the reintegrator's event-triggered behavior is conservatively modeled as time-triggered behavior to further reduce the size of k and to make it invariant to the number of nodes modeled. A corollary is that a clique avoidance property is satisfied.

Pike, Lee S.↗

The second generation intelligent user interface for the crustal dynamics data information system

For the past decade, operations and research projects that support a major portion of NASA's overall mission have experienced a dramatic increase in the volume of generated data and resultant information that is unparalleled in the history of the agency. The effect of such an increase is that most of the science and engineering disciplines are undergoing an information glut, which has occurred, not only because of the amount, but also because of the type of data being collected. This information glut is growing exponentially and is expected to grow for the foreseeable future. Consequently, it is becoming physically and intellectually impossible to identify, access, modify, and analyze the most suitable information. Thus, the dilemma arises that the amount and complexity of information has exceeded and will continue to exceed, using present information systems, the ability of all the scientists and engineers to understand and take advantage of this information. As a result of this information problem, NASA has initiated the Intelligent Data Management (IDM) project to design and develop Advanced Information Management (IDM) project to design and develop Advanced Information Management Systems (AIMS). The first effort of the Project was the prototyping of an Intelligent User Interface (IUI) to an operational scientific database using expert systems, natural language processing, and graphics technologies. An overview of the IUI formulation and development for the second phase is presented.

Short, Nicholas, Jr.↗

High Temperature Polymer Electrolyte Membrane Fuel Cells with High Phosphoric Acid Retention

Phosphoric acid loss poses immense hurdles for the durability of high-temperature polymer electrolyte membrane fuel cells (HT-PEMFCs). Here we report quaternary ammonium-biphosphate ion-pair HT-PEMFCs that do not lose phosphoric acids under normal and accelerated stress conditions. Additionally, our energetics study explains the acid loss behavior of the conventional phosphoric acid-polybenzimidazole (PA-PBI) system by two mechanisms. If PA loss occurs via acid evaporation, the acid loss is constant over time. On the other hand, when water activity in the PA-PBI system is high, exponential decay of PA loss occurs via the water replacement mechanism. Combined 31 P NMR and computational studies show that the proposed ion-pair system has six times higher interaction energy, which allows for containing all PAs in the membrane electrode assemblies under a broad range of operating conditions. In addition, polar interactions between the phosphonic acid ionomer and phosphoric acid explain acid retention in the electrodes of the ion-pair HT-PEMFCs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Lieb-Robinson Bounds with Exponential-in-Volume Tails

Lieb-Robinson bounds demonstrate the emergence of locality in many-body quantum systems. Intuitively, Lieb-Robinson bounds state that, with local or exponentially decaying interactions, the correlation that can be built up between two sites separated by distance 𝑟 after a time 𝑡 decays as exp (𝑣⁢𝑡 −𝑟), where 𝑣 is the emergent Lieb-Robinson velocity. In many problems, it is important to also capture how much of an operator grows to act on 𝑟 𝑑 sites in 𝑑 spatial dimensions. Perturbation theory and cluster expansion methods suggest that, at short times, these volume-filling operators are suppressed as exp (−𝑟 𝑑 ). We confirm this intuition, showing that, for 𝑟 >𝑣⁢𝑡, the volume-filling operator is suppressed by exp (−(𝑟−𝑣⁢𝑡) 𝑑 /(𝑣⁢𝑡) 𝑑−1 ). This closes a conceptual and practical gap between the cluster expansion and the Lieb-Robinson bound. We then present two very different applications of this new bound. Firstly, we obtain improved bounds on the classical computational resources necessary to simulate many-body dynamics with error tolerance 𝜀 for any finite time 𝑡: as 𝜀 becomes sufficiently small, only 𝜀 −O⁡(𝑡 𝑑−1 ) resources are needed. A protocol that likely saturates this bound is given. Secondly, we prove that disorder operators have volume-law suppression near the “solvable (Ising) point” in quantum phases with spontaneous symmetry breaking, which implies a new diagnostic for distinguishing many-body phases of quantum matter.

computational complexity↗

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system. While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuous-variable paradigm. Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation. We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities. We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems. These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.

97 MATHEMATICS AND COMPUTING↗

Stability of large-scale systems under structural perturbations.

A large-scale system is considered as a system constituted of subsystems which may be connected or disconnected from each other during operation. A new concept of connective stability is introduced by which a large-scale system is regarded as stable if it remains stable (in the sense of Lyapunov) under structural perturbations produced by the on-off participation of the subsystems. Algebraic conditions are developed that guarantee exponential connective stability of large-scale systems which may be composed of linear and nonlinear time-varying subsystems coupled by linear or nonlinear connections.

Siljak, D. D.↗

On large-scale system stability.

A large-scale system is considered as a system constituted of subsystems which may be connected or disconnected from each other during operation. A new notion of connective stability is introduced by which a large-scale system is regarded as stable if it remains stable (in the sense of Liapunov) under structural perturbations produced by the on-off participation of the subsystems. Algebraic conditions are developed that guarantee exponential connective stability in large-scale systems which may be composed of linear and nonlinear subsystems coupled by linear or nonlinear connections.

Siljak, D. D.↗

Concatenated coding for low date rate space communications.

In deep space communications with distant planets, the data rate as well as the operating SNR may be very low. To maintain the error rate also at a very low level, it is necessary to use a sophisticated coding system (longer code) without excessive decoding complexity. The concatenated coding has been shown to meet such requirements in that the error rate decreases exponentially with the overall length of the code while the decoder complexity increases only algebraically. Three methods of concatenating an inner code with an outer code are considered. Performance comparison of the three concatenated codes is made.

Chen, C. H.↗

Determining the N -Representability of a Reduced Density Matrix via Unitary Evolution and Stochastic Sampling

The N-representability problem consists in determining whether, for a given p-body matrix, there exists at least one N-body density matrix from which the p-body matrix can be obtained by contraction, that is, if the given matrix is a p-body reduced density matrix (p-RDM). The knowledge of all necessary and sufficient conditions for a p-body matrix to be N-representable allows the constrained minimization of a many-body Hamiltonian expectation value with respect to the p-body density matrix and, thus, the determination of its exact ground state. However, the number of constraints that complete the N-representability conditions grows exponentially with system size, and hence, the procedure quickly becomes intractable for practical applications. This work introduces a hybrid quantum-stochastic algorithm to effectively replace the N-representability conditions. The algorithm consists of applying to an initial N-body density matrix a sequence of unitary evolution operators constructed from a stochastic process that successively approaches the reduced state of the density matrix on a p-body subsystem, represented by a p-RDM, to a target p-body matrix, potentially a p-RDM. The generators of the evolution operators follow the well-known adaptive derivative-assembled pseudo-Trotter method (ADAPT), while the stochastic component is implemented by using a simulated annealing process. The resulting algorithm is independent of any underlying Hamiltonian, and it can be used to decide whether a given p-body matrix is N-representable, establishing a criterion to determine its quality and correcting it. We apply the proposed hybrid ADAPT algorithm to alleged reduced density matrices from a quantum chemistry electronic Hamiltonian, from the reduced Bardeen–Cooper–Schrieffer model with constant pairing, and from the Heisenberg XXZ spin model. In all cases, the proposed method behaves as expected for 1-RDMs and 2-RDMs, evolving the initial matrices toward different targets.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Topology, criticality, and dynamically generated qubits in a stochastic measurement-only Kitaev model

Here we consider a paradigmatic solvable model of topological order in two dimensions, Kitaev's honeycomb Hamiltonian, and turn it into a measurement-only dynamics consisting of stochastic measurements of two-qubit bond operators. We find an entanglement phase diagram that resembles that of the Hamiltonian problem in some ways, while being qualitatively different in others. When one type of bond is dominantly measured, we find area-law entangled phases that protect two topological qubits (on a torus) for a time exponential in system size. This generalizes the recently proposed idea of Floquet codes, where logical qubits are dynamically generated by a time-periodic measurement schedule, to a stochastic setting. When all types of bonds are measured with comparable frequency, we find a critical phase with a logarithmic violation of the area law, which sharply distinguishes it from its Hamiltonian counterpart. The critical phase has the same set of topological qubits, as diagnosed by the tripartite mutual information, but protects them only for a time polynomial in system size. Furthermore, we observe an unusual behavior for the dynamical purification of mixed states, characterized at late times by the dynamical exponent z = $\frac{1}{2}$ a superballistic dynamics made possible by measurements.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

At least some errors are randomly generated (Freud was wrong)

An experiment was carried out to expose something about human error generating mechanisms. In the context of the experiment, an error was made when a subject pressed the wrong key on a computer keyboard or pressed no key at all in the time allotted. These might be considered, respectively, errors of substitution and errors of omission. Each of seven subjects saw a sequence of three digital numbers, made an easily learned binary judgement about each, and was to press the appropriate one of two keys. Each session consisted of 1,000 presentations of randomly permuted, fixed numbers broken into 10 blocks of 100. One of two keys should have been pressed within one second of the onset of each stimulus. These data were subjected to statistical analyses in order to probe the nature of the error generating mechanisms. Goodness of fit tests for a Poisson distribution for the number of errors per 50 trial interval and for an exponential distribution of the length of the intervals between errors were carried out. There is evidence for an endogenous mechanism that may best be described as a random error generator. Furthermore, an item analysis of the number of errors produced per stimulus suggests the existence of a second mechanism operating on task driven factors producing exogenous errors. Some errors, at least, are the result of constant probability generating mechanisms with error rate idiosyncratically determined for each subject.

Sellen, A. J.↗