Search NASA⌕ Search

Engineering topics

Nguyen, Thien

Publications and source records attributed to Nguyen, Thien.

8 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Investigation of Point-Contact Strategies for CFD Simulations of Pebble-Bed Reactor Cores

This study numerically investigated the effects of various contact strategies on the thermal hydraulic behavior within a structured bed of 100 explicitly modeled pebbles. Four contact strategies and two thermal hydraulic conditions were considered. The strategies to avoid contact singularities include decreasing the pebble diameter, increasing the pebble diameter, bridging the pebble surfaces near the contact region, and capping the pebble surfaces near the contact region. One strategy, Strategy 3a, which involves bridging with a cylinder equal to 10% of the pebble diameter, was selected as the baseline strategy because it addressed the contact singularity while minimizing the geometric changes that affect the bed porosity. The two thermal hydraulic conditions were full-power operation (Case 1) and pressurized loss of forced cooling or PLOFC (Case 2). Simulations of the conjugate heat transfer within the structured bed were performed using the Reynolds-averaged Navier–Stokes approach with the realizable k-ϵ turbulence model and two-layer all y + wall treatment. The thermal-fluid quantities of interest were compared between the contact strategies for each case. In Case 1, the hydraulic behavior was sensitive to the contact strategy, with large differences in the pressure drop (30%) and volume-average velocity (4%). The thermal behavior was not sensitive, with less than a 0.5% difference across the strategies. To better understand the separate effects of each heat transfer mode, Case 2 was divided into the following subcases: conduction (Case 2a); conduction/radiation (Case 2b); and conduction/radiation/convection (Case 2c). Case 2a represents an early phase of the PLOFC transient. Case 2b represents an intermediate phase of the PLOFC transient, with the pebble temperatures sufficiently high for the radiative heat transfer to be non-negligible. Case 2c represents a late phase of the PLOFC transient after the establishment of the natural circulation of the heat transfer fluid. For Case 2, large differences in the contact strategy were observed only in Case 2a with only conduction. The difference in the maximum pebble temperature was 23% in Case 2a, 2% in Case 2b, and 0.3% in Case 2c.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale

The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. Here, we present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.

Nguyen, Thien↗
DOE OSTI2022

Numerical simulations of noisy quantum circuits for computational chemistry

The opportunities afforded by near-term quantum computers to calculate the ground-state properties of small molecules depend on the structure of the computational ansatz as well as the errors induced by device noise. Here we investigate the behavior of these noisy quantum circuits using numerical simulations to estimate the accuracy and fidelity of the prepared quantum states relative to the ground truth obtained by conventional means. We implement several different types of ansatz circuits derived from unitary coupled cluster theory for the purposes of estimating the ground-state energy of sodium hydride using the variational quantum eigensolver algorithm. We show how relative error in the energy and the fidelity scale with the levels of gate-based noise, the internuclear configuration, the ansatz circuit depth, and the parameter optimization methods.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Scaling quantum approximate optimization on near-term hardware

The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers to potentially demonstrate computational advantage in solving combinatorial optimization problems. However, the viability of the QAOA depends on how its performance and resource requirements scale with problem size and complexity for realistic hardware implementations. Here, we quantify scaling of the expected resource requirements by synthesizing optimized circuits for hardware architectures with varying levels of connectivity. Assuming noisy gate operations, we estimate the number of measurements needed to sample the output of the idealized QAOA circuit with high probability. We show the number of measurements, and hence total time to solution, grows exponentially in problem size and problem graph degree as well as depth of the QAOA ansatz, gate infidelities, and inverse hardware graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

ExaTN: Scalable GPU-Accelerated High-Performance Processing of General Tensor Networks at Exascale

We present ExaTN (Exascale Tensor Networks), a scalable GPU-accelerated C++ library which can express and process tensor networks on shared- as well as distributed-memory high-performance computing platforms, including those equipped with GPU accelerators. Specifically, ExaTN provides the ability to build, transform, and numerically evaluate tensor networks with arbitrary graph structures and complexity. It also provides algorithmic primitives for the optimization of tensor factors inside a given tensor network in order to find an extremum of a chosen tensor network functional, which is one of the key numerical procedures in quantum many-body theory and quantum-inspired machine learning. Numerical primitives exposed by ExaTN provide the foundation for composing rather complex tensor network algorithms. We enumerate multiple application domains which can benefit from the capabilities of our library, including condensed matter physics, quantum chemistry, quantum circuit simulations, as well as quantum and classical machine learning, for some of which we provide preliminary demonstrations and performance benchmarks just to emphasize a broad utility of our library.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Retargetable Optimizing Compilers for Quantum Accelerators via a Multi-Level Intermediate Representation

In this work, we present a multi-level quantum-classical intermediate representation (IR) that enables an optimizing, retargetable compiler for available quantum languages. Our work builds upon the Multi-level Intermediate Representation (MLIR) framework and leverages its unique progressive lowering capabilities to map quantum languages to the LLVM machine-level IR. We provide both quantum and classical optimizations via the MLIR pattern rewriting sub-system and standard LLVM optimization passes, and demonstrate the programmability, compilation, and execution of our approach via standard benchmarks and test cases. In comparison to other standalone language and compiler efforts available today, our work results in compile times that are 1000x faster than standard Pythonic approaches, and 5-10x faster than comparative standalone quantum language compilers. Our compiler provides quantum resource optimizations via standard programming patterns that result in a 10x reduction in entangling operations, a common source of program noise. We see this work as a vehicle for rapid quantum compiler prototyping.

43 PARTICLE ACCELERATORS↗
NASA NTRS2011

Telerobotic Excavator Designed to Compete in NASA's Lunabotics Mining Competition

The second annual NASA Lunabotics Mining competition is to be held in May 23-28, 2011. The goal of the competition is for teams of university level students to design, build, test and compete with a fully integrated lunar excavator on a simulated lunar surface. Our team, named Lunar Solutions I, will be representing Temple University's College of Engineering in the competition. The team's main goal was to build a robot which is able to compete with other teams, and ultimately win the competition. The main challenge of the competition was to build a wireless robot that can excavate and collect a minimum of 10 kilograms of the regolith material within 15 minutes. The robot must also be designed to operate in conditions similar to those found on the lunar surface. The design of the lunar excavator is constrained by a set of requirements determined by NASA and detailed in the competition's rulebook. The excavator must have the ability to communicate with the "main base" wirelessly, and over a Wi-Fi network. Human operators are located at a remote site approximately 60 meters away from the simulated lunar surface upon which the robot must excavate the lunar regolith surface. During the competition, the robot will operate in a separate area from the control room in an area referred to as the "Lunarena." From the control room, the operators will have to control the robot using visual feedback from cameras placed both within the arena and on the robot. Using this visual feedback the human operators control the robots movement using both keyboard and joystick commands. In order to place in the competition, a minimum of 10 kg of regolith material has to be excavated, collected, and dumped into a specific location. For that reason, the robot must be provided with an effective and powerful excavation system. Our excavator uses tracks for the drive system. After performing extensive research and trade studies, we concluded that tracks would be the most effective method for transporting the excavator. When designing the excavation system, we analyzed several design options from the previous year's competition. We decided to use a front loader to collect the material, rather than a conveyer belt system or auger. Many of the designs from last year's competition used a conveyer belt mechanism to mine regolith and dump it into a temporary storage bin place on the robot. Using the front end loader approach allowed us to combine the scooping system and storage unit, which meant that the excavation system required less space.

Nash, Rodney↗