Search NASA⌕ Search

SEARCH · Search NASA

Results for “permutation”

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

Advanced measurement techniques in quantum Monte Carlo: The permutation matrix representation approach

In a typical finite temperature quantum Monte Carlo (QMC) simulation, estimators for simple static observables such as specific heat and magnetization are known. With a great deal of system-specific manual labor, one can sometimes also derive more complicated non-local or even dynamic observable estimators. In contrast, we show that arbitrary static observables can be estimated within the permutation matrix representation (PMR) flavor for any Hamiltonian. We then generalize these results to general imaginary-time correlation functions and non-trivial integrated susceptibilities thereof. Finally, we demonstrate the practical versatility of our method by estimating various non-local, random observables for the transverse-field Ising model on a square lattice and a toy random model.

Permutation matrix representation↗

Permutationally invariant polynomial basis for molecular energy surface fitting via monomial symmetrization.

We describe a procedure to develop a fitting basis for molecular potential energy surfaces (PESs) that is invariant with respect to permutation of like atoms. The method is based on a straightforward symmetrization of a primitive monomial basis and illustrated for several classes of molecules. A numerically efficient method to evaluate the resulting expression for the PES is also described. The fitting basis is used to obtain a new PES for H{sub 3}O{sup +} based on roughly 62000 ab initio energies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Theoretical guarantees for permutation-equivariant quantum neural networks

Despite the great promise of quantum machine learning models, there are several challenges one must overcome before unlocking their full potential. For instance, models based on quantum neural networks (QNNs) can suffer from excessive local minima and barren plateaus in their training landscapes. Recently, the nascent field of geometric quantum machine learning (GQML) has emerged as a potential solution to some of those issues. The key insight of GQML is that one should design architectures, such as equivariant QNNs, encoding the symmetries of the problem at hand. Here, we focus on problems with permutation symmetry (i.e., symmetry group $S_n$), and show how to build $S_n$-equivariant QNNs We provide an analytical study of their performance, proving that they do not suffer from barren plateaus, quickly reach overparametrization, and generalize well from small amounts of data. To verify our results, we perform numerical simulations for a graph state classification task. Our work provides theoretical guarantees for equivariant QNNs, thus indicating the power and potential of GQML.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discriminating chaotic and stochastic dynamics through the permutation spectrum test

In this paper, we propose a new heuristic symbolic tool for unveiling chaotic and stochastic dynamics: the permutation spectrum test. Several numerical examples allow us to confirm the usefulness of the introduced methodology. Indeed, we show that it is robust in situations in which other techniques fail (intermittent chaos, hyperchaotic dynamics, stochastic linear and nonlinear correlated dynamics, and deterministic non-chaotic noise-driven dynamics). We illustrate the applicability and reliability of this pragmatic method by examining real complex time series from diverse scientific fields. Taking into account that the proposed test has the advantages of being conceptually simple and computationally fast, we think that it can be of practical utility as an alternative test for determinism.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Permutationally invariant fitting of intermolecular potential energy surfaces: A case study of the Ne-C 2 H 2 system

Here, the permutation invariant polynomial-neural network (PIP-NN) approach is extended to fit intermolecular potential energy surfaces (PESs). Specifically, three PESs were constructed for the Ne-C 2 H 2 system. PES1 is a full nine-dimensional PIP-NN PES directly fitted to ~42 000 ab initio points calculated at the level of CCSD(T)-F12a/cc-pCVTZ-F12, while the other two consist of the six-dimensional PES for C 2 H 2 [H. Han, A. Li, and H. Guo, J. Chem. Phys. 141, 244312 (2014)] and an intermolecular PES represented in either the PIP (PES2) or PIP-NN (PES3) form. The comparison of fitting errors and their distributions, one-dimensional cuts and two-dimensional contour plots of the PESs, as well as classical trajectory collisional energy transfer dynamics calculations shows that the three PESs are very similar. We conclude that full-dimensional PESs for non-covalent interacting molecular systems can be constructed efficiently and accurately by the PIP-NN approach for both the constituent molecules and intermolecular parts.

74 ATOMIC AND MOLECULAR PHYSICS↗

Permutation invariant polynomial neural network approach to fitting potential energy surfaces. IV. Coupled diabatic potential energy matrices

A machine learning method is proposed for representing the elements of diabatic potential energy matrices (PEMs) with high fidelity. This is an extension of the so-called permutation invariant polynomial-neural network (PIP-NN) method for representing adiabatic potential energy surfaces. While for one-dimensional irreducible representations the diagonal elements of a diabatic PEM are invariant under exchange of identical nuclei in a molecular system, the off-diagonal elements require special symmetry consideration, particularly in the presence of a conical intersection. A multiplicative factor is introduced to take into consideration the particular symmetry properties while maintaining the PIP-NN framework. Here, we demonstrate here that the extended PIP-NN approach is accurate in representing diabatic PEMs, as evidenced by small fitting errors and by the reproduction of absorption spectra and product branching ratios in both H 2 O$(\tilde{X} / \tilde{B})$ and NH 3 $(\tilde{X} $/Ã) non-adiabatic photodissociation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Permutation matrix representation quantum Monte Carlo

We present a quantum Monte Carlo algorithm for the simulation of general quantum and classical many-body models within a single unifying framework. The algorithm builds on a power series expansion of the quantum partition function in its off-diagonal terms and is both parameter-free and Trotter error-free. In our approach, the quantum dimension consists of products of elements of a permutation group. As such, it allows for the study of a very wide variety of models on an equal footing. To demonstrate the utility of our technique, we use it to clarify the emergence of the sign problem in the simulations of non-stoquastic physical models. We showcase the flexibility of our algorithm and the advantages it offers over existing state-of-the-art by simulating transverse- field Ising model Hamiltonians and comparing the performance of our technique against that of the stochastic series expansion algorithm. Furthermore, we also study a transverse-field Ising model augmented with randomly chosen two-body transverse-field interactions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Coherence-Induced Deep Thermalization Transition in Random Permutation Quantum Dynamics

We report a phase transition in the projected ensemble—the collection of postmeasurement wave functions of a local subsystem obtained by measuring its complement. The transition emerges in systems undergoing random permutation dynamics, a type of quantum time evolution wherein computational basis states are shuffled without creating superpositions. It separates a phase exhibiting deep thermalization, where the projected ensemble is distributed over Hilbert space in a maximally entropic fashion (Haar random), from a phase where it is minimally entropic (“classical bit-string ensemble”). Crucially, this deep thermalization transition is invisible to the subsystem’s density matrix, which always exhibits thermalization to infinite temperature across the phase diagram. Through a combination of analytical arguments and numerical simulations, we show that the transition is tuned by the total amount of injected by the input state and the measurement basis, and is exhibited robustly across different microscopic models. Our findings represent a novel form of ergodicity-breaking universality in quantum many-body dynamics, characterized not by a failure of regular thermalization, but rather by a failure of deep thermalization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement and symmetry in permutation-symmetric states

We investigate the relationship between multipartite entanglement and symmetry, focusing on permutation symmetric states. We give a highly intuitive geometric interpretation to entanglement via the Majorana representation, where these states correspond to points on a unit sphere. We use this to show how various entanglement properties are determined by the symmetry properties of the states. The geometric measure of entanglement is thus phrased entirely as a geometric optimization and a condition for the equivalence of entanglement measures written in terms of point symmetries. Finally, we see that different symmetries of the states correspond to different types of entanglement with respect to interconvertibility under stochastic local operations and classical communication.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum tests for the linearity and permutation invariance of Boolean functions

The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is {epsilon}-far from having that property. The performance of the algorithm is judged by how many calls need to be made to the black box in order to determine, with high probability, which of the two alternatives is the case. Here we present two quantum algorithms, the first to determine whether the function is linear and the second to determine whether it is symmetric (invariant under permutations of the arguments). Both require order {epsilon}{sup -2/3} calls to the oracle, which is better than known classical algorithms. In addition, in the case of linearity testing, if the function is linear, the quantum algorithm identifies which linear function it is. The linearity test combines the Bernstein-Vazirani algorithm and amplitude amplification, while the test to determine whether a function is symmetric uses projective measurements and amplitude amplification.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scattering neutrinos, spin models, and permutations

We consider a class of Heisenberg all-to-all coupled spin models inspired by neutrino interactions in a supernova with N degrees of freedom. These models are characterized by a coupling matrix that is relatively simple in the sense that there are only a few, relative to N , nontrivial eigenvalues, in distinction to the classic Heisenberg spin-glass models, leading to distinct behavior in both the high-temperature and low-temperature regimes. When the momenta of the neutrinos are uniform and random in directions, we can calculate the large- N partition function for the quantum Heisenberg model. In particular, the high-temperature partition function predicts a non-Gaussian density of states, providing interesting counterexamples showing the limits of general theorems on the density of states for quantum spin models. We can repeat the same argument for classical Heisenberg models, also known as rotor models, and we find the high-temperature expansion is completely controlled by the eigenvalues of the coupling matrix, and again predicts non-Gaussian behavior for the density of states as long as the number of eigenvalues does not scale linearly with N . Indeed, we derive the amusing fact that these partition functions are essentially the generating function for counting permutations in the high-temperature regime. Finally, for the case relevant to neutrinos in a supernova, we identify the low-temperature phase as a unique state with the direction of the momenta of the neutrino dictating its coherent state in flavor-space, a state we dub the “flavor-momentum-locked” state. Published by the American Physical Society 2025

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Improved Potential Energy Surface of Ozone Constructed Using the Fitting by Permutationally Invariant Polynomial Function

New global potential energy surface for the ground electronic state of ozone is constructed at the complete basis set level of the multireference configuration interaction theory. A method of fitting the data points by analytical permutationally invariant polynomial function is adopted. A small set of 500 points is preoptimized using the old surface of ozone. In this procedure the positions of points in the configuration space are chosen such that the RMS deviation of the fit is minimized. New ab initio calculations are carried out at these points and are used to build new surface. Additional points are added to the vicinity of the minimum energy path in order to improve accuracy of the fit, particularly in the region where the surface of ozone exhibits a shallow van der Waals well. New surface can be used to study formation of ozone at thermal energies and its spectroscopy near the dissociation threshold.

Ayouz, Mehdi↗

Adaptive QM/MM for Molecular Dynamics Simulations: 5. On the Energy-Conserved Permuted Adaptive-Partitioning Schemes

In combined quantum-mechanical/molecular-mechanical (QM/MM) dynamics simulations, the adaptive-partitioning (AP) schemes reclassify atoms on-the-fly as QM or MM in a smooth manner. This yields a mobile QM subsystem with contents that are continuously updated as needed. Here, we tailor the Hamiltonian adaptive many-body correction (HAMBC) proposed by Boreboom et al. [J. Chem. Theory Comput. 2016, 12, 3441] to the permuted AP (PAP) scheme. The treatments lead to the HAMBC-PAP method (HPAP), which both conserves energy and produces accurate solvation structures in the test of “water-in-water” model system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Densely Connected G-invariant Deep Neural Networks with Signed Permutation Representations

We introduce and investigate, for finite groups G, G-invariant deep neural network (GDNN) architectures with ReLU activation that are densely connected- i.e., include all possible skip connections. In contrast to other G-invariant architectures in the literature, the preactivations of theG-DNNs presented here are able to transform by signed permutation representations (signed perm-reps) of G. Moreover, the individual layers of the G-DNNs are not required to be G-equivariant; instead, the preactivations are constrained to be G-equivariant functions of the network input in a way that couples weights across all layers. The result is a richer family of G-invariant architectures never seen previously. We derive an efficient implementation of G-DNNs after a reparameterization of weights, as well as necessary and sufficient conditions for an architecture to be "admissible"- i.e., nondegenerate and inequivalent to smaller architectures. We include code that allows a user to build a G-DNN interactively layer-by-layer, with the final architecture guaranteed to be admissible. We show that there are far more admissible G-DNN architectures than those accessible with the "concatenated ReLU" activation function from the literature. Finally, we apply G-DNNs to two example problems--(1) multiplication in --1, 1} (with theoretical guarantees) and (2) 3D object classification--finding that the inclusion of signed perm-reps significantly boosts predictive performance compared to baselines with only ordinary (i.e., unsigned) perm-reps.

97 MATHEMATICS AND COMPUTING↗

Enhanced Integer Permutation based Genetic Algorithm for Optimization of Tube-Fin Heat Exchanger Circuitry with Splits and Merges

Tube-fin heat exchangers (HXs) are widely used in air-conditioning and heat pump applications. The performance of these heat exchangers is strongly influenced by the refrigerant circuitry. Studies have proved that by optimizing the refrigerant circuitry, the performance of HXs can be significantly improved. In our previous research, an Integer Permutation based Genetic Algorithm (IPGA) was developed to obtain the optimal circuitry designs. Our previous research showed that IPGA demonstrates superior capability to obtain better refrigerant circuitries with lower computational cost than the other methods in literature. And the optimal circuitry designs obtained from IPGA are manufacturable with the available tooling. However, the IPGA developed previously cannot generate designs with splitting and merging of circuits. To remedy this limitation, a new chromosome which can represent circuitry with splitting and merging of circuits is developed. In addition to the six genetic operators implemented previously, two new genetic operators are developed to generate splits and merges. As a result, the enhanced IPGA can explore the solution space more thoroughly than the previous IPGA. A case study using an evaporator from an A-type indoor unit shows that, given the similar capacity improvements obtained from the enhanced IPGA compared with the previous IPGA, the refrigerant pressure drop reduction obtained from the enhanced IPGA is 26.5% compared against 1.0% pressure drop reduction from the previous IPGA. The benchmark of the enhanced IPGA with other methods in literature demonstrates that the enhanced IPGA can generate circuitry designs with performance superior to those obtained from other methods.

LI, Zhenning↗

Late Breaking Results: COPPER: Computation Obfuscation by Producing Permutations for Encoding Randomly

Deployed embedded devices face security risks due to increased ease of physical access to the devices by unauthorized users. Capable adversaries can intercept a device to recover the data in memory, including results of performed sensitive computations. Device owners require data confidentiality on their physically insecure devices. To satisfy this goal we implement a novel method, COPPER (Computation Obfuscation by Producing Permutations for Encoding Randomly), to create data which never exists on the device digitally in plaintext format and which is subsequently used for computation. In this paper we utilize COPPER to calculate a moving average computation on encoded data.

embedded systems↗