Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum computing for simulation”

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 955 records · Page 53

Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates

Current quantum computers are especially error prone and require high levels of optimization to reduce operation counts and maximize the probability the compiled program will succeed. These computers only support operations decomposed into one- and two-qubit gates and only two-qubit gates between physically connected pairs of qubits. Typical compilers first decompose operations, then route data to connected qubits. We propose a new compiler structure, Orchestrated Trios, that first decomposes to the three-qubit Toffoli, routes the inputs of the higher-level Toffoli operations to groups of nearby qubits, then finishes decomposition to hardware-supported gates. This significantly reduces communication overhead by giving the routing pass access to the higher-level structure of the circuit instead of discarding it. A second benefit is the ability to now select an architecture-tuned Toffoli decomposition such as the 8-CNOT Toffoli for the specific hardware qubits now known after the routing pass. Furthermore, we perform real experiments on IBM Johannesburg showing an average 35% decrease in two-qubit gate count and 23% increase in success rate of a single Toffoli over Qiskit. We additionally compile many near-term benchmark algorithms showing an average 344% increase in (or 4.44x) simulated success rate on the Johannesburg architecture and compare with other architecture types.

compiler↗

Advanced Shuttle Strategies for Parallel QCCD Architectures

Trapped ions (TIs) are at the forefront of quantum computing implementation, offering unparalleled coherence, fidelity, and connectivity. However, the scalability of TI systems is hampered by the limited capacity of individual ion traps, necessitating intricate ion shuttling for advanced computational tasks. The quantum charge-coupled device (QCCD) framework has emerged as a promising solution, facilitating ion mobility for universal quantum computation. Current QCCD architectures predominantly feature a linear topology, which is increasingly recognized as inefficient for complex quantum operations. Anticipating the shift toward more efficacious designs, this article introduces an innovative quantum scheduling strategy optimized for parallel QCCD topologies. Our strategy proposes a probabilistic formula for ion movement, alongside ingenious methods for local layer generation and layer compression, yielding a significant reduction in ion shuttle times. Through simulations, we demonstrate that our strategy not only substantially outstrips the linear model but also exhibits better performance over other parallel strategies that employ greedy algorithms. This is achieved through our nuanced resolution of complexities, such as traffic blocks and trap capacity limitations. The consequent reduction in shuttle operations leads to lower energy consumption and an enhancement in the quantum computer's fidelity, ultimately accelerating program execution times.

43 PARTICLE ACCELERATORS↗

Macroscale properties and atomic-scale mechanisms of ash removal in low-temperature hydrothermal carbonization

Biogenic ash is a significant impediment to the utilization of agricultural residues in biofuel production. Such challenge can be addressed by various treatments, as demonstrated in this study on the experimental and computational mechanisms involved in the hydrothermal treatment (HT) of wheat straw. A combination of classical (all-atom) molecular dynamics simulations of cellulose carrying silica and calcium species, along with first principles quantum chemical calculations, indicates the dissociation of inorganics from the cellulose with increased HT temperature. Here, this observation is confirmed by experimental evidence of effective ash removal by HT, showing at least 50% removal of sulfur, chlorine, potassium, and calcium, and 12.5% of silica, leading to a reduced total ash content (from 6.7% to 4.2%).Changes in structural features upon HT, such as surface cellular structure and porosity, were revealed, accompanied by an increased specific surface area (from 1.17 to 6.34 m 2 /g). Our simulations suggest that silica binds tightly to the hydrophobic face of cellulose at room temperature, but HT significantly reduces the binding free energy of association with both hydrophobic and hydrophilic surfaces. Most significantly, ash removal leads to an increased calorific value, rising from approximately 16 MJ/kg to about 19 MJ/kg, along with improved thermal behavior. The improved integration combustion index parameter S indicates that the combustion properties improve with ash removal efficiency. The proposed atomic-level mechanism for the observed removal of inorganics during mild HT underscores the potential of such treatment in producing energy-dense wheat straw, a widely available agricultural residue.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adaptive Circuit Learning for Quantum Metrology

Quantum sensing is an important application of emerging quantum technologies. We explore whether a hybrid system of quantum sensors and quantum circuits can surpass the classical limit of sensing. In particular, we use optimization techniques to search for encoder and decoder circuits that scalably improve sensitivity under given application and noise characteristics. Furthermore, our approach uses a variational algorithm that can learn a quantum sensing circuit based on platform-specific control capacity, noise, and signal distribution. The quantum circuit is composed of an encoder which prepares the optimal sensing state and a decoder which gives an output distribution containing information of the signal. We optimize the full circuit to maximize the Signal-to-Noise Ratio (SNR). Furthermore, this learning algorithm can be run on real hardware scalably by using the "parameter-shift" rule which enables gradient evaluation on noisy quantum circuits, avoiding the exponential cost of quantum system simulation. We demonstrate up to 13.12x SNR improvement over existing fixed protocol (GHZ), and 3.19x Classical Fisher Information (CFI) improvement over the classical limit on 15 qubits using IBM quantum computer. More notably, our algorithm overcomes the decreasing performance of existing entanglement-based protocols with increased system sizes.

42 ENGINEERING↗

CV4Quantum

CV4Quantum is a statistical technique for reducing the sampling overhead in probabilistic error cancellation, which is an error mitigation technique used in quantum computing. CV4Quantum is based on the control variates method, which is a Monte Carlo variance reduction technique. This repository contains the code and data associated with a demonstration of CV4Quantum using simulation experiments.

Shyamsundar, Prasanth [Fermi National Accelerator ↗

Integrating micromagnets and hybrid nanowires for topological quantum computing

Majorana zero modes are expected to arise in semiconductor-superconductor hybrid systems, with potential topological quantum computing applications. One limitation of this approach is the need for a relatively high external magnetic field that should also change direction at the nanoscale. This proposal considers devices that incorporate micromagnets to address this challenge. We perform numerical simulations of stray magnetic fields from different micromagnet configurations, which are then used to solve for Majorana wavefunctions. Several devices are proposed, starting with the basic four-magnet design to align magnetic field with the nanowire and scaling up to nanowire T-junctions. The feasibility of the approach is assessed by performing magnetic imaging of prototype patterns.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable qubit representations of neutrino mixing matrices

Oscillating neutrino beams exhibit quantum coherence over distances of thousands of kilometers. Their unambiguously quantum nature suggests an appealing test system for direct quantum simulation. Such techniques may enable presently analytically intractable calculations involving multi-neutrino entanglements, such as collective neutrino oscillations in supernovae, but only once oscillation phenomenology is properly re-expressed in the language of quantum circuits. Here we resolve outstanding conceptual issues regarding encoding of arbitrarily mixed neutrino flavor states in the Hilbert space of an n-qubit quantum computer. We introduce algorithms to encode mixing and oscillation of any number of flavor-mixed neutrinos, both with and without CP-violation, with an efficient number of prescriptive input parameters in terms of sub-rotations of the PMNS matrix in standard form. As a result, examples encoded for an IBM-Q quantum computer are shown to converge to analytic predictions both with and without CP-violation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Qutrit circuits and algebraic relations: A pathway to efficient spin-1 Hamiltonian simulation

Quantum information processing has witnessed significant advancements through the application of qubit-based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d -dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.

97 MATHEMATICS AND COMPUTING↗

Qutrit Circuits and Algebraic Relations: A Pathway to Efficient Spin-1 Hamiltonian Simulation

Quantum information processing has witnessed significant advancements through the application of qubit- based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d-dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Error-mitigated nonorthogonal quantum eigensolver via shadow tomography

We present a shadow-tomography-enhanced nonorthogonal quantum eigensolver (NOQE) for more efficient and accurate electronic structure calculations on near-term quantum devices. By integrating shadow tomography into the NOQE, the measurement cost scales linearly rather than quadratically with the number of reference states, while also reducing the required qubits and circuit depth by half. This approach enables extraction of all matrix elements via randomized measurements and classical postprocessing. We analyze its sample complexity and show that, for small systems, it remains constant in the high-precision regime, while for larger systems, it scales linearly with the system size. We further apply shadow-based error mitigation to suppress noise-induced bias without increasing quantum resources. Demonstrations on the hydrogen molecule in the strongly correlated regime achieve chemical accuracy under realistic noise, showing that our method is both resource-efficient and noise-resilient for practical quantum chemistry simulations in the near term.

quantum algorithms & computation↗

Analysis of combustion acoustic phenomena in compression–ignition engines using large eddy simulation

As computational capabilities continue to grow, exploring the limits of computational fluid dynamics to capture complex and elusive phenomena, which are otherwise difficult to study by experimental techniques, is one of the main targets for the research community. This paper presents a detailed analysis of the physical processes that lead to combustion noise emissions in internal combustion engines. In particular, diesel combustion in a compression-ignition (CI) engine is studied in order to understand the singular behavior of the in-cylinder flow field responsible for the acoustic emissions. The main objective is, therefore, to improve the understanding of the phenomena involved in CI engine noise using large eddy simulations. Several visualization methods are employed to investigate the connection between combustion behavior and its effects on the pressure field. In addition, proper orthogonal decomposition is used to analyze the modal energy distribution among all the acoustic modes. The results show that the acoustic signature is fundamentally conditioned by the intensity of the premixed combustion rather than by the pressure oscillations generated by turbulent fluctuations in the flame surface established during the diffusion stage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamical topological phase realized in a trapped-ion quantum simulator

Nascent platforms for programmable quantum simulation offer unprecedented access to new regimes of far-from-equilibrium quantum many-body dynamics in almost isolated systems. Here achieving precise control over quantum many-body entanglement is an essential task for quantum sensing and computation. Extensive theoretical work indicates that these capabilities can enable dynamical phases and critical phenomena that show topologically robust methods to create, protect and manipulate quantum entanglement that self-correct against large classes of errors. However, so far, experimental realizations have been confined to classical (non-entangled) symmetry-breaking orders. In this work, we demonstrate an emergent dynamical symmetry-protected topological phase, in a quasiperiodically driven array of ten 171 Yb + hyperfine qubits in Quantinuum’s System Model H1 trapped-ion quantum processor. This phase shows edge qubits that are dynamically protected from control errors, cross-talk and stray fields. Crucially, this edge protection relies purely on emergent dynamical symmetries that are absolutely stable to generic coherent perturbations. Here, this property is special to quasiperiodically driven systems: as we demonstrate, the analogous edge states of a periodically driven qubit array are vulnerable to symmetry-breaking errors and quickly decohere. Our work paves the way for implementation of more complex dynamical topological orders that would enable error-resilient manipulation of quantum information.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Low-overhead transversal fault tolerance for universal quantum computation

Fast, reliable logical operations are essential for realizing useful quantum computers. By redundantly encoding logical qubits into many physical qubits and using syndrome measurements to detect and correct errors, we can achieve low logical error rates. However, for many practical quantum error correction codes such as the surface code, owing to syndrome measurement errors, standard constructions require multiple extraction rounds—of the order of the code distance d—for fault-tolerant computation, particularly considering fault-tolerant state preparation. Here we show that logical operations can be performed fault-tolerantly with only a constant number of extraction rounds for a broad class of quantum error correction codes, including the surface code with magic state inputs and feedforward, to achieve ‘transversal algorithmic fault tolerance’. Through the combination of transversal operations7 and new strategies for correlated decoding, despite only having access to partial syndrome information, we prove that the deviation from the ideal logical measurement distribution can be made exponentially small in the distance, even if the instantaneous quantum state cannot be made close to a logical codeword because of measurement errors. We supplement this proof with circuit-level simulations in a range of relevant settings, demonstrating the fault tolerance and competitive performance of our approach. Furthermore, our work sheds new light on the theory of quantum fault tolerance and has the potential to reduce the space–time cost of practical fault-tolerant quantum computation by over an order of magnitude.

Zhou, Hengyun [QuEra Computing, Boston, MA (United↗

Quantum Dynamics at Scale: Ultrafast Control of Emergent Functional Materials

Confluence of extreme-scale quantum dynamics simulations (i.e. quantum@scale) and cutting-edge x-ray free-electron laser experiments are revolutionizing materials science. An archetypal example is the exciting concept of using picosecond light pulses to control emergent material properties on demand in atomically-thin layered materials. This paper describes efforts to scale our quantum molecular dynamics engine toward the United States' first exaflop/s computer, under an Aurora Early Science Program project named "Metascalable layered material genome". Key algorithmic and computing techniques incorporated are: (1) globally-scalable and locally-fast solvers within a linear-scaling divide-conquer-recombine algorithmic framework; (2) algebraic `BLASification' of computational kernels; and (3) data alignment and loop restructuring, along with register and cache blocking, for enhanced vectorization and efficient memory access. The resulting weak-scaling parallel efficiency was 0.93 on 131,072 Intel Xeon Phi cores for a 56.6 million atom (or 169 million valence-electron) system, whereas the various code transformations achieved 5-fold speedup. The optimized simulation engine allowed us for the first time to establish a significant effect of substrate on the dynamics of layered material upon electronic excitation.

Algebraic BLASification↗

Investigating two-dimensional adjoint QCD on the lattice

We present our investigations of SU(N) adjoint QCD in two dimensions with one Majorana fermion on the lattice. We determine the relevant parameter range for the simulations with Wilson fermions and present results for Polyakov loop, chiral condensate, and string tension. In the theory with massive fermions, all observables we checked show qualitative agreement between numerical lattice data and theory, while the massless limit is more subtle since chiral and non-invertible symmetry of the continuum theory are explicitly broken by lattice regularization. In thermal compactification, we observe N perturbative vacua for the holonomy potential at high-T with instanton events connecting them, and a unique vacuum at low-T. At finite-N, this is a cross-over and it turns to a phase transition at large-N thermodynamic limit. In circle compactification with periodic boundary conditions, we observe a unique center-symmetric minimum at any radius. In continuum, the instantons in the thermal case carry zero modes (for even N) and indeed, in the lattice simulations, we observe that chiral condensate is dominated by instanton centers, where zero modes are localized. We present lattice results on the issue of confinement vs. screening in the theory and comment on the roles of chiral symmetry and non-invertible symmetry.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Graph-Based Approaches for Predicting Solvation Energy in Multiple Solvents: Open Datasets and Machine Learning Models

The solvation properties of molecules, often estimated using quantum chemical simulations, are important in the synthesis of energy storage materials, drugs, and industrial chemicals. Here, we develop machine learning models of solvation energies to replace expensive quantum chemistry calculations with inexpensive-to-compute message-passing neural network models that require only the molecular graph as inputs. Our models are trained on a new database of solvation energies for 130,258 molecules taken from the QM9 dataset computed in five solvents (acetone, ethanol, acetonitrile, dimethyl sulfoxide, and water) via an implicit solvent model. Our best model achieves a mean absolute error of 0.5 kcal/mol for molecules with nine or fewer non-hydrogen atoms and 1 kcal/mol for molecules with between 10 and 14 non-hydrogen atoms. We make the entire dataset of 651,290 computed entries openly available and provide simple web and programmatic interfaces to enable others to run our solvation energy model on new molecules. This model calculates the solvation energies for molecules using only the SMILES string and also provides an estimate of whether each molecule is within the domain of applicability of our model. We envision that the dataset and models will provide the functionality needed for the rapid screening of large chemical spaces to discover improved molecules for many applications.

25 ENERGY STORAGE↗

Steady-state properties of multi-orbital systems using quantum Monte Carlo

A precise dynamical characterization of quantum impurity models with multiple interacting orbitals is challenging. In quantum Monte Carlo methods, this is embodied by sign problems. A dynamical sign problem makes it exponentially difficult to simulate long times. A multi-orbital sign problem generally results in a prohibitive computational cost for systems with multiple impurity degrees of freedom even in static equilibrium calculations. Here, we present a numerically exact inchworm method that simultaneously alleviates both sign problems, enabling simulation of multi-orbital systems directly in the equilibrium or nonequilibrium steady-state. The method combines ideas from the recently developed steady-state inchworm Monte Carlo framework [Erpenbeck et al., Phys. Rev. Lett. 130, 186301 (2023)] with other ideas from the equilibrium multi-orbital inchworm algorithm [Eidelstein et al., Phys. Rev. Lett. 124, 206405 (2020)]. We verify our method by comparison with analytical limits and numerical results from previous methods.

Chemistry↗