Search NASA⌕ Search

SEARCH · Search NASA

Results for “LOGIC”

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,387 records · Page 77

Bound on quantum computation time: Quantum error correction in a critical environment

We obtain an upper bound on the time available for quantum computation for a given quantum computer and decohering environment with quantum error correction implemented. First, we derive an explicit quantum evolution operator for the logical qubits and show that it has the same form as that for the physical qubits but with a reduced coupling strength to the environment. Using this evolution operator, we find the trace distance between the real and ideal states of the logical qubits in two cases. For a super-Ohmic bath, the trace distance saturates, while for Ohmic or sub-Ohmic baths, there is a finite time before the trace distance exceeds a value set by the user.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Recursive encoding and decoding of the noiseless subsystem and decoherence-free subspace

When an environmental disturbance to a quantum system has a wavelength much larger than the system size, all qubits in the system are under the action of the same error operator. The noiseless subsystem and decoherence-free subspace are immune to such collective noise. We construct simple quantum circuits that implement these error-avoiding codes for a small number n of physical qubits. A single logical qubit is encoded with n=3 and 4, while two and three logical qubits are encoded with n=5 and 7, respectively. Recursive relations among subspaces employed in these codes play essential roles in our implementation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

4-Clique network minor embedding for quantum annealers

Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network minor embedding. This method is in contrast to the standard minor embedding technique of using a path of linearly connected qubits in order to represent a logical variable state. The 4-clique minor embedding is possible on Pegasus graph connectivity, which is the native hardware graph for some of the current D-Wave quantum annealers. The Pegasus hardware graph contains many cliques of size 4, making it possible to form a graph composed entirely of paths of connected 4-cliques on which a problem can be minor-embedded. The 4-clique chains come at the cost of additional qubit usage on the hardware graph, but they allow for stronger coupling within each chain, thereby increasing chain integrity, reducing chain breaks, and allow for greater usage of the available energy scale for programming logical problem coefficients on current quantum annealers. The 4-clique minor embedding technique is compared with the standard linear path minor embedding with experiments on two D-Wave quantum annealing processors with Pegasus hardware graphs. We show proof-of-concept experiments where the 4-clique minor embeddings can use weak chain strengths while successfully carrying out the computation of minimizing random all-to-all spin glass problem instances. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Josephson Thermal Memory

In this work, we propose a superconducting thermal memory device that exploits the thermal hysteresis in a flux-controlled temperature-biased superconducting quantum-interference device (SQUID). This system reveals a flux-controllable temperature bistability, which can be used to define two well-distinguishable thermal logic states. We discuss a suitable writing-reading procedure for these memory states. The time of the memory writing operation is expected to be on the order of approximately 0.2 ns for a Nb-based SQUID in thermal contact with a phonon bath at 4.2 K. We suggest a noninvasive readout scheme for the memory states based on the measurement of the effective resonance frequency of a tank circuit inductively coupled to the SQUID. The proposed device paves the way for a practical implementation of thermal logic and computation. The advantage of this proposal is that it represents also an example of harvesting thermal energy in superconducting circuits.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Lorentz symmetry breaking as a quantum field theory regulator

Perturbative expansions of quantum field theories typically lead to ultraviolet (short-distance) divergences requiring regularization and renormalization. Many different regularization techniques have been developed over the years, but most regularizations require severe mutilation of the logical foundations of the theory. In contrast, breaking Lorentz invariance, while it is certainly a radical step, at least does not damage the logical foundations of the theory. I shall explore the features of a Lorentz symmetry breaking regulator in a simple polynomial scalar field theory and discuss its implications. In particular, I shall quantify just 'how much' Lorentz symmetry breaking is required to fully regulate the quantum theory and render it finite. This scalar field theory provides a simple way of understanding many of the key features of Horava's recent article [Phys. Rev. D 79, 084008 (2009)] on 3+1 dimensional quantum gravity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Neural units with time-dependent functionality

We show that the time-resolved dynamics of an underdamped harmonic oscillator can be used to do multifunctional computation, performing distinct computations at distinct times within a single dynamical trajectory. We consider the amplitude of an oscillator whose inputs influence its frequency. The activity of the oscillator at fixed times is a nonmonotonic function of its inputs, so it can solve problems such as XOR that are not linearly separable. The activity of the oscillator at fixed input is a nonmonotonic function of time, so it is multifunctional in a temporal sense, and able to carry out distinct nonlinear computations at distinct times within the same dynamical trajectory. We show that a single oscillator, observed at different times, can act as all of the elementary logic gates and perform binary addition, the latter usually implemented in hardware using five logic gates. We show that a set of n oscillators, observed at different times, can perform an arbitrary number of analog-to-n-bit digital conversions. We also show that oscillators can be trained by gradient descent to perform distinct classification tasks at distinct times. Computing with time-dependent functionality can be done in or out of equilibrium, and suggests a way of reducing the number of parameters or devices required to do nonlinear computations.

97 MATHEMATICS AND COMPUTING↗

Memory states in small arrays of Josephson junctions

Here, we study memory states of a circuit consisting of a small inductively coupled Josephson junction array and introduce basic (write, read, and reset) memory operations logics of the circuit. The presented memory operation paradigm is fundamentally different from conventional single quantum flux operation logics. We calculate stability diagrams of the zero-voltage states and outline memory states of the circuit. We also calculate access times and access energies for basic memory operations.

97 MATHEMATICS AND COMPUTING↗

Exploiting Coherence in Nonlinear Spin-Superfluid Transport

We show how the interference between superfluid spin currents can endow spin circuits with coherent logic functionality. While the hydrodynamic aspects of the linear-response collective spin transport obviate interference features, we focus on the nonlinear regime, where the critical supercurrent is sensitive to the phase accumulated by the condensate in a loop geometry. We propose to control this phase by electrical gating that tunes the spin-condensate coherence length. The nonlinear aspects of the spin superfluidity thus naturally lend themselves to the construction of logic gates, uniquely exploiting the coherence of collective spin currents. Vice versa, this functionality can be used to reveal the fundamental properties of spin superfluids.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Encoding an Oscillator into Many Oscillators

An outstanding challenge for quantum information processing using bosonic systems is Gaussian errors such as excitation loss and added thermal noise errors. Thus, bosonic quantum error correction is essential. Most bosonic quantum error correction schemes encode a finite-dimensional logical qubit or qudit into noisy bosonic oscillator modes. In this case, however, the infinite-dimensional bosonic nature of the physical system is lost at the error-corrected logical level. On the other hand, there are several proposals for encoding an oscillator mode into many noisy oscillator modes. However, these oscillator-into-oscillators encoding schemes are in the class of Gaussian quantum error correction. Therefore, these codes cannot correct practically relevant Gaussian errors due to the established no-go theorems that state that Gaussian errors cannot be corrected by using only Gaussian resources. Here, we circumvent these no-go results and show that it is possible to correct Gaussian errors by using Gottesman-Kitaev-Preskill (GKP) states as non-Gaussian resources. In particular, we propose a non-Gaussian oscillator-into-oscillators code, namely the GKP two-mode squeezing code, and demonstrate that it can quadratically suppress additive Gaussian noise errors in both the position and momentum quadratures except for a small sublogarithmic correction. Furthermore, we demonstrate that our GKP two-mode squeezing code is near optimal in the weak noise limit by proving via quantum information theoretic tools that quadratic noise suppression is optimal when we use two physical oscillator modes. Lastly, in this work we show that our non-Gaussian oscillator encoding scheme can also be used to correct excitation loss and thermal noise errors, which are dominant error sources in many realistic bosonic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ionic Tuning of Cobaltites at the Nanoscale

Control of materials through custom design of ionic distributions is one of the most promising approaches for developing future technologies ranging from spintronic logic and memory devices to energy storage. Perovskites have shown particular promise for ionic-devices due to their high ion mobility and sensitivity to chemical stoichiometry. In this work, we demonstrate control of ion distributions in (La,Sr)CoO3. Commensurate with control of the oxygen stoichiometry, the Co valence and saturation magnetization show a smooth continuous variation. In contrast, magnetoresistance measurements show a sharp, step-wise transition in the magnetic anisotropy and resistivity over the same range of oxygen stoichiometry. These results suggest significant phase separation, with conductive magnetic regions and oxygen-deficient, insulating, non-magnetic regions, forming percolated networks. Indeed, X-ray diffraction identifies oxygen vacancy ordering, including the emergence of Brownmillerite ordering. The unusual appearance of the Brownmillerite phase under ambient temperature is further confirmed by high resolution scanning transmission electron microscopy. This work demonstrates room-temperature ionic control of magnetism, electrical conductivity and crystalline structure, in a 40 nm film, presenting new opportunities for ionic devices that leverage multiple material properties.

thin films, magnetism, xmcd, pnr, STEM, defects↗

Engineering 3D Floquet Codes by Rewinding

Floquet codes are a novel class of quantum error-correcting codes with dynamically generated logical qubits arising from a periodic schedule of noncommuting measurements. We utilize the interpretation of measurements in terms of condensation of topological excitations and the rewinding of measurement sequences to engineer new examples of Floquet codes. In particular, rewinding is advantageous for obtaining a desired set of instantaneous stabilizer groups on both toric and planar layouts. Our first example is a Floquet code with instantaneous stabilizer codes that have the same topological order as the three-dimensional (3D) toric code(s). This Floquet code also exhibits a splitting of the topological order of the 3D toric code under the associated sequence of measurements, i.e., an instantaneous stabilizer group of a single copy of the 3D toric code in one round transforms into an instantaneous stabilizer group of two copies of the 3D toric code up to nonlocal stabilizers in the following round. We further construct boundaries for this 3D code and argue that stacking it with two copies of the 3D subsystem toric code allows for a transversal implementation of the logical non-Clifford controlled-controlled- Z gate. We also show that the coupled-layer construction of the X-cube Floquet code can be modified by a rewinding schedule such that each of the instantaneous stabilizer codes is finite depth equivalent to the X-cube model up to toric codes; the X-cube Floquet code exhibits a splitting of the X-cube model into a copy of the X-cube model and toric codes under the measurement sequence. Our final 3D example is a generalization of the 2D Floquet toric code on the honeycomb lattice to three dimensions, which has instantaneous stabilizer codes with the same topological order as the 3D fermionic toric code. Published by the American Physical Society2024

Physics↗

Optimal parametric discrete event control: Problem and solution

We present a novel optimization problem for discrete event control, similar in spirit to the optimal parametric control problem common in statistical process control. In our problem, we assume a known finite state machine plant model G defined over an event alphabet Sigma so that the plant model language L = L M (G) is prefix closed. We further assume the existence of a base control structure M K , which may be either a finite state machine or a deterministic pushdown machine. If K = L M (M K ), we assume K is prefix closed and that K C L. We associate each controllable transition of M K with a binary variable X 1 ,..., X n middot indicating whether the transition is enabled or not. This leads to a function M K (X 1 , ,...,- , X n ), that returns a new control specification depending upon the values of X 1 ,..., X n middot We exhibit a branch-and-bound algorithm to solve the optimization problem minx 1 x,...x n &maxwwepsiK C(w) such that M K (X 1 ,...,X n ) \= |= and L M (M K (X 1 ,...,- , X n middot)) epsi C(L). Here . is a set of logical assertions on the structure of M K (X 1 , X 1 ,...,- , X n middot), and M K (X 1 ,...,- , X n middot) \= || indicates that M K (X 1 ,...,- , X n ) satisfies the logical assertions; and, C(L) is the set of controllable sublanguages of L 1 .

42 ENGINEERING↗

DriveSense: A Noise-Resilient Framework for Driving Mode Identification

Accurate drive mode classification is essential for enhancing the reliability and predictive maintenance of heavy-duty electric trucks. This study proposes a novel fuzzy logic-based framework, DriveSense, for real-time drive mode classification, addressing key challenges such as sensor noise, transitional behaviors, and computational efficiency. The proposed approach integrates a two-stage filtering pipeline, combining adaptive outlier removal and a dynamic Kalman filter to enhance data quality. A fuzzy inference system with smoothened trapezoidal membership functions is then applied to classify driving modes into standstill, constant speed, acceleration, and deceleration while mitigating the effects of noise and edge cases. Performance evaluation using real-world and simulated drive cycles demonstrates significant improvements in classification accuracy (up to 97.8%), F1-score (up to 0.97), and robustness against noise, while reducing false positives. Comparative analysis against baseline models, demonstrates DriveSense’s superior accuracy and generalizability across diverse driving patterns. The framework’s lightweight and interpretable fuzzy inference engine operates with low computational latency, ensuring compatibility with real-time embedded systems typical of heavy-duty electric trucks. Moreover, DriveSense models transitional behaviors through overlapping fuzzy sets and adaptive borderline classification logic, enabling smooth identification of subtle shifts such as rolling stops or gradual deceleration. These results highlight DriveSense’s potential to enhance predictive maintenance strategies, reduce downtime, and support scalable, fleet-wide diagnostics.

Kumar, Praveen [Oak Ridge National Laboratory (ORN↗

Test results of an ITER relevant FPGA when irradiated with neutrons

The data acquisition and control instrumentation cubicles room of the ITER tokamak will be irradiated with neutrons during the fusion reactor operation. A Virtex-6 FPGA from Xilinx (XC6VLX365T-1FFG1156C) is used on the ATCA-IO-PROCESSOR board, included in the ITER Catalog of I and C products - Fast Controllers. The Virtex-6 is a re-programmable logic device where the configuration is stored in Static RAM (SRAM), functional data stored in dedicated Block RAM (BRAM) and functional state logic in Flip-Flops. Single Event Upsets (SEU) due to the ionizing radiation of neutrons causes soft errors, unintended changes (bit-flips) to the values stored in state elements of the FPGA. The SEU monitoring and soft errors repairing, when possible, were explored in this work. An FPGA built-in Soft Error Mitigation (SEM) controller detects and corrects soft errors in the FPGA configuration memory. Novel SEU sensors with Error Correction Code (ECC) detect and repair the BRAM memories. Proper management of SEU can increase reliability and availability of control instrumentation hardware for nuclear applications. The results of the tests performed using the SEM controller and the BRAM SEU sensors are presented for a Virtex-6 FPGA (XC6VLX240T-1FFG1156C) when irradiated with neutrons from the Portuguese Research Reactor (RPI), a 1 MW nuclear fission reactor operated by IST in the neighborhood of Lisbon. Results show that the proposed SEU mitigation technique is able to repair the majority of the detected SEU errors in the configuration and BRAM memories. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Multi-Label Classification with Constraint-Based Learning for Hierarchical Consistency

We explore the limitations of traditional crossentropy loss in a hierarchical multi-label classification setting and introduce a novel loss function. This function is designed to integrate hierarchical constraints directly into the training process. By incorporating such constraints into the loss, our approach slightly improves the logical consistency of predictions in structured domains. We demonstrate the efficacy of our approach through experiments on primary site and histology classification by using electronic pathology reports. These results show that our proposed hierarchical loss function enhances the model's ability to produce predictions that are logically consistent with the natural data hierarchies, and it slightly improves predictive accuracy. Our framework may be extended to other hierarchical domains, however the performance gains are context specific.

Shivanna, Abhishek [ORNL] (ORCID:0009000665228593)↗

Asynchronous and Distributed Tracking of Time-Varying Fixed Points

NREL researcher Andrey Bernstein discusses asynchronous and distributed tracking of time-varying fixed points as part of the Innovative Optimization and Control Methods for Highly Distributed Autonomous Systems workshop. NREL hosted the workshop to exchange ideas on state-of-the-art control and optimization strategies as well as get feedback on work being done at NREL.

97 MATHEMATICS AND COMPUTING↗

Sparse matrix-vector multiplication on a reconfigurable supercomputer

Double precision floating point Sparse Matrix-Vector Multiplication (SMVM) is a critical computational kernel used in iterative solvers for systems of sparse linear equations. The poor data locality exhibited by sparse matrices along with the high memory bandwidth requirements of SMVM result in poor performance on general purpose processors. Field Programmable Gate Arrays (FPGAs) offer a possible alternative with their customizable and application-targeted memory sub-system and processing elements. In this work we investigate two separate implementations of the SMVM on an SRC-6 MAPStation workstation. The first implementation investigates the peak performance capability, while the second implementation balances the amount of instantiated logic with the available sustained bandwidth of the FPGA subsystem. Both implementations yield the same sustained performance with the second producing a much more efficient solution. The metrics of processor and application balance are introduced to help provide some insight into the efficiencies of the FPGA and CPU based solutions explicitly showing the tight coupling of the available bandwidth to peak floating point performance. Due to the FPGA's ability to balance the amount of implemented logic to the available memory bandwidth it can provide a much more efficient solution. Finally, making use of the lessons learned implementing the SMVM, we present an fully implemented nonpreconditioned Conjugate Gradient Algorithm utilizing the second SMVM design.

97 MATHEMATICS AND COMPUTING↗