Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum algorithm”

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 1,261 records · Page 70

Coherent electrical control of a single high-spin nucleus in silicon

Nuclear spins are highly coherent quantum objects. In large ensembles, their control and detection via magnetic resonance is widely exploited, for example, in chemistry, medicine, materials science and mining. Nuclear spins also featured in early proposals for solid-state quantum computers and demonstrations of quantum search and factoring algorithms. Scaling up such concepts requires controlling individual nuclei, which can be detected when coupled to an electron. However, the need to address the nuclei via oscillating magnetic fields complicates their integration in multi-spin nanoscale devices, because the field cannot be localized or screened. Control via electric fields would resolve this problem, but previous methods relied on transducing electric signals into magnetic fields via the electron–nuclear hyperfine interaction, which severely affects nuclear coherence. In this work, we demonstrate the coherent quantum control of a single 123 Sb (spin-7/2) nucleus using localized electric fields produced within a silicon nanoelectronic device. The method exploits an idea proposed in 1961 but not previously realized experimentally with a single nucleus. Our results are quantitatively supported by a microscopic theoretical model that reveals how the purely electrical modulation of the nuclear electric quadrupole interaction results in coherent nuclear spin transitions that are uniquely addressable owing to lattice strain. The spin dephasing time, 0.1 seconds, is orders of magnitude longer than those obtained by methods that require a coupled electron spin to achieve electrical driving. These results show that high-spin quadrupolar nuclei could be deployed as chaotic models, strain sensors and hybrid spin-mechanical quantum systems using all-electrical controls. Integrating electrically controllable nuclei with quantum dots could pave the way to scalable, nuclear- and electron-spin-based quantum computers in silicon that operate without the need for oscillating magnetic fields.

42 ENGINEERING↗

Quantifying the magic of quantum channels

Abstract To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other non-stabilizer quantum resources. Motivated by this necessity, we develop a resource theory for magic quantum channels to characterize and quantify the quantum ‘magic’ or non-stabilizerness of noisy quantum circuits. For qudit quantum computing with odd dimension d , it is known that quantum states with non-negative Wigner function can be efficiently simulated classically. First, inspired by this observation, we introduce a resource theory based on completely positive-Wigner-preserving quantum operations as free operations, and we show that they can be efficiently simulated via a classical algorithm. Second, we introduce two efficiently computable magic measures for quantum channels, called the mana and thauma of a quantum channel. As applications, we show that these measures not only provide fundamental limits on the distillable magic of quantum channels, but they also lead to lower bounds for the task of synthesizing non-Clifford gates. Third, we propose a classical algorithm for simulating noisy quantum circuits, whose sample complexity can be quantified by the mana of a quantum channel. We further show that this algorithm can outperform another approach for simulating noisy quantum circuits, based on channel robustness. Finally, we explore the threshold of non-stabilizerness for basic quantum circuits under depolarizing noise.

Wang, Xin (ORCID:0000000206413186)↗

Survey on nonlocal games and operator space theory

This review article is concerned with a recently uncovered connection between operator spaces, a noncommutative extension of Banach spaces, and quantum nonlocality, a striking phenomenon which underlies many of the applications of quantum mechanics to information theory, cryptography, and algorithms. Using the framework of nonlocal games, we relate measures of the nonlocality of quantum mechanics to certain norms in the Banach and operator space categories. We survey recent results that exploit this connection to derive large violations of Bell inequalities, study the complexity of the classical and quantum values of games and their relation to Grothendieck inequalities, and quantify the nonlocality of different classes of entangled states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A reactant-coordinate-based approach to state-to-state differential cross sections for tetratomic reactions

A new algorithm is proposed to compute quantum mechanically state-to-state differential cross sections for reactions involving four atoms in full dimensionality. This algorithm, which is based on the propagation of an initial state specific wave packet exclusively in reactant coordinates, extracts the S-matrix elements in the product channel by first interpolating the time-dependent wave packet using a collocation method at selected time intervals on the product coordinate grid and then projecting out the contributions of all final product states. Here, this approach is efficient and accurate, particularly for reactions that are dominated by a product well or long-range interactions. Validation of this approach is demonstrated for the H 2 + OH → H + H 2 O reaction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Non-orthogonal determinants in multi-Slater-Jastrow trial wave functions for fixed-node diffusion Monte Carlo

The accuracy and efficiency of ab initio Quantum Monte Carlo (QMC) algorithms benefit greatly from compact variational trial wave functions that accurately reproduce ground state properties of a system. We investigate the possibility of using multi-Slater-Jastrow trial wave functions with non-orthogonal determinants by optimizing identical single particle orbitals independently in separate determinants. As a test case, we compute variational and fixed-node diffusion Monte Carlo (FN-DMC) energies of a C 2 molecule. For a given multi-determinant expansion, we find that this non-orthogonal orbital optimization results in a consistent improvement in the variational energy and the FN-DMC energy on the order of a few tenths of an eV. In some cases, fewer non-orthogonal determinants are required compared to orthogonal ones in order to achieve similar accuracy in FN-DMC. Our calculations indicate that trial wave functions with non-orthogonal determinants can improve computed energies in a QMC calculation when compared to their orthogonal counterparts.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Thermodynamics of correlated electrons in a magnetic field

The Hofstadter–Hubbard model captures the physics of strongly correlated electrons in an applied magnetic field, which is relevant to many recent experiments on Moiré materials. Few large-scale, numerically exact simulations exists for this model. In this work, we simulate the Hubbard–Hofstadter model using the determinant quantum Monte Carlo (DQMC) algorithm. We report the field and Hubbard interaction strength dependence of charge compressibility, fermion sign, local moment, magnetic structure factor, and specific heat. The gross structure of magnetic Bloch bands and band gaps determined by the non-interacting Hofstadter spectrum is preserved in the presence of U. Incompressible regions of the phase diagram have improved fermion sign. At half filling and intermediate and larger couplings, a strong orbital magnetic field delocalizes electrons and reduces the effect of Hubbard U on thermodynamic properties of the system.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Particle-based simulation approach for single-particle interference experiments: Application to double-slit experiments

We review recent progress in the development of event-by-event simulation algorithms that do not rely on concepts of quantum theory or probability theory but are nevertheless capable of reproducing the averages computed from quantum theory. The simulation approach is illustrated by applications to single-photon double-slit experiments. We demonstrate that it is possible to give a particle-only description of single-photon interference experiments without first solving a wave equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mana and thermalization: Probing the feasibility of near-Clifford Hamiltonian simulation

Quantum hydrodynamics is the emergent classical dynamics governing transport of conserved quantities in generic strongly interacting quantum systems. Here, recent matrix product operator methods [1,2] have made simulations of quantum hydrodynamics in 1+1D tractable, but they do not naturally generalize to 2+1D or higher, and they offer limited guidance as to the difficulty of simulations on quantum computers. Near-Clifford simulation algorithms are not limited to one dimension, and future error-corrected quantum computers will likely be bottlenecked by non-Clifford operations. We therefore investigate the non-Clifford resource requirements for simulation of quantum hydrodynamics using mana, a resource theory of non-Clifford operations. For infinite-temperature starting states, we find that the mana of subsystems quickly approaches zero, while for starting states with energy above some threshold the mana approaches a nonzero value. Surprisingly, in each case the finite-time mana is governed by the subsystem entropy, not the thermal state mana; we argue that this is because mana is a sensitive diagnostic of finite-time deviations from canonical typicality.

1-dimensional spin chains↗

Auxiliary-field-based trial wave functions in quantum Monte Carlo calculations

Quantum Monte Carlo (QMC) algorithms have long relied on Jastrow factors to incorporate dynamic correlation into trial wave functions. While Jastrow-type wave functions have been widely employed in real-space algorithms, they have seen limited use in second-quantized QMC methods, particularly in projection methods that involve a stochastic evolution of the wave function in imaginary time. Here we propose a scheme for generating Jastrow-type correlated trial wave functions for auxiliary-field QMC methods. The method is based on decoupling the two-body Jastrow into one-body projectors coupled to auxiliary fields, which then operate on a single determinant to produce a multideterminant trial wave function. We demonstrate that intelligent sampling of the most significant determinants in this expansion can produce compact trial wave functions that reduce errors in the calculated energies. Lastly, our technique may be readily generalized to accommodate a wide range of two-body Jastrow factors and applied to a variety of model and chemical systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum-inspired method for solving the Vlasov-Poisson equations

Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high-resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently, it has been proposed that matrix product state (MPS) methods, a quantum-inspired but classical algorithm, can be used to solve partial differential equations with exponential speed-up, provided that the solution can be compressed and efficiently represented as a MPS within some tolerable error threshold. Here, in this work, we explore the practicality of MPS methods for solving the Vlasov-Poisson equations for systems with one coordinate in space and one coordinate in velocity, and find that important features of linear and nonlinear dynamics, such as damping or growth rates and saturation amplitudes, can be captured while compressing the solution significantly. Furthermore, by comparing the performance of different mappings of the distribution functions onto the MPS, we develop an intuition of the MPS representation and its behavior in the context of solving the Vlasov-Poisson equations, which will be useful for extending these methods to higher-dimensional problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization

Classical optimization problems can be solved by adiabatically preparing the ground state of a quantum Hamiltonian that encodes the problem. The performance of this approach is determined by the smallest gap encountered during the evolution. Here, we consider the maximum independent set problem, which can be efficiently encoded in the Hamiltonian describing a Rydberg atom array. We present a general construction of instances of the problem for which the minimum gap decays superexponentially with system size, implying a superexponentially large time to solution via adiabatic evolution. The small gap arises from locally independent choices which cause the system to initially evolve and localize into a configuration far from the solution in terms of Hamming distance. We investigate remedies to this problem. Specifically, we show that quantum quenches in these models can exhibit signatures of quantum many-body scars, which in turn, can circumvent the superexponential gaps. By quenching from a suboptimal configuration, states with a larger ground-state overlap can be prepared, illustrating the utility of quantum quenches as an algorithmic tool. Published by the American Physical Society 2024

Schiffer, Benjamin F. (ORCID:0000000189512157)↗

FTK: A Simplicial Spacetime Meshing Framework for Robust and Scalable Feature Tracking

In this work, we present the Feature Tracking Kit (FTK), a framework that simplifies, scales, and delivers various feature-tracking algorithms for scientific data. The key of FTK is our simplicial spacetime meshing scheme that generalizes both regular and unstructured spatial meshes to spacetime while tessellating spacetime mesh elements into simplices. The benefits of using simplicial spacetime meshes include (1) reducing ambiguity cases for feature extraction and tracking, (2) simplifying the handling of degeneracies using symbolic perturbations, and (3) enabling scalable and parallel processing. The use of simplicial spacetime meshing simplifies and improves the implementation of several feature-tracking algorithms for critical points, quantum vortices, and isosurfaces. As a software framework, FTK provides end users with VTK/ParaView filters, Python bindings, a command line interface, and programming interfaces for feature-tracking applications. We demonstrate use cases as well as scalability studies through both synthetic data and scientific applications including tokamak, fluid dynamics, and superconductivity simulations. We also conduct end-to-end performance studies on the Summit supercomputer. FTK is open sourced under the MIT license: https://github.com/hguo/ftk.

97 MATHEMATICS AND COMPUTING↗

MPS++

The MPS++ computer code simulates models of strongly correlated quantum lattice systems. The algorithm used is the density-matrix renormalization method formulated in the matrix product states language. These models and methods are used to obtain ground state, dynamic, finite temperature and time evolution properties of the underlying materials that are simulated. These materials are usually one- and quasi-one dimensional strongly correlated electronic systems, such as high temperature superconductors, manganites, and other transition metal oxides. This code is (mostly) an implementation of the paper “The density-matrix renormalization group in the age of matrix product states” by U. Schollwoeck, and references therein, found at http://arxiv.org/abs/1008.3477v2 , and that was also published in Annals of Physics 326,96 (2011).

Source record↗

Enabling particle applications for exascale computing platforms

The Exascale Computing Project (ECP) is invested in co-design to assure that key applications are ready for exascale computing. Within ECP, the Co-design Center for Particle Applications (CoPA) is addressing challenges faced by particle-based applications across four “sub-motifs”: short-range particle–particle interactions (e.g., those which often dominate molecular dynamics (MD) and smoothed particle hydrodynamics (SPH) methods), long-range particle–particle interactions (e.g., electrostatic MD and gravitational N-body), particle-in-cell (PIC) methods, and linear-scaling electronic structure and quantum molecular dynamics (QMD) algorithms. Our crosscutting co-designed technologies fall into two categories: proxy applications (or “apps”) and libraries. Proxy apps are vehicles used to evaluate the viability of incorporating various types of algorithms, data structures, and architecture-specific optimizations and the associated trade-offs; examples include ExaMiniMD, CabanaMD, CabanaPIC, and ExaSP2. Libraries are modular instantiations that multiple applications can utilize or be built upon; CoPA has developed the Cabana particle library, PROGRESS/BML libraries for QMD, and the SWFFT and fftMPI parallel FFT libraries. Success is measured by identifiable “lessons learned” that are translated either directly into parent production application codes or into libraries, with demonstrated performance and/or productivity improvement. The libraries and their use in CoPA’s ECP application partner codes are also addressed.

97 MATHEMATICS AND COMPUTING↗

Translating Non-Trivial Algorithms from the Circuit Model to the Measurement

We provide a set of prescriptions for implementing a circuit model algorithm as measurement based quantum computing via a large discrete cluster state constructed sequentially, from qubits implemented as single photons. We describe a large optical discrete graph state capable of searching logical 4 and 8 element lists as an example. To do so we have developed several prescriptions based on analytic evaluation of the evolution of discrete cluster states and graph state equations. We describe the cluster state as a sequence of repeated entanglement and measurement steps using a small number of single photons for each step. These prescriptions can be generalized to implement any logical circuit model operation with appropriate single photon measurements and feed forward error corrections. Such a cluster state is not guaranteed to be optimal (i.e. minimum number of photons, measurements, run time).

Smith, IV, Amos M↗

MPS++

The MPS++ computer code simulates models of strongly correlated quantum lattice systems. The algorithm used is the density-matrix renormalization method formulated in the matrix product states language. These models and methods are used to obtain ground state, dynamic, finite temperature and time evolution properties of the underlying materials that are simulated. These materials are usually one- and quasi-one dimensional strongly correlated electronic systems, such as high temperature superconductors, manganites, and other transition metal oxides. This code is (mostly) an implementation of the paper "The density-matrix renormalization group in the age of matrix product states" by U. Schollwoeck, and references therein, found at http://arxiv.org/abs/1008.3477v2 , and that was also published in Annals of Physics 326,96 (2011).

Source record↗