Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum, Quantum Algorithms”

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,297 records · Page 72

Parallel hybrid quantum-classical machine learning for kernelized time-series classification

Supervised time-series classification garners widespread interest because of its applicability throughout a broad application domain including finance, astronomy, biosensors, and many others. Here, in this work, we tackle this problem with hybrid quantum-classical machine learning, deducing pairwise temporal relationships between time-series instances using a timeseries Hamiltonian kernel (TSHK). A TSHK is constructed with a sum of inner products generated by quantum states evolved using a parameterized time evolution operator. This sum is then optimally weighted using techniques derived from multiple kernel learning. Because we treat the kernel weighting step as a differentiable convex optimization problem, our method can be regarded as an end-to-end learnable hybrid quantum-classical-convex neural network, or QCC-net, whose output is a data set-generalized kernel function suitable for use in any kernelized machine learning technique such as the support vector machine (SVM). Using our TSHK as input to a SVM, we classify univariate and multivariate time-series using quantum circuit simulators and demonstrate the efficient parallel deployment of the algorithm to 127-qubit superconducting quantum processors using quantum multi-programming.

97 MATHEMATICS AND COMPUTING↗

Statistical Complexity of Quantum Learning

Abstract Learning problems involve settings in which an algorithm has to make decisions based on data, and possibly side information such as expert knowledge. This study has two main goals. First, it reviews and generalizes different results on the data and model complexity of quantum learning, where the data and/or the algorithm can be quantum, focusing on information‐theoretic techniques. Second, it introduces the notion of copy complexity, which quantifies the number of copies of a quantum state required to achieve a target accuracy level. Copy complexity arises from the destructive nature of quantum measurements, which irreversibly alter the state to be processed, limiting the information that can be extracted about quantum data. As a result, empirical risk minimization is generally inapplicable. The paper presents novel results on the copy complexity for both training and testing. To make the paper self‐contained and approachable by different research communities, an extensive background material is provided on classical results from statistical learning theory, as well as on the distinguishability of quantum states. Throughout, the differences between quantum and classical learning are highlighted by addressing both supervised and unsupervised learning, and extensive pointers are provided to the literature.

97 MATHEMATICS AND COMPUTING↗

Surface hopping with a manifold of electronic states. I. Incorporating surface-leaking to capture lifetimes

We investigate the incorporation of the surface-leaking (SL) algorithm into Tully’s fewest-switches surface hopping (FSSH) algorithm to simulate some electronic relaxation induced by an electronic bath in conjunction with some electronic transitions between discrete states. The resulting SL-FSSH algorithm is benchmarked against exact quantum scattering calculations for three one-dimensional model problems. The results show excellent agreement between SL-FSSH and exact quantum dynamics in the wide band limit, suggesting the potential for a SL-FSSH algorithm. Discrepancies and failures are investigated in detail to understand the factors that will limit the reliability of SL-FSSH, especially the wide band approximation. Considering the easiness of implementation and the low computational cost, we expect this method to be useful in studying processes involving both a continuum of electronic states (where electronic dynamics are probabilistic) and processes involving only a few electronic states (where non-adiabatic processes cannot ignore short-time coherence)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large-scale simulations of Floquet physics on near-term quantum computers

Abstract Periodically driven quantum systems exhibit a diverse set of phenomena but are more challenging to simulate than their equilibrium counterparts. Here, we introduce the Quantum High-Frequency Floquet Simulation (QHiFFS) algorithm as a method to simulate fast-driven quantum systems on quantum hardware. Central to QHiFFS is the concept of a kick operator which transforms the system into a basis where the dynamics is governed by a time-independent effective Hamiltonian. This allows prior methods for time-independent simulation to be lifted to simulate Floquet systems. We use the periodically driven biaxial next-nearest neighbor Ising (BNNNI) model, a natural test bed for quantum frustrated magnetism and criticality, as a case study to illustrate our algorithm. We implemented a 20-qubit simulation of the driven two-dimensional BNNNI model on Quantinuum’s trapped ion quantum computer. Our error analysis shows that QHiFFS exhibits not only a cubic advantage in driving frequency ω but also a linear advantage in simulation time t compared to Trotterization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Factorization in large-scale many-body calculations

One approach for solving interacting many-fermion systems is the configuration-interaction method, also sometimes called the interacting shell model, where one finds eigenvalues of the Hamiltonian in a many-body basis of Slater determinants (antisymmetrized products of single-particle wavefunctions). The resulting Hamiltonian matrix is typically very sparse, but for large systems the nonzero matrix elements can nonetheless require terabytes or more of storage. An alternate algorithm, applicable to a broad class of systems with symmetry, in our case rotational invariance, is to exactly factorize both the basis and the interaction using additive/multiplicative quantum numbers; such an algorithm recreates the many-body matrix elements on the fly and can reduce the storage requirements by an order of magnitude or more. Here, we discuss factorization in general and introduce a novel, generalized factorization method, essentially a ‘double-factorization’ which speeds up basis generation and set-up of required arrays. Although we emphasize techniques, we also place factorization in the context of a specific (unpublished) configuration-interaction code, BIGSTICK, which runs both on serial and parallel machines, and discuss the savings in memory due to factorization.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Simulating noncontact atomic force microscopy images

A scanning probe with an atomically sharp tip is used in atomic force microscopy. As the probe is rastered over the specimen of interest, changes in its vibration mode can be ascribed to changes in the interatomic forces between the specimen and the tip. Various modes for implementing atomic force measures exist. One of the most successful modes is frequency-modulation noncontact atomic force microscopy. Here we address the role of replicating accurate forces on the probe tip to simulate images within this mode. In this work, we examine several approaches. One involves the use of classical force fields based on interatomic potentials, where the potentials are often fit to experiment. Other approaches center on the use of forces generated from quantum-based calculations. We consider the development of a “virtual tip” approximation wherein the probe tip senses electrostatic forces generated by the specimen. This approach treats the specimen quantum mechanically, while the tip is treated as a classical object. We also consider the use of an embedding approximation to avoid direct computations of the specimen in the presence of the tip. In this method, the tip and specimen are treated quantum mechanically. However, the electronic structure of the specimen is computed in the absence of the probe tip. The electronic density of the specimen is then fixed and the electronic structure of the tip is then computed in the presence of the fixed density. As a general approach, we outline new methods for the full computation of quantum forces between the tip and specimen. We note that quantum-based forces are particularly important as they directly contain the chemical nature of the forces present without the use of any adjustable parameters. We illustrate recent algorithmic developments to computing quantum forces that can produce accurate simulations of atomic force microscopy images for large and complex molecular species. We also suggest new pathways to overcome current challenges in this rapidly evolving field.

36 MATERIALS SCIENCE↗

Effective Gaps Are Not Effective: Quasipolynomial Classical Simulation of Obstructed Stoquastic Hamiltonians

All known examples suggesting an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (StoqAQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric subspaces. The symmetries produce large effective eigenvalue gaps, which in turn make adiabatic computation efficient. We present a classical algorithm to subexponentially sample from an effective subspace of any k -local stoquastic Hamiltonian H , without a priori knowledge of its symmetries (or near symmetries). Our algorithm maps any k -local Hamiltonian to a graph G = ( V , E ) with | V | = O (poly (n)) , where n is the number of qubits. Given the well-known result of Babai [Graph isomorphism in quasipolynomial time, in Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (2016), pp. 684–697], we exploit graph isomorphism to study the automorphisms of G and arrive at an algorithm quasipolynomial in | V | for producing samples from effective subspace eigenstates of H . Our results rule out exponential separations between StoqAQC and classical computation that arise from hidden symmetries in k -local Hamiltonians. Our graph representation of H is not limited to stoquastic Hamiltonians and may rule out corresponding obstructions in nonstoquastic cases, or be useful in studying additional properties of k -local Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variational approaches to constructing the many-body nuclear ground state for quantum computing

Here, we explore the preparation of specific nuclear states on gate-based quantum hardware using variational algorithms. Large-scale classical diagonalizations of the nuclear shell model have reached sizes of 10 9 –10 10 basis states but are still severely limited by computational resources. Quantum computing can, in principle, solve such systems exactly with exponentially fewer resources than classical computing. Exact solutions for large systems require many qubits and large gate depth, but variational approaches can effectively limit the required gate depth. We use the unitary coupled cluster approach to construct approximations of the ground-state vectors, later to be used in dynamics calculations. The testing ground is the phenomenological shell model space, which allows us to mimic the complexity of the internucleon interactions. We find that often one needs to minimize over a large number of parameters, using a large number of entanglements that makes the application on existing hardware challenging. Prospects for rapid improvements with more capable hardware are, however, very encouraging.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Many-fermion simulation from the contracted quantum eigensolver without fermionic encoding of the wave function

Quantum computers potentially have an exponential advantage over classical computers for the quantum simulation of many-fermion quantum systems. Nonetheless, fermions are more expensive to simulate than bosons due to the fermionic encoding—a mapping by which the qubits are encoded with fermion statistics. Here we generalize the contracted quantum eigensolver (CQE) to avoid fermionic encoding of the wave function. In contrast to the variational quantum eigensolver, the CQE solves for a many-fermion stationary state by minimizing the contraction (projection) of the Schrödinger equation onto two fermions. We avoid fermionic encoding of the wave function by contracting the Schrödinger equation onto an unencoded pair of particles. Solution of the resulting contracted equation by a series of unencoded two-body exponential transformations generates an unencoded wave function from which the energy and two-fermion reduced density matrix (2-RDM) can be computed. We apply the unencoded and the encoded CQE algorithms to the hydrogen fluoride molecule, the dissociation of oxygen O 2 , and a series of hydrogen chains. Both algorithms show comparable convergence towards the exact ground-state energies and 2-RDMs, but the unencoded algorithm has computational advantages in terms of state preparation and tomography.

74 ATOMIC AND MOLECULAR PHYSICS↗

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

Instantons in Quantum Annealing: Thermally Assisted Tunneling Vs Quantum Monte Carlo Simulations

Recent numerical result (arXiv:1512.02206) from Google suggested that the D-Wave quantum annealer may have an asymptotic speed-up than simulated annealing, however, the asymptotic advantage disappears when it is compared to quantum Monte Carlo (a classical algorithm despite its name). We show analytically that the asymptotic scaling of quantum tunneling is exactly the same as the escape rate in quantum Monte Carlo for a class of problems. Thus, the Google result might be explained in our framework. We also found that the transition state in quantum Monte Carlo corresponds to the instanton solution in quantum tunneling problems, which is observed in numerical simulations.

Quantum Monte Carlo↗

Computing Free Energies with Fluctuation Relations on Quantum Computers

As a central thermodynamic property, free energy enables the calculation of virtually any equilibrium property of a physical system, allowing for the construction of phase diagrams and predictions about transport, chemical reactions, and biological processes. Thus, methods for efficiently computing free energies, which in general is a difficult problem, are of great interest to broad areas of physics and the natural sciences. The majority of techniques for computing free energies target classical systems, leaving the computation of free energies in quantum systems less explored. Recently developed fluctuation relations enable the computation of free energy differences in quantum systems from an ensemble of dynamic simulations. While performing such simulations is exponentially hard on classical computers, quantum computers can efficiently simulate the dynamics of quantum systems. Here, we present an algorithm utilizing a fluctuation relation known as the Jarzynski equality to approximate free energy differences of quantum systems on a quantum computer. In this work we discuss under which conditions our approximation becomes exact, and under which conditions it serves as a strict upper bound. Furthermore, we successfully demonstrate a proof of concept of our algorithm using the transverse field Ising model on a real quantum processor. As quantum hardware continues to improve, we anticipate that our algorithm will enable computation of free energy differences for a wide range of quantum systems useful across the natural sciences.

97 MATHEMATICS AND COMPUTING↗

Automated searching for quantum subsystem codes

Quantum error correction allows for faulty quantum systems to behave in an effectively error-free manner. One important class of techniques for quantum error correction is the class of quantum subsystem codes, which are relevant both to active quantum error-correcting schemes as well as to the design of self-correcting quantum memories. Previous approaches for investigating these codes have focused on applying theoretical analysis to look for interesting codes and to investigate their properties. In this paper we present an alternative approach that uses computational analysis to accomplish the same goals. Specifically, we present an algorithm that computes the optimal quantum subsystem code that can be implemented given an arbitrary set of measurement operators that are tensor products of Pauli operators. We then demonstrate the utility of this algorithm by performing a systematic investigation of the quantum subsystem codes that exist in the setting where the interactions are limited to two-body interactions between neighbors on lattices derived from the convex uniform tilings of the plane.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Authentication Protocol using Quantum Superposition States

When it became known that quantum computers could break the RSA (named for its creators - Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have sufficient computational power to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. An authentication protocol using quantum superposition states instead of quantum entangled particles is proposed. The random number shared between a sender and a receiver can be used for classical encryption after the authentication has succeeded. The proposed protocol can be implemented with the current technologies we introduce in this paper.

97 MATHEMATICS AND COMPUTING↗

Simplified projection on total spin zero for state preparation on quantum computers

Here, we introduce a simple algorithm for projecting on J = 0 states of a many-body system by performing a series of rotations to remove states with angular momentum projections greater than zero. Existing methods rely on unitary evolution with the two-body operator J 2 , which when expressed in the computational basis contains many complicated Pauli strings requiring Trotterization and leading to very deep quantum circuits. Our approach performs the necessary projections using the one-body operators J x and J z . By leveraging the method of Cartan decomposition, the unitary transformations that perform the projection can be parametrized as a product of a small number of two-qubit rotations, with angles determined by an efficient classical optimization. Given the reduced complexity in terms of gates, this approach can be used to prepare approximate ground states of even-even nuclei by projecting onto the J = 0 component of deformed Hartree-Fock states. We estimate the resource requirements in terms of the universal gate set {H,S, CNOT ,T} and briefly discuss a variant of the algorithm that projects onto J = 1/2 states of a system with an odd number of fermions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Control simulations of many-body quantum systems by a synergism of discrete real-time learning and optimal control theory

We present a self-consistent algorithm for optimal control simulations of many-body quantum systems. The algorithm features a two-step synergism that combines discrete real-time machine learning (DRTL) with Quantum Optimal Control Theory (QOCT) using the time-dependent Schrödinger equation. Specifically, in step (1), DRTL is employed to identify a compact working space (i.e., the important portion of the Hilbert space) for the time evolution of the many-body quantum system in the presence of a control field (i.e., the initial or previously updated field), and in step (2), QOCT utilizes the DRTL-determined working space to find a newly updated control field for a chosen objective. Steps 1 and 2 are iterated until a self-consistent control objective value is reached such that the resulting optimal control field yields the same targeted objective value when the corresponding working space is systematically enlarged. Furthermore, to demonstrate this two-step self-consistent DRTL-QOCT synergistic algorithm, we perform optimal control simulations of strongly interacting 1D as well as 2D Heisenberg spin systems. In both scenarios, only a single spin (at the left end site for 1D and the upper left corner site for 2D) is driven by the time-dependent control fields to create an excitation at the opposite site as the target. It is found that, starting from all spin-down zero excitation states, the synergistic method is able to identify working spaces and convergence of the desired controlled dynamics with just a few iterations of the overall algorithm. In the cases studied, the dimensionality of the working space scales only quasi-linearly with the number of spins.

Artificial neural networks↗

Predicting Adaptively Chosen Observables in Quantum Systems

Recent advances have demonstrated that 𝒪⁡(log 𝑀) measurements suffice to predict 𝑀 properties of arbitrarily large quantum many-body systems. However, these remarkable findings assume that the properties to be predicted are chosen independently of the data. This assumption can be violated in practice, where scientists adaptively select properties after looking at previous predictions. This work investigates the adaptive setting for three classes of observables: local, Pauli, and bounded-Frobenius-norm observables. We prove that Ω⁡(√𝑀) samples of an arbitrarily large unknown quantum state are necessary to predict expectation values of 𝑀 adaptively chosen local and Pauli observables, where the system size scales exponentially and polynomially in 𝑀, respectively. We also present computationally efficient algorithms that achieve this information-theoretic lower bound. In contrast, for bounded-Frobenius-norm observables, we devise an algorithm requiring only 𝒪⁡(log 𝑀) samples, independent of system size. These results highlight the potential pitfalls of adaptivity in analyzing data from quantum experiments and provide algorithmic tools to safeguard against erroneous predictions in quantum experiments.

Machine learning↗

Hybridized Methods for Quantum Simulation in the Interaction Picture

Conventional methods of quantum simulation involve trade-offs that limit their applicability to specific contexts where their use is optimal. In particular, the interaction picture simulation has been found to provide substantial asymptotic advantages for some Hamiltonians, but incurs prohibitive constant factors and is incompatible with methods like qubitization. We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations over known algorithms. These approaches show asymptotic improvements over the individual methods that comprise them and further make interaction picture simulation methods practical in the near term. Physical applications of these hybridized methods yield a gate complexity scaling as log 2 ⁡ Λ in the electric cutoff Λ for the Schwinger Model and independent of the electron density for collective neutrino oscillations, outperforming the scaling for all current algorithms with these parameters. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter λ used to impose an energy cost on time-evolution into an unphysical subspace.

97 MATHEMATICS AND COMPUTING↗