SEARCH · Search NASA

Results for “matched bound”

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.

SourceResearch connectionFrom yearThrough year

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

At least 19 records

All sources NASA NTRS DOE OSTI

NASA NTRS2003

Match-bounded String Rewriting Systems

We introduce a new class of automated proof methods for the termination of rewriting systems on strings. The basis of all these methods is to show that rewriting preserves regular languages. To this end, letters are annotated with natural numbers, called match heights. If the minimal height of all positions in a redex is h+1 then every position in the reduct will get height h+1. In a match-bounded system, match heights are globally bounded. Using recent results on deleting systems, we prove that rewriting by a match-bounded system preserves regular languages. Hence it is decidable whether a given rewriting system has a given match bound. We also provide a sufficient criterion for the abence of a match-bound. The problem of existence of a match-bound is still open. Match-boundedness for all strings can be used as an automated criterion for termination, for match-bounded systems are terminating. This criterion can be strengthened by requiring match-boundedness only for a restricted set of strings, for instance the set of right hand sides of forward closures.

Geser, Alfons↗

NASA NTRS2004

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds

Annotating a letter by a number, one can record information about its history during a reduction. A string rewriting system is called match-bounded if there is a global upper bound to these numbers. In earlier papers we established match-boundedness as a strong sufficient criterion for both termination and preservation of regular languages. We show now that the string rewriting system whose inverse (left and right hand sides exchanged) is match-bounded, also have exceptional properties, but slightly different ones. Inverse match-bounded systems effectively preserve context-free languages; their sets of normalized strings and their sets of immortal strings are effectively regular. These sets of strings can be used to decide the normalization, the termination and the uniform termination problems of inverse match-bounded systems. We also show that the termination problem is decidable in linear time, and that a certain strong reachability problem is deciable, thus solving two open problems of McNaughton's.

Butler, Ricky↗

NASA NTRS2005

Deciding Termination for Ancestor Match- Bounded String Rewriting Systems

Termination of a string rewriting system can be characterized by termination on suitable recursively defined languages. This kind of termination criteria has been criticized for its lack of automation. In an earlier paper we have shown how to construct an automated termination criterion if the recursion is aligned with the rewrite relation. We have demonstrated the technique with Dershowitz's forward closure criterion. In this paper we show that a different approach is suitable when the recursion is aligned with the inverse of the rewrite relation. We apply this idea to Kurth's ancestor graphs and obtain ancestor match-bounded string rewriting systems. Termination is shown to be decidable for this class. The resulting method improves upon those based on match-boundedness or inverse match-boundedness.

Geser, Alfons↗

DOE OSTI2020

Penetration Through Slots in Cylindrical Cavities Operating at Fundamental Cavity Modes

In this article, we examine the coupling into an electrically short azimuthal slot on a cylindrical cavity operating at fundamental cavity modal frequencies. We first develop a matched bound formulation through which we can gather information for maximum achievable levels of interior cavity fields. Actual field levels are below this matched bound; therefore, we also develop an unmatched formulation for frequencies below the slot resonance to achieve a better insight on the physics of this coupling. Good agreement is observed between the unmatched formulation, full-wave simulations, and experimental data, providing a validation of our analytical models. We then extend the unmatched formulation to treat an array of slots, found again in good agreement with full-wave simulations. These analytical models can be used to investigate ways to mitigate electromagnetic interference and electromagnetic compatibility effects within cavities.

42 ENGINEERING↗

DOE OSTI2026

Time Correlations from Steady-State Expectation Values

Recovering properties of correlation functions is typically challenging. On the one hand, experimentally, it requires measurements with a temporal resolution finer than the system’s dynamics. On the other hand, analytical or numerical analysis requires solving the system evolution. Here, we use recent results of quantum metrology with continuous measurements to derive general lower bounds on the relaxation and second-order correlation times that are both easy to calculate and measure. These bounds are based solely on steady-state expectation values and their derivatives with respect to a system parameter, and can be readily extended to the autocorrelation of arbitrary observables. We validate our method on two examples of critical quantum systems: a critical driven-dissipative resonator, where the bound matches analytical results for the dynamics, and the infinite-range Ising model, where only the steady state is solvable, and thus the bound provides information beyond the reach of existing analytical approaches. Our results can be applied to the experimental characterization of ultrafast systems and to the theoretical analysis of many-body models whose dynamics are hard to compute.

Górecki, Wojciech [INFN, Pavia] (ORCID:00000001991↗

DOE OSTI2025

Time correlations from steady-state expectation values

Recovering properties of correlation functions is typically challenging. On one hand, experimentally, it requires measurements with a temporal resolution finer than the system's dynamics. On the other hand, analytical or numerical analysis requires solving the system evolution. Here, we use recent results of quantum metrology with continuous measurements to derive general lower bounds on the relaxation and second-order correlation times that are both easy to calculate and measure. These bounds are based solely on steady-state expectation values and their derivatives with respect to a control parameter, and can be readily extended to the autocorrelation of arbitrary observables. We validate our method on two examples of critical quantum systems: a critical driven-dissipative resonator, where the bound matches analytical results for the dynamics, and the infinite-range Ising model, where only the steady state is solvable and thus the bound provides information beyond the reach of existing analytical approaches. Our results can be applied to experimentally characterize ultrafast systems, and to theoretically analyze many-body models with dynamics that are analytically or numerically hard.

Górecki, Wojciech [INFN, Pavia]↗

DOE OSTI2025

Time correlations from steady-state expectation values

Górecki, Wojciech [INFN, Pavia]↗

DOE OSTI2026

Trajectory-independent speed limits for controlled open quantum systems

Existing quantum speed limits for controlled open quantum systems depend on the specified trajectory. For example, lower bounds on quantum annealing times in the presence of dissipation depend explicitly on the chosen annealing schedule. Recently, schedule-independent speed limits have been derived for annealing in the closed quantum system setting [L. P. García-Pintos et al ., SciPost Phys. 18 , 159 (2025)]. In this work, we generalize these results to open quantum systems, deriving schedule-independent lower bounds for quantum annealing times in systems described by a Lindblad master equation. We analyze the interplay between coherent control and dissipation in single- and two-qubit examples, demonstrating that the derived lower bounds capture key scaling behavior with respect to the strength of the dissipator. Finally, we apply the bound to thermal state preparation and show that the bound matches the expected asymptotic behavior for an Ising model in the high-temperature limit.

open quantum systems & decoherence↗

DOE OSTI2024

Scalable Experimental Bounds for Entangled Quantum State Fidelities

Estimating the state preparation fidelity of highly entangled states on noisy intermediate-scale quantum (NISQ) devices is important for benchmarking and application considerations. Unfortunately, exact fidelity measurements quickly become prohibitively expensive, as they scale exponentially as O(3 N for N-qubit states, using full state tomography with measurements in all Pauli bases combinations. However, Somma et al.established that the complexity could be drastically reduced when looking at fidelity lower bounds for states that exhibit symmetries, such as Dicke states and GHZ states. These bounds must still be tight enough for larger states to provide reasonable estimations on NISQ devices. For the first time and more than 15 years after the theoretical introduction, we report meaningful lower bounds for the state preparation fidelity of all Dicke states up to N=10 and all GHZ states up to N=20 on Quantinuum H1 ion-trap systems using efficient implementations of recently proposed scalable circuits for these states. Our achieved lower bounds match or exceed previously reported exact fidelities on superconducting systems for much smaller states. Furthermore, we provide evidence that for large Dicke states |$D^{N}_{N/2}\rangle$, we may resort to a GHZ-based approximate state preparation to achieve better fidelity. This work provides a path forward to benchmarking entanglement as NISQ devices improve in size and quality.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

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↗

DOE OSTI2020

Destructive Error Interference in Product-Formula Lattice Simulation

Quantum computers can efficiently simulate the dynamics of quantum systems. Here, we study the cost of digitally simulating the dynamics of several physically relevant systems using the first-order product-formula algorithm. We show that the errors from different Trotterization steps in the algorithm can interfere destructively, yielding a much smaller error than previously estimated. In particular, we prove that the total error in simulating a nearest-neighbor interacting system of n sites for time t using the first-order product formula with r time slices is O ( n t / r + n t 3 / r 2 ) when n t 2 / r is less than a small constant. Given an error tolerance ϵ , the error bound yields an estimate of max { O ( n 2 t / ϵ ) , O ( n 2 t 3 / 2 / ϵ 1 / 2 ) } for the total gate count of the simulation. The estimate is tighter than previous bounds and matches the empirical performance observed in Childs et al. [ Proc. Natl. Acad. Sci. U.S.A. 115 , 9456 (2018) ]. We also provide numerical evidence for potential improvements and conjecture an even tighter estimate for the gate count.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Learning Many-Body Hamiltonians with Heisenberg-Limited Scaling

Learning a many-body Hamiltonian from its dynamics is a fundamental problem in physics. Here, in this Letter, we propose the first algorithm to achieve the Heisenberg limit for learning an interacting N-qubit local Hamiltonian. After a total evolution time of $\mathscr{O}$⁡(ε –1 ), the proposed algorithm can efficiently estimate any parameter in the N-qubit Hamiltonian to ε error with high probability. Our algorithm uses ideas from quantum simulation to decouple the unknown N-qubit Hamiltonian H into noninteracting patches and learns H using a quantum-enhanced divide-and-conquer approach. The proposed algorithm is robust against state preparation and measurement error, does not require eigenstates or thermal states, and only uses polylog⁡(ε –1 ) experiments. In contrast, the best existing algorithms require $\mathscr{O}$⁡⁡(ε –2 ) experiments and total evolution time. We prove a matching lower bound to establish the asymptotic optimality of our algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1988

Fault diagnosis in sparse multiprocessor systems

The problem of fault diagnosis in multiprocessor systems is considered under a uniformly probabilistic model in which processors are faulty with probability p. This work focuses on minimizing the number of tests that must be conducted in order to correctly diagnose the state of every processor in the system with high probability. A diagnosis algorithm that can correctly diagnose the state of every processor with probability approaching one in a class of systems performing slightly greater than a linear number of tests is presented. A nearly matching lower bound on the number of tests required to achieve correct diagnosis in arbitrary systems is also proven. The number of tests required under this probabilistic model is shown to be significantly less than under a bounded-size fault set model. Because the number of tests that must be conducted is a measure of the diagnosis overhead, these results represent a dramatic improvement in the performance of system-level diagnosis technique.

Blough, Douglas M.↗

NASA NTRS1989

Efficient diagnosis of multiprocessor systems under probabilistic models

The problem of fault diagnosis in multiprocessor systems is considered under a probabilistic fault model. The focus is on minimizing the number of tests that must be conducted in order to correctly diagnose the state of every processor in the system with high probability. A diagnosis algorithm that can correctly diagnose the state of every processor with probability approaching one in a class of systems performing slightly greater than a linear number of tests is presented. A nearly matching lower bound on the number of tests required to achieve correct diagnosis in arbitrary systems is also proven. Lower and upper bounds on the number of tests required for regular systems are also presented. A class of regular systems which includes hypercubes is shown to be correctly diagnosable with high probability. In all cases, the number of tests required under this probabilistic model is shown to be significantly less than under a bounded-size fault set model. Because the number of tests that must be conducted is a measure of the diagnosis overhead, these results represent a dramatic improvement in the performance of system-level diagnosis techniques.

Blough, Douglas M.↗

NASA NTRS1992

Fault-tolerant wait-free shared objects

A concurrent system consists of processes communicating via shared objects, such as shared variables, queues, etc. The concept of wait-freedom was introduced to cope with process failures: each process that accesses a wait-free object is guaranteed to get a response even if all the other processes crash. However, if a wait-free object 'crashes,' all the processes that access that object are prevented from making progress. In this paper, we introduce the concept of fault-tolerant wait-free objects, and study the problem of implementing them. We give a universal method to construct fault-tolerant wait-free objects, for all types of 'responsive' failures (including one in which faulty objects may 'lie'). In sharp contrast, we prove that many common and interesting types (such as queues, sets, and test&set) have no fault-tolerant wait-free implementations even under the most benign of the 'non-responsive' types of failure. We also introduce several concepts and techniques that are central to the design of fault-tolerant concurrent systems: the concepts of self-implementation and graceful degradation, and techniques to automatically increase the fault-tolerance of implementations. We prove matching lower bounds on the resource complexity of most of our algorithms.

Jayanti, Prasad↗

DOE OSTI2022

Online Learning and Pricing for Service Systems with Reusable Resources

We consider a price-based revenue management problem with finite reusable resources over a finite time horizon T. Customers arrive following a price-dependent Poisson process, and each customer requests one unit of c homogeneous reusable resources. If there is an available unit, the customer gets served within a price-dependent exponentially distributed service time; otherwise, the customer waits in a queue until the next available unit. In this paper, we assume that the firm does not know how the arrival and service rates depend on posted prices, and thus it makes adaptive pricing decisions in each period based only on past observations to maximize the cumulative revenue. Given a discrete price set with cardinality P, we propose two online learning algorithms, termed batch upper confidence bound (BUCB) and batch Thompson sampling (BTS), and prove that the cumulative regret upper bound is O˜(√PT) , which matches the regret lower bound. In establishing the regret, we bound the transient system performance upon price changes via a novel coupling argument, and also generalize bandits to accommodate subexponential rewards. Here, we also extend our approach to models with balking and reneging customers and discuss a continuous price setting. Our numerical experiments demonstrate the efficacy of the proposed BUCB and BTS algorithms.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Opacity on NIF: Anchor 2 Iron (Level 2 Milestone 7118 Report)

In FY2020 we fulfilled the exit criteria of milestone 7118. We fielded iron opacity experiments at higher densities and temperatures approaching anchor 2 conditions and made good progress on overcoming the problems that we found. This report describes in detail the progress that has been made. We presented the results in a LANL seminar on August 10 and we gave two talks on our results to the National Opacity Workshop Series, one on July 9 and the other on September 14. Before discussing the anchor 2 measurements, we present an update of the NIF anchor 1 data. We did a new analysis of the anchor 1 data and compared the results to a series of calculations using the LANL ATOMIC code. Figures 1 and 2 compare the data with the best-fit to calculations. This result is significantly improved over the result published in Atoms. The differences are small for the iron quasi-continuum between 8-9.5 Å and for the Mg Heα and Lyα lines. The opacities near the centers of the iron bound-bound features also match fairly well in the 9.5-12.5 Å range. However, the opacity windows between the large iron bound-bound features are deeper in the Atomic predictions than the measurement. Furthermore, large discrepancies exist for the Mg He β, γ, and δ lines and for the short-wavelength quasicontinuum. The experiment and analysis refinements described below have set the stage for unraveling these discrepancies. Specifically, we can repeat the Anchor 1 experiments using improved backlighter, hohlraum, and spectrometers to obtain reduced backgrounds and better spectral resolution. Exploiting the AlMg calibration experiments and repeating the Anchor 1 measurements multiple times will enable formal and rigorous uncertainty determination. This well-defined path gives us confidence that high quality opacity data can be obtained on NIF.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2024

Structural basis of transcription: RNA polymerase II substrate binding and metal coordination using a free-electron laser

Catalysis and translocation of multisubunit DNA-directed RNA polymerases underlie all cellular mRNA synthesis. RNA polymerase II (Pol II) synthesizes eukaryotic pre-mRNAs from a DNA template strand buried in its active site. Structural details of catalysis at near-atomic resolution and precise arrangement of key active site components have been elusive. Here, we present the free-electron laser (FEL) structures of a matched ATP-bound Pol II and the hyperactive Rpb1 T834P bridge helix (BH) mutant at the highest resolution to date. The radiation-damage-free FEL structures reveal the full active site interaction network, including the trigger loop (TL) in the closed conformation, bonafide occupancy of both site A and B Mg 2+ , and, more importantly, a putative third (site C) Mg 2+ analogous to that described for some DNA polymerases but not observed previously for cellular RNA polymerases. Molecular dynamics (MD) simulations of the structures indicate that the third Mg 2+ is coordinated and stabilized at its observed position. TL residues provide half of the substrate binding pocket while multiple TL/BH interactions induce conformational changes that could allow translocation upon substrate hydrolysis. Consistent with TL/BH communication, a FEL structure and MD simulations of the T834P mutant reveal rearrangement of some active site interactions supporting potential plasticity in active site function and long-distance effects on both the width of the central channel and TL conformation, likely underlying its increased elongation rate at the expense of fidelity.

Science & Technology - Other Topics↗