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 289 records · Page 16

Entanglement of periodic states, the quantum Fourier transform, and Shor's factoring algorithm

The preprocessing stage of Shor's algorithm generates a class of quantum states referred to as periodic states, on which the quantum Fourier transform is applied. Such states also play an important role in other quantum algorithms that rely on the quantum Fourier transform. Since entanglement is believed to be a necessary resource for quantum computational speedup, we analyze the entanglement of periodic states and the way it is affected by the quantum Fourier transform. To this end, we derive a formula that evaluates the Groverian entanglement measure for periodic states. Using this formula, we explain the surprising result that the Groverian entanglement of the periodic states built up during the preprocessing stage is only slightly affected by the quantum Fourier transform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Computing for Neutrino-Nucleus Scattering

Neutrino-nucleus cross section uncertainties are expected to be a dominant systematic in future accelerator neutrino experiments. The cross sections are determined by the linear response of the nucleus to the weak interactions of the neutrino, and are dominated by energy and distance scales of the order of the separation between nucleons in the nucleus. These response functions are potentially an important early physics application of quantum computers. Here we present an analysis of the resources required and their expected scaling for scattering cross section calculations. The current estimates of Trotter steps needed to achieve an energy resolution of 10 MeV and the number of CNOT gates for analyzing Ar40 highlights the need for significant improvements in algorithms. We also examine simple small-scale neutrino-nucleus models on modern quantum hardware. In this paper, we use variational methods to obtain the ground state of a three nucleon system (the triton) and then implement the relevant time evolution. To tame the errors in present-day NISQ devices, we explore the use of different error-mitigation techniques to increase the fidelity of the calculations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Time-evolution methods for matrix-product states

Highlights: • Introductory review of time-evolution methods for matrix-product states. • Detailed description of five state-of-the-art algorithms. • Extended comparison of numerical examples. • Extended error analysis of each algorithm. • Pseudo-code examples towards an implementation where necessary. - Abstract: Matrix-product states have become the de facto standard for the representation of one-dimensional quantum many body states. During the last few years, numerous new methods have been introduced to evaluate the time evolution of a matrix-product state. Here, we will review and summarize the recent work on this topic as applied to finite quantum systems. We will explain and compare the different methods available to construct a time-evolved matrix-product state, namely the time-evolving block decimation, the MPO W{sup I,II} method, the global Krylov method, the local Krylov method and the one- and two-site time-dependent variational principle. We will also apply these methods to four different representative examples of current problem settings in condensed matter physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Direct estimation of the density of states for fermionic systems

Simulating time evolution is one of the most natural applications of quantum computers and is thus one of the most promising prospects for achieving practical quantum advantage. Here, we develop quantum algorithms to extract thermodynamic properties by estimating the density of states (DOS), which is a central object in quantum statistical mechanics. We introduce several key innovations that significantly improve the practicality and extend the generality of previous techniques. First, our approach allows one to estimate the DOS only for a specific subspace of the full Hilbert space. This is crucial for fermionic systems, since both canonical and grand canonical ensemble thermal equilibrium properties depend on subspaces of fixed number. Second, in our approach, by time evolving very simple, random initial states, such as randomly chosen computational basis states, we can exactly recover the DOS on average. Third, due to circuit-depth limitations, we only reconstruct the DOS up to a convolution with a Gaussian window—thus all imperfections that shift the energy levels by less than the width of the convolution window will not significantly affect the estimated DOS. For these reasons, we find the approach is a promising candidate for early quantum advantage as even short-time, noisy dynamics can yield a semiquantitative reconstruction of the DOS (convolution with a broad Gaussian window), while early fault-tolerant devices will likely enable higher-resolution DOS reconstruction through longer time evolutions. We demonstrate the practicality of our approach in representative Fermi-Hubbard and spin models and indeed find that our approach is highly robust against algorithmic errors in the time evolution and against gate noise. We further demonstrate that our approach is compatible with noisy intermediate-scale quantum (NISQ) computing NISQ-friendly variational techniques, introducing and leveraging a technique for variational time evolution.

97 MATHEMATICS AND COMPUTING↗

On the spin separation of algebraic two-component relativistic Hamiltonians

The separation of the spin-free and spin-dependent terms of a given relativistic Hamiltonian is usually facilitated by the Dirac identity. However, this is no longer possible for the recently developed exact two-component relativistic Hamiltonians derived from the matrix representation of the Dirac equation in a kinetically balanced basis. This stems from the fact that the decoupling matrix does not have an explicit form. To resolve this formal difficulty, we first define the spin-dependent term as the difference between a two-component Hamiltonian corresponding to the full Dirac equation and its one-component counterpart corresponding to the spin-free Dirac equation. The series expansion of the spin-dependent term is then developed in two different ways. One is in the spirit of the Douglas-Kroll-Hess (DKH) transformation and the other is based on the perturbative expansion of a two-component Hamiltonian of fixed structure, either the two-step Barysz-Sadlej-Snijders (BSS) or the one-step exact two-component (X2C) form. The algorithms for constructing arbitrary order terms are proposed for both schemes and their convergence patterns are assessed numerically. Truncating the expansions to finite orders leads naturally to a sequence of novel spin-dependent Hamiltonians. In particular, the order-by-order distinctions among the DKH, BSS, and X2C approaches can nicely be revealed. The well-known Pauli, zeroth-order regular approximation, and DKH1 spin-dependent Hamiltonians can also be recovered naturally by appropriately approximating the decoupling and renormalization matrices. On the practical side, the sf-X2C+so-DKH3 Hamiltonian, together with appropriately constructed generally contracted basis sets, is most promising for accounting for relativistic effects in two steps, first spin-free and then spin-dependent, with the latter applied either perturbatively or variationally.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Control of Evolution Mixed Variational Inclusions

Optimal control problems of primal and dual evolution mixed variational inclusions, in reflexive Banach spaces, are studied. The solvability analysis of the mixed state systems is established via duality principles. The optimality analysis is performed in terms of perturbation conjugate duality methods, and proximation penalty-duality algorithms to mixed optimality conditions are further presented. Applications to nonlinear diffusion constrained problems as well as quasistatic elastoviscoplastic bilateral contact problems exemplify the theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Method for simulating dose reduction in digital mammography using the Anscombe transformation

Purpose: This work proposes an accurate method for simulating dose reduction in digital mammography starting from a clinical image acquired with a standard dose. Methods: The method developed in this work consists of scaling a mammogram acquired at the standard radiation dose and adding signal-dependent noise. The algorithm accounts for specific issues relevant in digital mammography images, such as anisotropic noise, spatial variations in pixel gain, and the effect of dose reduction on the detective quantum efficiency. The scaling process takes into account the linearity of the system and the offset of the detector elements. The inserted noise is obtained by acquiring images of a flat-field phantom at the standard radiation dose and at the simulated dose. Using the Anscombe transformation, a relationship is created between the calculated noise mask and the scaled image, resulting in a clinical mammogram with the same noise and gray level characteristics as an image acquired at the lower-radiation dose. Results: The performance of the proposed algorithm was validated using real images acquired with an anthropomorphic breast phantom at four different doses, with five exposures for each dose and 256 nonoverlapping ROIs extracted from each image and with uniform images. The authors simulated lower-dose images and compared these with the real images. The authors evaluated the similarity between the normalized noise power spectrum (NNPS) and power spectrum (PS) of simulated images and real images acquired with the same dose. The maximum relative error was less than 2.5% for every ROI. The added noise was also evaluated by measuring the local variance in the real and simulated images. The relative average error for the local variance was smaller than 1%. Conclusions: A new method is proposed for simulating dose reduction in clinical mammograms. In this method, the dependency between image noise and image signal is addressed using a novel application of the Anscombe transformation. NNPS, PS, and local noise metrics confirm that this method is capable of precisely simulating various dose reductions.

60 APPLIED LIFE SCIENCES↗

A method for the characterization of intra-pixel response of infrared sensor

Due to the response variations within a pixel, response of sensor varies with the positions of the point target. The accurate measurement of intra-pixel response of the sensor is the key to high-precision centroid estimation and radiometric calibration. In this paper, we establish an intra-pixel response model based on the pixel structure and use Gauss function to describe the beam spot profile. We further calculate the full width at half maximum (FWHM) of the Gauss function and the fill factor of the infrared sensor using the grid search algorithm. Experimental results show that the Gauss function FWHM differences among different pixels using the same radius could be less than 6%. The fill factors are not constant in different pixels because of errors in the process of manufacture and assembly, and the error between model and measured values is less than 3.6%. This work could be useful for stellar calibration and centroid estimation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ion-Stockmayer clusters: Minima, classical thermodynamics, and variational ground state estimates of Li{sup +}(CH{sub 3}NO{sub 2}){sub n} (n = 1–20)

Structural optimizations, classical NVT ensemble, and variational Monte Carlo simulations of ion Stockmayer clusters parameterized to approximate the Li{sup +}(CH{sub 3}NO{sub 2}){sub n} (n = 1–20) systems are performed. The Metropolis algorithm enhanced by the parallel tempering strategy is used to measure internal energies and heat capacities, and a parallel version of the genetic algorithm is employed to obtain the most important minima. The first solvation sheath is octahedral and this feature remains the dominant theme in the structure of clusters with n ≥ 6. The first “magic number” is identified using the adiabatic solvent dissociation energy, and it marks the completion of the second solvation layer for the lithium ion-nitromethane clusters. It corresponds to the n = 18 system, a solvated ion with the first sheath having octahedral symmetry, weakly bound to an eight-membered and a four-membered ring crowning a vertex of the octahedron. Variational Monte Carlo estimates of the adiabatic solvent dissociation energy reveal that quantum effects further enhance the stability of the n = 18 system relative to its neighbors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sensitivity of blackbody effective emissivity to wavelength and temperature: By genetic algorithm

A variable-temperature blackbody (VTBB) is used to calibrate an infrared radiation thermometer (pyrometer). The effective emissivity (ε{sub eff}) of a VTBB is dependent on temperature and wavelength other than the geometry of the VTBB. In the calibration process the effective emissivity is often assumed to be constant within the wavelength and temperature range. There are practical situations where the sensitivity of the effective emissivity needs to be known and correction has to be applied. We present a method using a genetic algorithm to investigate the sensitivity of the effective emissivity to wavelength and temperature variation. Two matlab® programs are generated: the first to model the radiance temperature calculation and the second to connect the model to the genetic algorithm optimization toolbox. The effective emissivity parameter is taken as a chromosome and optimized at each wavelength and temperature point. The difference between the contact temperature (reading from a platinum resistance thermometer or liquid in glass thermometer) and radiance temperature (calculated from the ε{sub eff} values) is used as an objective function where merit values are calculated and best fit ε{sub eff} values selected. The best fit ε{sub eff} values obtained as a solution show how sensitive they are to temperature and wavelength parameter variation. Uncertainty components that arise from wavelength and temperature variation are determined based on the sensitivity analysis. Numerical examples are considered for illustration.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Long-time simulations for fixed input states on quantum hardware

Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.

97 MATHEMATICS AND COMPUTING↗

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)↗

Qubit coupled cluster singles and doubles variational quantum eigensolver ansatz for electronic structure calculations

Variational quantum eigensolver (VQE) for electronic structure calculations is believed to be one major potential application of near term quantum computing. Among all proposed VQE algorithms, the unitary coupled cluster singles and doubles excitations (UCCSD) VQE ansatz has achieved high accuracy and received a lot of research interest. However, the UCCSD VQE based on fermionic excitations needs extra terms for the parity when using Jordan–Wigner transformation. Here we introduce a new VQE ansatz based on the particle preserving exchange gate to achieve qubit excitations. The proposed VQE ansatz has gate complexity up-bounded to O ( n 4 ) for all-to-all connectivity where n is the number of qubits of the Hamiltonian. Numerical results of simple molecular systems such as BeH 2 , H 2 O, N 2 , H 4 and H 6 using the proposed VQE ansatz gives very accurate results within errors about 10 -3 Hartree.

Physics↗

Application of an efficient generator-coordinate subspace-selection algorithm to neutrinoless double- β decay

The generator coordinate method begins with the variational construction of a set of nonorthogonal mean-field states that span a subspace of the full many-body Hilbert space. These states are then often projected onto states with good quantum numbers to restore symmetries, leading to a set with members that can be similar to one another, and it is sometimes possible to reduce this set without greatly affecting results. Here, we propose a greedy algorithm that we call the energy-transition-orthogonality procedure (ENTROP) to select subsets of important states. As applied here, the approach selects on the basis of diagonal energy, orthogonality, and contribution to the matrix element that governs neutrinoless double-β decay. We present both shell-model and preliminary ab initio calculations of this matrix element for the decay of 76Ge, with quadrupole deformation parameters and the isoscalar pairing strength as generator coordinates. ENTROP converges quickly, reducing significantly the number of basis states needed for an accurate calculation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Geometric integration of the Vlasov-Maxwell system with a variational particle-in-cell scheme

A fully variational, unstructured, electromagnetic particle-in-cell integrator is developed for integration of the Vlasov-Maxwell equations. Using the formalism of discrete exterior calculus [Desbrun et al., e-print arXiv:math/0508341 (2005)], the field solver, interpolation scheme, and particle advance algorithm are derived through minimization of a single discrete field theory action. As a consequence of ensuring that the action is invariant under discrete electromagnetic gauge transformations, the integrator exactly conserves Gauss's law.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Squeezed coherent states of motion for ions confined in quadrupole and octupole ion traps

Quasiclassical dynamics of trapped ions is characterized by applying the time dependent variational principle (TDVP) on coherent state orbits, in case of quadrupole and octupole combined (Paul and Penning) or radiofrequency (RF) traps. A dequantization algorithm is proposed, by which the classical Hamilton (energy) function associated to the system results as the expectation value of the quantum Hamiltonian on squeezed coherent states. We develop such method and particularize the quantum Hamiltonian for both combined and RF nonlinear traps, that exhibit axial symmetry. We also build the classical Hamiltonian functions for the particular traps we considered, and find the classical equations of motion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental quantum learning of a spectral decomposition

Currently available quantum hardware allows for small-scale implementations of quantum machine learning algorithms. Such experiments aid the search for applications of quantum computers by benchmarking the near-term feasibility of candidate algorithms. Here we demonstrate the quantum learning of a two-qubit unitary by a sequence of three parameterized quantum circuits containing a total of 21 variational parameters. Moreover, we variationally diagonalize the unitary to learn its spectral decomposition, i.e., its eigenvalues and eigenvectors. We illustrate how this can be used as a subroutine to compress the depth of dynamical quantum simulations. One can view our implementation as a demonstration of entanglement-enhanced machine learning, as only a single (entangled) training data pair is required to learn a 4 × 4 unitary matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-C-207-05: A Comparative Study of Noise-Reduction Algorithms for Low-Dose Cone-Beam Computed Tomography

Purpose: To study different noise-reduction algorithms and to improve the image quality of low dose cone beam CT for patient positioning in radiation therapy. Methods: In low-dose cone-beam CT, the reconstructed image is contaminated with excessive quantum noise. In this study, three well-developed noise reduction algorithms namely, a) penalized weighted least square (PWLS) method, b) split-Bregman total variation (TV) method, and c) compressed sensing (CS) method were studied and applied to the images of a computer–simulated “Shepp-Logan” phantom and a physical CATPHAN phantom. Up to 20% additive Gaussian noise was added to the Shepp-Logan phantom. The CATPHAN phantom was scanned by a Varian OBI system with 100 kVp, 4 ms and 20 mA. For comparing the performance of these algorithms, peak signal-to-noise ratio (PSNR) of the denoised images was computed. Results: The algorithms were shown to have the potential in reducing the noise level for low-dose CBCT images. For Shepp-Logan phantom, an improvement of PSNR of 2 dB, 3.1 dB and 4 dB was observed using PWLS, TV and CS respectively, while for CATPHAN, the improvement was 1.2 dB, 1.8 dB and 2.1 dB, respectively. Conclusion: Penalized weighted least square, total variation and compressed sensing methods were studied and compared for reducing the noise on a simulated phantom and a physical phantom scanned by low-dose CBCT. The techniques have shown promising results for noise reduction in terms of PSNR improvement. However, reducing the noise without compromising the smoothness and resolution of the image needs more extensive research.

60 APPLIED LIFE SCIENCES↗