Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “variational 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 325 records · Page 18

Ground state property calculations of LiH n complexes using IBM Qiskit’s quantum simulator

In this study, the variational quantum eigensolver (VQE) on a quantum simulator is used in calculating ground state electronic structure properties of the LiH n , n = 1–3, complexes including their singly charged ions. Results calculated using classical electronic structure algorithms are also included. We investigate the use of the unitary coupled cluster with singles and doubles (UCCSD) Ansatz using VQE within Qiskit and compare results to full configuration interaction (FCI) calculations. Computed ground state energies, electron affinities, ionization potentials, and dipole moments are considered. We report the first-of-its-kind simulated quantum computing results of selected LiH n species and use the parity orbital to qubit mapping scheme. We find that VQE/UCCSD results are comparable to classical coupled clusters with singles and doubles for all considered systems with respect to FCI. A VQE calculation cost evaluation is included in which we evaluate performance using both Jordan–Wigner and parity orbital to qubit mapping schemes. We also discuss some of the current limitations of utilizing VQE for the study of chemical systems.

97 MATHEMATICS AND COMPUTING↗

A partially reflecting random walk on spheres algorithm for electrical impedance tomography

In this work, we develop a probabilistic estimator for the voltage-to-current map arising in electrical impedance tomography. This novel so-called partially reflecting random walk on spheres estimator enables Monte Carlo methods to compute the voltage-to-current map in an embarrassingly parallel manner, which is an important issue with regard to the corresponding inverse problem. Our method uses the well-known random walk on spheres algorithm inside subdomains where the diffusion coefficient is constant and employs replacement techniques motivated by finite difference discretization to deal with both mixed boundary conditions and interface transmission conditions. We analyze the global bias and the variance of the new estimator both theoretically and experimentally. Subsequently, the variance of the new estimator is considerably reduced via a novel control variate conditional sampling technique which yields a highly efficient hybrid forward solver coupling probabilistic and deterministic algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher order terms using the Julia based QAOA simulation tool \texttt{JuliQAOA} to perform classical angle finding for up to $49$ QAOA layers ($p$). Parameter transfer of the fixed angles is validated using a combination of full statevector, Projected Entangled Pair States (PEPS), Matrix Product State (MPS), and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of $p$ - there are many cases where the performance temporarily decreases as a function of $p$ - but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the $100+$ qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM Quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM NISQ processors up to $p=5$ on \texttt{ibm\_fez}, up to $p=9$ on \texttt{ibm\_torino}, and up to $p=10$ on \texttt{ibm\_pittsburgh}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Lie algebraic theory of barren plateaus for deep parameterized quantum circuits

Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit, and measuring the expectation value of some operator. Despite their promise, the trainability of these algorithms is hindered by barren plateaus (BPs) induced by the expressiveness of the circuit, the entanglement of the input data, the locality of the observable, or the presence of noise. Up to this point, these sources of BPs have been regarded as independent. In this work, we present a general Lie algebraic theory that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits, even in the presence of certain noise models. Our results allow us to understand under one framework all aforementioned sources of BPs. This theoretical leap resolves a standing conjecture about a connection between loss concentration and the dimension of the Lie algebra of the circuit’s generators.

97 MATHEMATICS AND COMPUTING↗

Dynamic properties of a polaron coupled to dispersive optical phonons

We study static and dynamic properties of an electron coupled to dispersive quantum optical phonons in the framework of the Holstein model defined on a one-dimensional lattice. Calculations are performed using the Lanczos algorithm based on a highly efficient construction of the variational Hilbert space. Even small phonon dispersion has a profound effect on the low-energy optical response. While the upward phonon dispersion broadens the optical spectra due to single-phonon excitations, the downward dispersion has the opposite effect. With increasing dispersion, a multiphonon excitation (MPE) state becomes the lowest excited state of the system at zero momentum and determines the low-frequency response of the optical conductivity where the threshold for optical absorption moves below the single-phonon frequency. Multiphonon states form a well-defined bandlike feature just above the polaron band as clearly seen in the electron spectral function. Low-energy MPEs should be observable in systems with strong optical phonon dispersion in optical as well as angle-resolved photoemission experiments.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Crustal structure beneath two seismic stations in the Sunda-Banda arc transition zone derived from receiver function analysis

We analyzed receiver functions to estimate the crustal thickness and velocity structure beneath two stations of Geofon (GE) network in the Sunda-Banda arc transition zone. The stations are located in two different tectonic regimes: Sumbawa Island (station PLAI) and Timor Island (station SOEI) representing the oceanic and continental characters, respectively. We analyzed teleseismic events of 80 earthquakes to calculate the receiver functions using the time-domain iterative deconvolution technique. We employed 2D grid search (H-κ) algorithm based on the Moho interaction phases to estimate crustal thickness and Vp/Vs ratio. We also derived the S-wave velocity variation with depth beneath both stations by inverting the receiver functions. We obtained that beneath station PLAI the crustal thickness is about 27.8 km with Vp/Vs ratio 2.01. As station SOEI is covered by very thick low-velocity sediment causing unstable solution for the inversion, we modified the initial velocity model by adding the sediment thickness estimated using high frequency content of receiver functions in H-κ stacking process. We obtained the crustal thickness is about 37 km with VP/Vs ratio 2.2 beneath station SOEI. We suggest that the high Vp/Vs in station PLAI may indicate the presence of fluid ascending from the subducted plate to the volcanic arc, whereas the high Vp/Vs in station SOEI could be due to the presence of sediment and rich mafic composition in the upper crust and possibly related to the serpentinization process in the lower crust. We also suggest that the difference in velocity models and crustal thicknesses between stations PLAI and SOEI are consistent with their contrasting tectonic environments.

58 GEOSCIENCES↗

Reconstruction algorithm for limited-angle diffraction tomography for microwave NDE

Microwave tomography is becoming a popular imaging modality in nondestructive evaluation and medicine. A commonly encountered challenge in tomography in general is that in many practical situations a full 360° angular access is not possible and with limited access, the quality of reconstructed image is compromised. This paper presents an approach for reconstruction with limited angular access in diffraction tomography. The algorithm takes advantage of redundancies in image Fourier space data obtained from diffracted field measurements and couples it to an error minimization technique using a constrained total variation (CTV) minimization. Initial results from simulated data have been presented here to validate the approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Total Variation Meets Topological Persistence: A First Encounter

We present first insights into the relation between two popular yet apparently dissimilar approaches to denoising of one dimensional signals, based on (i) total variation (TV) minimization and (ii) ideas from topological persistence. While a close relation between (i) and (ii) might phenomenologically not be unexpected, our work appears to be the first to make this connection precise for one dimensional signals. We provide a link between (i) and (ii) that builds on the equivalence between TV-L{sup 2} regularization and taut strings and leads to a novel and efficient denoising algorithm that is contrast preserving and operates in O(nlogn) time, where n is the size of the input.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient method for energy levels calculation using full symmetry and exact kinetic energy operator: Tetrahedral molecules

A simultaneous use of the full molecular symmetry and of an exact kinetic energy operator (KEO) is of key importance for accurate predictions of vibrational levels at a high energy range from a potential energy surface (PES). An efficient method that permits a fast convergence of variational calculations would allow iterative optimization of the PES parameters using experimental data. In this work, we propose such a method applied to tetrahedral AB{sub 4} molecules for which a use of high symmetry is crucial for vibrational calculations. A symmetry-adapted contracted angular basis set for six redundant angles is introduced. Simple formulas using this basis set for explicit calculation of the angular matrix elements of KEO and PES are reported. The symmetric form (six redundant angles) of vibrational KEO without the sin(q){sup −2} type singularity is derived. The efficient recursive algorithm based on the tensorial formalism is used for the calculation of vibrational matrix elements. A good basis set convergence for the calculations of vibrational levels of the CH{sub 4} molecule is demonstrated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Binary Control Pulse Optimization for Quantum Systems

Quantum control aims to manipulate quantum systems toward specific quantum states or desired operations. Designing highly accurate and effective control steps is vitally important to various quantum applications, including energy minimization and circuit compilation. In this paper we focus on discrete binary quantum control problems and apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Specifically, we develop a generic model and extend it in several ways. We introduce a squared L 2 -penalty function to handle additional side constraints, to model requirements such as allowing at most one control to be active. We introduce a total variation (TV) regularizer to reduce the number of switches in the control. We modify the popular gradient ascent pulse engineering (GRAPE) algorithm, develop a new alternating direction method of multipliers (ADMM) algorithm to solve the continuous relaxation of the penalized model, and then apply rounding techniques to obtain binary control solutions. We propose a modified trust-region method to further improve the solutions. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Magnetized plasma flows and magnetoplasmadynamic thrusters

An axisymmetric magnetohydrodynamics (MHD) model of the acceleration channel of an applied-field magnetoplasmadynamic thruster is presented. A set of general relationships between the flow features and the thruster performance is obtained. The boundary conditions and the flow regime, which depends on the Alfven Mach number, are shown to provide the ideal limits of steady state thruster operation. In the present analysis, a Hamiltonian formulation of the MHD plasma flow model is adopted. This formulation makes it possible to cast the model equations in a variational form, which is then solved by using a finite element numerical algorithm.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Gauge properties of the guiding center variational symplectic integrator

Recently, variational symplectic algorithms have been developed for the long-time simulation of charged particles in magnetic fields. As a direct consequence of their derivation from a discrete variational principle, these algorithms have very good long-time energy conservation, as well as exactly preserving discrete momenta. We present stability results for these algorithms, focusing on understanding how explicit variational integrators can be designed for this type of system. It is found that for explicit algorithms an instability arises because the discrete symplectic structure does not become the continuous structure in the t → 0 limit. We examine how a generalized gauge transformation can be used to put the Lagrangian in the "antisymmetric discretization gauge," in which the discrete symplectic structure has the correct form, thus eliminating the numerical instability. Finally, it is noted that the variational guiding center algorithms are not electromagnetically gauge invariant. By designing a model discrete Lagrangian, we show that the algorithms are approximately gauge invariant as long as A and Φ are relatively smooth. A gauge invariant discrete Lagrangian is very important in a variational particle-in-cell algorithm where it ensures current continuity and preservation of Gauss's law.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A simulation-optimization model for Stone column-supported embankment stability considering rainfall effect

Landslide due to rainfall has been and continues to be one of the most important concerns of geotechnical engineering. The paper presents the variation of factor of safety of stone column-supported embankment constructed over soft soil due to change in water level for an incessant period of rainfall. A combined simulation-optimization based methodology has been proposed to predict the critical surface of failure of the embankment and to optimize the corresponding factor of safety under rainfall conditions using an evolutionary genetic algorithm NSGA-II (Non-Dominated Sorted Genetic Algorithm-II). It has been observed that the position of water table can be reliably estimated with varying periods of infiltration using developed numerical method. The parametric study is presented to study the optimum factor of safety of the embankment and its corresponding critical failure surface under the steady-state infiltration condition. Results show that in case of floating stone columns, period of infiltration has no effect on factor of safety. Even critical failure surfaces for a particular floating column length remain same irrespective of rainfall duration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resource-Optimized Fermionic Local-Hamiltonian Simulation on a Quantum Computer for Quantum Chemistry

The ability to simulate a fermionic system on a quantum computer is expected to revolutionize chemical engineering, materials design, nuclear physics, to name a few. Thus, optimizing the simulation circuits is of significance in harnessing the power of quantum computers. Here, we address this problem in two aspects. In the fault-tolerant regime, we optimize the R z and T gate counts along with the ancilla qubit counts required, assuming the use of a product-formula algorithm for implementation. We obtain a savings ratio of two in the gate counts and a savings ratio of eleven in the number of ancilla qubits required over the state of the art. In the pre-fault tolerant regime, we optimize the two-qubit gate counts, assuming the use of the variational quantum eigensolver (VQE) approach. Specific to the latter, we present a framework that enables bootstrapping the VQE progression towards the convergence of the ground-state energy of the fermionic system. This framework, based on perturbation theory, is capable of improving the energy estimate at each cycle of the VQE progression, by about a factor of three closer to the known ground-state energy compared to the standard VQE approach in the test-bed, classically-accessible system of the water molecule. The improved energy estimate in turn results in a commensurate level of savings of quantum resources, such as the number of qubits and quantum gates, required to be within a pre-specified tolerance from the known ground-state energy. We also explore a suite of generalized transformations of fermion to qubit operators and show that resource-requirement savings of up to more than 20 % , in small instances, is possible.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Towards large-scale quantum optimization solvers with few qubits

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Flexibility of the factorized form of the unitary coupled cluster Ansatz

The factorized form of the unitary coupled cluster Ansatz is a popular state preparation Ansatz for electronic structure calculations of molecules on quantum computers. It is often viewed as an approximation (based on the Trotter product formula) for the conventional unitary coupled cluster operator. In this work, we show that the factorized form is quite flexible, allowing one to range from a conventional configuration interaction, to conventional unitary coupled cluster, to efficient approximations that lie in between these two. The variational minimization of the energy often allows simpler factorized unitary coupled cluster approximations to achieve high accuracy, even if they do not accurately approximate the Trotter product formula. This is similar to how quantum approximate optimization algorithms can achieve high accuracy with a small number of levels.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Solving the nuclear pairing model with neural network quantum states

In this work, we present a variational Monte Carlo method that solves the nuclear many-body problem in the occupation number formalism exploiting an artificial neural network representation of the groundstate wave function. A memory-efficient version of the stochastic reconfiguration algorithm is developed to train the network by minimizing the expectation value of the Hamiltonian. We benchmark this approach against widely used nuclear many-body methods by solving a model used to describe pairing in nuclei for different types of interaction and different values of the interaction strength. Despite its polynomial computational cost, our method outperforms coupled-cluster and provides energies that are in excellent agreement with the numerically-exact full configuration interaction values.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A variational multi-symplectic particle-in-cell algorithm with smoothing functions for the Vlasov-Maxwell system

Smoothing functions are commonly used to reduce numerical noise arising from coarse sampling of particles in particle-in-cell (PIC) plasma simulations. When applying smoothing functions to symplectic algorithms, the conservation of symplectic structure should be guaranteed to preserve good conservation properties. In this paper, we show how to construct a variational multi-symplectic PIC algorithm with smoothing functions for the Vlasov-Maxwell system. The conservation of the multi-symplectic structure and the reduction of numerical noise make this algorithm specifically suitable for simulating long-term dynamics of plasmas, such as those in the steady-state operation or long-pulse discharge of a super-conducting tokamak. The algorithm has been implemented in a 6D large scale PIC code. Numerical examples are given to demonstrate the good conservation properties of the multi-symplectic algorithm and the reduction of the noise due to the application of smoothing function.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗