Advanced Manufacturing of High-performance Broadband Graded-index THz Anti-Reflection Coatings
Explore the source record for details and available documents.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
SEARCH · Engineering Papers
Results for “high performance computing, quantum computing”
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.
Thermodynamic stability of a spin microemulsion in Rashba spin-orbit-coupled bosons
Recent finite-temperature numerical simulations have unveiled a quantum “spin” microemulsion analog, found by raising the temperature of a stripe supersolid phase in a Rashba spin-orbit coupled Bose gas. This microemulsion state is a highly correlated, isotropic normal fluid where atoms self-arrange based on their internal pseudospin into patterns that resemble bicontinuous microemulsions. This finding leaves several open questions regarding the broader accessibility of this phase in experiments. Here, we use equilibrium finite-temperature numerical simulations based on a coherent-state path integral representation to perform a computational investigation into the thermodynamic stability of the spin microemulsion state. Numerical simulations emphasize the requirement of a nearly, but not perfectly, isotropic spin-orbit coupling in order to achieve the microemulsion phase in cold-atom experiments. Moreover, the microemulsion state exists independent of miscibility of the pseudospin components and for a wide range of pseudospin population imbalance, suggesting a high degree of flexibility in choosing the atom and hyperfine states in an experimental realization. Lastly, we demonstrate this feasibility by mimicking a Rashba spin-orbit-coupled 87 Rb experiment in an isotropic harmonic trap, where we confirm the microemulsion's existence via its density profile and equilibrium quasimomentum distribution.
Complex Langevin dynamics↗
Towards large-scale quantum optimization solvers with few qubits
Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Quantum signal processing for simulating cold plasma waves
Numerical modeling of radio-frequency waves in plasma with sufficiently high spatial and temporal resolution remains challenging even with modern computers. However, such simulations can be sped up using quantum computers in the future. In this work, we propose how to do such modeling for cold plasma waves, in particular, for an X wave propagating in an inhomogeneous one-dimensional plasma. The wave system is represented in the form of a vector Schrödinger equation with a Hermitian Hamiltonian. Block encoding is used to represent the Hamiltonian through unitary operations that can be implemented on a quantum computer. To perform the modeling, we apply the so-called quantum signal processing algorithm and construct the corresponding circuit. Quantum simulations with this circuit are emulated on a classical computer, and the results show agreement with traditional classical calculations. We also discuss how our quantum circuit scales with the resolution.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Assessing three closed-loop learning algorithms by searching for high-quality quantum control pulses
Designing a high-quality control is crucial for reliable quantum computation. Among the existing approaches, closed-loop leaning control is an effective choice. Its efficiency depends on the learning algorithm employed, thus deserving algorithmic comparisons for its practical applications. Here we assess three representative learning algorithms, including GRadient Ascent Pulse Engineering (GRAPE), improved Nelder-Mead (NMplus), and Differential Evolution (DE), by searching for high-quality control pulses to prepare the Bell state. We first implement each algorithm experimentally in a nuclear magnetic resonance system and then conduct a numerical study considering the impact of some possible significant experimental uncertainties. The experiments report the successful preparation of the high-fidelity target state by the three algorithms, while NMplus converges fastest, and these results coincide with the numerical simulations when potential uncertainties are negligible. However, under certain significant uncertainties, these algorithms possess distinct performance with respect to their resulting precision and efficiency, and DE shows the best robustness. Finally, this study provides insight to aid in the practical application of different closed-loop learning algorithms in realistic physical scenarios.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
TeraChem: A graphical processing unit-accelerated electronic structure package for large-scale ab initio molecular dynamics
TeraChem was born in 2008 with the goal of providing fast on-the-fly electronic structure calculations to facilitate ab initio molecular dynamics studies of large biochemical systems such as photoswitchable proteins and multichromophoric antenna complexes. Originally developed for videogaming applications, graphics processing units (GPUs) offered a low-cost parallel computer architecture that became more accessible for general-purpose GPU computing with the release of CUDA in 2007. The evaluation of the electron repulsion integrals (ERIs) is a major bottleneck in electronic structure codes and provides an attractive target for acceleration on GPUs. Thus, highly efficient routines for evaluation of and contractions between the ERIs and density matrices were implemented in TeraChem. Here, electronic structure methods were developed and implemented to leverage these integral contraction routines, resulting in the first quantum chemistry package designed from the ground up for GPUs. This GPU acceleration makes TeraChem capable of performing large-scale ground and excited state calculations in the gas and condensed phase. Today, TeraChem's speed forms the basis for a suite of quantum chemistry applications, including optimization and dynamics of proteins, automated and interactive chemical discovery tools, and large-scale nonadiabatic dynamics simulations.
74 ATOMIC AND MOLECULAR PHYSICS↗
The road to atomically thin metasurface optics
Abstract The development of flat optics has taken the world by storm. The initial mission was to try and replace conventional optical elements by thinner, lightweight equivalents. However, while developing this technology and learning about its strengths and limitations, researchers have identified a myriad of exciting new opportunities. It is therefore a great moment to explore where flat optics can really make a difference and what materials and building blocks are needed to make further progress. Building on its strengths, flat optics is bound to impact computational imaging, active wavefront manipulation, ultrafast spatiotemporal control of light, quantum communications, thermal emission management, novel display technologies, and sensing. In parallel with the development of flat optics, we have witnessed an incredible progress in the large-area synthesis and physical understanding of atomically thin, two-dimensional (2D) quantum materials. Given that these materials bring a wealth of unique physical properties and feature the same dimensionality as planar optical elements, they appear to have exactly what it takes to develop the next generation of high-performance flat optics.
Brongersma, Mark L.↗
Comparing three generations of D-Wave quantum annealers for minor embedded combinatorial optimization problems
Abstract Quantum annealing (QA) is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. QA in the transverse Ising model, implemented on D-Wave quantum processing units, are available as cloud computing resources. In this study we report concise benchmarks across three generations of D-Wave quantum annealers, consisting of four different devices, for the NP-hard discrete combinatorial optimization problems unweighted maximum clique and unweighted maximum cut on random graphs. The Ising, or equivalently quadratic unconstrained binary optimization, formulation of these problems do not require auxiliary variables for order reduction, and their overall structure and weights are not highly variable, which makes these problems simple test cases to understand the sampling capability of current D-Wave quantum annealers. All-to-all minor embeddings of size 52, with relatively uniform chain lengths, are used for a direct comparison across the Chimera, Pegasus, and Zephyr device topologies. A grid-search over annealing times and the minor embedding chain strengths is performed in order to determine the level of reasonable performance for each device and problem type. Experiment metrics that are reported are approximation ratios for non-broken chain samples, chain break proportions, and time-to-solution for the maximum clique problem instances. How fairly the quantum annealers sample optimal maximum cliques, for instances which contain multiple maximum cliques, is quantified using entropy of the measured ground state distributions. The newest generation of quantum annealing hardware, which has a Zephyr hardware connectivity, performed the best overall with respect to approximation ratios and chain break frequencies.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
HEPCloud Operations at Fermilab—The First Five Years
The HEPCloud Facility at Fermilab has now been in production operation for five years. This facility is a unified provisioning gateway to US high performance computing centers, including NERSC, OLCF, and ALCF, other large supercomputers run by the NSF, and commercial clouds. HEPCloud delivers hundreds of millions of core-hours yearly for CMS. HEPCloud also serves other Fermilab experiments including DUNE, Mu2e, Muon g-2, and NOvA. In this paper we present the practical considerations of operating a distributed facility such as HEPCloud. We also mention some of the interesting research and development that HEPCloud has been used for including GPU-based machine learning inference servers, and tests of Quantum Computing.
Timm, Steven [Fermilab]↗
Putting error bars on density functional theory dataset
This dataset contains submission files and raw output files from high-throughput DFT simulations to analyze the systemic errors in lattice constant, bulk moduli and formation energy predictions for a range of binary and ternary oxides using four exchange correlation functionals (LDA, PBE, PBEsol and vdW-DF-C09). This data was then used as the basis for employing materials informatics methods to predict the expected errors in the lattice constants of the studied compounds. Predicted errors were also used to better the DFT-predicted lattice parameters. Our results emphasize the link between the computed errors and the electron density and hybridization errors of a functional. In essence, these results provide “error bars” for choosing a functional for the creation of high-accuracy, high-throughput datasets as well as avenues for the development of XC functionals with enhanced performance, thereby enabling the accelerated discovery and design of new materials.
36 MATERIALS SCIENCE↗
Solving Large‐Scale Linear Systems of Equations by a Quantum Hybrid Algorithm
Abstract Today's intermediate‐scale quantum computers, although imperfect, already perform computational tasks that are manifestly beyond the capabilities of modern classical supercomputers. However, so far, quantum‐enabled large‐scale solutions have been realized only for limited set of problems. Here a hybrid algorithm based on phase estimation and classical optimization of the circuit width and depth is employed for solving a specific class of large linear systems of equations ubiquitous to many areas of science and engineering. A classification of linear systems based on the entanglement properties of the associated phase‐estimation unitary operation is introduced, enabling a highly efficient search for solutions that is facilitated by a straightforward matrix‐to‐circuit map. A 2 17 ‐dimensional problem is implemented on several IBM quantum computer superconducting quantum processors, a record‐breaking result for a linear system solved by a quantum computer. Demonstrated realisation sets a clear benchmark in the quest for the future quantum speedup in the linear systems of equations solution.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Robust implementation of generative modeling with parametrized quantum circuits
Although the performance of hybrid quantum-classical algorithms is highly dependent on the selection of the classical optimizer and the circuit ansätze, a robust and thorough assessment on-hardware of such features has been missing to date. From the optimizer perspective, the primary challenge lies in the solver’s stochastic nature, and their significant variance over the random initialization. Therefore, a robust comparison requires one to perform several training curves for each solver before one can reach conclusions about their typical performance. Since each of the training curves requires the execution of thousands of quantum circuits in the quantum computer, such a robust study remained a steep challenge for most hybrid platforms available today. In this work, we leverage on Rigetti’s Quantum Cloud Services (QCS™) to overcome this implementation barrier, and we study the on-hardware performance of the data-driven quantum circuit learning (DDQCL) for three different state-of-the-art classical solvers, and on two-different circuit ansätze associated to different entangling connectivity graphs for the same task. Additionally, we assess the gains in performance from varying circuit depths. To evaluate the typical performance associated with each of these settings in this benchmark study, we use at least five independent runs of DDQCL towards the generation of quantum generative models capable of capturing the patterns of the canonical Bars and Stripes dataset. In this experimental benchmarking, the gradient-free optimization algorithms show an outstanding performance compared to the gradient-based solver. In particular, one of them had better performance when handling the unavoidable noisy objective function to be minimized under experimental conditions.
97 MATHEMATICS AND COMPUTING↗
Synthesis and anisotropic magnetism in quantum spin liquid candidates A YbSe 2 ( A = K and Rb)
The quantum spin liquid (QSL) state in rare-earth triangular lattices has attracted much attention recently due to its potential application in quantum computing and communication. Here, we report the single-crystal growth synthesis, crystal structure characterizations, and magnetic properties of AYbSe 2 (A = K and Rb) compounds. The x-ray diffraction analysis shows that AYbSe 2 (A = K and Rb) crystallizes in a trigonal space group, R-3m (No. 166) with Z = 3. AYbSe 2 possesses a two-dimensional (2D) Yb–Se–Yb layered structure formed by edged-shared YbSe 6 octahedra. The magnetic properties are highly anisotropic for both title compounds, and no long-range order is found down to 0.4 K, revealing the possible QSL ground state in these compounds. The isothermal magnetization exhibits a one-third magnetization plateau when the magnetic fields are applied in the ab-plane. Heat capacity is performed along both ab-plane and c axis and features the characteristic dome for triangular magnetic lattice compounds as a function of magnetic fields. Due to the change in the interlayer and intralayer distance of Yb 3+ , the dome shifts to low fields from KYbSe 2 to RbYbSe 2 . All these results indicate that the AYbSe 2 family presents unique frustrated magnetism close to the possible QSL and noncollinear spin states.
36 MATERIALS SCIENCE↗
Interactions involved in the adsorption of ethylene glycol and 2-hydroxyethoxide on the Au(111) surface: a Density Functional Theory study
Abstract Context:The monolayers of ethylene glycol and 2-hydroxyethoxide on gold surfaces have been used in hybrid materials as biosensors. In this article, the adsorption of ethylene glycol and 2-hydroxyethoxide on the Au(111) surface was analyzed. For the first system, ethylene glycol on Au(111), there are Au$$\cdot \cdot \cdot $$ · · · O and Au$$\cdot \cdot \cdot $$ · · · H interactions. To the best of our knowledge, the Au$$\cdot \cdot \cdot $$ · · · H interaction has been overlooked until now. However, in this work, there is strong evidence that this interaction is important to stabilize the system. For the second system, the atomic interactions mentioned previously are also predicted, although there is an additional interaction between 2-hydroxyethoxide molecules. Such an interaction induces the link -O-H-O-, with high values of the electron density at the critical points of the corresponding bond path of the O-H interaction. These links suggest the forming of ethylene glycol chains.Methods:The calculations were performed using two exchange-correlation functionals: BEEF-vdW and C09$$_{x}$$ x -vdW; both functionals incorporate dispersion effects within the Kohn-Sham approach in Density Functional Theory as implemented in GPAW code and ASE computational packages. The contacts between the molecules considered in this article and the Au(111) surface were analyzed through the Quantum Theory of Atoms in Molecules implemented in GPUAM code.
Biochemistry & Molecular Biology↗
Self-Healing Ceramics and Mechanical Metamaterials
We performed large scale molecular dynamics (MD) simulations and reactive & quantum molecular dynamics simulations to investigate: (1) faceting, grain growth, and crack healing in ceramics; (2) stress-release mechanism and healing in fibers; and (3) mechanical properties of two-dimensional metamaterials. We also designed highly accurate interatomic potentials and forces using artificial neural networks (ANN) and first-principles molecular dynamics simulation data for use in our MD and reactive MD simulations. We demonstrated the efficacy of modeling quantum materials atomistic simulation data using unsupervised deep learning approaches on a quantum computer. These achievements are elaborated in the following sections.
36 MATERIALS SCIENCE↗
A regression algorithm for accelerated lattice QCD that exploits sparse inference on the D-Wave quantum annealer
We propose a regression algorithm that utilizes a learned dictionary optimized for sparse inference on a D-Wave quantum annealer. In this regression algorithm, we concatenate the independent and dependent variables as a combined vector, and encode the high-order correlations between them into a dictionary optimized for sparse reconstruction. On a test dataset, the dependent variable is initialized to its average value and then a sparse reconstruction of the combined vector is obtained in which the dependent variable is typically shifted closer to its true value, as in a standard inpainting or denoising task. Here, a quantum annealer, which can presumably exploit a fully entangled initial state to better explore the complex energy landscape, is used to solve the highly non-convex sparse coding optimization problem. The regression algorithm is demonstrated for a lattice quantum chromodynamics simulation data using a D-Wave 2000Q quantum annealer and good prediction performance is achieved. The regression test is performed using six different values for the number of fully connected logical qubits, between 20 and 64. The scaling results indicate that a larger number of qubits gives better prediction accuracy.
97 MATHEMATICS AND COMPUTING↗
MLPF: efficient machine-learned particle-flow reconstruction using graph neural networks
In general-purpose particle detectors, the particle-flow algorithm may be used to reconstruct a comprehensive particle-level view of the event by combining information from the calorimeters and the trackers, significantly improving the detector resolution for jets and the missing transverse momentum. In view of the planned high-luminosity upgrade of the CERN Large Hadron Collider (LHC), it is necessary to revisit existing reconstruction algorithms and ensure that both the physics and computational performance are sufficient in an environment with many simultaneous proton–proton interactions (pileup). Machine learning may offer a prospect for computationally efficient event reconstruction that is well-suited to heterogeneous computing platforms, while significantly improving the reconstruction quality over rule-based algorithms for granular detectors. We introduce MLPF, a novel, end-to-end trainable, machine-learned particle-flow algorithm based on parallelizable, computationally efficient, and scalable graph neural network optimized using a multi-task objective on simulated events. We report the physics and computational performance of the MLPF algorithm on a Monte Carlo dataset of top quark–antiquark pairs produced in proton–proton collisions in conditions similar to those expected for the high-luminosity LHC. The MLPF algorithm improves the physics response with respect to a rule-based benchmark algorithm and demonstrates computationally scalable particle-flow reconstruction in a high-pileup environment.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Co-design for Particle Applications at Exascale
Co-design across the Exascale Computing Project (ECP) has been critical for both enabling science applications and bringing disparate communities together. Developing and porting applications to the various high-performance computing (HPC) architectures on pre-exascale and exascale computers has been quite challenging due to the diversity of hardware features and software stacks. The Co-design Center for Particle Applications (CoPA) has developed and enhanced the Cabana and PROGRESS/BML libraries to facilitate the creation of new particle applications, make existing particle applications exascale capable, and allow teams to explore new capabilities. Particle methods from atomistic, mesoscale, continuum, through cosmological scales have been built with Cabana, along with new possibilities for application coupling. Similarly, the PROGRESS/BML library has enabled quantum particle applications with linear algebra solvers to use advanced hardware. Across these CoPA-developed libraries, the co-design abstraction layer combines performance portability with math library support to facilitate separation of concerns and directly support science runs.
97 MATHEMATICS AND COMPUTING↗