SEARCH · Search NASA
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.
In this paper, an analytical method for comparing the performance of an ideal forecasting algorithm to the best statistical methods in terms of average data return is derived.
Here, we discuss the computational efficiency of the finite-temperature simulation with minimally entangled typical thermal states (METTS). To argue that METTS can be efficiently represented as matrix product states, we present an analytic upper bound for the average entanglement Rényi entropy of METTS for a Rényi index 0 < q ≤ 1. In particular, for one-dimensional (1D) gapless systems described by conformal field theories, the upper bound scales as O(cN 0 logβ) where c is the central charge and N is the system size. Furthermore, we numerically find that the average Rényi entropy exhibits a universal behavior characterized by the central charge and is roughly given by half of the analytic upper bound. Based on these results, we show that METTS can provide a speedup compared to employing the purification method to analyze thermal equilibrium states at low temperatures in 1D gapless systems.
Recent study has shown that it can be advantageous to implement a composite channel that partitions the Hamiltonian H for a given simulation problem into subsets A and B such that H = A + B , where the terms in A are simulated with a Trotter-Suzuki channel and the B terms are randomly sampled via the Qdrift algorithm. Here we extend Qdrift and composite product formulas to imaginary time, formulating candidate classical algorithms for quantum Monte Carlo calculations. We upper bound the induced Schatten- 1 → 1 norm on both imaginary-time Qdrift and composite channels. Another recent result demonstrated that simulations of lattice Hamiltonians containing geometrically local interactions can be improved using a Lieb-Robinson argument to decompose H into subsets that contain only terms supported on that subset of the lattice. Here, we provide a quantum algorithm by unifying this result with the composite approach into “local composite channels” and we upper bound the diamond distance. We provide exact numerical simulations of algorithmic cost by counting the number of gates of the form e − i H j t and e − H j β to meet a certain error tolerance ε . In doing so, we optimize the partitioning into sets A and B using gradient boosted tree models from machine learning. These numerical studies are important given that product formulas have been historically known to outperform analytic upper bounds. We show constant factor advantages for a variety of interesting Hamiltonians, the maximum of which is a ≈ 20 -fold speedup that occurs in the simulation of Jellium. Published by the American Physical Society 2024
Recently, the problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temporal planning is an attractive approach for part of this compilation task, specifically, the routing of circuits that implement the Quantum Alternating Operator Ansatz (QAOA) applied to theMaxCut problem on a quantum processor architecture. In this paper, we extend the earlier work to route circuits that implement QAOAfor Graph Coloring problems. QAOA for coloring requires execution of more, and more complex, operations on the chip, which makes routing a more challenging problem. We evaluate the approach on state-of-the-art hardware architectures from leading quantum computing companies. Additionally, we investigate applying the planning approach to qubit initialization as well as routing. Our empirical evaluation shows that temporal planning compares well to reasonable analytic upper bounds [20], and that solving qubit initialization with a classical planner generally helps temporal planners in finding shorter-makespan compilations for QAOA for Graph Coloring.These advances suggest that temporal planning can be an effective approach for more complex quantum computing algorithms and architectures.
This study presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time-stepping operator, analyzed directly and bounded in the norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time-stepping operator as parameters. The paper concludes with supporting numerical investigations of parabolic (anisotropic diffusion) and hyperbolic (wave equation) model problems. We assess the sharpness of the bounds and the quality of the approximate convergence factors. Observations from these numerical investigations demonstrate the value of the proposed multilevel convergence framework for estimating MGRIT convergence a priori and for the design of a convergent algorithm. We further highlight that observations in the literature are captured by the theory, including that two-level Parareal and multilevel MGRIT with F-relaxation do not yield scalable algorithms and the benefit of a stronger relaxation scheme. An important observation is that with increasing numbers of levels MGRIT convergence deteriorates for the hyperbolic model problem, while constant convergence factors can be achieved for the diffusion equation. The theory also indicates that L-stable Runge--Kutta schemes are more amendable to multilevel parallel-in-time integration with MGRIT than A-stable Runge--Kutta schemes.
The throughput is an important performance metric of entangled qubit distribution quantum networks, and may be characterized by the number of distributed entangled qubit pairs per second (ebps). It is measured over physical quantum network connections using specialized instruments, including photonic entanglement sources and single photon detectors. Extensive theory has been developed to estimate the entangled qubit capacity of quantum channels using abstractions of physical connections. These two quantities both characterize the throughput performance but in different ways, and typically have been hard to relate to each other in concrete terms, in part due to the lack of precise measurements with matching analytical models and derivations. We describe measurements on a physical testbed with fiber connections of lengths 0-75 kilometers. We obtain the normalized analytic capacity estimates using the transmissivity approximations derived using single photon coincidence measurements, and convert them to bounds on throughput (measured in ebps) using a multiplier derived from co-located detector measurements. The results indicate consistent throughput measurements upper-bounded by their analytical capacity estimates across all connections. We show that previous capacity estimates using light measurements are below ebps measurements for some connections, due to the inclusion of non-representative decrease of light levels outside C-band with distance.
Given a system which can fail in 1 or n different ways, a fault detection and isolation (FDI) algorithm uses sensor data in order to determine which fault is the most likely to have occurred. The effectiveness of an FDI algorithm can be quantified by a confusion matrix, which i ndicates the probability that each fault is isolated given that each fault has occurred. Confusion matrices are often generated with simulation data, particularly for complex systems. In this paper we perform FDI using sums of squares of sensor residuals (SSRs). We assume that the sensor residuals are Gaussian, which gives the SSRs a chi-squared distribution. We then generate analytic lower and upper bounds on the confusion matrix elements. This allows for the generation of optimal sensor sets without numerical simulations. The confusion matrix bound s are verified with simulated aircraft engine data.
Abstract Fundamental mechanisms governing the erosion and prompt re-deposition of tungsten impurities in tokamak divertors are identified and analyzed to inform the lifetime of tungsten plasma-facing components in ITER and other future devices. Various experiments conducted at DIII-D to benchmark predictive models are presented, leveraging the DiMES removable sample exposure probe capability and the Metal Rings Campaign, in which toroidally symmetric rows of tungsten-coated tiles were installed in the DIII-D divertor. In tokamak divertors, the width of the electric sheath is of the order of the main ion Larmor radius, and a vast majority of sputtered tungsten impurities are typically ionized within the sheath. Therefore, W prompt redeposition is mainly governed by the ratio of the characteristic ionization mean-free path of neutral tungsten to the width of the sheath. In-situ monitoring of the prompt redeposition of tungsten impurities in divertors is demonstrated via the use of WII/WI line ratios and the ionizations/photon (S/XB) method in L-mode discharges. Even with this relatively limited set of emission measurements, net erosion measurements were found to be a consistent upper bound to an analytic scaling based on the ratio of the W ionization length, λ iz , and the width of the magnetic sheath rather than the ratio of λ iz and the W + gyro-radius. In the far-scrape-off layer (SOL) of the ITER divertor, however, it is calculated that the measurement of photon emissions associated with the ionization of tungsten impurities up to W 5 + may be required. Finally, W deposition patterns on DiMES collector probes, interpreted via DIVIMP-WallDYN modelling, reveal the key roles of progressive W erosion/re-deposition staps and E × B drifts in regulating long-range high-Z material migration.
The resonance mechanism in the initial of wind-wave generation proposed by Phillips is a foundation of wind-wave generation theory, but a precise theoretical quantification of wave energy growth in this initial stage has not been obtained yet after more than six decades of research. In this study, we aim to address this knowledge gap by developing an analytical approach based on a novel complex analysis method to theoretically investigate the temporal evolution of the wave energy in the Phillips initial stage. We quantitatively derive and analyse the growth behaviour of the surface wave energy and obtain an analytical solution for its upper bound. Our result highlights the crucial effects of surface tension. Because the phase velocity of gravity–capillary waves has a minimal value at a critical wavenumber, gravity–capillary waves and gravity waves (which neglect surface tension) exhibit distinct resonance curve properties and wave energy growth behaviours. For gravity waves, the resonance curve extends indefinitely; for gravity–capillary waves, it either forms a finite-length curve or does not exist, depending on the wind speed. The leading-order term of the upper-bound solution of the energy of gravity waves increases linearly over time, while for gravity–capillary waves, the term increases linearly over time under strong wind conditions but remains finite under weak wind conditions. This theoretical study provides an analytical framework for the generation of wind-waves in the Phillips initial stage, which may inspire further theoretical, numerical and experimental research.
Using an exhaustive computation, the unequal error protection capabilities of all binary cyclic codes of odd length up to 65 that have minimum distances at least 3 are found. For those codes that can only have upper bounds on their unequal error protection capabilities computed, an analytic method developed by Dynkin and Togonidze (1976) is used to show that the upper bounds meet the exact unequal error protection capabilities.
This paper presents a method for estimating time delay margin for model-reference adaptive control of systems with almost linear structured uncertainty. The bounded linear stability analysis method seeks to represent the conventional model-reference adaptive law by a locally bounded linear approximation within a small time window using the comparison lemma. The locally bounded linear approximation of the combined adaptive system is cast in a form of an input-time-delay differential equation over a small time window. The time delay margin of this system represents a local stability measure and is computed analytically by a matrix measure method, which provides a simple analytical technique for estimating an upper bound of time delay margin. Based on simulation results for a scalar model-reference adaptive control system, both the bounded linear stability method and the matrix measure method are seen to provide a reasonably accurate and yet not too conservative time delay margin estimation.
In the past few years, the mixed H(sub 2)/H-infinity control problem has been the object of much research interest since it allows the incorporation of robust stability into the LQG framework. The general mixed H(sub 2)/H-infinity design problem has yet to be solved analytically. Numerous schemes have considered upper bounds for the H(sub 2)-performance criterion and/or imposed restrictive constraints on the class of systems under investigation. Furthermore, many modern control applications rely on dynamic models obtained from finite-element analysis and thus involve high-order plant models. Hence the capability to design low-order (fixed-order) controllers is of great importance. In this research a new design method was developed that optimizes the exact H(sub 2)-norm of a certain subsystem subject to robust stability in terms of H-infinity constraints and a minimal number of system assumptions. The derived algorithm is based on a differentiable scalar time-domain penalty function to represent the H-infinity constraints in the overall optimization. The scheme is capable of handling multiple plant conditions and hence multiple performance criteria and H-infinity constraints and incorporates additional constraints such as fixed-order and/or fixed structure controllers. The defined penalty function is applicable to any constraint that is expressible in form of a real symmetric matrix-inequity.
The problem of a boundary layer on a flat plate which has a constant velocity opposite in direction to that of the uniform mainstream is examined. It was previously shown that the solution of this boundary value problem is crucially dependent on the parameter which is the ratio of the velocity of the plate to the velocity of the free stream. In particular, it was proved that a solution exists only if this parameter does not exceed a certain critical value, and numerical evidence was adduced to show that this solution is nonunique. Using Crocco formulation the present work proves this nonuniqueness. Also considered are the analyticity of solutions and the derivation of upper bounds on the critical value of wall velocity parameter.
The resonance diffusion of electrons in velocity space caused by the excited EM wave fields is considered to be the dominant saturation process of cyclotron maser instability that is driven by an electron loss-cone distribution. An upper bound of the saturation level is derived analytically. Since the resulting saturation level is low, the resonance diffusion is indeed responsible for the saturation of the cyclotron maser instability.
The problem of a boundary layer on a flat plate which has a constant velocity opposite in direction to that of the uniform mainstream is examined. It was previously shown that the solution of this boundary value problem is crucially dependent on the parameter which is the ratio of the velocity of the plate to the velocity of the free stream. In particular, it was proved that a solution exists only if this parameter does not exceed a certain critical value, and numerical evidence was adduced to show that this solution is nonunique. Using Crocco formulation the present work proves this nonuniqueness. Also considered are the analyticity of solutions and the derivation of upper bounds on the critical value of wall velocity parameter.
Strong microwave drives enable fast measurement and parametric control in superconducting circuits but can induce transitions out of the intended low-energy manifold. We develop a unified description of strong-drive limits in flux- and charge-driven Josephson circuits across drive frequency and dc flux bias. Using classical phase-space analysis and Floquet--Markov simulations, we identify distinct low- and high-frequency mechanisms. At low frequency, we characterize bound-state resonances and separatrix chaos and find that the flux-drive chaos threshold depends strongly on dc flux bias. At high frequency, these mechanisms are suppressed, and the dissipative steady state transfers from the central bound-state sector to outer resonances formed by above-barrier running trajectories. The resulting unbound-resonance threshold is nearly independent of drive frequency and circuit parameters over the regime studied and is controlled primarily by dc flux bias. Coherent simulations show that parametric operation persists beyond this threshold, but at a reduced rate, setting an effective upper bound on the achievable operation speed. We derive analytical criteria for both thresholds, validate them numerically, and experimentally confirm the predicted dc-bias dependence of the low-frequency threshold in a flux-driven SQUID. We also determine the timescales for transfer into the unbound-resonance regime and relaxation back to the bound-state manifold after the drive is removed. Finally, we relate the stability limits to a complementary picture based on the junction critical current and extend the framework to multitone drives and inductively shunted circuits. Together, these results identify the mechanisms limiting strong driving and suggest routes to extend the stable operating range of Josephson circuits.
Highlights: • Analytic results in disordered quantum systems are obtained. • Correlated disorder changes the universality class of quantum phase transitions. • The lower and upper bounds of the dynamical critical exponent are obtained. This study investigates the dynamical critical exponent of disordered Ising chains under transverse fields to examine the effect of a correlated disorder on quantum phase transitions. The correlated disorder, where the on-site transverse field depends on the nearest-neighbor coupling strengths connecting the site, gives a qualitatively different result from the uncorrelated disorder. In the uncorrelated disorder cases where the transverse field is either homogeneous over sites or random independently of the nearest-neighbor coupling strengths, the dynamical critical exponent is infinite. In contrast, in the presence of the correlated disorder, we analytically show that the dynamical critical exponent is finite. We also show that the dynamical critical exponent depends on the tuning process of the transverse field strengths.
The apparent tidal disruption of Periodic Comet Shoemaker-Levy 9 (1993e) during a close encounter within approximately 1.62 planetary radii of Jupiter can be used along with theoretical models of tidal disruption to place an upper bound on the density of the predisruption body. Depending on the theoretical model used, these upper bounds range from rho(sub c) less than 0.702 +/- 0.080 g/cu cm for a simple analytical model calibrated by numerical smoothed particle hydrodynamics (SPH) simulations to rho(sub c) less than 1.50 +/- 0.17 g/cu cm for a detailed semianalytical model. The quoted uncertainties stem from an assumed uncertainty in the perijove radius. However, the uncertainty introduced by the different theoretical models is the major source of error; this uncertainty could be eliminated by future SPH simulations specialized to cometary disruptions, including the effects of initially prolate, spinning comets. If the SPH-based upper bound turns out to be most appropriate, it would be consistent with the predisruption body being a comet with a relatively low density and porous structure, as has been asserted previously based on observations of cometary outgassing. Regardless of which upper bound is preferable, the models all agree that the predisruption body could not have been a relatively high-density body, such as an asteroid with rho approximately = 2 g/cu cm.