Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “codes”

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 1,171 records · Page 65

The cis-regulatory codes of response to combined heat and drought stress in Arabidopsis thaliana

Abstract Plants respond to their environment by dynamically modulating gene expression. A powerful approach for understanding how these responses are regulated is to integrate information about cis-regulatory elements (CREs) into models called cis-regulatory codes. Transcriptional response to combined stress is typically not the sum of the responses to the individual stresses. However, cis-regulatory codes underlying combined stress response have not been established. Here we modeled transcriptional response to single and combined heat and drought stress in Arabidopsis thaliana. We grouped genes by their pattern of response (independent, antagonistic and synergistic) and trained machine learning models to predict their response using putative CREs (pCREs) as features (median F-measure = 0.64). We then developed a deep learning approach to integrate additional omics information (sequence conservation, chromatin accessibility and histone modification) into our models, improving performance by 6.2%. While pCREs important for predicting independent and antagonistic responses tended to resemble binding motifs of transcription factors associated with heat and/or drought stress, important synergistic pCREs resembled binding motifs of transcription factors not known to be associated with stress. These findings demonstrate how in silico approaches can improve our understanding of the complex codes regulating response to combined stress and help us identify prime targets for future characterization.

Azodi, Christina B.↗

Why don't we share data and code? Perceived barriers and benefits to public archiving practices

The biological sciences community is increasingly recognizing the value of open, reproducible and transparent research practices for science and society at large. Despite this recognition, many researchers fail to share their data and code publicly. This pattern may arise from knowledge barriers about how to archive data and code, concerns about its reuse, and misaligned career incentives. Here, we define, categorize and discuss barriers to data and code sharing that are relevant to many research fields. We explore how real and perceived barriers might be overcome or reframed in the light of the benefits relative to costs. By elucidating these barriers and the contexts in which they arise, we can take steps to mitigate them and align our actions with the goals of open science, both as individual scientists and as a scientific community.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Multispin Clifford codes for angular momentum errors in spin systems

The physical symmetries of a system play a central role in quantum error correction. Here, in this work we encode a qubit in a collection of systems with angular momentum symmetry (spins), extending the tools developed by Gross for single large spins. By considering large spins present in atomic systems and focusing on their collective symmetric subspace, we develop codes with octahedral symmetry capable of correcting errors up to second order in angular momentum operators. These errors include the most physically relevant noise sources such as microwave control errors and optical pumping. We additionally explore qubit codes that exhibit distance scaling commensurate with the surface code while permitting transversal single-qubit Clifford operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Finite-temperature topological order in two-dimensional topological color codes

In this work the topological order at finite temperature in two-dimensional color code is studied. The topological entropy is used to measure the behavior of the topological order. Topological order in color code arises from the colored string-net structures. By imposing the hard constrained limit the exact solution of the entanglement entropy becomes possible. For finite size systems, by raising the temperature, one type of string-net structure is thermalized and the associative topological entropy vanishes. In the thermodynamic limit the underlying topological order is fragile even at very low temperatures. Taking first the thermodynamic limit and then the zero-temperature limit and vice versa does not commute, and their difference is related only to the topology of regions. The contribution of the colors and symmetry of the model in the topological entropy is also discussed. It is shown how the gauge symmetry of the color code underlies the topological entropy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Overcoming a limitation of deterministic dense coding with a nonmaximally entangled initial state

Under two-party deterministic dense coding, Alice communicates (perfectly distinguishable) messages to Bob via a qudit from a pair of entangled qudits in pure state |{Psi}>. If |{Psi}> represents a maximally entangled state (i.e., each of its Schmidt coefficients is {radical}(1/d)), then Alice can convey to Bob one of d{sup 2} distinct messages. If |{Psi}> is not maximally entangled, then Ji et al. [Phys. Rev. A 73, 034307 (2006)] have shown that under the original deterministic dense-coding protocol, in which messages are encoded by unitary operations performed on Alice's qudit, it is impossible to encode d{sup 2}-1 messages. Encoding d{sup 2}-2 messages is possible; see, for example, the numerical studies by Mozes et al. [Phys. Rev. A 71, 012311 (2005)]. Answering a question raised by Wu et al. [Phys. Rev. A 73, 042311 (2006)], we show that when |{Psi}> is not maximally entangled, the communications limit of d{sup 2}-2 messages persists even when the requirement that Alice encode by unitary operations on her qudit is weakened to allow encoding by more general quantum operators. We then describe a dense-coding protocol that can overcome this limitation with high probability, assuming the largest Schmidt coefficient of |{Psi}> is sufficiently close to {radical}(1/d). In this protocol, d{sup 2}-2 of the messages are encoded via unitary operations on Alice's qudit, and the final (d{sup 2}-1)-th message is encoded via a non-trace-preserving quantum operation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Local equivalence, surface-code states, and matroids

Recently, Ji et al. disproved the local-unitary-local Clifford (LU-LC) conjecture and showed that the local unitary (LU) and local Clifford (LC) equivalence classes of the stabilizer states are not always the same. Despite the fact that this settles the LU-LC conjecture, a sufficient condition for stabilizer states that violate the LU-LC conjecture is not known. In this paper, we investigate further the properties of stabilizer states with respect to local equivalence. Our first result shows that there exist infinitely many stabilizer states that violate the LU-LC conjecture. In particular, we show that for all numbers of qubits n{>=}28, there exist distance-two stabilizer states which are counterexamples to the LU-LC conjecture. We prove that, for all odd n{>=}195, there exist stabilizer states with distance greater than two that are LU equivalent but not LC equivalent. Two important classes of stabilizer states that are of great interest in quantum computation are the cluster states and stabilizer states of the surface codes. We show that, under some minimal restrictions, both these classes of states preclude any counterexamples. In this context, we also show that the associated surface codes do not have any encoded non-Clifford transversal gates. We characterize the Calderbank-Shor-Steane (CSS) surface-code states in terms of a class of minor closed binary matroids. In addition to making a connection to an important open problem in binary matroid theory, this characterization does in some cases provide an efficient test for CSS states that are not counterexamples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Two-dimensional color-code quantum computation

We describe in detail how to perform universal fault-tolerant quantum computation on a two-dimensional color code, making use of only nearest neighbor interactions. Three defects (holes) in the code are used to represent logical qubits. Triple-defect logical qubits are deformed into isolated triangular sections of color code to enable transversal implementation of all single logical qubit Clifford group gates. Controlled-NOT (CNOT) is implemented between pairs of triple-defect logical qubits via braiding.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal superdense coding over memory channels

We study the superdense coding capacity in the presence of quantum channels with correlated noise. We investigate both the cases of unitary and nonunitary encoding. Pauli channels for arbitrary dimensions are treated explicitly. The superdense coding capacity for some special channels and resource states is derived for unitary encoding. We also provide an example of a memory channel where nonunitary encoding leads to an improvement in the superdense coding capacity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Restricted Boltzmann machines and matrix product states of one-dimensional translationally invariant stabilizer codes

We discuss the relations between restricted Boltzmann machine (RBM) states and the matrix product states (MPS) for the ground states of 1D translational invariant stabilizer codes. A generic translational invariant and finitely connected RBM state can be expressed as an MPS, and the matrices of the resulting MPS are of rank 1. We dub such an MPS as an RBM-MPS. This provides a necessary condition for exactly realizing a quantum state as an RBM state, if the quantum state can be written as an MPS. For generic 1D stabilizer codes having a nondegenerate ground state with periodic boundary condition, we obtain an expression for the lower bound of their MPS bond dimension, and an upper bound for the rank of their MPS matrices. In terms of RBM, we provide an algorithm to derive the RBM for the cocycle Hamiltonians whose MPS matrices are proved to be of rank 1. Moreover, the RBM-MPS produced by our algorithm has the minimal bond dimension. A family of examples is provided to explain the algorithm. Furthermore, we finally conjecture that these features hold true for all the 1D stabilizer codes having a nondegenerate ground state with periodic boundary condition, as long as their MPS matrices are of rank 1.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Production of energetic light fragments in extensions of the CEM and LAQGSM event generators of the Monte Carlo transport code MCNP6 [Production of energetic light fragments in CEM, LAQGSM, and MCNP6]

We extend the cascade-exciton model (CEM), and the Los Alamos version of the quark-gluon string model (LAQGSM), event generators of the Monte Carlo N-particle transport code version 6 (MCNP6), to describe production of energetic light fragments (LF) heavier than 4 He from various nuclear reactions induced by particles and nuclei at energies up to about 1 TeV/nucleon. In these models, energetic LF can be produced via Fermi breakup, preequilibrium emission, and coalescence of cascade particles. Initially, we study several variations of the Fermi breakup model and choose the best option for these models. Then, we extend the modified exciton model (MEM) used by these codes to account for a possibility of multiple emission of up to 66 types of particles and LF (up to 28 Mg) at the preequilibrium stage of reactions. Then, we expand the coalescence model to allow coalescence of LF from nucleons emitted at the intranuclear cascade stage of reactions and from lighter clusters, up to fragments with mass numbers A ≤ 7, in the case of CEM, and A ≤ 12, in the case of LAQGSM. Next, we modify MCNP6 to allow calculating and outputting spectra of LF and heavier products with arbitrary mass and charge numbers. The improved version of CEM is implemented into MCNP6. Lastly, we test the improved versions of CEM, LAQGSM, and MCNP6 on a variety of measured nuclear reactions. The modified codes give an improved description of energetic LF from particle- and nucleus-induced reactions; showing a good agreement with a variety of available experimental data. They have an improved predictive power compared to the previous versions and can be used as reliable tools in simulating applications involving such types of reactions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Code package for calculating modified cosmic ionization and thermal histories with dark matter and other exotic energy injections

Here we present a new public Python package, DarkHistory, for computing the effects of dark matter annihilation and decay on the temperature and ionization history of the early universe. DarkHistory simultaneously solves for the evolution of the free electron fraction and gas temperature, and for the cooling of annihilation/decay products and the secondary particles produced in the process. Consequently, we can self-consistently include the effects of both astrophysical and exotic sources of heating and ionization, and automatically take into account backreaction, where modifications to the ionization/temperature history in turn modify the energy-loss processes for injected particles. We introduce a number of worked examples, demonstrating how to use the code in a range of different configurations, in particular for arbitrary dark matter masses and annihilation/decay final states. Possible applications of DarkHistory include mapping out the effects of dark matter annihilation/decay on the global 21 cm signal and the epoch of reionization, as well as the effects of exotic energy injections other than dark matter annihilation/decay. The code is available at https://github.com/hongwanliu/DarkHistory with documentation at https://darkhistory.readthedocs.io. Data files required to run the code can be downloaded at https://doi.org/10.7910/DVN/DUOUWA.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Numerical relativity for D dimensional axially symmetric space-times: Formalism and code tests

The numerical evolution of Einstein's field equations in a generic background has the potential to answer a variety of important questions in physics: from applications to the gauge-gravity duality, to modeling black hole production in TeV gravity scenarios, to analysis of the stability of exact solutions, and to tests of cosmic censorship. In order to investigate these questions, we extend numerical relativity to more general space-times than those investigated hitherto, by developing a framework to study the numerical evolution of D dimensional vacuum space-times with an SO(D-2) isometry group for D{>=}5, or SO(D-3) for D{>=}6. Performing a dimensional reduction on a (D-4) sphere, the D dimensional vacuum Einstein equations are rewritten as a 3+1 dimensional system with source terms, and presented in the Baumgarte, Shapiro, Shibata, and Nakamura formulation. This allows the use of existing 3+1 dimensional numerical codes with small adaptations. Brill-Lindquist initial data are constructed in D dimensions and a procedure to match them to our 3+1 dimensional evolution equations is given. We have implemented our framework by adapting the Lean code and perform a variety of simulations of nonspinning black hole space-times. Specifically, we present a modified moving puncture gauge, which facilitates long-term stable simulations in D=5. We further demonstrate the internal consistency of the code by studying convergence and comparing numerical versus analytic results in the case of geodesic slicing for D=5, 6.

79 ASTRONOMY AND ASTROPHYSICS↗

Dynamics of genetic code evolution: The emergence of universality

We study the dynamics of genetic code evolution. The model of Vetsigian et al. [Proc. Natl. Acad. Sci. USA 103, 10696 (2006)] and Vetsigian [Collective evolution of biological and physical systems, Ph.D. thesis, 2005] uses the mechanism of horizontal gene transfer to demonstrate convergence of the genetic code to a near universal solution. We reproduce and analyze the algorithm as a dynamical system. All the parameters used in the model are varied to assess their impact on convergence and optimality score. We show that by allowing specific parameters to vary with time, the solution exhibits attractor dynamics. Finally, we study automorphisms of the genetic code arising due to this model. We use this to examine the scaling of the solutions to re-examine universality and find that there is a direct link to mutation rate.

59 BASIC BIOLOGICAL SCIENCES↗

Optimizing the FEDVR-TDCC Code for Exploring the Quantum Dynamics of Two-Electron Systems in Intense Laser Pulses

To efficiently solve the three-dimensional (3D) time-dependent linear and nonlinear Schrödinger equation, we have developed a large-scale parallel code RSP-FEDVR [B. I. Schneider, L. A. Collins, and S. X. Hu, Phys. Rev. E 73, 036708 (2006)], which combines the finite-element discrete variable representation (FEDVR) with the real-space product algorithm. Using the similar algorithm, we have derived an accurate approach to solve the time-dependent close-coupling (TDCC) equation for exploring two-electron dynamics in linearly polarized intense laser pulses. However, when the number N of partial waves used for the TDCC expansion increases, the FEDVR-TDCC code unfortunately slows down, because the potential-matrix operation scales as ~O(N^2). In this paper, we show that the full potential-matrix operation can be decomposed into a series of small-matrix operations utilizing the sparse property of the N N potential matrix. Such optimization speeds up the FEDVR-TDCC code by an order of magnitude for N=256. This may facilitate the ultimate solution to the 3D two-electron quantum dynamics in ultrashort intense optical laser pulses, where a large number of partial waves are required.

Hu, S X↗

Flag Gadgets Based on Classical Codes

Fault-tolerant syndrome extraction is a key ingredient in implementing fault-tolerant quantum computation. While conventional methods use a number of extra qubits that are linear in the weight of the syndrome, several improvements have been introduced using flag gadgets. In this work, we develop a framework to design flag gadgets using classical codes. Using this framework, we show how to perform fault-tolerant syndrome extraction for any stabilizer code with arbitrary distance using exponentially fewer qubits than conventional methods when qubit measurement and reset are relatively slow compared to a round of error correction. In particular, our method requires only ( 2 t + 1 ) t ⌈ log 2 ( w ) ⌉ flag qubits to fault-tolerantly measure a weight- w stabilizer. We further take advantage of the saving provided by our construction to fault-tolerantly measure multiple stabilizers using a single gadget and show that it maintains the same exponential advantage when it is used to fault-tolerantly extract the syndromes of quantum low-density parity-check codes. Using the developed framework, we perform computer-assisted search to find several small examples where our constructions reduce the number of qubits required. These small examples may be relevant to near-term experiments on small-scale quantum computers. Published by the American Physical Society 2024

Anker, Benjamin↗

Modeling betatron radiation using particle-in-cell codes for plasma wakefield accelerator diagnostics

The analysis of plasma wakefield acceleration experimental measurements, particularly in the characterization of photons emitted through the betatron radiation mechanism, requires the development of accurate numerical models. These computational models are crucial for supporting modern instrumentation designed to measure the single-shot, double-differential angular-energy radiation spectra resulting from interactions between beams and plasmas. Motivated by the needs of such applications, this paper presents detailed numerical models of betatron radiation generated in beam-plasma acceleration experiments. These models are based on the integration of the Liénard-Wiechert (LW) potentials, applied to computed particle trajectories. The particle trajectories are generated using three distinct methods: first, by tracking particles through idealized fields in the blowout regime of PWFA; second, by obtaining trajectories using the fast quasistatic particle-in-cell (PIC) code quickpic; and third, obtaining trajectories from the fully self-consistent PIC code osiris. To ensure the accuracy and reliability of these models, the paper includes various benchmark tests using analytical expressions, as well as employing the PIC code epoch, which takes an alternative approach by using a Monte Carlo quantum electrodynamics (QED)-based radiation model. Additionally, the paper presents simulations of the expected experimental betatron radiation spectra, taking into account parameters relevant to PWFA and plasma photocathode experiments at the SLAC FACET-II facility.

Yadav, M. [University of California, Los Angeles, ↗

HipGISAXS : a high-performance computing code for simulating grazing-incidence X-ray scattering data

This article describes the development of a flexible grazing-incidence small-angle X-ray scattering (GISAXS) simulation code in the framework of the distorted wave Born approximation that effectively utilizes the parallel processing power provided by graphics processors and multicore processors. The code, entitled High-Performance GISAXS , computes the GISAXS image for any given superposition of user-defined custom shapes or morphologies in a material and for various grazing-incidence angles and sample orientations. These capabilities permit treatment of a wide range of possible sample structures, including multilayered polymer films and nanoparticles on top of or embedded in a substrate or polymer film layers. In cases where the material displays regions of significant refractive index contrast, an algorithm has been implemented to perform a slicing of the sample and compute the averaged refractive index profile to be used as the reference geometry of the unperturbed system. A number of case studies are presented, which demonstrate good agreement with the experimental data for a variety of polymer and hybrid polymer/nanoparticle composite materials. The parallelized simulation code is well suited for addressing the analysis efforts required by the increasing amounts of GISAXS data being produced by high-speed detectors and ultrafast light sources.

Chemistry↗

The FEFF code

FEFF is a real-space multiple-scattering Green’s function code for simulating a variety of X-ray spectroscopies as well as ground-state and excited-state electronic structure. It is perhaps best known for its use in extended X-ray absorption fine-structure (EXAFS) calculations, particularly within various analysis codes such as DEMETER and LARCH. In addition to EXAFS, FEFF can also be used to calculate X-ray absorption near-edge structure (XANES), X-ray emission spectroscopy (XES), electron energy loss spectra (EELS) and many other spectroscopic quantities. Here, the basic approach used for the calculations is described, focusing on the most important approximations and aspects of the simulations. Here, the capabilities of the FEFF code, including those of the Java-based graphical user interface JFEFF, are also briefly described.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗