Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer algorithms”

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 1,207 records · Page 67

Error detection on quantum computers improving the accuracy of chemical calculations

The ultimate goal of quantum error correction is to achieve the fault-tolerance threshold beyond which quantum computers can be made arbitrarily accurate. This requires extraordinary resources and engineering efforts. We show that even without achieving full fault-tolerance, quantum error detection is already useful on the current generation of quantum hardware. We demonstrate this by executing an end-to-end chemical calculation for the hydrogen molecule encoded in the [[4, 2, 2]] quantum error-detecting code. The encoded calculation with logical qubits significantly improves the accuracy of the molecular ground-state energy.

97 MATHEMATICS AND COMPUTING↗

Quantum simulation of second-quantized Hamiltonians in compact encoding

We describe methods for simulating general second-quantized Hamiltonians using the compact encoding, in which qubit states encode only the occupied modes in physical occupation number basis states. These methods apply to second-quantized Hamiltonians composed of a constant number of interactions, i.e., linear combinations of ladder operator monomials of fixed form. Compact encoding leads to qubit requirements that are optimal up to logarithmic factors. Here, we show how to use sparse Hamiltonian simulation methods for second-quantized Hamiltonians in compact encoding, give explicit implementations for the required oracles, and analyze the methods. We also describe several example applications including the free boson and fermion theories, the φ 4 -theory, and the massive Yukawa model, all in both equal-time and light-front quantization. Our methods provide a general-purpose tool for simulating second-quantized Hamiltonians, with optimal or near-optimal scaling with error and model parameters.

97 MATHEMATICS AND COMPUTING↗

Theoretical Insights for Improving the Schottky-Barrier Height at the Ga2O3/Pt Interface

In this work, we study the Schottky-barrier height (SBH) at the junction between ..beta..-Ga2O3 and platinum, a system of great importance for the next generation of high-power and high-temperature electronic devices. Specifically, we obtain interfacial atomic structures at different orientations using our structure-matching algorithm and compute their SBH using electronic structure calculations based on hybrid density-functional theory.

CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS,P↗

4-Clique network minor embedding for quantum annealers

Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network minor embedding. This method is in contrast to the standard minor embedding technique of using a path of linearly connected qubits in order to represent a logical variable state. The 4-clique minor embedding is possible on Pegasus graph connectivity, which is the native hardware graph for some of the current D-Wave quantum annealers. The Pegasus hardware graph contains many cliques of size 4, making it possible to form a graph composed entirely of paths of connected 4-cliques on which a problem can be minor-embedded. The 4-clique chains come at the cost of additional qubit usage on the hardware graph, but they allow for stronger coupling within each chain, thereby increasing chain integrity, reducing chain breaks, and allow for greater usage of the available energy scale for programming logical problem coefficients on current quantum annealers. The 4-clique minor embedding technique is compared with the standard linear path minor embedding with experiments on two D-Wave quantum annealing processors with Pegasus hardware graphs. We show proof-of-concept experiments where the 4-clique minor embeddings can use weak chain strengths while successfully carrying out the computation of minimizing random all-to-all spin glass problem instances. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Numerically exact generalized Green's function cluster expansions for electron-phonon problems

We generalize the family of approximate momentum average methods to formulate a numerically exact, convergent hierarchy of equations whose solution provides an efficient algorithm to compute the Green's function of a particle dressed by bosons suitable in the entire parameter regime. We use this approach to extract ground-state properties and spectral functions. Our approximation-free framework, dubbed the generalized Green's function cluster expansion (GGCE), allows access to exact numerical results in the extreme adiabatic limit, where many standard methods struggle or completely fail. We showcase the performance of the method, specializing three important models of charge-boson coupling in solids and molecular complexes: the molecular Holstein model, which describes coupling between charge density and local distortions, the Peierls model, which describes modulation of charge hopping due to intersite distortions, and a more complex Holstein + Peierls system with couplings to two different phonon modes, paradigmatic of charge-lattice interactions in organic crystals. Furthermore, the GGCE serves as an efficient approach that can be systematically extended to different physical scenarios, thus providing a tool to model the frequency dependence of dressed particles in realistic settings.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Universal Tripartite Entanglement in One-Dimensional Many-Body Systems

Motivated by conjectures in holography relating the entanglement of purification and reflected entropy to the entanglement wedge cross section, we introduce two related non-negative measures of tripartite entanglement g and h. We prove structure theorems which show that states with nonzero g or h have nontrivial tripartite entanglement. We then establish that in one dimension these tripartite entanglement measures are universal quantities that depend only on the emergent low-energy theory. For a gapped system, we argue that either g≠0 and h=0 or g=h=0, depending on whether the ground state has long-range order. For a critical system, we develop a numerical algorithm for computing g and h from a lattice model. We compute g and h for various CFTs and show that h depends only on the central charge whereas g depends on the whole operator content.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning Conservation Laws in Unknown Quantum Dynamics

We present a learning algorithm for discovering conservation laws given as sums of geometrically local observables in quantum dynamics. This includes conserved quantities that arise from local and global symmetries in closed and open quantum many-body systems. The algorithm combines the classical shadow formalism for estimating expectation values of observable and data analysis techniques based on singular value decompositions and robust polynomial interpolation to discover all such conservation laws in unknown quantum dynamics with rigorous performance guarantees. Our method can be directly realized in quantum experiments, which we illustrate with numerical simulations, using closed and open quantum system dynamics in a ℤ 2 gauge theory and in many-body localized spin chains.

Machine learning↗

Theory for Equivariant Quantum Neural Networks

Quantum neural network architectures that have little to no inductive biases are known to face trainability and generalization issues. Inspired by a similar problem, recent breakthroughs in machine learning address this challenge by creating models encoding the symmetries of the learning task. This is materialized through the usage of equivariant neural networks the action of which commutes with that of the symmetry. In this work, we import these ideas to the quantum realm by presenting a comprehensive theoretical framework to design equivariant quantum neural networks (EQNNs) for essentially any relevant symmetry group. We develop multiple methods to construct equivariant layers for EQNNs and analyze their advantages and drawbacks. Our methods can find unitary or general equivariant quantum channels efficiently even when the symmetry group is exponentially large or continuous. As a special implementation, we show how standard quantum convolutional neural networks (QCNNs) can be generalized to group-equivariant QCNNs where both the convolution and pooling layers are equivariant to the symmetry group. We then numerically demonstrate the effectiveness of a S U ( 2 ) -equivariant QCNN over symmetry-agnostic QCNN on a classification task of phases of matter in the bond-alternating Heisenberg model. Our framework can be readily applied to virtually all areas of quantum machine learning. Lastly, we discuss about how symmetry-informed models such as EQNNs provide hopes to alleviate central challenges such as barren plateaus, poor local minima, and sample complexity. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Effective Missing Value Imputation Methods for Building Monitoring Data

To understand behaviors of natural and man-made events, such as energy consumption of buildings, which accounts for 40% of energy uses in the US, we deploy automated monitoring devices to record periodic observations. However, such experimental and observation data often contains problems and irregularities that have to be cleaned up before analyses. Due to various conditions affecting sensor operations, the communication channels, recording steps, or the recording media, the recorded data might have missing values, errors, or anomalous values. An effective way to clean up these problems is to replace these missing values, errors and anomalous values with expected values, a process generally known as imputation. In this work, we survey commonly used missing value imputation techniques and compare their performance on a set of building monitoring data. To compare the different types of sensor measurements with widely varying characteristics, we use normalized root mean squared error (NRMSE) as the key metric for the effectiveness of the imputation methods. We additionally consider periodicity and run time when considering comparing methods. Through extensive testing, we find that for small gap sizes, up to 8 consecutive missing values, linear interpolation performs the best; for larger gaps stretching up to 48 consecutive missing values, K-nearest neighbors provides the most accurate imputations; for even larger gaps, more computational intensive methods, such as matrix factorization, achieve the smallest NRMSE. Additionally, we observe that these computationally intensive algorithms not only provide accurate imputations for large gaps, but are also more robust across all types of sensors.

Cho, B↗

Data-driven Distributed Learning of Multi-agent Systems: A Koopman Operator Approach

Koopman operator theory provides a model-free technique for studying nonlinear dynamical systems purely from data. Since the Koopman operator is infinite-dimensional, researchers have developed several methods that provide a finite-dimensional approximation of the Koopman operator so that it can be applied for practical use cases. One common thing with most of the methods is that their solutions are obtained by solving a centralized minimization problem. In this work, we treat the dynamical system to be a multi-agent system and propose an algorithm to compute the finite-dimensional approximation of the Koopman operator in a distributed manner using the knowledge of the topology of the underlying multi-agent system. The proposed distributed approach is shown to be equivalent to the centralized learning problem and results in a sparse Koopman whose block structure mimics the Laplacian of the multi-agent system. Extensive simulation studies illustrate the proposed framework on the network of oscillators and the IEEE 68 bus system.

Nandanoori, Sai Pushpak↗

Optimized AC/DC Dual Active Bridge Converter using Monolithic SiC Bidirectional FET (BiDFET) for Solar PV Applications

Grid interface power conversion systems for commercial, industrial and residential solar power generation are becoming ubiquitous due to the competitive cost of solar energy. The AC/DC dual active bridge (DAB) converter is an upcoming topology in industrial PV energy and energy storage applications, providing bidirectional power transfer and galvanic isolation. In this paper, the properties of a DAB-type converter are leveraged to propose a design optimization process. It can optimize the high-frequency RMS current, size of magnetic elements and zero-voltage-switching (ZVS) region of the converter. The resulting design is compared against that derived from a conventional approach. In addition, an algorithm to compute the harmonic currents at the DC and line frequency AC ports of the system is proposed, and the respective filter designs are presented. The optimized design of the AC/DC DAB converter is implemented using the newly developed, 1200 V, 46 mΩ, four quadrant, SiC-based monolithic bidirectional FETs (BiDFET). Experimental results from the 2.3 kW, 400V/277VRMS hardware prototype are finally presented to verify the design process.

Bidirectional isolated AC-DC conversion, solar ene↗

Bidding Curve Design for Hybrid Power Plants with Uncertain Solar Forecast

This paper presents a novel bidding curve design algorithm tailored for hybrid power plants (HPPs) to participate in the wholesale electricity market. Utilizing forecasts for photovoltaic (PV) generation and available battery power, our algorithm strategically computes the bidding curve to maximize HPP profit while adeptly managing the inherent uncertainty associated with PV power generation. In addition, the introduction of the penalty cost in HPP bidding curves provides the system operator a tool to effectively manage the system-level uncertainty that caused by HPPs. Numerical analysis through Monte Carlo simulations confirms that our bidding curve methodology outperforms the benchmark across various scenarios.

bidding curve↗

Cycle-by-cycle Delay Estimation at Signalized Intersections by using Machine Learning and Simulated Video Detection Data

Accurate estimation of delay is crucial for efficient traffic signal operations. Estimation of delay in the real-time manner using traditional loop detectors requires advanced detectors (in addition to stop-bar detection). In cases when this detection layout is not in place, delay estimates are approximated with a lower accuracy. Video detection is one of the most frequently deployed detection systems at signalized intersections in recent years. In most cases video detection operates in the same way as traditional inductive loops. However, when coupled with computer vision algorithms, video detection systems could be used to retrieve additional information (e.g., vehicular arrivals and departures) that cannot be taken out from the conventional systems (e.g., long stop-bar loop detectors). Although present for several decades, video detection data were not frequently examined for delay estimation purposes. In this study, we proposed a novel delay estimation model which can be developed with only data from stop-bar video detectors. Relevant data were collected from a simulation model of 11 signalized intersections at downtown Chattanooga, TN and processed to create needed inputs for model development. With the use of multigene genetic programming the authors developed a delay model that outperforms accuracy of multi regression model. Furthermore, authors evaluated the developed model by comparison with the other benchmark delay models, such as HCM and approach delay model. It was found that the developed MGGP delay model outperforms benchmark models for a wide range of traffic and signal operation conditions.

Erdagi, Ismet Goksad↗