Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algebraic structures”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Benchmarking near-term quantum devices with the variational quantum eigensolver and the Lipkin-Meshkov-Glick model

The variational quantum eigensolver is a promising algorithm for noisy intermediate scale quantum (NISQ) computation. Verification and validation of NISQ algorithms' performance on NISQ devices is an important task. Here, we consider the exactly diagonalizable Lipkin-Meshkov-Glick (LMG) model as a candidate for benchmarking NISQ computers. We use the Bethe Ansatz to construct eigenstates of the trigonometric LMG model using quantum circuits inspired by the LMG's underlying algebraic structure. We construct circuits with depth $\mathcal{O}$(N) and $\mathcal{O}$(log 2 N) that can prepare any trigonometric LMG eigenstate of N particles. The number of gates required for both circuits is $\mathcal{O}$(N). The energies of the eigenstates can then be measured and compared to the exactly known answers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Robust finite-temperature many-body scarring on a quantum computer

Mechanisms for suppressing thermalization in disorder-free many-body systems, such as Hilbert space fragmentation and quantum many-body scars, have recently attracted much interest in foundations of quantum statistical physics and potential quantum information processing applications. However, their sensitivity to realistic effects such as finite temperature remains largely unexplored. Here, we have utilized IBM's Kolkata quantum processor to demonstrate an unexpected robustness of quantum many-body scars at finite temperatures when the system is prepared in a thermal Gibbs ensemble. We identify such robustness in the PXP model, which describes quantum many-body scars in experimental systems of Rydberg atom arrays and ultracold atoms in tilted Bose-Hubbard optical lattices. By contrast, other theoretical models which host exact quantum many-body scars are found to lack such robustness and their scarring properties quickly decay with temperature. Our study sheds light on the important differences between scarred models in terms of their algebraic structures, which impacts their resilience to finite temperature. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Perturbative quantum evolution of the gravitational state and dressing in general backgrounds

This paper sets up a perturbative treatment of the evolving quantum state of a gravitational system, in a Schrödinger-like picture, working about a general background. This connects gauge symmetry, the constraints, gravitational dressing, and evolution. Starting with a general time slicing, we give a simple derivation of the relation between the constraints, the Hamiltonian, and its well-known boundary term. Among different approaches to quantization with constraints, we focus on a “gauge-invariant canonical quantization,” which is developed perturbatively in the gravitational coupling. The leading-order solution of the constraints (including the Wheeler-DeWitt equation) for perturbations about the background is given in terms of an explicit construction of gravitational dressings built using certain generalized Green’s functions; different such dressings corresponding to adding propagating gravitational waves to a particular solution of the constraints. Dressed operators commute with the constraints, expressing their gauge invariance, and have an algebraic structure differing significantly from the undressed operators of the underlying field theory. These operators can act on the vacuum to create dressed states, and evolution of general such states is then generated by the boundary Hamiltonian, and alternately may be characterized using other relational observables. This provides a concrete approach to studying perturbative time evolution, including the leading gravitational backreaction, of quantum states of black holes with flat or anti–de-Sitter asymptotics, for example on horizon-crossing slices. This description of evolution in turn provides a starting point for investigating possibly important corrections to quantum evolution, that go beyond quantized general relativity. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Strong Zero Modes in Integrable Quantum Circuits

It is a classic result that certain interacting integrable spin chains host robust edge modes known as strong zero modes (SZMs). In this Letter, we extend this result to the Floquet setting of local quantum circuits, focusing on a prototypical model providing an integrable Trotterization for the evolution of the XXZ Heisenberg spin chain. By exploiting the algebraic structures of integrability, we show that an exact SZM operator can be constructed for these integrable quantum circuits in certain regions of parameter space. Our construction, which recovers a well-known result by Paul Fendley in the continuous-time limit, relies on a set of commuting transfer matrices known from integrability, and allows us to easily prove important properties of the SZM, including normalizabilty. Our approach is different from previous methods and could be of independent interest even in the Hamiltonian setting. Furthermore, our predictions, which are corroborated by numerical simulations of infinite-temperature autocorrelation functions, are potentially interesting for implementations of the XXZ quantum circuit on available quantum platforms.

1-dimensional spin chains↗
DOE OSTI2021

Theory of Trotter Error with Commutator Scaling

The Lie-Trotter formula, together with its higher-order generalizations, provides a simple approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly understood. We develop a theory of Trotter error that overcomes the limitations of truncating the Baker-Campbell-Hausdorff expansion. Our analysis directly exploits the commutativity of operator summands, producing tighter error bounds for both real- and imaginary-time evolutions. Whereas previous work achieves similar goals for systems with geometric locality or Lie-algebraic structure, our approach holds in general. We give a host of improved algorithms for digital quantum simulation and quantum Monte Carlo methods, nearly matching or even outperforming the best previous results. Our applications include: (i) a simulation of second-quantized plane-wave electronic structure, nearly matching the interaction-picture algorithm of Low and Wiebe; (ii) a simulation of $k$-local Hamiltonians almost with induced one-norm scaling, faster than the qubitization algorithm of Low and Chuang; (iii) a simulation of rapidly decaying power-law interactions, outperforming the Lieb-Robinson-based approach of Tran et al.; (iv) a hybrid simulation of clustered Hamiltonians, dramatically improving the result of Peng, Harrow, Ozols, and Wu; and (v) quantum Monte Carlo simulations of the transverse field Ising model and quantum ferromagnets, tightening previous analyses of Bravyi and Gosset. We obtain further speedups using the fact that product formulas can preserve the locality of the simulated system. Specifically, we show that local observables can be simulated with complexity independent of the system size for power-law interacting systems, which implies a Lieb-Robinson bound nearly matching a recent result of Tran et al. Our analysis reproduces known tight bounds for first- and second-order formulas. We further investigate the tightness of our bounds for higher-order formulas. For quantum simulation of a one-dimensional Heisenberg model with an even-odd ordering of terms, our result overestimates the complexity by only a factor of $5$. Our bound is also close to tight for power-law interactions and other orderings of terms. This suggests that our theory can accurately characterize Trotter error in terms of both the asymptotic scaling and the constant prefactor.

quantum computing, numerical analysis↗
DOE OSTI2026

Spacetime quantum mechanics for bosonic and fermionic systems

We provide a Hilbert space approach to quantum mechanics where space and time are treated on an equal footing. Our approach replaces the standard dependence on an external classical time parameter with a spacetime-symmetric algebraic structure, thereby unifying the axioms that traditionally distinguish the treatment of spacelike and timelike separations. Standard quantum evolution can be recovered from timelike correlators, defined by means of a quantum action operator, a quantum version of the action of classical mechanics. The corresponding map also provides an alternative perspective on the path integral formulation that, in the case of fermions, does not require the use of Grassmann variables. In addition, the formalism can be interpreted in terms of generalized quantum states, codifying both the conventional information of a quantum system at a given time and its evolution. We show that these states are solutions to a quantum principle of stationary action grounded in timelike correlations and pseudo-entropies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Codimension-2 defects and higher symmetries in (3+1)D topological phases

(3+1)D topological phases of matter can host a broad class of non-trivial topological defects of codimension-1, 2, and 3, of which the well-known point charges and flux loops are special cases. The complete algebraic structure of these defects defines a higher category, and can be viewed as an emergent higher symmetry. This plays a crucial role both in the classification of phases of matter and the possible fault-tolerant logical operations in topological quantum error-correcting codes. In this paper, we study several examples of such higher codimension defects from distinct perspectives. We mainly study a class of invertible codimension-2 topological defects, which we refer to as twist strings. We provide a number of general constructions for twist strings, in terms of gauging lower dimensional invertible phases, layer constructions, and condensation defects. We study some special examples in the context of \mathbb{Z}_2 ℤ 2 gauge theory with fermionic charges, in \mathbb{Z}_2 \times \mathbb{Z}_2 ℤ 2 × ℤ 2 gauge theory with bosonic charges, and also in non-Abelian discrete gauge theories based on dihedral ( D_n D n ) and alternating ( A_6 A 6 ) groups. The intersection between twist strings and Abelian flux loops sources Abelian point charges, which defines an H^4 H 4 cohomology class that characterizes part of an underlying 3-group symmetry of the topological order. The equations involving background gauge fields for the 3-group symmetry have been explicitly written down for various cases. We also study examples of twist strings interacting with non-Abelian flux loops (defining part of a non-invertible higher symmetry), examples of non-invertible codimension-2 defects, and examples of the interplay of codimension-2 defects with codimension-1 defects. We also find an example of geometric, not fully topological, twist strings in (3+1)D A_6 A 6 gauge theory.

Barkeshli, Maissam↗
NASA NTRS1975

Algebraic methods in system theory

Investigations on problems of the type which arise in the control of switched electrical networks are reported. The main results concern the algebraic structure and stochastic aspects of these systems. Future reports will contain more detailed applications of these results to engineering studies.

Brockett, R. W.↗
NASA NTRS1974

Discretized partial differential equations - Examples of control systems defined on modules

The purpose of this paper is to show how the important problems of linear system theory can be solved concisely for a particular class of linear systems, namely block circulant systems, by exploiting the algebraic structure. This type of system arises in lumped approximations to linear partial differential equations. The computation of the transition matrix, the variation of constants formula, observability, controllability, pole allocation, realization theory, stability and quadratic optimal control are discussed. In principle, all questions which are solved here could also be solved by standard methods; the present paper clearly exposes the structure of the solution, and thus permits various savings in computational effort.

Brockett, R. W.↗
NASA NTRS1984

Sequential Syndrome Decoding of Convolutional Codes

The algebraic structure of convolutional codes are reviewed and sequential syndrome decoding is applied to those codes. These concepts are then used to realize by example actual sequential decoding, using the stack algorithm. The Fano metric for use in sequential decoding is modified so that it can be utilized to sequentially find the minimum weight error sequence.

Reed, I. S.↗
NASA NTRS1983

Pfaffian systems and feedback linearization/obstructions

The concept of Cartan-Vessiot filtered Lie algebra/module is defined in terms of previous feedback linearizations constructed through canonical forms of Pfaffian systems associated with nonlinear systems. Nonlinearization/Cartan-Vessiot algebras are regarded as deformations of linear ones. It is shown how certain problems of interest in nonlinear system theory translate over to algebraic problems involving this sort of algebraic structure.

Hermann, R.↗
NASA NTRS1989

Classical geometries defined by exterior differential systems on higher frame bundles

Exterior differential ideals are discussed, and sets of invariant generators presented, for Reimannian, conformal and projective geometries, and for specializations such as Ricci-flat, self-dual and Einstein-Maxwell theories. The Cartan characteristic integers are explicitly calculated, and involutory basis forms found, for each of these (specialized to four dimensions), exposing their algebraic structure and showing how they generate well-posed sets of partial differential equations.

Estabrook, Frank B.↗
NASA NTRS1995

Shapes and stability of algebraic nuclear models

A generalization of the procedure to study shapes and stability of algebraic nuclear models introduced by Gilmore is presented. One calculates the expectation value of the Hamiltonian with respect to the coherent states of the algebraic structure of the system. Then equilibrium configurations of the resulting energy surface, which depends in general on state variables and a set of parameters, are classified through the Catastrophe theory. For one- and two-body interactions in the Hamiltonian of the interacting Boson model-1, the critical points are organized through the Cusp catastrophe. As an example, we apply this Separatrix to describe the energy surfaces associated to the Rutenium and Samarium isotopes.

Lopez-Moreno, Enrique↗
DOE OSTI2025

Structure of Odd-A Ag Isotopes Studied via Algebraic Approaches

The structure of the odd-A silver isotopes Ag 103–115 is discussed within the frame of the interacting boson–fermion model (IBFM). An overview of their key properties is presented, with a particular attention paid to the “ J -1 anomaly”, represented by an abnormal ordering of the lowest 7/2 + and 9/2 + states. By examining previously published data and newly performed calculations, it is demonstrated that the experimentally known level schemes and electromagnetic properties of Ag 103–115 can be reproduced well within IBFM-1 by using a consistent set of model parameters. The contribution of different single-particle orbitals to the structure of the lowest-lying excited nuclear states in Ag 103–115 is discussed. Given that the J-1 anomaly brings down the 7/2 + level from the j −3 multiplet to energies, which can be thermally populated in hot stellar environments, the importance of low-lying excited states in odd-A silver isotopes for astrophysical processes is outlined.

IBFM-1↗
NASA NTRS1993

Structured adaptive grid generation using algebraic methods

The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration of points to the grid redistribution scheme. The evaluation of the weighting mesh is accomplished by utilizing the weight function representing the solution variation and the equidistribution law. The selection of the weight function plays a key role in grid adaptation. A new weight function utilizing a properly weighted boolean sum of various flowfield characteristics is defined. The redistribution scheme is developed utilizing Non-Uniform Rational B-Splines (NURBS) representation. The application of NURBS representation results in a well distributed smooth grid by maintaining the fidelity of the geometry associated with boundary curves. Several algebraic methods are applied to smooth and/or nearly orthogonalize the grid lines. An elliptic solver is utilized to smooth the grid lines if there are grid crossings. Various computational examples of practical interest are presented to demonstrate the success of these methods.

Yang, Jiann-Cherng↗
NASA NTRS1989

Applications of algebraic image operators to model-based vision

A highly structured and compact algebraic representation of grey-level images is expanded. Addition and multiplication are defined for the set of all grey-level images, which can then be described as polynomials of two variables. Utilizing this new algebraic structure, an innovative, efficient edge-detection scheme is devised. A robust method for linear feature extraction is developed by combining the techniques of a Hough transform and a line follower with this new edge detection scheme. The major advantage of this feature extractor is its general, object-independent nature. Target attributes, such as line segment lengths, intersections, angles of intersection, and endpoints are derived by the feature extraction algorithm and employed during model matching. The feature extractor and model matcher are being incorporated into a distributed robot-control system.

Lerner, Bao-Ting↗
NASA NTRS1990

Extensions of algebraic image operators: An approach to model-based vision

Researchers extend their previous research on a highly structured and compact algebraic representation of grey-level images which can be viewed as fuzzy sets. Addition and multiplication are defined for the set of all grey-level images, which can then be described as polynomials of two variables. Utilizing this new algebraic structure, researchers devised an innovative, efficient edge detection scheme. An accurate method for deriving gradient component information from this edge detector is presented. Based upon this new edge detection system researchers developed a robust method for linear feature extraction by combining the techniques of a Hough transform and a line follower. The major advantage of this feature extractor is its general, object-independent nature. Target attributes, such as line segment lengths, intersections, angles of intersection, and endpoints are derived by the feature extraction algorithm and employed during model matching. The algebraic operators are global operations which are easily reconfigured to operate on any size or shape region. This provides a natural platform from which to pursue dynamic scene analysis. A method for optimizing the linear feature extractor which capitalizes on the spatially reconfiguration nature of the edge detector/gradient component operator is discussed.

Lerner, Bao-Ting↗
NASA NTRS1989

Algebraic multigrid methods applied to problems in computational structural mechanics

The development of algebraic multigrid (AMG) methods and their application to certain problems in structural mechanics are described with emphasis on two- and three-dimensional linear elasticity equations and the 'jacket problems' (three-dimensional beam structures). Various possible extensions of AMG are also described. The basic idea of AMG is to develop the discretization sequence based on the target matrix and not the differential equation. Therefore, the matrix is analyzed for certain dependencies that permit the proper construction of coarser matrices and attendant transfer operators. In this manner, AMG appears to be adaptable to structural analysis applications.

Mccormick, Steve↗