Search NASA⌕ Search

SEARCH · Search NASA

Results for “circuit model”

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
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↗
DOE OSTI2025

Performance evaluations of signed and unsigned 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 toward 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 unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. 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 the performance trends in our results and speculate on possible future developments within this computational paradigm.

Computational models↗
DOE OSTI2021

Pilot-Scale Testing of an Integrated Circuit for the Extraction of Rare Earth Minerals and Elements from Coal and Coal Byproducts Using Advanced Separation Technologies

The primary objective of this project was to develop and demonstrate an integrated pilot-scale circuitry for recovering high-value rare earth elements (REEs) from coal and coal byproducts. The target performance was to produce a mixed REE product with content of at least two percent by weight on a dry mass basis in a cost-effective and environmentally benign manner. During the first nine months of the project period (Phase 2 Budget Period 2), pilot plant construction was completed including all field site startup activities such as permitting, engineering design, procurement/bidding, unit fabrication, site construction, equipment installation, module assembly, safety training, and circuit shakedown. During the remaining 21 months of project period (Phase 2 Budget Period 3), detailed field-testing activities were performed including feedstock sample collection and preparation, exploratory testing, circuit modification, detailed parametric study, and performance optimization. A detailed techno-economic analysis was performed based on the pilot plant testing findings which provided various scenarios for REE production. The project successfully accomplished the proposed target performance by producing mixed rare earth oxide (REO) with greater than 90% purity by weight in a continuous pilot scale operation from two distinctly different coarse refuse materials (i.e., West Kentucky No. 13 and Fire Clay coal seams), and at least three secondary sources (i.e., heap leach process and naturally formed acid mine drainage system). Project partners included the University of Kentucky, Virginia Tech, West Virginia University, Alliance Coal, Blackhawk Mining, Mineral Refining Company, and Mineral Separation Technologies. The pilot scale test facility was constructed at a former mining complex owned by Alliance Natural Resource Partners (Alliance Coal). The site was rehabilitated to accommodate the equipment installation, construction and fabrication, electrical power requirement, water line management and containment. The process units constructed and installed included X-ray sorting unit, crushing and grinding unit, physical separation unit, acid leaching unit, solvent extraction unit, and wastewater management unit. A rare earth mineral concentration unit was constructed as a standalone unit for flexible operation. A detailed environmental assessment and control plan was carried out to identify and quantify any potential impacts of the pilot-scale processing circuitry on the human and eco-system health and well-being. Corresponding mitigation strategies and control measures were provided. A conceptual flowsheet was developed to effectively remove thorium and uranium from high purity rare earth oxide mix or any potential radionuclide enriched stream. The two distinct feedstock materials were secured from the Blackhawk Mining Complex in eastern Kentucky where the Fire Clay (Hazard No. 4) seam is processed. The West Kentucky No. 13 (Baker) coarse refuse material was collected from an active process stream at an Alliance coal preparation plant located in western Kentucky. Characterization analysis indicated that both of feed materials generated from the two sources contained >300 ppm of TREEs on a dry whole mass basis which met the requirements for a qualified feed stock. The two feedstocks were further upgraded using a dual x-ray sorter to prepare the feed material for hydrometallurgical circuit. Thermal treatment on feed material prior to leaching was found to: 1) improve the leaching recovery of REEs, 2) increase the leaching kinetics, and 3) allow the leaching reaction to occur at lower acidity. Roasting at 600°C was selected as the pre-treatment condition for both West Kentucky No. 13 and Fire Clay coarse refuse material. Over 40% of leaching recovery was achieved by roasting West Kentucky No. 13 material having a top particle size of 3 mm in the pilot scale operation using 1.2M sulfuric acid leaching at 75OC. Initial pilot scale testing involved continuous operation of the pilot plant for 94 hours. The leaching unit was operated at solid-to-liquid ratio of 1 to 10 (w/v) using 0.5M sulfuric acid solution at a temperature of 75°C. The continuous solvent extraction circuit utilized rougher and cleaner units with DEHPA and TBP as the extractants. An innovative stripping circuit was developed to accumulate the REE concentration in the stripping solution to a level above 600 ppm. A bleed stream from the recycled strip solution was treated using oxalic acid precipitation which produced a high grade rare earth oxalate. The oxalate product was roasted to remove the oxalate which produced a rare earth oxide product having a purity greater 90%. Due to high concentrations of contaminant ions in the pregnant leach solution (PLS), a modified flowsheet was developed that involved pre-concentration of the REEs using multiple stages of precipitation and redissolution. The advantage of this process was improved removal of contamination before the downstream purification process and a significant cost reduction relative to the circuit that utilized the solvent extraction process. The modified circuitry included processes involving leaching, multistage precipitation, redissolution, and oxalate precipitation followed by roasting of the oxalate product. The circuit produced a mixed REO that was 92.96% pure from the initial test. A detailed parametric test plan was carried out which involved varying key parameters including solids feed rate, acid flowrate, acid concentration, multistage precipitation pH, redissolution pH, oxalate precipitation dosage and pH. The response variables included REE recovery, contaminant recovery, REO product grade and overall chemical consumption. Test results indicated that the acid-to-solid ratio is the key parameter to leaching efficiency as performance deteriorated with an increase in solids concentration. The optimal pH determined for REE precipitation and redissolution was 6.5 and 2.5, respectively. Additional tests were conducted to further improve the flowsheet. Recirculating a portion of the PLS to the feed of the leach tanks improved the leaching performance by lowering the pH of the leaching system and reducing the contamination recovery by shortening the residence time. Moreover, the removal of Al prior to REE precipitation significantly reduced the oxalic acid consumption in the oxalate precipitation circuit. The modified circuit produced over 90% grade REO by weight from both West Kentucky No. 13 and Fire Clay coarse refuse material in pilot scale continuous test programs. A case analysis model was developed to project the REE and major contaminants concentration in each PLS stream based on the leaching condition, pH cut point, and oxalic acid dosage. A correlation was established using empirical and semi-empirical models. Using the models, chemical consumption required for each stage was predicted based on the projected performance of the hydrometallurgy circuit. After identifying the optimum conditions, validation tests were carried out for the treatment of both West Kentucky No. 13 and Fire Clay coarse refuse materials in the pilot plant. The actual circuit performance and chemical consumptions were very close to the model predictions. Other than the two coarse refuse sources, several secondary feedstocks were also tested in the pilot plant facility. A “heap leach” system was constructed using the coarse refuse material generated from cleaning the West Kentucky No. 13 seam coal. Using the two stage SX rougher and cleaner circuit, a concentrate with a grade >90% REO was produced while recovering >97% of the REEs from the heap leach PLS. Naturally generated acid mine drainage (AMD) from West Kentucky No.13 mine was processed using the multistage precipitation circuit in the pilot plant in a test conducted for a period of 32 hours. The final grade of the mix RE oxide produced from the AMD was 90.84% with an overall circuit recovery of 64%. The primary source of REE was the selective precipitation steps involving iron and aluminum rejection. The hydrophobic-hydrophilic separation (HHS) process was proven to effectively recover coal from fine waste materials. For REM recovery, the HHS process was able to produce concentrates at grades of approximately 1.8% REE on an ash basis; however, recovery values were typically low, <10%, under the optimal conditions determined in the laboratory-scale testing. Staged testing of the pilot-scale HHS process for coal recovery and semi-continuous laboratory testing for REM testing showed that a total concentration ratio of more than 15x was observed for the REM recovery process. A circuit simulation package was developed for REE extraction and purification using a spreadsheet-based platform (Microsoft Excel). The REESim circuit simulation package is configured to track the mass and volume flows of components passing through a series of unit operations specified and configured by the user. The mass rates can then be utilized by the user to determine important performance indicators such as product mass yields, concentrate purity levels, element-by-element recoveries, and so forth. The techno-economic analysis showed that the roasting and leaching operations were the most expensive capital items, each contributing approximately 30% to the total capital cost. One notable contributor to the high production costs was the low REE recovery observed in the pilot scale trials. The product basket price was shown to have a strong influence on the economic viability of the scenarios, with the scandium price being the most significant influencer. Operating cost was shown to be extremely sensitive to REE recovery, REE feed grade, and leaching acid consumption. An analysis of ten different scenarios for a 500 t/h commercial operation revealed that three were economically favorable, producing internal rates of return varying from 27.7% to 33.1% and payback periods of 4 to 5 years. The project successfully developed and demonstrated a process to recover REEs from coal and coal byproducts in a pilot-plant operation which consistently produced over 90% grade REO mix from varies types of feedstocks. Commercialization analysis showed that the technology readiness level successfully achieved TRL 6 at the end of the project and demonstrated the need and the potential for scaling the process to further advance the technologies toward the goal of providing a domestic supply of REEs at a commercial scale.

01 COAL, LIGNITE, AND PEAT↗
DOE OSTI2020

Extending the Frontier of Quantum Computers with Qutrits

Here, we advocate for a fundamentally different way to perform quantum computation by using three-level qutrits instead of qubits. In particular, we substantially reduce the resource requirements of quantum computations by exploiting a third state for temporary variables (ancilla) in quantum circuits. Past work with qutrits has demonstrated only constant factor improvements, owing to the log 2 (3) binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic runtime decomposition of the Generalized Toffoli gate using no ancilla - an exponential improvement over the best qubit-only equivalent. Our approach features a 70× improvement in total two-qudit gate count over the qubit-only decomposition. This results in improvements for important algorithms for arithmetic and QRAM. Simulation results under realistic noise models indicate over 90% mean reliability (fidelity) for our circuit, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path toward extending the frontier of quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems

Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational hybrid quantum-classical algorithm for approximately solving combinatorial optimization problems. The quality of the solution obtained by QAOA for a given problem instance depends on the performance of the classical optimizer used to optimize the variational parameters. In this paper, we formulate the problem of finding optimal QAOA parameters as a learning task in which the knowledge gained from solving training instances can be leveraged to find high-quality solutions for unseen test instances. To this end, we develop two machine-learning-based approaches. Our first approach adopts a reinforcement learning (RL) framework to learn a policy network to optimize QAOA circuits. Our second approach adopts a kernel density estimation (KDE) technique to learn a generative model of optimal QAOA parameters. In both approaches, the training procedure is performed on small-sized problem instances that can be simulated on a classical computer; yet the learned RL policy and the generative model can be used to efficiently solve larger problems. Furthermore, extensive simulations using the IBM Qiskit Aer quantum circuit simulator demonstrate that our proposed RL- and KDE-based approaches reduce the optimality gap by factors up to 30.15 when compared with other commonly used off-the-shelf optimizers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A quantum hamiltonian simulation benchmark

Hamiltonian simulation is one of the most important problems in quantum computation, and quantum singular value transformation (QSVT) is an efficient way to simulate a general class of Hamiltonians. However, the QSVT circuit typically involves multiple ancilla qubits and multi-qubit control gates. In order to simulate a certain class of n-qubit random Hamiltonians, we propose a drastically simplified quantum circuit that we refer to as the minimal QSVT circuit, which uses only one ancilla qubit and no multi-qubit controlled gates. We formulate a simple metric called the quantum unitary evolution score (QUES), which is a scalable quantum benchmark and can be verified without any need for classical computation. Under the globally depolarized noise model, we demonstrate that QUES is directly related to the circuit fidelity, and the potential classical hardness of an associated quantum circuit sampling problem. Under the same assumption, theoretical analysis suggests there exists an ‘optimal’ simulation time t opt ≈ 4.81, at which even a noisy quantum device may be sufficient to demonstrate the potential classical hardness.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Leveraging Qubit Loss Detection in Fault-Tolerant Quantum Algorithms

Qubit loss errors constitute a dominant source of noise in many quantum hardware systems, particularly in neutral-atom quantum computers. We develop a theoretical framework to effectively detect and correct loss errors in logical algorithms and leverage such loss information in decoding. Considering general quantum error correction codes and logical circuits, we introduce a delayed-erasure decoder for experimentally motivated error models which leverages information from delayed loss detection to accurately correct loss errors, even when the precise moment of the error is unknown. Using this decoder, we identify strategies for detecting and correcting loss errors based on the logical circuit structure. For deep circuits prior to logical measurement, we explore methods to integrate loss detection into syndrome extraction with minimal overhead, identifying optimal strategies depending on the qubit loss fraction in the noise and hardware capabilities. In contrast, we find that many key algorithmic subroutines involve frequent gate teleportation, shortening the circuit depth before logical measurement and naturally replacing qubits with no additional experimental overhead. We simulate this setting using a toy model algorithm for small-angle synthesis and find a significant performance improvement as the loss fraction increases. These results provide a path forward for advancing large-scale fault-tolerant quantum computation in systems with loss error detection.

atoms↗
DOE OSTI2024

Training self-learning circuits for power-efficient solutions

As the size and ubiquity of artificial intelligence and computational machine learning models grow, the energy required to train and use them is rapidly becoming economically and environmentally unsustainable. Recent laboratory prototypes of self-learning electronic circuits, such as “physical learning machines,” open the door to analog hardware that directly employs physics to learn desired functions from examples at a low energy cost. In this work, we show that this hardware platform allows for an even further reduction in energy consumption by using good initial conditions and a new learning algorithm. Using analytical calculations, simulations, and experiments, we show that a trade-off emerges when learning dynamics attempt to minimize both the error and the power consumption of the solution—greater power reductions can be achieved at the cost of decreasing solution accuracy. Finally, we demonstrate a practical procedure to weigh the relative importance of error and power minimization, improving the power efficiency given a specific tolerance to error.

Stern, Menachem (ORCID:0000000302158082)↗
DOE OSTI2026

DC Cryogenic Modeling of Open-Source SkyWater 130 nm MOSFETs at 77 K Using BSIM4

Cryogenic applications in high-energy physics (HEP) demand reliable, low-power CMOS electronics capable of operating at liquid nitrogen temperatures (77 K). The open-source SkyWater 130nm (SKY130) CMOS process has previously been shown to operate at temperatures as low as 4 K making it a promising candidate for HEP applications. In this work, we characterize and model SKY130 low-threshold voltage transistors at 77 K, which is a temperature commonly used in modeling applications for liquid argon detectors. DC characteristic measurements were performed at both room temperature and liquid nitrogen temperature. We created a cryogenic modeling approach to produce a SPICE-compatible, isothermal BSIM4-based model for select transistor sizes at 77 K. The resulting model agrees with data at 77 K with an average error on the order of 20% (relative RMS) and shows no dependence on drain voltage. Due to the open-source nature of SKY130, we have made our models publicly available on Github. We hope this work will continue the trend for democratizing circuit design at cryogenic temperatures in high-energy physics by enabling open access to accurate cryogenic CMOS device models at 77 K.

Beall, F. [Texas U., Arlington]↗
DOE OSTI2022

An Investigation of Chemo-Mechanical Phenomena and Li Metal Penetration in All-Solid-State Lithium Metal Batteries Using In Situ Optical Curvature Measurements

Solid-electrolytes (SEs) can provide a pathway to increase energy-density in lithium metal batteries. However, lithium metal penetration through garnet based LLZO solid electrolytes has been identified as a critical failure process. This phenomenon is related to chemo-mechanical processes which are difficult to probe. In particular, characterizing the dynamic mechanical deformations that occur in electrode-SE structures is very challenging. Here study reports in situ curvature measurements that are thus designed to probe chemo-mechanical phenomena that occur during lithium plating. The novel experimental cell configuration created for this work shows that pressure builds up in the Li metal during plating, up until the point where short circuits occur. The resulting data are analyzed with a detailed finite element model (FEM) to quantitatively evaluate stress evolution. The results show that Li metal plating within a surface flaw can produce stress build-up prior to short-circuiting. The combined results from both the experiments and the FEM suggest that it is critical to minimize surface defects and flaws during the manufacturing processes.

25 ENERGY STORAGE↗
DOE OSTI2022

Estimation of process steady state with autoregressive models and Bayesian inference

To improve efficiency, separations engineers will typically design process circuits containing recirculating streams, which mix one or more of the process outputs with the feed material. Doing so can improve efficiency, but will cause a delay in the system reaching steady state conditions until the recirculating load mass flows stabilize. In testing separation circuits, engineers will often test a variety of factors and complete an analysis from sample results. Knowledge of if a process is at steady state, as well as the steady state conditions of a process, is essential for a valid techno-economic analysis. However, the definition of process steady state is often poorly defined, or does not include uncertainty quantification. If the performance of a process operating under two different sets of conditions are compared, an engineer who does not test for steady state or quantify steady state conditions risks producing a faulty analysis. In this work, a Bayesian statistical method for testing if all streams are at steady state is further motivated and then derived. Then after testing for steady state, the same model is used with a prior distribution that enforces a steady state assumption to estimate steady state conditions. Further, these methods were validated in a solvent extraction pilot plant where steady state conditions for all outflows were inferred with uncertainty quantification. Analysis is completed with functions available to the reader as part of the BayesMassBal (V 1.1.0) software package written in R.

01 COAL, LIGNITE, AND PEAT↗
DOE OSTI2024

Validation of prediction capability of operating space for plasma initiation in MAST-U

DYON is a plasma initiation modelling code that solves the differential equation system of the full circuit equations (plasma current, active coil currents and eddy currents in full passive structures) and 0D global energy and particle balance equations (Kim 2022 Nucl. Fusion 62 126012). In order to test the capability of the full electromagnetic plasma initiation model to predict individual discharges in experiments and thus the operating space in the device, a dedicated experimental database was built in MAST-U by scanning the prefilled gas pressure p 0 and the induced loop voltage V loop . In the experimental operating space of p 0 and V loop the lower and the upper limits of p 0 are determined by the plasma breakdown failure and the plasma burn-through failure, respectively. The lower limit of V loop is determined by the plasma burn-through failure. By directly reading the control room data used in each discharge (i.e. currents in the solenoid, poloidal field coils, and toroidal field coils, p 0 , and gas puffing rate), the full electromagnetic DYON consistently predicted the failed breakdown, failed burn-through, and successful plasma initiation discharges in the experimental database, demonstrating its capability to predict the operating space for inductive plasma initiation. The Paschen curve calculated with the effective connection length in MAST-U indicates a much higher p 0 required for plasma breakdown than the experimental data, indicating that individual field line evaluation is necessary to calculate the quantitative requirements for Townsend breakdown. The demonstration in this paper shows that the full electromagnetic DYON could be a useful simulation tool to assess the feasibility of inductive plasma initiation and to optimise operating scenarios in future devices.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

An efficient solution of low-frequency magnetic problems with voltage sources using all-frequency stable formulation

The modeling and simulation of magnetic problems at low frequencies are considered in this paper. When excited with a voltage source, conduction current is induced in the circuit of interest, which generates the magnetic field. This type of problems is modeled using the all-frequency stable formulation, which employs the potential description of fields with an inhomogeneous Coulomb gauge. With the aid of the stable formulation, the low-frequency breakdown problem is circumvented and both electric and magnetic fields can be solved in a single simulation. To solve large magnetic problems efficiently, it is necessary to employ an iterative solver with an efficient preconditioner. In this work, a preconditioner based on the incomplete LU decomposition is constructed and applied in a wide frequency range. Several numerical examples are given to demonstrate the performance of the proposed method.

Mekonnen, Minyechil↗
DOE OSTI2024

Decentralized Microgrid Protection Through Relative Fault Direction Classification: Preprint

Protection in inverter-based resources (IBRs) dominated microgrids generally face significant challenges due to the low fault current and inconsistent fault behaviors from IBRs. Recently, machine learning-based approaches have attracted considerable attention to address these challenges. This paper introduces a novel decentralized protection strategy for microgrids. The proposed method decomposes the protection challenge into several distributed learning tasks, enabling individual relays to autonomously determine the direction of faults using a binary classification framework based on support vector machine (SVM) algorithms. Following the distributed fault direction estimation, classifier outcomes are shared among neighboring relays, facilitating a local decision-making process to ascertain the presence of faults within the neighborhood. Finally, a tripping signal is generated based on the classifier results of each relay to operate the circuit breaker. To test and validate this approach, a 100% renewable microgrid model is simulated in MATLAB/Simulink. In the numerical analysis, the application of SVM classifiers in our approach yields impressive results: an average relay classification accuracy of 98%, and a 96% accuracy in circuit breaker control. These findings highlight the potential of machine-learning-based approaches in enhancing the efficiency and reliability of microgrid protection systems.

decentralized algorithm↗
DOE OSTI2022

Integrable nonunitary quantum circuits

Here we show that the integrable Lindblad superoperators found recently can be used to build integrable nonunitary quantum circuits with two-site gates by demonstrating that the R(SIC) matrices are completely positive and trace preserving. Using the bond-site transformation, we obtain the corresponding integrable nonunitary quantum circuits with three-site gates. When restricted to the diagonals of the density matrix, these quantum models reduce to integrable classical cellular automata. This approach may pave the way for a systematic construction of circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Characterizing Quantum Classifier Utility in Natural Language Processing Workflows

Quantum Natural Language Processing (QNLP) develops natural language processing (NLP) models for deployment on quantum computers. We explore feature and data prototype selection techniques to address challenges posed by encoding high dimensional features. Our study builds quantum circuit classifiers that includes classical feature pre-processing, quantum embedding and quantum model training. The quantum models are built on 4 or 6 qubits and the quantum neural network (QNN) uses the established bricklayer design. We compare the dependence of model performance (in terms of accuracy and F1 scores) on feature length, embedding gates and parameterized unitary design. We compare the performance of quantum machine learning models to classical convolution neural network model (CNN) on binary and multi-class classification tasks using two datasets of synthetic features and labels. The first is the ECP-CANDLE P3B3 dataset a corpus of synthetically generated cancer pathology reports. The second dataset is extracted from well-known benchmark dataset (MADELON) - features are generated with a combination of informative, repeated and uninformative features. Both datasets are used for binary classification and multi-class classification with 3 classes. We observe robust, accurate performance from all models on the binary classification tasks, but multiclass classification is a challenge for the quantum models-there is a notable decrease in accuracy when using 3 classes. Overall the performance is comparable in terms of recall and accuracy between QNNs and CNNs, even with large datasets. These results provide a point of comparison between quantum and classical models on real-world datasets.

Hamilton, Kathleen↗
DOE OSTI2023

Analytic Theory for the Dynamics of Wide Quantum Neural Networks

Here, parametrized quantum circuits can be used as quantum neural networks and have the potential to outperform their classical counterparts when trained for addressing learning problems. To date, much of the results on their performance on practical problems are heuristic in nature. In particular, the convergence rate for the training of quantum neural networks is not fully understood. Here, we analyze the dynamics of gradient descent for the training error of a class of variational quantum machine learning models. We define wide quantum neural networks as parametrized quantum circuits in the limit of a large number of qubits and variational parameters. Then, we find a simple analytic formula that captures the average behavior of their loss function and discuss the consequences of our findings. For example, for random quantum circuits, we predict and characterize an exponential decay of the residual training error as a function of the parameters of the system. Finally, we validate our analytic results with numerical experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗