Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum algorithms and computation”

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

tih_vqe [SWR-23-32]

This software supports the paper, "Exploring the scaling limitations of the variational quantum eigensolver with the bond dissociation of hydride diatomic molecules," published in the International Journal of Quantum Chemistry, whose abstract is as follows: Materials simulations involving strongly correlated electrons pose fundamental challenges to state-of-the-art electronic structure methods but are hypothesized to be the ideal use case for quantum computing. To date, no quantum computer has simulated a molecule of a size and complexity relevant to real-world applications, despite the fact that the variational quantum eigensolver (VQE) algorithm can predict chemically accurate total energies. Nevertheless, because of the many applications of moderately-sized, strongly correlated systems, such as molecular catalysts, the successful use of the VQE stands as an important waypoint in the advancement toward useful chemical modeling on near-term quantum processors. In this paper, we take a significant step in this direction. We lay out the steps, write, and run parallel code for an (emulated) quantum computer to compute the bond dissociation curves of the TiH, LiH, NaH, and KH diatomic hydride molecules using VQE. TiH was chosen as a relatively simple chemical system that incorporates d orbitals and strong electron correlation. Because current VQE implementations on existing quantum hardware are limited by qubit error rates, the number of qubits available, and the allowable gate depth, recent studies have focused on chemical systems involving s and p block elements. Through VQE + UCCSD calculations of TiH, we evaluate the near-term feasibility of modeling a molecule with d-orbitals on real quantum hardware. We demonstrate that the inclusion of d-orbitals and the use of the UCCSD ansatz, which are both necessary to capture the correct TiH physics, dramatically increase the cost of this problem. We estimate the approximate error rates necessary to model TiH on current quantum computing hardware using VQE+UCCSD and show them to likely be prohibitive until significant improvements in hardware and error correction algorithms are available.

Graf, Peter↗

Hybrid Quantum-Classical Eigensolver without Variation or Parametric Gates

The use of near-term quantum devices that lack quantum error correction, for addressing quantum chemistry and physics problems, requires hybrid quantum-classical algorithms and techniques. Here, we present a process for obtaining the eigenenergy spectrum of electronic quantum systems. This is achieved by projecting the Hamiltonian of a quantum system onto a limited effective Hilbert space specified by a set of computational bases. From this projection, an effective Hamiltonian is obtained. Furthermore, a process for preparing short depth quantum circuits to measure the corresponding diagonal and off-diagonal terms of the effective Hamiltonian is given, whereby quantum entanglement and ancilla qubits are used. The effective Hamiltonian is then diagonalized on a classical computer using numerical algorithms to obtain the eigenvalues. The use case of this approach is demonstrated for ground state and excited states of BeH2 and LiH molecules, and the density of states, which agrees well with exact solutions. Additionally, hardware demonstration is presented using IBM quantum devices for H2 molecule.

Jouzdani, Pejman (ORCID:0000000256470381)↗

Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer

Abstract Realizing the potential of near-term quantum computers to solve industry-relevant constrained-optimization problems is a promising path to quantum advantage. In this work, we consider the extractive summarization constrained-optimization problem and demonstrate the largest-to-date execution of a quantum optimization algorithm that natively preserves constraints on quantum hardware. We report results with the Quantum Alternating Operator Ansatz algorithm with a Hamming-weight-preserving XY mixer (XY-QAOA) on trapped-ion quantum computer. We successfully execute XY-QAOA circuits that restrict the quantum evolution to the in-constraint subspace, using up to 20 qubits and a two-qubit gate depth of up to 159. We demonstrate the necessity of directly encoding the constraints into the quantum circuit by showing the trade-off between the in-constraint probability and the quality of the solution that is implicit if unconstrained quantum optimization methods are used. We show that this trade-off makes choosing good parameters difficult in general. We compare XY-QAOA to the Layer Variational Quantum Eigensolver algorithm, which has a highly expressive constant-depth circuit, and the Quantum Approximate Optimization Algorithm. We discuss the respective trade-offs of the algorithms and implications for their execution on near-term quantum hardware.

97 MATHEMATICS AND COMPUTING↗

Error statistics and scalability of quantum error mitigation formulas

Quantum computing promises advantages over classical computing in many problems. Nevertheless, noise in quantum devices prevents most quantum algorithms from achieving the quantum advantage. Quantum error mitigation provides a variety of protocols to handle such noise using minimal qubit resources. While some of those protocols have been implemented in experiments for a few qubits, it remains unclear whether error mitigation will be effective in quantum circuits with tens to hundreds of qubits. In this paper, we apply statistics principles to quantum error mitigation and analyse the scaling behaviour of its intrinsic error. We find that the error increases linearly O(ϵN) with the gate number N before mitigation and sublinearly O(ϵ'N γ ) after mitigation, where γ ≈ 0.5, ϵ is the error rate of a quantum gate, and ϵ' is a protocol-dependent factor. The $\sqrt{N}$ scaling is a consequence of the law of large numbers, and it indicates that error mitigation can suppress the error by a larger factor in larger circuits. We propose the importance Clifford sampling as a key technique for error mitigation in large circuits to obtain this result.

97 MATHEMATICS AND COMPUTING↗

Casimir forces in the time domain: Theory

We present a method to compute Casimir forces in arbitrary geometries and for arbitrary materials based on the finite-difference time-domain (FDTD) scheme. The method involves the time evolution of electric and magnetic fields in response to a set of current sources, in a modified medium with frequency-independent conductivity. The advantage of this approach is that it allows one to exploit existing FDTD software, without modification, to compute Casimir forces. In this paper, we focus on the derivation, implementation choices, and essential properties of the time-domain algorithm, both considered analytically and illustrated in the simplest parallel-plate geometry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Connes distance function on fuzzy sphere and the connection between geometry and statistics

An algorithm to compute Connes spectral distance, adaptable to the Hilbert-Schmidt operatorial formulation of non-commutative quantum mechanics, was developed earlier by introducing the appropriate spectral triple and used to compute infinitesimal distances in the Moyal plane, revealing a deep connection between geometry and statistics. In this paper, using the same algorithm, the Connes spectral distance has been calculated in the Hilbert-Schmidt operatorial formulation for the fuzzy sphere whose spatial coordinates satisfy the su(2) algebra. This has been computed for both the discrete and the Perelemov’s SU(2) coherent state. Here also, we get a connection between geometry and statistics which is shown by computing the infinitesimal distance between mixed states on the quantum Hilbert space of a particular fuzzy sphere, indexed by n ∈ ℤ/2.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rethinking Programming Paradigms in the QC-HPC Context

Programming for today’s quantum computers is making significant strides toward modern workflows compatible with high performance computing (HPC), but fundamental challenges still remain in the integration of these vastly different technologies. Quantum computing (QC) programming languages share some common ground, as well as their emerging runtimes and algorithmic modalities. In this short paper, we explore avenues of refinement for the quantum processing unit (QPU) in the context of many-tasks management, asynchronous or otherwise, in order to understand the value it can play in linking QC with HPC. Through examples, we illustrate how its potential for scientific discovery might be realized.

Wong, Elaine↗

Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods

Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree–Fock and density functional theory but offer higher accuracy. Accordingly, quantum computers have been predominantly regarded as competitors to only the most accurate and costly classical methods for treating electron correlation. However, here we tighten bounds showing that certain first-quantized quantum algorithms enable exact time evolution of electronic systems with exponentially less space and polynomially fewer operations in basis set size than conventional real-time time-dependent Hartree–Fock and density functional theory. Although the need to sample observables in the quantum algorithm reduces the speedup, we show that one can estimate all elements of the k-particle reduced density matrix with a number of samples scaling only polylogarithmically in basis set size. We also introduce a more efficient quantum algorithm for first-quantized mean-field state preparation that is likely cheaper than the cost of time evolution. We conclude that quantum speedup is most pronounced for finite-temperature simulations and suggest several practically important electron dynamics problems with potential quantum advantage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient traveltime solutions of the acoustic TI eikonal equation

Numerical solutions of the eikonal (Hamilton–Jacobi) equation for transversely isotropic (TI) media are essential for imaging and traveltime tomography applications. Such solutions, however, suffer from the inherent higher-order nonlinearity of the TI eikonal equation, which requires solving a quartic polynomial for every grid point. Analytical solutions of the quartic polynomial yield numerically unstable formulations. Thus, it requires a numerical root finding algorithm, adding significantly to the computational load. Using perturbation theory we approximate, in a first order discretized form, the TI eikonal equation with a series of simpler equations for the coefficients of a polynomial expansion of the eikonal solution, in terms of the anellipticity anisotropy parameter. Such perturbation, applied to the discretized form of the eikonal equation, does not impose any restrictions on the complexity of the perturbed parameter field. Therefore, it provides accurate traveltime solutions even for models with complex distribution of velocity and anisotropic anellipticity parameter, such as that for the complicated Marmousi model. The formulation allows for large cost reduction compared to using the direct TI eikonal solver. Furthermore, comparative tests with previously developed approximations illustrate remarkable gain in accuracy in the proposed algorithm, without any addition to the computational cost.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A workflow for automatic generation and efficient refinement of individual pressure-dependent networks

Manual chemical kinetic model construction often requires modelists to at least implicitly guess all possible decay pathways and their relative fluxes for all important species. We present a workflow and associated tool for automatic generation and re finement of pressure-dependent networks that should enable modelists to efficiently and comprehensively identify decay pathways and estimate respective parameters for chemical species. This tool combines the capabilities of the Reaction Mechanism Generator (RMG) software to generate possible reaction paths, determine thermochemistry, approximate rate coefficients and estimate frequencies with the capabilities of the Arkane software to use quantum chemical parameters to compute thermochemistry and pressure dependent rates. A flux-based algorithm is used to decide which isomers to add to the network. Isomers added to the network are reacted to form other channels. When enough of the flux is accounted for by the isomers and bimolecular product channels, the generation process terminates to yield a comprehensive network. Network sensitivity analysis is applied to the network to identify the most important wells and barriers that can be refined using quantum chemistry calculations. Iterative refinement can then be used to achieve accuracy. The comprehensive network can be easily reduced using energy and flux-based algorithms to the most important channels and isomers in the network.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum simulation: From spin models to gauge-gravity correspondence

Quantum many-body systems with coherent and controllable interactions enable the realization of novel quantum materials, the quantum simulation of problems that cannot be simulated on classical computers, computational systems that are exponentially faster than existing classical algorithms, and the direct investigation of the conjectured duality between gravitational theories and quantum field theories. This project focusses on quantum phase transitions in strongly interacting many-body spin systems, and in particular on the dynamical evolution near the critical point and across the phase transition. The dynamics of a large quantum system containing more than 50 qubits is investigated in various critical regimes. In particular, the Kibble-Zurek transition has been characterized and critical exponents have been measured. Furthermore, quantum many-body scars have been observed and characterized for the first time. We are investigating the Kibble-Zurek mechanism in the quantum phase transition in one dimension from a disordered system to a system with ordering induced by Rydberg interactions between neighboring atoms. The Kibble-Zurek mechanism describes the formation of topological defects as a system evolves across a phase transitions, and is expected to apply to a large number of problems, including cosmology, where it should describe the structure of domain formation in the early universe.

74 ATOMIC AND MOLECULAR PHYSICS↗

Quantum discord for general two-qubit states: Analytical progress

We present a reliable algorithm to evaluate quantum discord for general two-qubit states, amending and extending an approach recently put forward for the subclass of X states. A closed expression for the discord of arbitrary states of two qubits cannot be obtained, as the optimization problem for the conditional entropy requires the solution to a pair of transcendental equations in the state parameters. We apply our algorithm to run a numerical comparison between quantum discord and an alternative, computable measure of nonclassical correlations, namely, the geometric discord. We identify the extremally nonclassically correlated two-qubit states according to the (normalized) geometric discord, at a fixed value of the conventional quantum discord. The latter cannot exceed the square root of the former for systems of two qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Digital-analog quantum computation

Digital quantum computing paradigm offers highly desirable features such as universality, scalability, and quantum error correction. However, physical resource requirements to implement useful error-corrected quantum algorithms are prohibitive in the current era of NISQ devices. As an alternative path to performing universal quantum computation, within the NISQ era limitations, we propose to merge digital single-qubit operations with analog multiqubit entangling blocks in an approach we call digital-analog quantum computing (DAQC). Along these lines, although the techniques may be extended to any resource, we propose to use unitaries generated by the ubiquitous Ising Hamiltonian for the analog entangling block and we prove its universal character. Here, we construct explicit DAQC protocols for efficient simulations of arbitrary inhomogeneous Ising, two-body, and M-body spin Hamiltonian dynamics by means of single-qubit gates and a fixed homogeneous Ising Hamiltonian. Additionally, we compare a sequential approach where the interactions are switched on and off (stepwise DAQC) with an always-on multiqubit interaction interspersed by fast single-qubit pulses (banged DAQC). Finally, we perform numerical tests comparing purely digital schemes with DAQC protocols, showing a remarkably better performance of the latter. The proposed DAQC approach combines the robustness of analog quantum computing with the flexibility of digital methods.

97 MATHEMATICS AND COMPUTING↗

Building a Universal Nuclear Energy Density Functional (UNEDF). SciDAC-2 Project

An understanding of the properties of atomic nuclei is crucial for a complete nuclear theory, for element formation, for properties of stars, and for present and future energy and defense applications. During the period of Dec. 1 2006 – Jun. 30, 2012, the UNEDF collaboration carried out a comprehensive study of all nuclei, based on the most accurate knowledge of the strong nuclear interaction, the most reliable theoretical approaches, the most advanced algorithms, and extensive computational resources, with a view towards scaling to the petaflop platforms and beyond. Until recently such an undertaking was hard to imagine, and even at the present time such an ambitious endeavor would be far beyond what a single researcher or a traditional research group could carry out. The UNEDF SciDAC project has developed several key computational codes and algorithms for reaching the goal of solving the nuclear quantum many-body problem throughout the chart of nuclei. Without such developments, scientific progress would not be possible. In addition the UNEDF SciDAC successfully applied these developments to solve many forefront research problems.

73 NUCLEAR PHYSICS AND RADIATION 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↗

Preliminary Assessment of Qiskit Quantum Simulator Capabilities for Development of Quantum Hopfield Neural Network for Anomaly Detection Applications (Q4 Report)

Quantum information processing offers potentially faster performance compared to the classical counterpart. The goal of this work is to investigate performance of Quantum Hopfield Neural Network for applications to anomaly detection. Preliminary study consist of assessment of computational capabilities of Qiskit quantum simulator. Eventual objective is to implement Quantum Hopfield Network algorithm for detection of weak nuisance and anomaly signal in the presence of strong and highly varying background in gamma radiation data measured during environmental screening.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A center-of-mass principle for the multiparticle Schroedinger equation

The center-of-mass principle is the key to the rapid computation of the interaction of a large number of classical particles. Electrons governed by the multiparticle Schroedinger equation have a much more complicated interaction mainly due to their spatial extent and the antisymmetry constraint on the total wave function of the combined electron system. We present a center-of-mass principle for quantum particles that accounts for this spatial extent, the antisymmetry constraint, and the potential operators. We use it to construct an algorithm for computing a size-consistent approximate wave function for large systems with simple geometries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simple approach to approximate quantum error correction based on the transpose channel

We demonstrate that there exists a universal, near-optimal recovery map--the transpose channel--for approximate quantum error-correcting codes, where optimality is defined using the worst-case fidelity. Using the transpose channel, we provide an alternative interpretation of the standard quantum error correction (QEC) conditions and generalize them to a set of conditions for approximate QEC (AQEC) codes. This forms the basis of a simple algorithm for finding AQEC codes. Our analytical approach is a departure from earlier work relying on exhaustive numerical search for the optimal recovery map, with optimality defined based on entanglement fidelity. For the practically useful case of codes encoding a single qubit of information, our algorithm is particularly easy to implement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗