Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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 991 records · Page 55

Variational quantum simulation of the critical Ising model with symmetry averaging

Here we investigate the use of deep multiscale entanglement renormalization ansatz (DMERA) circuits as a variational ansatz. We use the exactly solvable one-dimensional critical transverse-field Ising model as a test bed. Numerically exact simulation of the quantum circuit ansatz can in this case be carried out to hundreds of qubits by exploiting efficient classical algorithms for simulating matchgate circuits. We find that, for this system, the DMERA strongly outperforms a standard quantum approximate optimization algorithm (QAOA)–style ansatz, and that a major source of systematic error in correlation functions approximated using the DMERA is the breaking of the translational and Kramers-Wannier symmetries of the transverse-field Ising model. We are able to reduce this error by up to four orders of magnitude by symmetry averaging, without incurring additional cost in qubits or circuit depth. Here, we propose that this technique for mitigating systematic error could be applied to noisy intermediate-scale quantum (NISQ) simulations of physical systems with other symmetries.

1-dimensional spin chains↗

Optimal experiment design for quantum state tomography: Fair, precise, and minimal tomography

Given an experimental setup and a fixed number of measurements, how should one take data to optimally reconstruct the state of a quantum system? The problem of optimal experiment design (OED) for quantum state tomography was first broached by Kosut et al.[R. Kosut, I. Walmsley, and H. Rabitz, e-print arXiv:quant-ph/0411093 (2004)]. Here we provide efficient numerical algorithms for finding the optimal design, and analytic results for the case of 'minimal tomography'. We also introduce the average OED, which is independent of the state to be reconstructed, and the optimal design for tomography (ODT), which minimizes tomographic bias. Monte Carlo simulations confirm the utility of our results for qubits. Finally, we adapt our approach to deal with constrained techniques such as maximum-likelihood estimation. We find that these are less amenable to optimization than cruder reconstruction methods, such as linear inversion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multipartite-to-bipartite entanglement transformations and polynomial identity testing

We consider the problem of deciding if some multiparty entangled pure state can be converted, with a nonzero success probability, into a given bipartite pure state shared between two specified parties through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to our question. As a result, a given transformation is possible if and only if it is generically attainable by a simple randomized protocol.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Maximal violation of a bipartite three-setting, two-outcome Bell inequality using infinite-dimensional quantum systems

The I{sub 3322} inequality is the simplest bipartite two-outcome Bell inequality beyond the Clauser-Horne-Shimony-Holt (CHSH) inequality, consisting of three two-outcome measurements per party. In the case of the CHSH inequality the maximal quantum violation can already be attained with local two-dimensional quantum systems; however, there is no such evidence for the I{sub 3322} inequality. In this paper a family of measurement operators and states is given which enables us to attain the maximum quantum value in an infinite-dimensional Hilbert space. Further, it is conjectured that our construction is optimal in the sense that measuring finite-dimensional quantum systems is not enough to achieve the true quantum maximum. We also describe an efficient iterative algorithm for computing quantum maximum of an arbitrary two-outcome Bell inequality in any given Hilbert space dimension. This algorithm played a key role in obtaining our results for the I{sub 3322} inequality, and we also applied it to improve on our previous results concerning the maximum quantum violation of several bipartite two-outcome Bell inequalities with up to five settings per party.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Self-learning Monte Carlo method and cumulative update in fermion systems

In this study, we develop the self-learning Monte Carlo (SLMC) method, a general-purpose numerical method recently introduced to simulate many-body systems, for studying interacting fermion systems. Our method uses a highly efficient update algorithm, which we design and dub “cumulative update”, to generate new candidate configurations in the Markov chain based on a self-learned bosonic effective model. From a general analysis and a numerical study of the double exchange model as an example, we find that the SLMC with cumulative update drastically reduces the computational cost of the simulation, while remaining statistically exact. Remarkably, its computational complexity is far less than the conventional algorithm with local updates.

36 MATERIALS SCIENCE↗

Efficient simulation of relativistic fermions via vertex models

We have developed an efficient simulation algorithm for strongly interacting relativistic fermions in two-dimensional field theories based on a formulation as a loop gas. It essentially eliminates critical slowing down by sampling two-point correlation functions and allows simulations directly in the massless limit at the critical point. It generates loop configurations with fluctuating topological boundary conditions enabling one to simulate fermions with arbitrary periodic or antiperiodic boundary conditions. As illustrative examples, the algorithm is applied to the Gross-Neveu model and to the Schwinger model in the strong coupling limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data analysis of gravitational-wave signals from spinning neutron stars. V. A narrow-band all-sky search

We present theory and algorithms to perform an all-sky coherent search for periodic signals of gravitational waves in narrow-band data of a detector. Our search is based on a statistic, commonly called the F-statistic, derived from the maximum-likelihood principle in Paper I of this series. We briefly review the response of a ground-based detector to the gravitational-wave signal from a rotating neuron star and the derivation of the F-statistic. We present several algorithms to calculate efficiently this statistic. In particular our algorithms are such that one can take advantage of the speed of fast Fourier transform in calculation of the F-statistic. We construct a grid in the parameter space such that the nodes of the grid coincide with the Fourier frequencies. We present interpolation methods that approximately convert the two integrals in the F-statistic into Fourier transforms so that the fast Fourier transform algorithm can be applied in their evaluation. We have implemented our methods and algorithms into computer codes and we present results of the Monte Carlo simulations performed to test these codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Width of the Confining String in Yang-Mills Theory

We investigate the transverse fluctuations of the confining string connecting two static quarks in (2+1)D SU(2) Yang-Mills theory using Monte Carlo calculations. The exponentially suppressed signal is extracted from the large noise by a very efficient multilevel algorithm. The resulting width of the string increases logarithmically with the distance between the static quark charges. Corrections at intermediate distances due to universal higher-order terms in the effective string action are calculated analytically. They accurately fit the numerical data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Structural hierarchy as a key to complex phase selection in Al-Sm

Investigating the unknown structure of the complex cubic phase, previously observed to crystallize from melt-spun amorphous Al–10 at.% Sm alloy, we determine the structure in full site-occupancy detail, highlighting several critical structural features that govern the far-from-equilibrium phase selection pathway. Using an efficient genetic algorithm combining molecular dynamics, density functional theory, and x-ray diffraction, the structure is clearly identified as body-centered cubic Im¯3m (No. 229) with ~140 atoms per cubic unit cell and a lattice parameter of 1.4 nm. The complex structure is further refined to elucidate the detailed site occupancy, revealing full Sm occupancy on 6b sites and split Sm/Al occupancy on 16f sites. Based on the refined site occupancy associated with the experimentally observed phase, we term this phase ε–Al 60 Sm 11 (bcc), corresponding to the limiting situation when all 16f sites are occupied by Sm. However, it should be recognized that the range of solubility enabled by split occupancy at Sm sites is an important feature in phase selection under experimental conditions, permitting an avenue for transition with little or no chemical partitioning. Our analysis shows that the ε–Al 60 Sm 11 (bcc) exhibits a “3-6-6-1” first-shell packing around Sm centers on 16f sites, the same dominant motif exhibited by the undercooled liquid. Here, the coincident motif supports the notion that liquid/glass ordering at high undercooling may give rise to topological invariants between the noncrystalline and crystalline states that provide kinetic pathways to metastable phases that are not accessible during near-equilibrium processing.

36 MATERIALS SCIENCE↗

Quantum Complexity of the Kronecker Coefficients

Whether or not the Kronecker coefficients of the symmetric group count some set of combinatorial objects is a longstanding open question. In this work we show that a given Kronecker coefficient is proportional to the rank of a projector that can be measured efficiently using a quantum computer. In other words a Kronecker coefficient counts the dimension of the vector space spanned by the accepting witnesses of a QMA verifier, where QMA is the quantum analogue of NP . This implies that approximating the Kronecker coefficients to within a given relative error is not harder than a certain natural class of problems that captures the complexity of estimating thermal properties of quantum many-body systems. A second consequence is that deciding positivity of Kronecker coefficients is contained in QMA , complementing a recent NP -hardness result of Ikenmeyer, Mulmuley, and Walter. We obtain similar results for the related problem of approximating row sums of the character table of the symmetric group. Finally, we discuss an efficient quantum algorithm that approximates normalized Kronecker coefficients to inverse-polynomial additive error. Published by the American Physical Society 2024

Physics↗

First-principles effective Hamiltonian for finite-temperature modeling of nonperovskite ferroelectrics

First-principles-based effective Hamiltonian techniques have been widely employed for over three decades to investigate ferroelectricity and related phenomena in perovskite materials. These techniques offer high accuracy, transferability, compatibility with various finite-temperature algorithms, computational efficiency, and ease in incorporating interactions with external fields. They have been adapted to study diverse phenomena, ranging from topological dipole patterns in ferroelectric nanostructures to multicaloric effects. In this work, we develop an effective Hamiltonian for the nonperovskite ferroelectric HfO 2 (hafnia). Applying this methodology to explore the finite-temperature and finite-electric-field properties of ferroelectric hafnia revealed (1) exceptionally large intrinsic coercive fields, an order of magnitude higher than those observed in perovskite ferroelectrics; (2) their atomistic origin; and (3) the existence of a regime where the relationship between the coercive field and the energy barrier for polarization reversal is counterintuitive. Here, these developments could accelerate progress both in methodological advancements for simulating ferroics and in the atomistic understanding of a broad range of ferroelectrics.

Electric polarization↗

Virtual Agents-Based Attack-Resilient Distributed Control for Islanded AC Microgrid

Due to its dependence on a communication network, distributed secondary control of microgrids is susceptible to denial-of-service (DoS) attacks in channel shutdown mode, which may negatively impact the network connectivity and thus deteriorate the coordination and power sharing among distributed generators (DGs). Honeypot is a common method for cyber deception by introducing fake targets. However, in the context of microgrid, the misleading information spread by honeypots will also impact the system performance. This paper proposes an attack-resilient distributed control for AC microgrids utilizing virtual agents (VAs) to counteract both DoS edge and node attacks. The VAs are designed to not impact the system’s steady state during normal operation but to share information among neighboring real agents and serve as dummy targets for DoS attacks. The control with VAs is implemented by a primal-dual gradient based distributed algorithm to efficiently obtain a practical solution for voltage/frequency regulation and power sharing. The simulation results on a 4-DG test system and a modified IEEE 34-bus system show that 1) VAs do not impact the normal functionality of the test system, and 2) deploying VAs can enhance the resilience of the microgrid control against DoS edge and node attacks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Communication-efficient Distributed Solutions to a System of Linear Equations with Laplacian Sparse Structure

Two communication-efficient distributed algorithms are proposed to solve a system of linear equations Ax = b with Laplacian sparse A. A system of linear equations with Laplacian sparse A can be found in many applications, e.g., the power flow problems and other network flow problems. The first algorithm is based on the gradient descent method in optimization and the agents only share two parts of the system state instead of that of the whole system state, which saves significant communication. The two parts shared by every agent through a communication link are the state information of its own and its neighbors connected by the communication link. The second method is obtained from an approximation of the Newton method, which converges faster. It requires twice as much communication as the first one but is still communicationefficient due to the low dimension of each part shared between agents. The convergence at a linear rate of both methods is proved. A comprehensive comparison of the convergence rate, communication burden, and computation costs between the methods is made. Finally, a simulation is conducted to show the effectiveness of both methods.

Wang, Peng↗

Multi-physics simulations of particle tracking in arterial geometries with a scalable moving window algorithm

In arterial systems, cancer cell trajectories determine metastatic cancer locations; similarly, particle trajectories determine drug delivery distribution. Predicting trajectories is challenging, as the dynamics are affected by local interactions with red blood cells, complex hemodynamic flow structure, and downstream factors such as stenoses or blockages. Direct simulation is not possible, as a single simulation of a large arterial domain with explicit red blood cells is currently intractable on even the largest supercomputers. To overcome this limitation, we present a multi-physics adaptive window algorithm, in which individual red blood cells are explicitly modeled in a small region of interest moving through a coupled arterial fluid domain. We describe the coupling between the window and fluid domains, including automatic insertion and deletion of explicit cells and dynamic tracking of cells of interest by the window. We show that this algorithm scales efficiently on heterogeneous architectures and enables us to perform large, highly-resolved particle-tracking simulations that would otherwise be intractable.

Herschlag, Gregory↗

Scalable Distributed Memory Community Detection Using Vite

Graph clustering, popularly known as community detection, is a fundamental graph operation used in several applications of relevance for network analysis and cybersecurity. Community detection is an operation of partitioning a network into an arbitrary number of “communities” such that each com munity represents a tightly-knit group of nodes with relatively sparser connections to the rest of the nodes in the network. The need to compute clustering on large-scale networks necessitates the development of efficient parallel algorithms capable of exploiting modern parallel architectures. However, due to their irregular and inherently sequential nature, many of the current algorithms for community detection are challenging to parallelize. In response to the 2018 Graph Challenge, we present Vite which is a distributed-memory parallel community detection method. Vite is a parallelization of the algorithmic template provided by a widely-used serial method (Louvain). Alongside, it uses several heuristics aimed at significantly improving parallelism and performance, while preserving output quality. Using the inputs from the 2018 Graph Challenge (static and streaming), we demonstrate superior performance and high quality solutions based on four parallelization heuristics.

community detection↗

Dynamic Restoration Strategy for Distribution System Resilience Enhancement

In electric power distribution systems, distributed energy resources (DERs) can act as controllable power sources and support utility operators to minimize power outages after extreme weather events (e.g., hurricane, earthquake, wildfire) and thus help enhance the grid's resilience. Meanwhile, the influences of extreme events and the capabilities of DERs are dynamic and difficult to predict. Hence, the desired distribution system restoration strategy should be able to evolve according to real-time fault/dis-turbance information and the availability of DERs. In this paper, we propose a new dynamic restoration strategy for distribution systems to enhance system resilience against potential hazards. An efficient reconfiguration algorithm is developed to eliminate the use of integer variables to relieve the computational burden. Model predictive control is implemented to adjust the system topology and DER operation set points based on the updated fault information and DER forecasts. The effectiveness of the proposed restoration model in enhancing distribution system resilience is validated through an IEEE 123-bus test system. Simulation results also validate that the proposed restoration model can mitigate the occurrence of unexpected events and the fluctuations of DERs.

distributed energy resources (DERs)↗

Visual Analytics of Performance of Quantum Computing Systems and Circuit Optimization

Driven by potential exponential speedups in business, security, and scientific scenarios, interest in quantum computing is surging. This interest feeds the development of quantum computing hardware, but several challenges arise in optimizing application performance for hardware metrics (e.g., qubit coherence and gate fidelity). In this work, we describe a visual analytics approach for analyzing the performance properties of quantum devices and quantum circuit optimization. Our approach allows users to explore spatial and temporal patterns in quantum device performance data and it computes similarities and variances in key performance metrics. Detailed analysis of the error properties characterizing individual qubits is also supported. We also describe a method for visualizing the optimization of quantum circuits. The resulting visualization tool allows researchers to design more efficient quantum algorithms and applications by increasing the interpretability of quantum computations.

Chae, Junghoon↗