Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum computing models”

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 757 records · Page 42

Fine-tuned vs. natural supersymmetry: what does the string landscape predict?

A vast array of (metastable) vacuum solutions arise from string compactifications, each leading to different 4-d laws of physics. The space of these solutions, known as the string landscape, allows for an environmental solution to the cosmological constant problem. We examine the possibility of an environmental solution to the gauge hierarchy problem. We argue that the landscape favors softly broken supersymmetric models over particle physics models containing quadratic divergences, such as the Standard Model. We present a scheme for computing relative probabilities for supersymmetric models to emerge from the landscape. The probabilities are related to the likelihood that the derived value of the weak scale lies within the Agrawal et al. (ABDS) allowed window of values leading to atoms as we know them. This then favors natural SUSY models over unnatural (SUSY and other) models via a computable probability measure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Non -degenerate marginal-likelihood calibration with application to quantum characterization

Here, we propose a marginal likelihood strategy within the Kennedy-O’Hagan (KOH) Bayesian framework, where a Gaussian process (GP) models the discrepancy between a physical system and its simulator. Our approach introduces a novel marginalized likelihood by integrating out the degenerate eigenspace of the covariance matrix, rather than approximating the original likelihood. Unlike approximation methods that compromise accuracy for computational efficiency, our method defines an exact likelihood—distinct from the original but preserving all relevant information. This formulation achieves computational efficiency and stability, even for large datasets where the covariance matrix nears degeneracy. Applied to the characterization of a superconducting quantum device at Lawrence Livermore National Laboratory, the approach enhances the predictive accuracy of the Lindblad master equations for modeling Ramsey measurement data by effectively quantifying uncertainties consistent with the quantum data.

general physics↗

A Novel Spatial-Temporal Variational Quantum Circuit to Enable Deep Learning on NISQ Devices

Quantum computing presents a promising approach for machine learning with its capability for extremely parallel computation in high-dimension through superposition and entanglement. Despite its potential, existing quantum learning algorithms, such as Variational Quantum Circuits (VQCs), face challenges in handling more complex datasets, particularly those that are not linearly separable. What’s more, it encounters the deployability issue, making the learning models suffer a drastic accuracy drop after deploying them to the actual quantum devices. To overcome these limitations, this paper proposes a novel spatial-temporal design, namely “ST-VQC”, to integrate nonlinearity in quantum learning and improve the robustness of the learning model to noise. Specifically, ST-VQC can extract spatial features via a novel block-based encoding quantum sub-circuit coupled with a layer-wise computation quantum sub-circuit to enable temporal-wise deep learning. Additionally, a SWAP-Free physical circuit design is devised to improve robustness. These designs bring a number of hyperparameters. After a systematic analysis of the design space for each design component, an automated optimization framework is proposed to generate the ST-VQC quantum circuit. The proposed ST-VQC has been evaluated on two IBM quantum processors, ibm-cairo with 27 qubits and ibmq-lima with 7 qubits to assess its effectiveness. The results of the evaluation on the standard dataset for binary classification show that ST-VQC can achieve over 30% accuracy improvement compared with existing VQCs on actual quantum computers. Moreover, on a non-linear synthetic dataset, the STVQC outperforms a linear classifier by 27.9%, while the linear classifier using classical computing outperforms the existing VQC by 15.58%.

Li, Jinyang↗

Hybrid nested sampling algorithm for Bayesian model selection applied to inverse subsurface flow problems

A Hybrid Nested Sampling (HNS) algorithm is proposed for efficient Bayesian model calibration and prior model selection. The proposed algorithm combines, Nested Sampling (NS) algorithm, Hybrid Monte Carlo (HMC) sampling and gradient estimation using Stochastic Ensemble Method (SEM). NS is an efficient sampling algorithm that can be used for Bayesian calibration and estimating the Bayesian evidence for prior model selection. Nested sampling has the advantage of computational feasibility. Within the nested sampling algorithm, a constrained sampling step is performed. For this step, we utilize HMC to reduce the correlation between successive sampled states. HMC relies on the gradient of the logarithm of the posterior distribution, which we estimate using a stochastic ensemble method based on an ensemble of directional derivatives. SEM only requires forward model runs and the simulator is then used as a black box and no adjoint code is needed. The developed HNS algorithm is successfully applied for Bayesian calibration and prior model selection of several nonlinear subsurface flow problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral function of the $J_1$ – $J_2$ Heisenberg model on the triangular lattice

Spectral probes, such as neutron scattering, are crucial for characterizing excitations in quantum many-body systems and the properties of quantum materials. Among the most elusive phases of matter are quantum spin liquids, which have no long-range order even at zero temperature and host exotic fractionalized excitations with nontrivial statistics. These phases can occur in frustrated quantum magnets, such as the paradigmatic Heisenberg model with nearest- and next-nearest-neighbor exchange interactions on the triangular lattice, the so-called $J_1$ – $J_2$ model. In this work, we compute the spectral function using large-scale matrix product state simulations across the three different phases of this model's phase diagram, including a quantum spin-liquid phase at intermediate $J_2$/$J_1$. Despite a plethora of theoretical and experimental studies, the exact nature of this phase is still contested, with the dominant candidates being a gapped $\mathbb{Z}_2$, a gapless U(1) Dirac, and a spinon Fermi surface quantum spin-liquid state. We find a V-shaped spectrum near the center of the Brillouin zone ($Γ$ point), a key signature of a spinon Fermi surface, observed in prior neutron scattering experiments. However, we find a small gap near the $Γ$ point, ruling out such a phase. Furthermore, we find localized gapless excitations at the corner of the Brillouin zone boundary (K point) and the middle of the edge of the Brillouin zone boundary (M point), ruling out the gapped $\mathbb{Z}_2$ spin-liquid phase. Here, our results imply that the intermediate spin-liquid phase is a gapless $U(1)$ Dirac spin liquid, and provide clear signatures to detect this phase in future neutron scattering experiments.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Using the D-Wave 2X Quantum Computer to Explore the Formation of Global Terrorist Networks

Social networks with signed edges (+/-) play an important role in an area of social network theory called structural balance. In these networks, edges represent relationships that are labeled as either friendly (+) or hostile (-). A signed social network is balanced only if all cycles of three or more nodes in the graph have an odd number of hostile edges. A fundamental property of a balanced network is that it can be cleanly divided into 2 factions, where all relationships within each faction are friendly, and all relationships between members of different factions are hostile. The more unbalanced a network is, the more edges will fail to adhere to this rule, making factions more ambiguous. Social theory suggests unbalanced networks should be unstable, a finding that has been supported by research on gangs, which shows that unbalanced relationships are associated with greater violence, possibly due to this increased ambiguity about factional allegiances (Nakamura et al). One way to estimate the imbalance in a network, if only edge relationships are known, is to assign nodes to factions that minimize the number of violations of the edge rule described above. This problem is known to be computationally NP-hard. However, Facchetti et al. have pointed out that it is equivalent to an Ising model with a Hamiltonian that effectively counts the number of edge rule violations. Therefore, finding the assignment of factions that minimizes energy of the equivalent Ising system yields an estimate of the imbalance in the network. Based on the Ising model equivalence of the signed-social network balance problem, we have used the D-Wave 2X quantum annealing computer to explore some aspects of signed social networks. Because connectivity in the D-Wave computer is limited to its particular native topology, arbitrary networks cannot be represented directly. Rather, they must be “embedded” using a technique in which multiple qubits are chained together with special weights to simulate a collection of nodes with the required connectivity. This limits the size of a fully connected network in the D-Wave to about 50 simulated nodes, using all of the approximately 1150 qubits in the machine. In order to keep within this limitation, while exploring a problem of potential social relevance, we constructed time series of historical network snapshots from Stanford’s Mapping Militants Project, where nodes represent militant organizations, and edges represent either alliances or rivalries between organizations. We constructed two series from different theaters – Iraq and Syria – spanning timelines from about 2000 to 2016, each with networks whose maximum size was in the 20-30 node range. Computationally, our experience suggests D-Wave technology is promising, providing fast, nearly constant scaling of computational effort in the main part of the calculation that relies on the quantum annealing cycle. However, the cost of embedding an arbitrary network of interest in the D-Wave native topology scales poorly. If the embedding cost can be amortized relative to the annealing cycle, it may be possible to gain a substantial advantage over classical computing methods, provided a large enough network can be accommodated by partitioning into subnetworks or some similar strategy. In terms of our application to networks of militant organizations, we found a rise in network imbalance in the Syrian theater that appears to correspond roughly with the entrance of the Islamic State into a milieu already populated with other groups, a phenomenon we plan to explore in more detail. In these very preliminary results, we also noticed that during at least one period where both the size and imbalance of the network increased substantially, the imbalance per edge seemed to remain fairly steady. This may suggest some adaptive behavior among the participating factions, which may also warrant further exploration.

97 MATHEMATICS AND COMPUTING↗

Runtime performance of a GAMESS quantum chemistry application offloaded to GPUs

Summary Computational chemistry is at the forefront of solving urgent societal problems, such as polymer upcycling and carbon capture. The complexity of modeling these processes at appropriate length and time scales is mainly manifested in the number and types of chemical species involved in the reactions and may require models of several thousand atoms and large basis sets to accurately capture the chemical complexity and heterogeneity in the physical and chemical processes. The quantum chemistry package General Atomic and Molecular Electronic Structure System (GAMESS) has a wide array of methods that can efficiently and accurately treat complex chemical systems. In this work, we have used the GAMESS Effective Fragment Molecule Orbital (EFMO) method for electronic structure calculation of a challenging mesoporous silica nanoparticle (MSN) model surrounded by about 4700 water molecules to investigate the strong scaling and GPU offloading on hybrid CPU‐GPU nodes. Experiments were performed on the Perlmutter platform at the National Energy Research Scientific Computing Center. Good strong scaling and load balancing have been observed on up to 88 hybrid nodes for different settings of the execution parameters for the calculation considered here. When GPUs are oversubscribed by offloading work from multiple CPU processes, using the NVIDIA multi‐process service (MPS) has consistently reduced time to solution and energy consumed. Additionally, for some configuration parameter settings, oversubscription with MPS improved performance by up to 5.8% over the case without oversubscription.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Near-optimal protocols in complex nonequilibrium transformations

Significance Classical thermodynamics was developed to help design the best protocols for operating heat engines that remain close to equilibrium at all times. Modern experimental techniques for manipulating microscopic and mesoscopic systems routinely access far-from-equilibrium states, demanding new theoretical tools to describe the optimal protocols in this more complicated regime. Prior studies have sought, in simple models, the protocol that minimizes dissipation. We use computational tools to investigate the diversity of low-dissipation protocols. We show that optimal protocols can be accompanied by a vast set of near-optimal protocols, which still offer the substantive benefits of the optimal protocol. Although solving for the optimal protocol is typically difficult, computationally identifying a near-optimal protocol can be comparatively easy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The effect of spin-orbit coupling in band structure of few-layer graphene

Topological insulators are electronic materials that have a bulk band gap like an ordinary insulator but have protected conducting states on their edge or surface. This can be happened due to spin-orbit coupling and time-reversal symmetry. Moreover, the edge current flows through their edge or surface depends on its spin orientation and also it is robust against non-magnetic impurities. Therefore, topological insulators are predicted to be useful ranging from spintronics to quantum computation. Graphene was first predicted to be the precursor of topological insulator by Kane-Mele. They developed a Hamiltonian model to describe the gap opening in graphene. In this work, we investigate the band structure of few-layer graphene by using this model with analytical approach. The results of our calculations show that the gap opening occurs at K and K’ point, not only in single layer, but also in bilayer and trilayer graphene.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Constraining Hamiltonians from chiral effective field theory with neutron-star data

Multi-messenger observations of neutron stars (NSs) and their mergers have placed strong constraints on the dense-matter equation of state (EOS). The EOS, in turn, depends on microscopic nuclear interactions that are described by nuclear Hamiltonians. These Hamiltonians are commonly derived within chiral effective field theory (EFT). Ideally, multi-messenger observations of NSs could be used to directly inform our understanding of EFT interactions, but such a direct inference necessitates millions of model evaluations. This is computationally prohibitive because each evaluation requires us to calculate the EOS from a Hamiltonian by solving the quantum many-body problem with methods such as auxiliary-field diffusion Monte Carlo (AFDMC), which provides very accurate and precise solutions but at a significant computational cost. Additionally, we need to solve the stellar structure equations for each EOS which further slows down each model evaluation by a few seconds. In this work, we combine emulators for AFDMC calculations of neutron matter, built using parametric matrix models, and for the stellar structure equations, built using multilayer perceptron neural networks, with the PyCBC data-analysis framework to enable a direct inference of coupling constants in an EFT Hamiltonian using multi-messenger observations of NSs. We find that astrophysical data can provide informative constraints on two-nucleon couplings despite the high densities probed in NS interiors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Light-induced electron dynamics of molecules in cavities: comparison of model Hamiltonians

The rapidly expanding field of polaritonic chemistry requires accurate theoretical simulations to understand new phenomena at the atomic scale. Computing the optoelectronic properties of molecules using established electronic structure methods is a careful balance of accuracy and computational expense, and expanding these methods to quantum electrodynamics to describe coupled cavity-molecule systems is an active topic of development. Key to these methods are the Hamiltonian operators representing the photon cavity modes. The recently introduced quantum electrodynamics time-dependent configuration interaction (QED-TDCI) method allows for the combination of electron dynamics simulations with quantum electrodynamics, enabling the simulation of time-dependent optoelectronic properties of cavity-molecule systems. Using this method, a comparison of two many-state QED Hamiltonians—the Pauli-Fierz and quantum Rabi model Hamiltonians—is presented, with a particular focus on time-dependent properties in applied electric fields.

Peyton, Benjamin G. (ORCID:0000000163190751)↗

Machine learning for arbitrary single-qubit rotations on an embedded device

Here, in this study, we present a technique for using machine learning (ML) for single-qubit gate synthesis on field-programmable logic for a superconducting transmon-based quantum computer based on simulated studies. Our approach is multi-stage. We first “bootstrap” a model based on simulation with access to the full state vector for measuring gate fidelity. We next present an algorithm, named adapted randomized benchmarking (ARB), for fine-tuning the gate on hardware based on measurements of the devices. We also present techniques for deploying the model on programmable devices with care to reduce the required resources. While the techniques here are applied to a transmon-based computer, many of them are portable to other architectures.

97 MATHEMATICS AND COMPUTING↗

Quantum computation of stopping power for inertial fusion target design

Stopping power is the rate at which a material absorbs the kinetic energy of a charged particle passing through it—one of many properties needed over a wide range of thermodynamic conditions in modeling inertial fusion implosions. First-principles stopping calculations are classically challenging because they involve the dynamics of large electronic systems far from equilibrium, with accuracies that are particularly difficult to constrain and assess in the warm-dense conditions preceding ignition. Here, we describe a protocol for using a fault-tolerant quantum computer to calculate stopping power from a first-quantized representation of the electrons and projectile. Our approach builds upon the electronic structure block encodings of Su et al. [ PRX Quant. 2 , 040332 (2021)], adapting and optimizing those algorithms to estimate observables of interest from the non-Born–Oppenheimer dynamics of multiple particle species at finite temperature. We also work out the constant factors associated with an implementation of a high-order Trotter approach to simulating a grid representation of these systems. Ultimately, we report logical qubit requirements and leading-order Toffoli costs for computing the stopping power of various projectile/target combinations relevant to interpreting and designing inertial fusion experiments. We estimate that scientifically interesting and classically intractable stopping power calculations can be quantum simulated with roughly the same number of logical qubits and about one hundred times more Toffoli gates than is required for state-of-the-art quantum simulations of industrially relevant molecules such as FeMoco or P450.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Strict parabolicity of the multifractal spectrum at the Anderson transition

Using the well-known “algebra of multifractality,” we derive the functional equation for anomalous dimensions Δ{sub q}, whose solution Δ = χq(q–1) corresponds to strict parabolicity of the multifractal spectrum. This result demonstrates clearly that a correspondence of the nonlinear σ-models with the initial disordered systems is not exact.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Linear resistivity and Sachdev-Ye-Kitaev (SYK) spin liquid behavior in a quantum critical metal with spin-1/2 fermions

Significance In “Planckian metals,” electrons dissipate energy at the fastest possible rate allowed by the fundamental laws of quantum mechanics, resulting in a linear temperature dependence of their electrical resistivity. Although observed for a number of quantum materials, this phenomenon lacks a general theoretical understanding and is often considered as one of the prominent fundamental questions in condensed matter physics. Here, we show that Planckian dissipation and a behavior consistent with the “marginal Fermi liquid” phenomenology emerge in the quantum critical regime separating a Mott insulating spin glass and a Fermi liquid. By establishing this behavior in an explicit model solvable by state-of-the-art computational methods, our theory paves the way toward a deeper understanding of Planckian or “strange” metals.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improving CASINO performance for models with large number of electrons

Quantum Monte Carlo calculations have at their core algorithms based on statistical ensembles of multidimensional random walkers which are straightforward to use on parallel computers. Nevertheless some computations have reached the limit of the memory resources for models with more than 1000 electrons because of the need to store a large amount of electronic orbitals related data. Besides that, for systems with large number of electrons, it is interesting to study if the evolution of one configuration of random walkers can be done faster in parallel. We present a comparative study of two ways to solve these problems: (1) distributed orbital data done with MPI or Unix inter-process communication tools, (2) second level parallelism for configuration computation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Dynamical Anyon Generation in Kitaev Honeycomb Non-Abelian Spin Liquids

Relativistic Mott insulators known as “Kitaev materials” potentially realize spin liquids hosting non-Abelian anyons. Motivated by fault-tolerant quantum-computing applications in this setting, we introduce a dynamical anyon-generation protocol that exploits universal edge physics. The setup features holes in the spin liquid, which define energetically cheap locations for non-Abelian anyons, connected by a narrow bridge that can be tuned between spin liquid and topologically trivial phases. We show that modulating the bridge from trivial to spin liquid over intermediate time scales—quantified by analytics and extensive simulations—deposits non-Abelian anyons into the holes with O(1) probability. The required bridge manipulations can be implemented by integrating the Kitaev material into magnetic tunnel junction arrays that engender locally tunable exchange fields. Combined with existing readout strategies, our protocol reveals a path to topological qubit experiments in Kitaev materials at zero applied magnetic field.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Kolmogorov-Arnold wavefunctions

Here, this work investigates Kolmogorov-Arnold network-based (KAN) wave-function Ansätz as viable representations for quantum Monte Carlo simulations. Through systematic analysis of one-dimensional model systems, we evaluate their computational efficiency and representational power against established methods. Our numerical experiments suggest some efficient training methods and we explore how the computational cost scales with desired precision, particle number, and system parameters. Roughly speaking, KANs seem to be 10 times cheaper computationally than other neural-network-based Ansätz . We also introduce a novel approach for handling strong short-range potentials—a persistent challenge for many numerical techniques—which generalizes efficiently to higher-dimensional, physically relevant systems with short-ranged strong potentials common in atomic and nuclear physics.

1-dimensional systems↗