Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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,495 records · Page 83

Data from "A Bayesian Record Linkage Approach to Applications in Tree Demography Using Overlapping LiDAR Scans"

Processed LiDAR data and environmental covariates from 2015 and 2019 LiDAR scans in the Vicinity of Snodgrass Mountain (Western Colorado, USA), in a geographic subset used in primary analysis for the research paper.This package contains LiDAR-derived canopy height maps for 2015 and 2019, crown polygons derived from the height maps using a segmentation algorithm, and environmental covariates supporting the model of forest growth. Source datasets include August 2015 and August 2019 discrete-return LiDAR point clouds collected by Quantum Geospatial for terrain mapping purposes on behalf of the Colorado Hazard Mapping Program and the Colorado Water Conservation Board. Both datasets adhere to the USGS QL2 quality standard. The point cloud data were processed using the R package lidR to generate a canopy height model representing maximum vegetation height above the ground surface, using a pit-free algorithm.This dataset was compiled to assess how spatial patterns of tree growth in montane and subalpine forests are influenced by water and energy availability. Understanding these growth patterns can provide insight into forest dynamics in the Southern Rocky Mountains under changing climatic conditions.This dataset contains .tif, .csv, and .txt files. This dataset additionally includes a file-level metadata (flmd.csv) file that lists each file contained in the dataset with associated metadata; and a data dictionary (dd.csv) file that contains column/row headers used throughout the files along with a definition, units, and data type.

54 ENVIRONMENTAL SCIENCES↗

A Whirlwind History of Cryptography

This presentation provides an overview of cryptography starting with the Spartan Scytale used extensively during the Peloponnesian wars up through present day. Cryptography and cryptanalysis developed side by side in arms race. Algorithm development stagnated pending cracking. Once a method of crypto was cracked, development took off. Cryptography and cryptanalysis drove developments in math, linguistics, information theory, and quantum theory, and pushed development of the first computers.

97 MATHEMATICS AND COMPUTING↗

Quantum mereology: Factorizing Hilbert space into subsystems with quasiclassical dynamics

We study the question of how to decompose Hilbert space into a preferred tensor-product factorization without any preexisting structure other than a Hamiltonian operator, in particular the case of a bipartite decomposition into “system” and “environment.” Such a decomposition can be defined by looking for subsystems that exhibit quasiclassical behavior. The correct decomposition is one in which pointer states of the system are relatively robust against environmental monitoring (their entanglement with the environment does not continually and dramatically increase) and remain localized around approximately classical trajectories. We present an in-principle algorithm for finding such a decomposition by minimizing a combination of entanglement growth and internal spreading of the system. Both of these properties are related to locality in different ways. Furthermore, this formalism is relevant to questions in the foundations of quantum mechanics and the emergence of spacetime from quantum entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An accurate, non-empirical method for incorporating decoherence into Ehrenfest dynamics

In mixed quantum-classical nonadiabatic molecular dynamics methods, the anchoring of the electronic wave function to a single nuclear geometry results in both quantitative and qualitative errors in the dynamics. In the context of both Ehrenfest and trajectory surface hopping methods, methods for incorporating decoherence are widely used to eliminate these errors. However, the accuracy of these methods often depends strongly on the parameterization of the decoherence time and/or other related quantities. Here, we present a refinement of the recently introduced collapse to a block (TAB) scheme for incorporating decoherence into Ehrenfest dynamics. The proposed approach incorporates an approximation to the history of the population dynamics and treats the coherence decay as Gaussian, rather than exponential. This method uses parameters that can be obtained from first principles, rather than empirical fitting. Application to one-dimensional models indicates excellent agreement with numerically exact simulations. We also introduce a second refinement to the TAB method: a robust linear least-squares algorithm for determining collapse probabilities.

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↗

Field–potential finite-difference time-domain (FiPo FDTD) technique for computational electromagnetics

Modeling light–matter interactions at the nanoscale requires accurate handling of coupled quantum and electromagnetic systems. This coupling requires information about the electric scalar potential Φ and the magnetic vector potential A, which are not typically calculated in standard computational electromagnetics implementations. To that end, we have developed a field–potential finite-difference time-domain (FiPo FDTD) algorithm, which solves a set of first-order equations for Φ and A alongside equations for the electric and magnetic fields E and H. The FiPo Basic code is essentially conventional FDTD, but with an added module that calculates the potentials. The FiPo Hybrid code self-consistently calculates both fields and potentials and is particularly suitable for coupling with quantum electronic transport solvers because it can be sourced by the potentials themselves. To terminate the domain and mimic infinite space, we have derived and implemented a convolutional perfectly matched layer (CPML) absorbing boundary condition for FiPo FDTD whose performance is on par with state-of-the-art CPMLs for standard FDTD. We present FiPo simulation results on several example systems.

Avazpour, L. [University of Wisconsin-Madison, WI ↗

Diffusion Monte Carlo approaches for studying nuclear quantum effects in fluxional molecules

Abstract Diffusion quantum Monte Carlo (DMC) provides a powerful approach for obtaining the ground state energy and wave function of molecules, ions, and molecular clusters. The approach is uniquely well suited for studies of fluxional molecules, which undergo large amplitude vibrational motions even in their ground state. In contrast to the electronic structure problem, where the wave function must be antisymmetric with respect to exchange of any pair of electrons, the wave function for the ground vibrational state is nodeless. This greatly simplifies the application of DMC for vibrational problems. Because there is not a single potential function that can be used to describe the intramolecular and intermolecular interactions in all molecular systems, most methods that are used to describe nuclear quantum effects rely on a carefully chosen zero‐order description of the molecular vibrations. In contrast, DMC calculations can be performed in Cartesian coordinates, making the DMC algorithm easily transferable between different chemical systems. In this contribution, the theory that underlies DMC will be discussed along with important considerations for performing DMC calculations. Extensions for evaluating vibrationally excited states and molecular properties are also discussed. Insights that can be obtained from DMC calculations are illustrated in the context of the protonated water clusters. This article is categorized under: Molecular and Statistical Mechanics > Molecular Dynamics and Monte‐Carlo Methods Theoretical and Physical Chemistry > Spectroscopy

Chemistry↗

Implementation of High Temperature and Pressure fluid property interpolation tables

This document describes the use of module property_interpolate by John Doherty (Doherty,2006). The document “Fast Lookup of CO 2 Properties” describes the numerical details associated with lookup table. Rajeh Pawar modified property_interpolate for easier implementation in the FEHM code. George Zyvoloski modified the package to produce tables for water and air at very high temperatures and pressures. He also modified the auxiliary codes(drivers) to use newer datasets from the National Institute of Standards and Technology. We note here that within the files associated with FEHM there three property_interpolate modules. They are interpolate_2a.f90 (water), interpolate_2b.f90 (air) , and interpolate_2c.f90(CO 2 ). The interpolate_2c module is different than the earlier module produced by Rajeh Pawar in that it includes high temperature and pressure data. While FEHM has a number of fluid physics modules, this document will describe only the software and algorithms associated with water, water vapor, and heat (WH).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

In situ tuning of optomechanical crystals with nano-oxidation

Optomechanical crystals are a promising device platform for quantum transduction and sensing. Precise targeting of the optical and acoustic resonance frequencies of these devices is crucial for future advances on these fronts. However, fabrication disorder in these wavelength-scale nanoscale devices typically leads to inhomogeneous resonance frequencies. Here we achieve in situ , selective frequency tuning of optical and acoustic resonances in silicon optomechanical crystals via electric field-induced nano-oxidation using an atomic-force microscope. Our method can achieve a tuning range >2nm (0.13%) for the optical resonance wavelength in the telecom C-band, and >60MHz (1.2%) for the acoustic resonance frequency at 5 GHz. The tuning resolution of 1.1 pm for the optical wavelength and 150 kHz for the acoustic frequency allows us to spectrally align multiple optomechanical crystal resonators using a pattern generation algorithm. Our results establish a method for precise post-fabrication tuning of optomechanical crystals. This technique can enable coupled optomechanical resonator arrays, scalable resonant optomechanical circuits, and frequency matching of microwave-optical quantum transducers.

Hatipoglu, Utku (ORCID:0000000205119196)↗

Application of Simulated Annealing and Related Algorithms to TWTA Design

Simulated Annealing (SA) is a stochastic optimization algorithm used to search for global minima in complex design surfaces where exhaustive searches are not computationally feasible. The algorithm is derived by simulating the annealing process, whereby a solid is heated to a liquid state and then cooled slowly to reach thermodynamic equilibrium at each temperature. The idea is that atoms in the solid continually bond and re-bond at various quantum energy levels, and with sufficient cooling time they will rearrange at the minimum energy state to form a perfect crystal. The distribution of energy levels is given by the Boltzmann distribution: as temperature drops, the probability of the presence of high-energy bonds decreases. In searching for an optimal design, local minima and discontinuities are often present in a design surface. SA presents a distinct advantage over other optimization algorithms in its ability to escape from these local minima. Just as high-energy atomic configurations are visited in the actual annealing process in order to eventually reach the minimum energy state, in SA highly non-optimal configurations are visited in order to find otherwise inaccessible global minima. The SA algorithm produces a Markov chain of points in the design space at each temperature, with a monotonically decreasing temperature. A random point is started upon, and the objective function is evaluated at that point. A stochastic perturbation is then made to the parameters of the point to arrive at a proposed new point in the design space, at which the objection function is evaluated as well. If the change in objective function values (Delta)E is negative, the proposed new point is accepted. If (Delta)E is positive, the proposed new point is accepted according to the Metropolis criterion: rho((Delta)f) = exp((-Delta)E/T), where T is the temperature for the current Markov chain. The process then repeats for the remainder of the Markov chain, after which the temperature is decremented and the process repeats. Eventually (and hopefully), a near-globally optimal solution is attained as T approaches zero. Several exciting variants of SA have recently emerged, including Discrete-State Simulated Annealing (DSSA) and Simulated Tempering (ST). The DSSA algorithm takes the thermodynamic analogy one step further by categorizing objective function evaluations into discrete states. In doing so, many of the case-specific problems associated with fine-tuning the SA algorithm can be avoided; for example, theoretical approximations for the initial and final temperature can be derived independently of the case. In this manner, DSSA provides a scheme that is more robust with respect to widely differing design surfaces. ST differs from SA in that the temperature T becomes an additional random variable in the optimization. The system is also kept in equilibrium as the temperature changes, as opposed to the system being driven out of equilibrium as temperature changes in SA. ST is designed to overcome obstacles in design surfaces where numerous local minima are separated by high barriers. These algorithms are incorporated into the optimal design of the traveling-wave tube amplifier (TWTA). The area under scrutiny is the collector, in which it would be ideal to use negative potential to decelerate the spent electron beam to zero kinetic energy just as it reaches the collector surface. In reality this is not plausible due to a number of physical limitations, including repulsion and differing levels of kinetic energy among individual electrons. Instead, the collector is designed with multiple stages depressed below ground potential. The design of this multiple-stage collector is the optimization problem of interest. One remaining problem in SA and DSSA is the difficulty in determining when equilibrium has been reached so that the current Markov chain can be terminated. It has been suggested in recent literature that simulating the thermodynamic properties opecific heat, entropy, and internal energy from the Boltzmann distribution can provide good indicators of having reached equilibrium at a certain temperature. These properties are tested for their efficacy and implemented in SA and DSSA code with respect to TWTA collector optimization.

Radke, Eric M.↗

VAN-DAMME: GPU-accelerated and symmetry-assisted quantum optimal control of multi-qubit systems

We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains.

97 MATHEMATICS AND COMPUTING↗

Extending the Frontier of Quantum Computers with Qutrits

Here, we advocate for a fundamentally different way to perform quantum computation by using three-level qutrits instead of qubits. In particular, we substantially reduce the resource requirements of quantum computations by exploiting a third state for temporary variables (ancilla) in quantum circuits. Past work with qutrits has demonstrated only constant factor improvements, owing to the log 2 (3) binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic runtime decomposition of the Generalized Toffoli gate using no ancilla - an exponential improvement over the best qubit-only equivalent. Our approach features a 70× improvement in total two-qudit gate count over the qubit-only decomposition. This results in improvements for important algorithms for arithmetic and QRAM. Simulation results under realistic noise models indicate over 90% mean reliability (fidelity) for our circuit, versus under 30% for the qubit-only baseline. These results suggest that qutrits offer a promising path toward extending the frontier of quantum computers.

97 MATHEMATICS AND COMPUTING↗

Transmon qubit readout fidelity at the threshold for quantum error correction without a quantum-limited amplifier

Abstract High-fidelity and rapid readout of a qubit state is key to quantum computing and communication, and it is a prerequisite for quantum error correction. We present a readout scheme for superconducting qubits that combines two microwave techniques: applying a shelving technique to the qubit that reduces the contribution of decay error during readout, and a two-tone excitation of the readout resonator to distinguish among qubit populations in higher energy levels. Using a machine-learning algorithm to post-process the two-tone measurement results further improves the qubit-state assignment fidelity. We perform single-shot frequency-multiplexed qubit readout, with a 140 ns readout time, and demonstrate 99.5% assignment fidelity for two-state readout and 96.9% for three-state readout–without using a quantum-limited amplifier.

Chen, Liangyu (ORCID:0000000250722445)↗

Flux-driven algebraic damping of m = 2 diocotron mode

Experiments with pure electron plasmas in a Malmberg–Penning trap have observed linear in time, algebraic damping of m = 2 diocotron modes. Transport due to small field asymmetries produces a low-density halo of electrons moving radially outward from the plasma core, and the mode damping begins when the halo reaches the resonant radius of the mode. The damping rate is proportional to the flux of halo particles through the resonant layer. The damping is related to, but distinct from spatial Landau damping in which a linear wave–particle resonance produces exponential damping. This paper reports an analytic theory that captures the main signatures reported for this novel damping, namely, that the damping begins when the halo particles reach the resonant radius and that the damping is algebraic in time with nearly constant damping rate. The model also predicts a nonlinear frequency shift. The model provides two ways to think about the damping. It results from a transfer of canonical angular momentum from the mode to halo particles being swept by the mode field through the nonlinear cat's eye orbits of the resonant region. More mechanistically, the electric field produced by the perturbed charge density of the resonant particles acts back on the plasma core causing E × B drift that gives rise to the damping and nonlinear frequency shift.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reverse order-disorder transition of Janus particles confined in two dimensions

In this study Janus particles with different patch sizes, confined to two dimensions, generate a series of patterns of interest to the field of nanoscience. Here we observe reverse melting, where for some densities the system melts under cooling. For a broad range of hydrophobic patch sizes ( 60° < θ 0 < 90°), a reentrant transition from solid to liquid and then to an ordered phase emerges as temperature (T) decreases due to the formation of rhombus chains at low T. This reentrant phase has pseudo long-range orientational order but short-range translational order, similar to a hexatic phase. Our work provides guidelines to study the melting and assembly of Janus particles in two dimensions, as well as mechanisms to generate phases with specific symmetry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Direct solar-pumped iodine laser amplifier

In order to evaluate the feasibility of the solar pumped dye laser, the parametric study of a dye laser amplifier pumped by a solar simulator and flashlamp was carried out, and the amplifier gains were measured at various pump beam irradiances on the dye cell. Rhodamine 6G was considered as a candidate for the solar pumped laser because of its good utilization of the solar spectrum and high quantum efficiency. The measurement shows that a solar concentration of 20,000 is required to reach the threshold of the dye. The work to construct a kinetic model algorithm which predicts the output parameter of laser was progressed. The kinetic model was improved such that there is good agreement between the theoretical model and experimental data for the systems defined previously as flashlamp pumped laser oscillator, and the long path length solar pumped laser.

Han, Kwang S.↗

Exact and Fixed-Point Grover Search with Qudits

Grover's algorithm provides a quadratic speedup for searching unstructured databases and is traditionally implemented with qubits in Hilbert spaces whose dimensions are powers of two. With the advent of quantum platforms utilizing qudits---quantum systems with more than two levels---there is a need to generalize Grover search to these architectures, including heterogeneous systems with qudits of varying dimensions. Here, we present a unified framework for qudit-based Grover search, detailing the construction of oracles and diffusion operators with and without ancilla qubits and generalizing deterministic and fixed-point search variants that ensure exact or bounded success probabilities. We analyze phase-matching techniques and provide explicit circuit decompositions suitable for diverse hardware platforms. We also compare the corresponding trajectories on the Bloch sphere to provide an intuitive visualization of how the different phase choices amplify the target state. These results facilitate flexible, hardware-oriented protocols for implementing Grover search on qudit processors, potentially reducing circuit depth and enhancing success probabilities, thereby offering a practical toolkit for quantum computation and sensing applications leveraging multilevel quantum systems.

Roy, Tanay [Fermilab] (ORCID:000000019442862X)↗

A Multilevel Approach For SolvingLarge-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Quantum approximate optimization is one ofthe promising candidates for useful quantum computation,particularly in the context of finding approximate solutionsto Quadratic Unconstrained Binary Optimization (QUBO)problems. However, the existing quantum processing units(QPUs) are of relatively small size, and canonical mappingsof QUBO via the Ising model require one qubit per vari-able, rendering direct large-scale optimization infeasible.In classical optimization, a general strategy for addressingmany large-scale problems is via multilevel/multigrid meth-ods, where the large target problem is iteratively coarsenedand the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentallytest how existing QPUs perform when used as a sub-solverwithin such a multilevel strategy. To this aim, we com-bine and extend (via additional classical processing steps)the recently proposed Noise-Directed Adaptive Remapping(NDAR) and Quantum Relax&Round (QRR) algorithms.We first demonstrate the effectiveness of our heuristicextensions on Rigetti’s superconducting transmon deviceAnkaa-2. We find approximate solutions to10instances offully connected82-qubit Sherrington-Kirkpatrick graphswith random integer-valued coefficients obtaining normal-ized approximation ratios (ARs) in the range∼0.98−1.0,and the same class with real-valued coefficients (ARs∼0.94−1.0). Then, we implement the extended NDAR andQRR algorithms as subsolvers in the multilevel algorithmfor6large-scale graphs with at most∼27,000variables.In practice, the QPU (with classical post-processing steps)is used to find approximate solutions to dozens of at most82-qubit problems, which are iteratively used to constructthe global solution. We observe that quantum optimizationresults are competitive in terms of the quality of solutionswhen compared to classical heuristics used as subsolverswithin the multilevel approach.Reproducibility: source code and data are available at[TBA upon acceptance]

quantum computing↗