Strategies for quantum-optimized construction of interpolating operators in classical simulations of lattice quantum field theories
Not Available
79 ASTRONOMY AND ASTROPHYSICS↗
SEARCH · Search NASA
Results for “Computer algorithm”
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.
Criticality of quantum energy teleportation at phase transition points in quantum field theory
Not Available
79 ASTRONOMY AND ASTROPHYSICS↗
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↗
Heisenberg-Limited Ground-State Energy Estimation for Early Fault-Tolerant Quantum Computers
Not Available
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↗
Practical Three-Dimensional Curvilinear Aperture Monopulse Synthetic Aperture Radar
When collected over a curved path, Synthetic Aperture Radar (SAR) contains information about the three-dimensional content of a scene that can aid interpretation of this difficult imaging modality. In a point scatterer simulation with amplitudes and heights derived from a real SAR image pair, we supplement confocal processing with a monopulse-based algorithm to compute heights of certain bright points, which we find automatically. In SAR, bright points often reflect man-made infrastructure central to scene interpretation.
Story, Mark [ORNL] (ORCID:0000000289148911)↗
Optimization-Based Fast-Frequency Estimation and Control of Low-Inertia Microgrids
The lack of inertial response from non-synchronous, inverter-based generation in microgrids makes the power system vulnerable to a large rate of change of frequency (ROCOF) and frequency excursions. Energy storage systems (ESSs) can be utilized to provide fast-frequency support to prevent such large excursions in the system. However, fast-frequency support is a power-intensive application that has a significant impact on the ESS lifetime. In this paper, a framework that allows the ESS operator to provide fast-frequency support as a service is proposed. The framework maintains the desired quality-of-service (limiting the ROCOF and frequency) while taking into account the ESS lifetime and physical limits. The framework utilizes moving horizon estimation (MHE) to estimate the frequency deviation and ROCOF from noisy phase-locked loop (PLL) measurements. These estimates are employed by a model predictive control (MPC) algorithm that computes control actions by solving a finite-horizon, online optimization problem. Additionally, this approach avoids oscillatory behavior induced by delays that are common when using low-pass filters as with traditional derivative-based (virtual inertia) controllers. MATLAB/Simulink simulations on a test system from Cordova, Alaska, show the effectiveness of the MHE-MPC approach to reduce frequency deviations and ROCOF of a low-inertia microgrid.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Distribution System Behind-the-Meter DERs: Estimation, Uncertainty Quantification, and Control
This paper summarizes the three-year technical activities of the IEEE Task Force (TF) on behind-the-meter (BTM) distributed energy resources (DERs): estimation, uncertainty quantification, and control. The potential grid services from BTM DERs are discussed in detail. The paper also reviews the state-of-the-art for BTM DERs visibility, uncertainty quantification, and, optimization and control. Furthermore, different aspects of the market structures associated with BTM DERs are covered, including emerging market and business models. Finally, needs and recommendations are provided for additional areas such as system protection, computing capabilities, algorithm development, market structure design, cyberinfrastructure and security, and hardware and software developments.
behind-the-meter↗
A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance
Graph similarity metrics serve far-ranging purposes across many domains in data science. As graph datasets grow in size, scientists need comparative tools that capture meaningful differences, yet are lightweight and scalable. Graph Relative Hausdorff (RH) distance is a promising, recently proposed measure for quantifying degree distribution similarity. In spite of recent interest in RH distance, little is known about its properties. Here, we conduct an algorithmic and analytic study of RH distance. In particular, we provide the first linear-time algorithm for computing RH distance, analyze examples of RH distance between families of graphs, and prove several analytic results concerning the range, density, and extremal behavior of RH distance values.
Relative Hausdorff distance, degree distribution, ↗
Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM
We analyze an expansion of the generalized block Krylov subspace framework of [Electron. Trans. Numer. Anal., 47 (2017), pp. 100--126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and contains, as special cases, the block GMRES method and the new block Radau--Arnoldi method. Within this general setting, we present results that extend the interpolation property from the nonblock case to a matrix polynomial interpolation property for the block case, and we relate the eigenvalues of the projected matrix to the latent roots of these matrix polynomials. Some error bounds for these modified block FOM methods for solving linear systems are presented. We then show how cospatial residuals can be preserved in the case of families of shifted linear block systems. This result is used to derive computationally practical restarted algorithms for block Krylov approximations that compute the action of a matrix function on a set of several vectors simultaneously. Finally, we prove some error bounds and present numerical results showing that two modifications of FOM, the block harmonic and the block Radau--Arnoldi methods for matrix functions, can significantly improve the convergence behavior.
97 MATHEMATICS AND COMPUTING↗