Engineering PapersSearch

SEARCH · Engineering Papers

Results for “complexity theory”

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 19 records

Real-space Kohn–Sham density functional theory for complex energy applications

Real-space Kohn-Sham density functional theory (real-space KS-DFT) enables large-scale electronic structure simulations that is particularly well-suited for the modern high-performance computing (HPC) architectures. This feature article reviews its theoretical foundations, highlights the algorithmic advances and recent developments, and showcases applications in complex nano systems. We aim to provide a perspective on the trajectory of real-space KS-DFT as an emerging tool for computational chemistry and materials science in the exascale era.

Zhang, Zeyi

Power of Quantum Witnesses

A central theme in the study of quantum information is to understand whether quantum resources are more powerful than their classical counterparts. One such resource is quantum witness and understanding the power of quantum witnesses is one of the fundamental questions of quantum complexity theory. The broad object of this project was to understand the power of quantum witnesses and related objects and their properties: In this direction, this project addressed three key broader category of questions: 1) Are quantum witnesses more powerful than the classical witnesses? 2) How easy it is to copy quantum witnesses and what are their complexity theoretic implications? 3) Can quantum witnesses shed light or help provide super-polynomial quantum speedups on problems for which super-polynomial quantum speedups are shown to be not possible in general? The research conducted under this grant has directly addressed the three core pillars of the original proposal: characterizing the computational power of quantum witnesses, understanding their uncloneability, implications for complexity theory and identifying structural regimes for super-polynomial speedups.

97 MATHEMATICS AND COMPUTING

From oversimplified to overlooked: The case for exploring rich dark sectors

The Standard Model (SM) of particle physics provides a very successful description of fundamental particles and their interactions but it is incomplete, as neutrino masses, dark matter and the baryon asymmetry of the Universe indicate. In addition, the origin of masses and of the approximate fundamental symmetries call out for deeper explanations. The quest for a New SM Theory, that extends the SM to a more general theory, is ongoing. For decades the main focus has been on the TeV scale, but despite an impressive theoretical and experimental effort, no hints of new physics at such scale has been found in experiments. Dark sectors provide an interesting alternative to TeV scale extensions of the SM to explain the open questions in particle and astroparticle physics. Going beyond minimal models, rich dark sectors extend the SM to a complex theory with multiple particles and interactions, in analogy to the SM itself. They have a wealth of theoretical and astrophysical/cosmological consequences and can lead to phenomenological signatures that can be markedly different to that of minimal ones. These include short-lived particles and semi-visible decay signatures, as opposed to minimal models where new states are typically long-lived and purely visible or invisible resonances. Given the experimental configurations and analysis strategies, current dark sector searches might miss such signatures. We advocate a dedicated programme of searches for rich dark sectors that overcomes the assumptions on minimality and on the long lifetime of particles and encompasses a broader range of possibilities. Here, we discuss a prototype model that includes a complex structure akin to the SM: multiple generations of fermions charged under a new spontaneously-broken gauge symmetry.

Dark matter

IR side of bounds on theories with spontaneously broken Lorentz symmetry

In nature, some UV features of dynamics are reflected in IR quantities. In fully relativistic theories, this connection can be probed through the analyticity properties of scattering amplitudes, allowing one to understand which IR theories respect the UV assumptions of quantum field theory. The ensuing analyticity bounds can usually be rephrased as the absence of faster-than-light propagation for low-energy excitations. While it is interesting to understand these relations and their IR characterization for theories that have less idealized properties, it is also more difficult to derive analyticity bounds in these cases. For theories that spontaneously break Lorentz symmetry, recent progress was made by considering correlators of conserved currents and their analyticity properties. In this work, we focus on such theories and work to close the gap from the IR side, finding a natural way to express the known analyticity bounds purely in terms of low-energy kinematical quantities. Our analysis shows that the bounds require gapped excitations to have a slower speed than the gapless ones, at least for momenta that are low with respect to the mass gap. These results suggest a way to interpret the UV/IR connection in more complex theories.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Soft factorisation and exponentiation from Schwinger-space geometry

Infrared divergences in Quantum Field Theory govern the low-energy dynamics of many physical theories, and their understanding is a crucial ingredient in predicting the outcomes of collider experiments. We present a novel approach to deriving the structure of these divergences by employing the Schwinger parametrization of Feynman integrals. After using tropical geometry to identify divergent limits, we study the all-orders asymptotic properties of Feynman diagrams via matrix manipulations of graph Laplacians, which allows us to analyse their IR behaviour systematically. We explicitly demonstrate the soft-hard factorization of the integrand for a broad class of diagrams, and reveal that when written in terms of worldline distances, topologically distinct diagrams asymptote to the same integrand at leading order in the soft limit. In particular, for the case of Quantum Electrodynamics (with massive fermions), we use this fact to show how ladder-type diagrams combine in Schwinger-parameter space to yield the correct exponentiated soft anomalous dimension. This framework provides a foundation for extending these methods to more complex theories like Quantum Chromodynamics and offers a pathway towards a systematic understanding of infrared divergences in perturbative amplitudes.

Factorization

Circuit complexity and functionality: A statistical thermodynamics perspective

Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem. Recently, in the context of black holes, circuit complexity has been promoted to a physical property, wherein the growth of complexity is reflected in the time evolution of the Einstein-Rosen bridge (“wormhole”) connecting the two sides of an anti-de Sitter “eternal” black hole. Here, we are motivated by an independent set of considerations and explore links between complexity and thermodynamics for functionally equivalent circuits, making the physics-inspired approach relevant to real computational problems, for which functionality is the key element of interest. In particular, our thermodynamic framework provides an alternative perspective on the obfuscation of programs of arbitrary length—an important problem in cryptography—as thermalization through recursive mixing of neighboring sections of a circuit, which can be viewed as the mixing of two containers with “gases of gates.” This recursive process equilibrates the average complexity and leads to the saturation of the circuit entropy, while preserving functionality of the overall circuit. The thermodynamic arguments hinge on ergodicity in the space of circuits which we conjecture is limited to disconnected ergodic sectors due to fragmentation. The notion of fragmentation has important implications for the problem of circuit obfuscation as it implies that there are circuits of same size and functionality that cannot be connected via a polynomial number of local moves. Furthermore, we argue that fragmentation is unavoidable unless the complexity classes NP and coNP coincide, a statement that implies the collapse of the polynomial hierarchy of computational complexity theory to its first level.

Science & Technology - Other Topics

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)

Understanding polaronic transport in complex oxides by combining precise synthesis and first-principles many-body theory

In complex oxides, charge carriers often couple strongly with lattice vibrations to form polarons–entangled electron–phonon quasiparticles whose transport properties remain difficult to characterize. Experimental access to intrinsic polaronic transport requires ultraclean samples, while theoretical description demands methods beyond low-order perturbation theory. Here, we show a predictive theory–experiment workflow to study polaron transport in complex oxides. Focusing on a prototypical polaronic oxide, anatase TiO 2 , we combine growth of high-quality oxygen-vacancy-doped films using hybrid molecular beam epitaxy with a first-principles electron–phonon diagrammatic Monte-Carlo (FEP-DMC) framework recently developed for accurate polaron predictions. Our films exhibit record-high electron mobility for anatase TiO 2 , in excellent agreement with FEP-DMC calculations conducted prior to experiment, which predict a room-temperature mobility of 45 ± 15 cm −2 V −1 s −1 and a mobility-temperature scaling of μ ∝ T −1.9 ± 0.077 . Microscopic analysis using scanning transmission electron microscopy and x-ray photoelectron spectroscopy reveals the role of oxygen vacancies in modulating transport at lower temperatures. FEP-DMC further provides quantitative insight into polaron formation energy, phonon cloud distribution, lattice distortion around the polaron, and the polaronic contribution to mobility. Together, these results provide a deeper microscopic understanding of large-polaron transport in a complex oxide and provide the blueprint to characterize other polaronic materials.

anatase TiO2

Quantum complexity in gravity, quantum field theory, and quantum information science

Quantum complexity quantifies the difficulty of preparing a state or implementing a unitary transformation with limited resources. Applications range from quantum computation to condensed matter physics and quantum gravity. Here, we seek to bridge the approaches of these fields, which define and study complexity using different frameworks and tools. We describe several definitions of complexity, along with their key properties. In quantum information theory, we focus on complexity growth in random quantum circuits. In quantum many-body systems and quantum field theory (QFT), we discuss a geometric definition of complexity in terms of geodesics on the unitary group. In dynamical systems, we explore a definition of complexity in terms of state or operator spreading, as well as concepts from tensor-networks. We also outline applications to simple quantum systems, quantum many-body models, and QFTs including conformal field theories (CFTs). Finally, we explain the proposed relationship between complexity and gravitational observables within the holographic anti-de Sitter (AdS)/CFT correspondence.

Baiguera, Stefano [Istituto Nazionale di Fisica Nu

Role of pore dilation in molecular transport through the nuclear pore complex: Insights from polymer scaling theory

The nuclear pore complex (NPC), a channel within the nuclear envelope filled with intrinsically disordered proteins, regulates the transport of macromolecules between the nucleus and the cytoplasm. Recent studies have highlighted the NPC’s ability to adjust its diameter in response to the membrane tension, underscoring the importance of exploring how variations in pore size influence molecular transport through the NPC. In this study, we investigated the relationship between pore size and transport rate and proposed a mathematical model describing this connection. We began by theoretically analyzing how the pore size scales with the characteristic dimensions of the mesh-like structure within the pore. By introducing key assumptions about how the meshwork structure influences molecular diffusion, we derived a mathematical expression for the transport rate based on the size of the pore and the transported molecules. To validate our model, we conducted Brownian dynamics simulations using a coarse-grained representation of the NPC. These simulations, performed across a range of pore sizes, demonstrated strong agreement with our model’s predictions, confirming its accuracy and applicability. Our model is specifically tailored for small-to-medium-sized molecules, approximately 5 nanometers in size, making it relevant to a wide range of transcription factors and signaling molecules. It also extends to molecules with weak and transient interactions with FG-Nups, such as importin-β. By presenting this model formula, our study offers a quantitative framework for analyzing the effects of pore dilation on nucleocytoplasmic transport.

Biochemistry & Molecular Biology

Cation-π Bonding in Actinides: UO x + (Benzene) ( x = 0, 1, 2) Complexes Studied with Threshold Photodissociation Spectroscopy and Theory

Cation-π complexes of the form UO x + (benzene) (x = 0, 1, 2) are produced by laser vaporization and cooled in a supersonic molecular beam. These ions are mass selected and studied with UV–visible laser photodissociation spectroscopy. Each of these complexes photodissociates by elimination of the benzene ligand. Above an energetic threshold, the absorption and photodissociation are continuous, indicating a high density of strongly coupled electronic states. The thresholds for the dissociation of each of these three complexes are measured and assigned as their respective bond dissociation energies. The bond energies determined [U + –(benzene): 42.5 ± 0.3 kcal/mol; UO + –(benzene): 41.0 ± 0.3 kcal/mol; UO 2 + –(benzene): 39.7 ± 0.3 kcal/mol] are comparable to those of transition metal ion-benzene complexes. Computational studies at the DFT/B3LYP level complement the experiments, predicting dissociation energies in reasonably good agreement with the experiments. Experiments and theory agree that the U+(benzene) complex is more strongly bound than its corresponding oxide ions. This new thermochemistry on actinide cation-π bonding should stimulate higher-level computational studies on these systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Impact Testing Theories and Techniques Employed at the TA-III Mechanical Shock Complex

We present theories and techniques to support safe, predictable, and efficient impact testing at the Sandia National Laboratories TA-III Mechanical Shock Complex (MSC), located in Building 6570. The two testing instruments used at the MSC are the 20-inch actuator, which is a launcher that propels sleds down an indoor track, and an indoor 6-in bore compressed-gas powered cannon. The theories and techniques presented derive from basic mechanical engineering principles but are significantly informed and validated by testing experience at the MSC.

42 ENGINEERING

Operator origin of anomalous dimensions in de Sitter space

The late-time limit of the power spectrum for heavy (principal series) fields in de Sitter (dS) space yields a series of polynomial terms with complex scaling dimensions. Such scaling behavior is expected to result from an associated operator with a complex dimension. In a free theory, these complex dimensions are known to match the constraints imposed by unitarity on the space of states. Yet, perturbative corrections to the scaling behavior of operators are naively inconsistent with unitary evolution of the quantum fields in dS space. This paper demonstrates how to compute one-loop corrections to the scaling dimensions that appear in the two-point function from the field theory description in terms of local operators. We first show how to evaluate these anomalous dimensions using Mellin space, which has the feature that it naturally accommodates a scaleless regulator. We then explore the consequences for the soft de Sitter effective theory (SdSET) description that emerges in the long wavelength limit. Carefully matching between the UV and SdSET descriptions requires the introduction of novel nondynamical “operators” in the effective theory. This is not only necessary to reproduce results extracted from the Källén-Lehmann representation (that use the space of unitary states directly), but it is also required by general arguments that invoke positivity. Published by the American Physical Society 2025

Cohen, Timothy

Quantum graph learning and algorithms applied in quantum computer sciences and image classification

Graph and network theory play a fundamental role in quantum computer sciences, including quantum information and computation. Random graphs and complex network theory are pivotal in predicting novel quantum phenomena, where entangled links are represented by edges. Quantum algorithms have been developed to enhance solutions for various network problems, giving rise to quantum graph computing and quantum graph learning (QGL). Here, in this review, we explore graph theory and graph learning methods as powerful tools for quantum computers to generate efficient solutions to problems beyond the reach of classical systems. We delve into the development of quantum complex network theory and its applications in quantum computation, materials discovery, and research. We also discuss quantum machine learning (QML) methodologies for effective image classification using qubits, quantum gates, and quantum circuits. Additionally, the paper addresses the challenges of QGL and algorithms, emphasizing the steps needed to develop flexible QGL solvers. This review presents a comprehensive overview of the fields of QGL and QML, highlights recent advancements, and identifies opportunities for future research.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Predictive Complexity of Quantum Subsystems

We define predictive states and predictive complexity for quantum systems composed of distinct subsystems. This complexity is a generalization of entanglement entropy. It is inspired by the statistical or forecasting complexity of predictive state analysis of stochastic and complex systems theory but is intrinsically quantum. Predictive states of a subsystem are formed by equivalence classes of state vectors in the exterior Hilbert space that effectively predict the same future behavior of that subsystem for some time. As an illustrative example, we present calculations in the dynamics of an isotropic Heisenberg model spin chain and show that, in comparison to the entanglement entropy, the predictive complexity better signifies dynamically important events, such as magnon collisions. It can also serve as a local order parameter that can distinguish long and short range entanglement.

Asplund, Curtis T. (ORCID:0000000305575850)

Quantum Algorithms for Representation-Theoretic Multiplicities

Kostka, Littlewood-Richardson, Plethysm, and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory, geometric complexity, and algebraic combinatorics. We give quantum algorithms for computing these coefficients whenever the ratio of dimensions of the representations is polynomial. We show that there is an efficient classical algorithm for computing the Kostka numbers under this restriction and conjecture the existence of an analogous algorithm for the Littlewood-Richardson coefficients. We argue why such classical algorithm does not straightforwardly work for the Plethysm and Kronecker coefficients and conjecture that our quantum algorithms lead to superpolynomial speedups. The conjecture about Kronecker coefficients was disproved by Panova [Polynomial time classical versus quantum algorithms for representation theoretic multiplicities, arXiv:2502.20253] with a classical algorithm which, if optimal, points to a 𝒪⁡(𝑛 4+2⁢𝑘 ) vs $\tilde{Ω}$⁡(𝑛 4⁢𝑘 2 +1 ) polynomial gap in quantum vs classical computational complexity for an integer parameter 𝑘.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Exotic phases in finite-density ℤ 3 theories

Lattice ℤ 3 theories with complex actions share many key features with finite- density QCD including a sign problem and $\mathcal{CK}$ symmetry. Complex ℤ 3 spin and gauge models exhibit a generalized Kramers-Wannier duality mapping them onto chiral ℤ 3 spin and gauge models, which are simulatable with standard lattice methods in large regions of parameter space. The Migdal-Kadanoff real-space renormalization group (RG) preserves this duality, and we use it to compute the approximate phase diagram of both spin and gauge ℤ 3 models in dimensions one through four. Chiral ℤ 3 spin models are known to exhibit a Devil’s Flower phase structure, with inhomogeneous phases that can be thought of as ℤ 3 analogues of chiral spirals. Out of the large class of models we study, we find that only chiral spin models and their duals have a Devil’s Flower structure with an infinite set of inhomogeneous phases, a result we attribute to Elitzur’s theorem. We also find that different forms of the Migdal-Kadanoff RG produce different numbers of phases, a violation of the expectation for universal behavior from a real-space RG. We discuss extensions of our work to ℤ N models, SU(N) models and nonzero temperature.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

Enhancing Distribution System Resilience: A First-Order Meta-RL Algorithm for Critical Load Restoration

The increasing frequency of extreme events and the integration of distributed energy resources (DERs) into modern grids have elevated the need for resilient and efficient critical load restoration strategies in distribution systems. However, the stochastic nature of renewable DERs, limited energy resource availability and the intricate nonlinearities inherent in complex grid control problem make the problem challenging. Although reinforcement learning (RL) and warm-start RL methods have shown promising results, their performance often falls short in rapidly adapting to new, unseen situations and typically requires exhaustive problem-specific tuning. To address these gaps, we propose a First-Order Meta-based RL (FOM-RL) algorithm within an online framework for adaptive and robust critical load restoration. By harnessing local DERs as the enabling technology, FOM-RL allows the RL agent to swiftly adapt to new unseen scenarios by leveraging previously acquired knowledge of different tasks. Experimental results provide evidence that proposed algorithm learns more efficiently and showcases generalization capabilities across diverse set of operational scenarios. Moreover, a rigorous theoretical analysis yields a tight sublinear regret bound, sensitive to temporal variability, with a task-averaged optimality gap bounded by O(VM+D*/(Tsquare root(M))). These results suggest that optimality improves with task similarity and an increased number of tasks M, reaffirming the efficacy and scalability of the proposed approach in addressing the complexities of critical load restoration in distribution systems.

complexity theory