Search NASA⌕ Search

SEARCH · Search NASA

Results for “circuit representation”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Generalized Circuit Representation for a Synchronous Machine

In this letter, a generalized circuit representation for a synchronous machine is presented. This circuit represents voltage and current relationship and can be used for dynamic and harmonic analysis. A distinct feature of the circuit is the use of Laplace transform variable s , which simplifies both calculus and frame conversion. Two derivation approaches are presented. Here, the first approach starts from a steady-state circuit representation, while the second approach starts from the dq-frame dynamic model of a synchronous generator. Both arrive at the same representation.

42 ENGINEERING↗
DOE OSTI2025

Large-signal Stability Analysis of Grid-forming Inverters with Equivalent-circuit Models

Here, this paper proposes an energy function-based direct method for large-signal stability assessment of grid-forming (GFM) inverters leveraging an equivalent-circuit representation of all involved control- and physical-layer dynamics. Three different primary controls, a standard inner-current outer-voltage cascaded-control architecture, output LCL filter, and reference-current saturation limiting are featured in the modeling and analysis framework. A composite energy function for the GFM inverter is obtained by summing up individual energy contributions gleaned from the circuit representation. The approach can readily be generalized to different primary controls, output-filter arrangements, and current limiters since it is based on a circuit-theoretic foundation. Numerical simulations validate the efficacy of the approach in estimating the critical clearing time following a large-signal disturbance.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

A Laplace-Domain Circuit Model for Fault and Stability Analysis Considering Unbalanced Topology

For systems subject to unbalanced faults, analytical model building for stability assessment is a challenging task. This letter presents a straightforward modeling approach. A generalized dynamic circuit representation is achieved by use of the Laplacian transform variable s . Here, we translate the voltage and current relationship at the fault location into the relationship of three subsystems. The final circuit model is an interconnected sequence network with impedances in the Laplace domain. This circuit can be directly converted from a steady-state sequence network. This modeling procedure is illustrated by an example case of an induction motor served by a grid through a series compensated line. Electromagnetic transient simulation results demonstrate that sub-synchronous oscillations can be mitigated when a single-line to ground fault is applied at the motor terminal. Stability analysis results based on the dynamic circuit corroborate the simulation results. What's more, the derived circuit effortlessly reveals why unbalance can enhance stability.

42 ENGINEERING↗
DOE OSTI2024

Quantum tensor network algorithms for evaluation of spectral functions on quantum computers

We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we call a quantum tensor network (QTN), we demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example. In this setting, we develop two approaches for extracting the spectral correlation functions measured in neutron-scattering experiments: (a) a generalization of the SWAP test for computing wave function overlaps and, (b) a generalization of the notion of matrix product operators to the QTN setting which generates a linear combination of unitaries. The latter method is discussed in detail for translationally invariant spin-half systems, where it is shown to reduce the qubit resource requirements compared with the SWAP method and may be generalized to other systems. We demonstrate the versatility of our approaches by simulating spin-1/2 and spin-3/2 MNMs, with the latter being an experimentally relevant model of a Cr$^{3+}_{8}$ ring. Here, our approach has qubit requirements that are independent of the number of constituents of the many-body system and scale only logarithmically with the bond dimension of the MPS representation, making them appealing for implementation on near-term quantum hardware with mid-circuit measurement and reset.

Neutron scattering↗
DOE OSTI2024

OpenQudit v1.0

OpenQudit is a library that packages a quantum circuit representation using a domain-specific language for gates with a highly optimized simulator for very small circuits. No other package is well optimized for small circuits, which is something another DOE-packaged tool, BQSKit, will benefit from.

Younis, Ed↗
DOE OSTI2025

NREL-AltDSS [SWR-25-58]

This repository builds upon the original work by PMeira at AltDSS-Schema, which aimed to define a structured JSON-based schema for DSS circuit representation. The schema has been packaged in this repository with slight modifications, enabling users to add the package as a dependency for downstream applications

Elgindy, Tarek [National Renewable Energy Laborato↗
DOE OSTI2024

Building Krylov complexity from circuit complexity

Krylov complexity has emerged as a probe of operator growth in a wide range of nonequilibrium quantum dynamics. However, a fundamental issue remains in such studies: the definition of the distance between basis states in Krylov space is ambiguous. Here we show that Krylov complexity can be rigorously established from circuit complexity when dynamical symmetries exist. Whereas circuit complexity characterizes the geodesic distance in a multidimensional operator space, Krylov complexity measures the height of the final operator in a particular direction. The geometric representation of circuit complexity thus unambiguously designates the distance between basis states in Krylov space. This geometric approach also applies to time-dependent Liouvillian superoperators, where a single Krylov complexity is no longer sufficient. Multiple Krylov complexity may be exploited jointly to fully describe operator dynamics. Published by the American Physical Society 2024

Lv, Chenwei (ORCID:0000000250952582)↗
DOE OSTI2026

Evaluation of a Reduced-Order Model for IBR Fault Response Representation via OEM Blackbox Models: Preprint

Driven by the need to capture the electromagnetic transients of transmission lines, inverter switching behavior, and detailed control systems, electromagnetic transient (EMT) studies have become increasingly important in industry, such as IBR interconnection study and fault study. However, original equipment manufacturer (OEM) inverter models typically include extensive parameters and proprietary settings that are unavailable to protection engineers. This paper introduces a data-driven, reduced-order model (ROM) developed as a PSCAD library component for use in EMT-based fault studies. The ROM replicates key OEM model behaviors without requiring detailed knowledge of control design or parameterization. The accompanying Python automation scripts streamline data generation, parameter fitting, and validation. The ROM's performance is demonstrated through comparison with both IEEE 2800-compliant and non-compliant OEM models in a real-world power system. Relay responses show nearly identical results, while simulation runtime is reduced by an average of 32.8\%, highlighting the ROM's practicality for protection engineers.

14 SOLAR ENERGY↗
DOE OSTI2023

On-the-fly computation of analog mixed-signal (AMS) measurements

The present disclosure generally relates to an analog mixed-signal (AMS) design verification system. In particular, the present disclosure relates to a system and method for system verification. One example method includes: obtaining an electronic representation of the circuit design; generating at least a portion of a waveform using the electronic representation of the circuit to obtain a first segment of the waveform associated with the circuit; converting, via the one or more processors, one or more measurement functions to code for performing the one or more computations on the first segment of the waveform; performing one or more computations on the first segment of the waveform using the code; and identifying when a behavior of the circuit violates a design specification based on whether a result of the one or more computations meets a threshold.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Efficient Hierarchical State Vector Simulation of Quantum Circuits via Acyclic Graph Partitioning

Early but promising results in quantum computing have been enabled by the concurrent development of quantum algorithms, devices, and materials. Classical simulation of quantum programs has enabled the design and analysis of algorithms and implementation strategies targeting current and anticipated quantum device architectures. In this paper, we present a graph-based approach to achieve efficient quantum circuit simulation. Our approach involves partitioning the graph representation of a given quantum circuit into sub-graphs/circuits that exhibit better data locality. Simulation of each sub-circuit is organized hierarchically, with the iterative construction and simulation of smaller state vectors, improving overall performance. Also, this partitioning reduces the number of passes through data, improving the total computation time. We present three partitioning strategies and observe that acyclic graph partitioning typically results in the best time-to-solution. In contrast, other strategies reduce the partitioning time at the expense of potentially increased simulation times. Experimental evaluation demonstrates the effectiveness of our approach.

Fang, Bo↗
DOE OSTI2025

A Quantum Approach for Implementing Fixed-Point Arithmetic in Solving Ordinary Differential Equations

Differential equations (DEs) serve as fundamental tools in mathematical modeling across scientific disciplines, yet classical numerical solvers face limitations with large-scale or computationally intensive problems. This study explores a quantum-inspired approach to solving DEs, combining quantum- inspired techniques with classical methods. It focuses on fixed- point arithmetic on quantum circuits, utilizing basic quantum gates to manipulate DE solutions. We expand upon the techniques introduced by Zanger et al. [Quantum, 5, 502 (2021)] by offering a precise computation for a fixed-point signed multiplication scheme, while also presenting a quantum circuit capable of executing the fixed-point division algorithm. We demonstrate the feasibility of our approach through the simulation of a linear Ordinary Differential Equation (ODE), where initial conditions and parameters are encoded into quantum circuits using fixed- point representation. By executing sequences of quantum gates mimicking numerical integration steps, we obtain approximate solutions to the ODE with specified fixed-point precision.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Random projection using random quantum circuits

The random sampling task performed by Google's Sycamore processor gave us a glimpse of the “quantum supremacy era.” This has definitely shed some light on the power of random quantum circuits in this abstract task of sampling outputs from the (pseudo)random circuits. In this paper, we explore a practical near-term use of local random quantum circuits in dimensional reduction of large low-rank data sets. We make use of the well-studied dimensionality reduction technique called the random projection method. This method has been extensively used in various applications such as image processing, logistic regression, entropy computation of low-rank matrices, etc. We prove that the matrix representations of local random quantum circuits with sufficiently shorter depths [ ∼ O ( n ) ] serve as good candidates for random projection. We demonstrate numerically that their projection abilities are not far off from the computationally expensive classical principal components analysis on MNIST and CIFAR-100 image datasets. We also benchmark the performance of quantum random projection against the commonly used classical random projection in the tasks of dimensionality reduction of image data sets and computing von Neumann entropies of large low-rank density matrices. And finally, using variational quantum singular value decomposition, we demonstrate a near-term implementation of extracting the singular vectors with dominant singular values after quantum random projecting a large low-rank matrix to lower dimensions. All such numerical experiments unequivocally demonstrate the ability of local random circuits to randomize a large Hilbert space at sufficiently shorter depths with robust retention of properties of large data sets in reduced dimensions. Published by the American Physical Society 2024

Kumaran, Keerthi (ORCID:0009000949125721)↗
DOE OSTI2026

Cathodic Protection Modeling for Hanford Underground Double-Shell Tank Farms

Hanford stores millions of gallons of radioactive and chemically hazardous waste from the production of weapon materials in tank farms consisting of underground carbon-steel storage tanks surrounded by reinforced concrete. Six of these Hanford tank farms use double-shell storage tanks (DSTs). The DST farms were constructed from 1968 to 1986 with a planned 40–50 year design life, so some are already operating beyond their initial life expectancy. Ultrasonic testing (UT) has indicated significant thinning on the bottom of the secondary (outer) liner of these tanks, believed to arise from groundwater intrusion driving concrete side corrosion. There is no direct access to the steel/concrete interface between the tank and the concrete pad, making it difficult to apply a chemical-based mitigation strategy or to conduct repairs, but cathodic protection (CP) is a possible method to inhibit further concrete-side corrosion. Hanford already uses CP to protect below grade steel piping within the tank farms and connected to the tanks, but this system was not designed to protect the tank bottoms. CP design must account for the structures surrounding the DSTs, including the steel reinforcing bars (rebar) within the concrete pad and vault, various process lines, and the existing CP system. In this study, finite element analysis (FEA) modeling was carried out to simulate CP protection of 1) a single tank and CP anode to develop options for modeling the rebar and to compare to a simpler circuit model and 2) the entire Hanford AN tank farm as a representative example consisting of seven tanks, associated piping, and both existing and new CP anodes. Both circuit and FEA models predict that significant protective current could be delivered to the bottoms of the tanks with the addition of tank-protection anodes below the depth of the tanks. Simulations with only the existing pipe-protection anodes active confirmed that only a very small current to the tank bottoms is predicted under present conditions. Multiple simplified representations of the dome and wall rebar were tested to reduce the computational complexity of the tank-farm simulations, resulting in modeling the rebar as edge elements with a prescribed effective circumference that matches the real rebar surface area. The geometry of the rebar is also simplified into horizontal hoops around the tank walls and radial rebar over the dome with increased effective circumference to retain the target surface area. This simplification was found to greatly reduce the complexity and solution time of the models without large changes in current distributions, especially to the tank bottom. A range of values were tested for model parameters such as soil and concrete resistivities and polarization resistance to investigate their impact on the current and electric potential distributions. Depending on the parameters used, FEA simulations predict some risk of overprotection, particularly on the piping system; since overprotection can also lead to surface damage associated with hydrogen gas generation at the interface (e.g. hydrogen embrittlement or damage to coatings), this needs to be considered when refining the design of the new CP system. Comparison between the FEA models and the circuit model representation demonstrated that the circuit model could not match the predicted FEA current distribution, even when using the exact same surface areas. This discrepancy appeared to be at least partly attributable to the impact of the relative positions of the tank components and anodes to each other and to the ground surface. The FEA model accounts for the relative positions since it solves the governing equations in three dimensions, but the circuit model cannot account for the positioning. In particular, the circuit model underpredicts the current to the tank bottom and overpredicts the current to the dome compared to FEA for the baseline geometry. The FEA models omitted the electrically isolated rebar in the bottom concrete slab. However, a circuit based stray current model estimated that only 2.1% of the total current through the slab would stray into the rebar, corresponding to ~0.21 A for a target current density of 2 mA/ft2 to the tank bottom. The estimated corrosion driven by this amount of stray current is predicted to yield a lifetime of >400 years for the minimum rebar diameter, assuming an acceptable cross-section area loss of 10%.

d'Entremont, Anna [Savannah River National Laborat↗
DOE OSTI2024

A Quantum Approach for Implementing Fixed-Point Arithmetic in Solving Ordinary Differential Equations

Differential equations (DEs) serve as fundamental tools in mathematical modeling across scientific disciplines, yet classical numerical solvers face limitations with large-scale or computationally intensive problems. This study explores a quantum-inspired approach to solving DEs, combining quantum-inspired techniques with classical methods. It focuses on fixed-point arithmetic on quantum circuits, utilizing basic quantum gates to manipulate DE solutions. We expand upon the techniques introduced by Zanger et al. [Quantum, 5, 502 (2021)] by offering a precise computation for a fixed-point signed multiplication scheme, while also presenting a quantum circuit capable of executing the fixed-point division algorithm. We demonstrate the feasibility of our approach through the simulation of a linear Ordinary Differential Equation (ODE), where initial conditions and parameters are encoded into quantum circuits using fixed-point representation. By executing sequences of quantum gates mimicking numerical integration steps, we obtain approximate solutions to the ODE with specified fixed-point precision.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗