Quantum computational advantage attested by nonlocal games with the cyclic cluster state
Not Available
97 MATHEMATICS AND COMPUTING↗
SEARCH · Engineering Papers
Results for “Cluster 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.
Critical points of the random cluster model with Newman–Ziff sampling
Here, we present a method for computing transition points of the random cluster model using a generalization of the Newman–Ziff algorithm, a celebrated technique in numerical percolation, to the random cluster model. The new method is straightforward to implement and works for real cluster weight q > 0. Furthermore, results for an arbitrary number of values of q can be found at once within a single simulation. Because the algorithm used to sweep through bond configurations is identical to that of Newman and Ziff, which was conceived for percolation, the method loses accuracy for large lattices when q > 1. However, by sampling the critical polynomial, accurate estimates of critical points in two dimensions can be found using relatively small lattice sizes, which we demonstrate here by computing critical points for non-integer values of q on the square lattice, to compare with the exact solution, and on the unsolved non-planar square matching lattice. The latter results would be much more difficult to obtain using other techniques.
97 MATHEMATICS AND COMPUTING↗
Investigating the crust of neutron stars with neural-network quantum states
An accurate description of low-density nuclear matter is crucial for explaining the physics of neutron star crusts. In the density range between approximately 0.01 fm −3 and 0.1 fm −3 , matter transitions from neutron-rich nuclei to various higher-density pasta shapes, before ultimately reaching a uniform liquid. In this work, we introduce a variational Monte Carlo method based on a neural Pfaffian-Jastrow quantum state, which allows us to model the transition from the liquid phase to neutron-rich nuclei microscopically. At low densities, nuclear clusters dynamically emerge from the microscopic interactions among protons and neutrons, which we model based on pionless effective field theory. Our variational Monte Carlo approach represents a significant improvement over the state-of-the-art auxiliary-field diffusion Monte Carlo method, which is severely hindered by the fermion-sign problem in this low-density regime and cannot capture the onset of clusters. In addition to computing the energy per particle of symmetric nuclear matter and pure neutron matter, we analyze an intermediate isospin-asymmetry configuration to elucidate the formation of nuclear clusters. We also provide evidence that the presence of such nuclear clusters influences the amount of protons in the crust compared to protons in beta-equilibrated, neutrino-transparent matter.
Nuclear astrophysics↗
Performance portable ice-sheet modeling with MALI
High-resolution simulations of polar ice sheets play a crucial role in the ongoing effort to develop more accurate and reliable Earth system models for probabilistic sea-level projections. These simulations often require a massive amount of memory and computation from large supercomputing clusters to provide sufficient accuracy and resolution; therefore, it has become essential to ensure performance on these platforms. Many of today’s supercomputers contain a diverse set of computing architectures and require specific programming interfaces in order to obtain optimal efficiency. In an effort to avoid architecture-specific programming and maintain productivity across platforms, the ice-sheet modeling code known as MPAS-Albany Land Ice (MALI) uses high-level abstractions to integrate Trilinos libraries and the Kokkos programming model for performance portable code across a variety of different architectures. In this article, we analyze the performance portable features of MALI via a performance analysis on current CPU-based and GPU-based supercomputers. The analysis highlights not only the performance portable improvements made in finite element assembly and multigrid preconditioning within MALI with speedups between 1.26 and 1.82x across CPU and GPU architectures but also identifies the need to further improve performance in software coupling and preconditioning on GPUs. We perform a weak scalability study and show that simulations on GPU-based machines perform 1.24–1.92x faster when utilizing the GPUs. The best performance is found in finite element assembly, which achieved a speedup of up to 8.65x and a weak scaling efficiency of 82.6% with GPUs. We additionally describe an automated performance testing framework developed for this code base using a changepoint detection method. The framework is used to make actionable decisions about performance within MALI. We provide several concrete examples of scenarios in which the framework has identified performance regressions, improvements, and algorithm differences over the course of 2 years of development.
54 ENVIRONMENTAL SCIENCES↗
Photoelectron Spectroscopy and Computational Study on Microsolvated [B 10 H 10 ] 2– Clusters and Comparisons to Their [B 12 H 12 ] 2– Analogues
Microhydrated closo-Boranes have attracted great interests due to their superchaotropic activity related to well-known Hofmeister effect and important applications in biomedical and battery fields. In this work, we report a combined negative ion photoelectron spectroscopy and quantum chemical investigation on hydrated closo-decaborate clusters [B 10 H 10 ] 2- ·nH 2 O (n = 1 – 7) with a direct comparison to their analogues [B 12 H 12 ] 2- ·nH 2 O and free water clusters. A single H 2 O molecule is found sufficient to stabilize the intrinsically unstable [B 10 H 10 ] 2- dianion. The first two water molecules strongly interact with the solute forming B-H···H-O dihydrogen bonds while additional water molecules show substantially reduced binding energies. Unlike [B 12 H 12 ] 2- ·nH 2 O possessing highly structured water network with the attached H 2 O molecules arranged in a unified pattern by maximizing B-H···H-O dihydrogen bonding, distinct structural arrangements of the water clusters within [B 10 H 10 ] 2– ·nH 2 O are achieved with the water cluster networks from trimer to heptamer resembling free water clusters. Such a distinct difference arises from the variations in size, symmetry, and charge distributions between these two dianions. Finally, the present finding again confirms the structural diversity of hydrogen-bonding networks in microhydrated closo-boranes and enrich our understanding of aqueous borate chemistry.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Microcarbonation of Naphthalene: An Experimental and Computational Study of Photoionization in Naphthalene-Carbon Dioxide Clusters
The photoionization of naphthalene (N)-carbon dioxide (CO 2 ) clusters was studied using tunable vacuum ultraviolet (VUV) radiation from a synchrotron in the photon range of 8.0 to 13.7 eV, in combination with time-of-flight mass spectrometry. Clusters of monomer, dimer, and trimer naphthalene with CO 2 (N(CO 2 ) 0–6 , N 2 (CO 2 ) 0–3 , N3) were observed. The lowest-energy conformers were obtained via a conformer search, followed by geometry optimizations at the ωB97X-V2/aug-cc-pVTZ (monomer) and ωB97X-V2/aug-cc-pVDZ (dimer) levels of theory. Carbon dioxide was found to preferentially cluster on top of the naphthalene molecule (in an out-of-plane configuration). From the mass spectra, photoionization intensity curves (PICs) were constructed, and appearance energies (AEs) were determined. No substantial trend in AE was observed with increasing size of the naphthalene-carbon dioxide clusters; rather, AE oscillations around the value for pure naphthalene were observed. These AE oscillations are also observed in a recently studied naphthalene-water cluster system, though in this system a slight downward trend in AE for pure naphthalene clusters (N1/2/3/4) was observed. The differences between the two systems are attributed to differing interaction strengths. In conclusion, understanding these differences may aid in determining how photoprocessing can proceed differently depending on the dominant matrix component in interstellar ices.
Wannenmacher, Anna [Lawrence Berkeley National Lab↗
A Multi-Armed Bayesian Ordinal Outcome Utility-Based Sequential Trial with a Pairwise Null Clustering Prior
A multi-armed trial based on ordinal outcomes is proposed that leverages a flexible non-proportional odds cumulative logit model and numerical utility scores for each outcome to determine treatment optimality. This trial design uses a Bayesian clustering prior on the treatment effects that encourages the pairwise null hypothesis of no differences between treatments. A group sequential design is proposed to determine which treatments are clinically different with an adaptive decision boundary that becomes more aggressive as the sample size or clinical significance grows, or the number of active treatments decreases. A simulation study is conducted for 3 and 5 treatment arms, which shows that the design has superior operating characteristics (family wise error rate, generalized power, average sample size) compared to utility designs that do not allow clustering, a frequentist proportional odds model, or a permutation test based on empirical mean utilities.
97 MATHEMATICS AND COMPUTING↗
Streaming Matching and Edge Cover in Practice
Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.
Ferdous, S M.↗
A Generic Advanced Computing Framework for Executing Windows-based Dynamic Contingency Analysis Tool in Parallel on Cluster Machines
Dynamic contingency analysis tool (DCAT) has been developed to assess the impact and likelihood of extreme contingencies and potential cascading events across their systems and interconnections. By including more customized protection models and corrective actions into the Windows-based commercial tools, DCAT can help operators understand the cascading behavior and find mitigation approaches to reduce the risk of cascading outages in a more realistic manner. In order to further enhance the capability of DCAT, this paper presents a design of an advanced computing framework that enables DCAT to run on a cluster machine to improve its computational performance. This framework is generic and can be applied to other Windows-based simulation tools to fill the technical gap of applying advanced computing technology to vendors' Windows-based tools. The preliminary tests using medium to large power systems have shown the effectiveness of this framework and its potential for accelerating the adoption of advanced computing in utilities.
Advanced computing, dynamic contingency analysis, ↗
Community detection in hypergraphs via mutual information maximization
Abstract The hypergraph community detection problem seeks to identify groups of related vertices in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community labels and community-edge intersections. This algorithm can also be viewed as maximum-likelihood inference in a degree-corrected microcanonical stochastic blockmodel. We perform the compression/inference step via simulated annealing. Unlike several recent algorithms based on canonical models, our microcanonical algorithm does not require inference of statistical parameters such as vertex degrees or pairwise group connection rates. Through synthetic experiments, we find that our algorithm succeeds down to recently-conjectured thresholds for sparse random hypergraphs. We also find competitive performance in cluster recovery tasks on several hypergraph data sets.
97 MATHEMATICS AND COMPUTING↗
Adaptive Conformer Sampling for Property Prediction Using the Conductor-like Screening Model for Real Solvents
The valorization of lignocellulose-derived bioproducts requires effective separation from excessive water. Liquid–liquid extraction is a promising low-energy separation technology, but effective extraction requires solvent selection based on the thermodynamic properties of the bioproduct and solvent components. We propose a computational framework for predicting such properties by developing an adaptive conformer selection approach for use with COSMO-RS (conductor-like screening model for real solvents) calculations. In this framework, molecular dynamics simulations are used to generate many molecular structures (conformers) at representative temperatures in varying solvent environments. Conformers are then clustered based on structural metrics in a low-dimensional space and selected using a mixed-integer quadratic programming problem to iteratively insert a sampled conformer. At each iteration, we determine bioproduct properties using COSMO-RS. Here, we demonstrate the capability of the proposed framework on representative bioproducts to show convergence of the adaptive sampling toward experimentally measured properties with fewer calculations than required by random conformer sampling, enabling the improved screening of solvent systems for liquid-phase separation.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Elucidating the Molecular Origins of the Transference Number in Battery Electrolytes Using Computer Simulations
The rate at which rechargeable batteries can be charged and discharged is governed by the selective transport of the working ions through the electrolyte. Conductivity, the parameter commonly used to characterize ion transport in electrolytes, reflects the mobility of both cations and anions. The transference number, a parameter introduced over a century ago, sheds light on the relative rates of cation and anion transport. This parameter is, not surprisingly, affected by cation–cation, anion–anion, and cation–anion correlations. In addition, it is affected by correlations between the ions and neutral solvent molecules. Computer simulations have the potential to provide insights into the nature of these correlations. We review the dominant theoretical approaches used to predict the transference number from simulations by using a model univalent lithium electrolyte. In electrolytes of low concentration, one can obtain a quantitative model by assuming that the solution is made up of discrete ion-containing clusters–neutral ion pairs, negatively and positively charged triplets, neutral quadruplets, and so on. These clusters can be identified in simulations using simple algorithms, provided their lifetimes are sufficiently long. In concentrated electrolytes, more clusters are short-lived and more rigorous approaches that account for all correlations are necessary to quantify transference. Elucidating the molecular origin of the transference number in this limit remains an unmet challenge.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Density Functional Tight Binding Insights into Plasmonic Silver–Platinum Nanoparticles and Alloys for Enhanced Photocatalysis
Developing accurate and efficient Slater-Koster (SK) tight-binding parameter sets is essential for quantum plasmonic studies of alloyed metal nanoparticles, as conventional time dependent density functional theory (TD-DFT) calculations are computationally prohibitive for larger clusters. In this work, we develop and validate density functional tight binding (DFTB) parameter sets for both ground state (GS-SK) and excited state (ES-SK) calculations to study the structural, electronic, and optical properties of silver (Ag), platinum (Pt), and Ag–Pt nanoalloys. Our investigation of the ground state properties demonstrates that the GS-SK parameters enable DFTB to closely reproduce the electronic structures of platinum clusters with diverse sizes and geometries – showing qualitative agreement with DFT for density of states (DOS) profiles and energy levels. The ES-SK parameters accurately describe excited-state properties compared to TD-DFT reference calculations, including the broad, featureless absorption profiles of Pt that are dominated by interband transitions. Using the ES-SK parameters within a real-time TD-DFTB framework, we compute size-dependent optical absorption spectra of Ag, Pt and Ag-Pt nanocubes containing up to 1099 atoms (size ∼4.18 nm). A detailed study of Ag–Pt and Pt-Ag core–shell nanoparticles shows quenching of the Ag plasmon resonance even at monolayer coverage for Ag-Pt, but not for Pt-Ag. We also show how to define submonolayer Ag-core Pt-shell cubic structures that have similar optical properties to those generated experimentally for much larger particles, which offers potential for describing plasmon-enhanced photocatalysis. Collectively, the GS-SK and ES-SK parameter sets provide an accurate, computationally efficient approach for modeling the complex optical and electronic behavior of noble–transition metal nanostructures and their alloys.
SPR↗
Uniformly Ordered Binary Decision Algorithm for Benchmark Experiment Correlations in Whisper Validation
When performing a validation exercise for determining the upper subcritical limit of a nuclear criticality safety application, an analyst should select and perform a statistical analysis on a population of benchmark experiments that are neutronically similar to the application. The size of this population should be sufficiently large such that the statistical analysis has a high degree of confidence that the bias plus bias uncertainty (calculational margin) has been accurately quantified. A complication arises because many benchmark experiments share common components, leading to correlations in their measured effective multiplication factors. Correlations between benchmark experiments within the population reduces its predictive power. This motivates the need for methods that consider benchmark experiment correlations and ensure adequate statistical significance of results. The Whisper code is a statistical analysis pack- age that incorporates nuclear data sensitivity coefficients from MCNP to assess benchmark experiment similarity and then performs an extreme-value analysis to estimate the bias plus bias uncertainty. The original methodology in Whisper does not consider the effect of benchmark experiment correlations when making this estimation, and this summary proposes the uniformly ordered binary decision algorithm to address this shortcoming. The original methodology in Whisper computes similarity coefficients ck for an application compared to all benchmark experiments in its library and develops weighting factors for a selected population proportional to the ck values. The methodology can be interpreted as statistically emulating a validation exercise for a particular application where the weighting factors may be viewed as the likelihood that an analyst would include a particular benchmark experiment within the population. The effective sample size of the population is the expected or mean number of benchmark experiments in the population. The uniformly ordered binary decision algorithm identifies clusters of correlated benchmark experiments within the population and then computes adjusted weighting factors based on the magnitude of the correlation coefficients within the cluster to compute a reduced effective sample size accounting for the lower information content because of correlations. Benchmark experiments within the cluster are ordered randomly with equal probability and probabilistic decisions are made as to whether a benchmark. experiment within the cluster should treated as redundant with a previous one; if two redundant benchmark experiments are included, then the conservative worst case bias plus bias uncertainty is used and the pair is counted as a single benchmark experiment in the population. Results are provided for HEU solutions in a research version of the Whisper software using benchmark experiment correlations provided by DICE, the Database for the International Criticality Safety Benchmark Evaluation Project (ICSBEP). These show that there can be a significant increase in the bias plus bias uncertainty because the effective sample size is reduced, and therefore the algorithm, needing to meet sample size requirements, expands the benchmark experiment population by accepting less similar benchmark experiments that would have otherwise not been included.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
A computational study of Al n - and Al n -1 1Pt - clusters: the effects of doping and a uniform tuning gauge for single-atom nanocatalysts
Results of density functional theory calculations on Al n - and Al n -1 1Pt - , n = 2-8, clusters are presented and analyzed. The analysis includes different structural forms of the clusters characterized in terms of binding energy, spin and symmetry, and a comparative evaluation of various properties of the two systems viewed as connected through a single-Pt substitutional doping and examined in terms of their respective most stable structures. Furthermore, the Al n -1 1Pt - clusters are then used as a paradigmatic (model) case of single-atom nanocatalysts, with Pt as the catalytic center and Al n-1 as its support, to implement a uniform descriptor for gauging the tuning effects of all the parameters ( "knobs ") of a nanocatalyst that include the identity of the active center and the material and size of its support.
97 MATHEMATICS AND COMPUTING↗
Global Optimization of Chemical Cluster Structures: Methods, Applications, and Challenges
Chemical clusters are relevant to many applications in catalysis, separations, materials, and energy sciences. Experimentally, the structure of clusters is difficult to determine, but it is very important in understanding their chemistry and properties. Computational methods can be used to examine cluster structure, however finding the most stable structure is not simple, particularly as the cluster size increases. Global optimization techniques have long been used to tackle the problem of the most stable structure, but such approaches would have to look for a global minimum, while sampling local minima over the whole potential energy surface as well. In this review, the state-of-the-art theory of global optimization theory is summarized. First, the definition, significance, relation to experiments, and a brief history of global optimization is presented. We then discuss, in more detail, three versatile global optimization methods: the basin hopping, the artificial bee colony algorithm, and the genetic algorithm. We close with some representative application examples of global optimization of clusters since 2016 and the challenges, open questions and opportunities in this field.
Global optimization, Chemical clusters, Artificial↗
Profiles of upcoming HPC Applications and their Impact on Reservation Strategies
With the expected convergence between HPC, BigData and AI, new applications with different profiles are coming to HPC infrastructures. Here, we aim at better understanding the features and needs of these applications in order to be able to run them efficiently on HPC platforms. The approach followed is bottom-up: we study thoroughly an emerging application from the neuroscience community (SLANT) to understand its behavior. Based on these observations, we derive a generic, yet simple, application model (namely, a linear sequence of stochastic jobs). We expect this model to be representative for a large set of upcoming applications that require the computational power of HPC clusters without fitting the typical behavior of large-scale traditional applications. In a second step, we show how one can manipulate this generic model in a scheduling framework. Specifically we consider the problem of making reservations (both time and memory) for an execution on an HPC platform. We derive solutions using the model of the first step of this work. We experimentally show the robustness of the model, even with very few data or with another application, to generate the model, and provide performance gains with regards to standard and more recent approaches used in the neuroscience community.
97 MATHEMATICS AND COMPUTING↗
Programmable photonic integrated meshes for modular generation of optical entanglement links
Abstract Large-scale generation of quantum entanglement between individually controllable qubits is at the core of quantum computing, communications, and sensing. Modular architectures of remotely-connected quantum technologies have been proposed for a variety of physical qubits, with demonstrations reported in atomic and all-photonic systems. However, an open challenge in these architectures lies in constructing high-speed and high-fidelity reconfigurable photonic networks for optically-heralded entanglement among target qubits. Here we introduce a programmable photonic integrated circuit (PIC), realized in a piezo-actuated silicon nitride (SiN)-in-oxide CMOS-compatible process, that implements an N × N Mach–Zehnder mesh (MZM) capable of high-speed execution of linear optical transformations. The visible-spectrum photonic integrated mesh is programmed to generate optical connectivity on up to N = 8 inputs for a range of optically-heralded entanglement protocols. In particular, we experimentally demonstrated optical connections between 16 independent pairwise mode couplings through the MZM, with optical transformation fidelities averaging 0.991 ± 0.0063. The PIC’s reconfigurable optical connectivity suffices for the production of 8-qubit resource states as building blocks of larger topological cluster states for quantum computing. Our programmable PIC platform enables the fast and scalable optical switching technology necessary for network-based quantum information processors.
47 OTHER INSTRUMENTATION↗