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,639 records · Page 91

Entanglement-assisted random access codes

An (n,m,p) random access code (RAC) makes it possible to encode n bits in an m-bit message in such a way that a receiver of the message can guess any of the original n bits with probability p greater than (1/2). In quantum RACs (QRACs), one transmits n qubits. The full set of primitive entanglement-assisted random access codes (EARACs) is introduced, in which parties are allowed to share a two-qubit singlet. It is shown that via a concatenation of these, one can build for any n an (n,1,p) EARAC. QRACs for n>3 exist only if parties also share classical randomness. We show that EARACs outperform the best of known QRACs not only in the success probabilities but also in the amount of communication needed in the preparatory stage of the protocol. Upper bounds on the performance of EARACs are given and shown to limit also QRACs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Construction of [[n,n-4,3]]{sub q} quantum codes for odd prime power q

For each odd prime power q, let 4{<=}n{<=}q{sup 2}+1. Hermitian self-orthogonal [n,2,n-1] codes over F{sub q}{sup 2} with dual distance three are constructed by using finite field theory. Hence, [[n,n-4,3]]{sub q} quantum maximal-distance-separable (MDS) codes for 4{<=}n{<=}q{sup 2}+1 are obtained.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum error correction with degenerate codes for correlated noise

We introduce a quantum packing bound on the minimal resources required by nondegenerate error-correction codes for any kind of noise. We prove that degenerate codes can outperform nondegenerate ones in the presence of correlated noise, by exhibiting examples where the quantum packing bound is violated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Local non-Calderbank-Shor-Steane quantum error-correcting code on a three-dimensional lattice

We present a family of non-Calderbank-Shor-Steane quantum error-correcting code consisting of geometrically local stabilizer generators on a 3D lattice. We study the Hamiltonian constructed from ferromagnetic interaction of overcomplete set of local stabilizer generators. The degenerate ground state of the system is characterized by a quantum error-correcting code whose number of encoded qubits are equal to the second Betti number of the manifold. These models (i) have solely local interactions; (ii) admit a strong-weak duality relation with an Ising model on a dual lattice; (iii) have topological order in the ground state, some of which survive at finite temperature; and (iv) behave as classical memory at finite temperature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Topological order and entanglement dynamics in the measurement-only XZZX quantum code

We examine the dynamics of a ( 1 + 1 ) -dimensional measurement-only circuit defined by the stabilizers of the [[5,1,3]] quantum error correcting code interrupted by single-qubit Pauli measurements. The code corrects arbitrary single-qubit errors and it stabilizes an area law entangled state with a D 2 = Z 2 × Z 2 symmetry protected topological (SPT) order, as well as a symmetry breaking (SB) order from a twofold bulk degeneracy. The Pauli measurements break the topological order and induce a phase transition into a trivial area law phase. Allowing more than one type of Pauli measurement increases the measurement-induced frustration and the SPT and SB order can be broken either simultaneously or separately at nonzero measurement rate. This yields a rich phase diagram and unanticipated critical behavior at the phase transitions. Although the correlation length exponent ν = 4 3 and the dynamical critical exponent z = 1 are consistent with bond percolation, the prefactor of the logarithmic entanglement growth may take noninteger multiples of the percolation value. Remarkably, we identify a robust transient scaling regime for the purification dynamics of L qubits. It reveals a modified dynamical critical exponent z * ≠ z , which is observable up to times t ~ L z * and is reminiscent of the relaxation of critical systems into a prethermal state.

36 MATERIALS SCIENCE↗

Towards a gauge-polyvalent numerical relativity code

The gauge polyvalence of a new numerical code is tested, both in harmonic-coordinate simulations (gauge-waves test bed) and in singularity-avoiding coordinates (simple black-hole simulations, either with or without shift). The code is built upon an adjusted first-order flux-conservative version of the Z4 formalism and a recently proposed family of robust finite-difference high-resolution algorithms. An outstanding result is the long-term evolution (up to 1000M) of a black hole in normal coordinates (zero shift) without excision.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Self-force with (3+1) codes: A primer for numerical relativists

Prescriptions for numerical self-force calculations have traditionally been designed for frequency-domain or (1+1) time-domain codes which employ a mode decomposition to facilitate in carrying out a delicate regularization scheme. This has prevented self-force analyses from benefiting from the powerful suite of tools developed and used by numerical relativists for simulations of the evolution of comparable-mass black hole binaries. In this work, we revisit a previously-introduced (3+1) method for self-force calculations and demonstrate its viability by applying it to the test case of a scalar charge moving in a circular orbit around a Schwarzschild black hole. Two (3+1) codes originally developed for numerical relativity applications were independently employed, and in each we were able to compute the two independent components of the self-force and the energy flux correctly to within <1%. We also demonstrate consistency between the t component of the self-force and the scalar energy flux. Our results constitute the first successful calculation of a self-force in a (3+1) framework, and thus open opportunities for the numerical relativity community in self-force analyses and the perturbative modeling of extreme-mass-ratio inspirals.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Higher-dimensional numerical relativity: Formulation and code tests

We derive a formalism of numerical relativity for higher-dimensional spacetimes and develop numerical codes for simulating a wide variety of five-dimensional (5D) spacetimes for the first time. First, the Baumgarte-Shapiro-Shibata-Nakamura formalism is extended for arbitrary spacetime dimensions D{>=}4, and then, the so-called cartoon method, which was originally proposed as a robust method for simulating axisymmetric 4D spacetimes, is described for 5D spacetimes of several types of symmetries. Implementing 5D numerical relativity codes with the cartoon methods, we perform test simulations by evolving a 5D Schwarzschild spacetime and a 5D spacetime composed of a gravitational-wave packet of small amplitude. The numerical simulations are stably performed for a sufficiently long time, as done in the 4D case, and the obtained numerical results agree well with the analytic solutions: The numerical solutions are shown to converge at the correct order. We also confirm that a long-term accurate evolution of the 5D Schwarzschild spacetime is feasible using the so-called puncture approach. In addition, we derive the Landau-Lifshitz pseudotensor in arbitrary dimensions, and show that it gives a robust tool for computing the energy flux of gravitational waves. The formulations and methods developed in this paper provide a powerful tool for studying nonlinear dynamics of higher-dimensional gravity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Axisymmetric generalized harmonic evolution code

We describe the first axisymmetric numerical code based on the generalized harmonic formulation of the Einstein equations, which is regular at the axis. We test the code by investigating gravitational collapse of distributions of complex scalar field in a Kaluza-Klein spacetime. One of the key issues of the harmonic formulation is the choice of the gauge source functions, and we conclude that a damped-wave gauge is remarkably robust in this case. Our preliminary study indicates that evolution of regular initial data leads to formation both of black holes with spherical and cylindrical horizon topologies. Intriguingly, we find evidence that near threshold for black hole formation the number of outcomes proliferates. Specifically, the collapsing matter splits into individual pulses, two of which travel in the opposite directions along the compact dimension and one which is ejected radially from the axis. Depending on the initial conditions, a curvature singularity develops inside the pulses.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers

We reformulate the continuous-space Schrödinger equation in terms of spin Hamiltonians. For the kinetic energy operator, the critical concept facilitating the reduction in model complexity is the idea of position encoding. A binary encoding of position produces a spin-1/2 Heisenberg-like model and yields exponential improvement in space complexity when compared to classical computing. Encoding with a binary reflected Gray code (BRGC), and a Hamming-distance-2 Gray code (H2GC) reduces the model complexity down to the 𝑋⁢𝑍 and transverse Ising model, respectively. For 𝐴 qubits BRGC yields 2 𝐴 positions and is reduced to its 2-local form with O⁡(𝐴) ancillary qubits. H2GC yields 2 𝐴/2+1 positions with O⁡(𝐴 2 ) three-local penalty terms. We also identify the bijective mapping between diagonal unitaries and the Walsh series, producing the mapping of any real potential to a series of 𝑘 -local Ising models through the fast Walsh transform. Finally, in a finite volume, we provide some numerical evidence to support the claim that the total time needed for adiabatic evolution is protected by the infrared cutoff of the system. As a result, initial state preparation from a free-field wave function to an interacting system is expected to exhibit polynomial time complexity with volume and constant scaling with respect to lattice discretization for all encodings. For H2GC, if the evolution starts with the transverse Hamiltonian due to hardware restrictions, then penalties are dynamically introduced such that the low-lying spectrum reproduces the energy levels of the Laplacian. The adiabatic evolution of the penalty Hamiltonian is therefore sensitive to the ultraviolet scale. It is expected to exhibit polynomial time complexity with lattice discretization, or exponential time complexity with respect to the number of qubits given a fixed volume.

97 MATHEMATICS AND COMPUTING↗

Hexagonal Uniformly Redundant Arrays (HURAs) for scintillator based coded aperture neutron imaging

A series of Monte Carlo simulations have been conducted, making use of the EJ-426 neutron scintillator detector, to investigate the potential of using hexagonal uniformly redundant arrays (HURAs) for scintillator based coded aperture neutron imaging. This type of scintillator material has a low sensitivity to gamma rays, therefore, is of particular use in a system with a source that emits both neutrons and gamma rays. The simulations used an AmBe source, neutron images have been produced using different coded-aperture materials (boron- 10, cadmium-113 and gadolinium-157) and location error has also been estimated. In each case the neutron image clearly shows the location of the source with a relatively small location error. Neutron images with high resolution can be easily used to identify and locate nuclear materials precisely in nuclear security and nuclear decommissioning applications. (authors)

42 ENGINEERING↗

OPEN-CODE, REAL-TIME EMULATION TESTBED OF GRID-CONNECTED TYPE-3 WIND TURBINE SYSTEM WITH HARDWARE VALIDATION

This paper presents the design and development of an open-code Type-3 wind turbine virtual-testbed for real-time simulations. The proposed testbed includes the bare code for all the models required to emulate a Type-3 wind turbine system: the Doubly-Fed Induction Generator (DFIG) dynamic model, single-mass drive train, wind turbine system, and average model of the back to back power. This testbed can be executed in PC-layer for offline simulations or can be executed in real-time on the National Instruments (NI)-CompactRIO (cRIO) platform. The discrete-time models are implemented on the Field Programmable Gate Array (FPGA), using LabVIEW, and validated against a physical hardware setup. The emulated stator and rotor currents and DC-link voltage are compared against physical measurements creating a validated platform independent from third-party models and suitable for applications in real-time. The proposed testbed is intended to be available to researchers, wind turbine manufacturers, and utility companies to perform tests using a validated platform to verify proposed control designs of DFIG wind turbines.

Ferrari Maglia, Max↗

A Co-Design Study Of Fusion Whole Device Modeling Using Code Coupling

Complex workflows consisting of multiple simulation and analysis codes running concurrently through in-memory coupling is becoming popular due to inherent advantages in online management of large-scale data, resilience, and the code development process. However, orchestrating such a multi-application workflow to efficiently utilize resources on a heterogeneous architecture is challenging. In this paper, we present our results with running the Fusion Whole Device Modeling benchmark workflow on Summit, a pre-exascale supercomputer at Oak Ridge National Laboratory. We explore various resource distribution and process placement mechanisms, including sharing compute nodes between processes from separate applications. We show that fine-grained process placement can have a significant impact towards efficient utilization of the compute power of a node on Summit, and conclude that sophisticated tools for performing co-design studies of multi-application workflows can play an important role towards efficient orchestration of such workflows.

Choi, Jong Youl↗

A High-Performance Design for Hierarchical Parallelism in the QMCPACK Monte Carlo code

We introduce a new high-performance design for parallelism within the Quantum Monte Carlo code QMCPACK. We demonstrate that the new design is better able to exploit the hierarchical parallelism of heterogeneous architectures compared to the previous GPU implementation. The new version is able to achieve higher GPU occupancy via the new concept of crowds of Monte Carlo walkers, and by enabling more host CPU threads to effectively offload to the GPU. The higher performance is expected to be achieved independent of the underlying hardware, significantly improving developer productivity and reducing code maintenance costs. Scientific productivity is also improved with full support for fallback to CPU execution when GPU implementations are not available or CPU execution is more optimal.

Luo, Ye↗

Static Graphs for Coding Productivity in OpenACC

The main contribution of this work is to increase the coding productivity for GPU programming by using the concept of Static Graphs. To do so, we have combined the new CUDA Graph API with the OpenACC programming model. We use as test cases a well-known and widely used problems in HPC and AI: the Particle Swarm Optimization. We complement the OpenACC functionality with the use of CUDA Graph, achieving accelerations of more than one order of magnitude, and a performance very close to a reference and optimized CUDA code. Finally, we propose a new specification to incorporate the concept of Static Graphs into the OpenACC specification.

Toledo, Leonel↗

PARVMEC: An Efficient, Scalable Implementation of the Variational Moments Equilibrium Code

The ability to sustain magnetically confined plasma in a state of stable equilibrium is crucial for optimal and cost-effective operations of fusion devices like tokamaks and stellarators. The Variational Moments Equilibrium Code (VMEC) is the de-facto serial application used by fusion scientists to compute magnetohydrodynamics (MHD) equilibria and study the physics of three dimensional plasmas in confined configurations. Modern fusion energy experiments have larger system scales with more interactive experimental workflows, both demanding faster analysis turnaround times on computational workloads that are stressing the capabilities of sequential VMEC. In this paper, we present PARVMEC, an efficient, parallel version of its sequential counterpart, capable of scaling to thousands of processors on distributed memory machines. PARVMEC is a non-linear code, with multiple numerical physics modules, each with its own computational complexity. A detailed speedup analysis supported by scaling results on 1,024 cores of a Cray XC30 supercomputer is presented. Depending on the mode of PARVMEC execution, speedup improvements of one to two orders of magnitude are reported. PARVMEC equips fusion scientists for the first time with a state-of-theart capability for rapid, high fidelity analyses of magnetically confined plasmas at unprecedented scales.

Seal, Sudip K↗

Revisiting Huffman Coding: Toward Extreme Performance on Modern GPU Architectures

Today's high-performance computing (HPC) applications are producing vast volumes of data, which are challenging to store and transfer efficiently during the execution, such that data compression is becoming a critical technique to mitigate the storage burden and data movement cost. Huffman coding is arguably the most efficient Entropy coding algorithm in information theory, such that it could be found as a fundamental step in many modern compression algorithms such as DEFLATE. On the other hand, today's HPC applications are more and more relying on the accelerators such as GPU on supercomputers, while Huffman encoding suffers from low throughput on GPUs, resulting in a significant bottleneck in the entire data processing. In this paper, we propose and implement an efficient Huffman encoding approach based on modern GPU architectures, which addresses two key challenges: (1) how to parallelize the entire Huffman encoding algorithm, including codebook construction, and (2) how to fully utilize the high memory-bandwidth feature of modern GPU architectures. The detailed contribution is fourfold. (1) We develop an efficient parallel codebook construction on GPUs that scales effectively with the number of input symbols. (2) We propose a novel reduction based encoding scheme that can efficiently merge the codewords on GPUs. (3) We optimize the overall GPU performance by leveraging the state-of-the-art CUDA APIs such as Cooperative Groups. (4) We evaluate our Huffman encoder thoroughly using six real-world application datasets on two advanced GPUs and compare with our implemented multi-threaded Huffman encoder. Experiments show that our solution can improve the encoding throughput by up to 5.0x and 6.8x on NVIDIA RTX 5000 and V100, respectively, over the state-of-the-art GPU Huffman encoder, and by up to 3.3x over the multi-thread encoder on two 28-core Xeon Platinum 8280 CPUs.

Tian, Jiannan↗

Soft Syndrome Decoding of Quantum LDPC Codes for Joint Correction of Data and Syndrome Errors

Quantum errors are primarily detected and corrected using the measurement of syndrome information which itself is an unreliable step in practical error correction implementations. Typically, such faulty or noisy syndrome measurements are modeled as a binary measurement outcome flipped with some probability. However, the measured syndrome is in fact a discretized value of the continuous voltage or current values obtained in the physical implementation of the syndrome extraction. In this paper, we use this "soft" or analog information without the conventional discretization step to benefit the iterative decoders for decoding quantum low-density parity-check (QLDPC) codes. Syndrome-based iterative belief propagation (BP) decoders are modified to utilize the syndrome-soft information to successfully correct both data and syndrome errors simultaneously, without repeated measurements. We demonstrate the advantages of extracting the soft information from the syndrome in our improved decoders, not only in terms of comparison of thresholds and logical error rates for quasi-cyclic lifted-product QLDPC code families, but also for faster convergence of iterative decoders. In particular, the new BP decoder with noisy syndrome performs as good as the standard BP decoder under ideal syndrome.

97 MATHEMATICS AND COMPUTING↗