Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum optimization”

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 55 records · Page 3

Quantum optimization of maximum independent set using Rydberg atom arrays

Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally investigate quantum algorithms for solving the maximum independent set problem. We use a hardware-efficient encoding associated with Rydberg blockade, realize closed-loop optimization to test several variational algorithms, and subsequently apply them to systematically explore a class of graphs with programmable connectivity. We find that the problem hardness is controlled by the solution degeneracy and number of local minima, and we experimentally benchmark the quantum algorithm’s performance against classical simulated annealing. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions in the deep circuit regime and analyze its origins.

Science & Technology - Other Topics↗

Unleashed from constrained optimization: quantum computing for quantum chemistry employing generator coordinate inspired method

Hybrid quantum-classical approaches offer potential solutions to quantum chemistry problems, yet they often manifest as constrained optimization problems. Here, we explore the interconnection between constrained optimization and generalized eigenvalue problems through the Unitary Coupled Cluster (UCC) excitation generators. Inspired by the generator coordinate method, we employ these UCC excitation generators to construct non-orthogonal, overcomplete many-body bases, projecting the system Hamiltonian into an effective Hamiltonian, which bypasses issues such as barren plateaus that heuristic numerical minimizers often encountered in standard variational quantum eigensolver (VQE). Diverging from conventional quantum subspace expansion methods, we introduce an adaptive scheme that robustly constructs the many-body basis sets from a pool of the UCC excitation generators. This scheme supports the development of a hierarchical ADAPT quantum-classical strategy, enabling a balanced interplay between subspace expansion and ansatz optimization to address complex, strongly correlated quantum chemical systems cost-effectively, setting the stage for more advanced quantum simulations in chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimized Quantum Program Execution Ordering to Mitigate Errors in Simulations of Quantum Systems

Simulating the time evolution of a physical system at quantum mechanical levels of detail - known as Hamiltonian Simulation (HS) - is an important and interesting problem across physics and chemistry. For this task, algorithms that run on quantum computers are known to be exponentially faster than classical algorithms; in fact, this application motivated Feynman to propose the construction of quantum computers. Nonetheless, there are challenges in reaching this performance potential. Prior work has focused on compiling circuits (quantum programs) for HS with the goal of maximizing either accuracy or gate cancellation. Our work proposes a compilation strategy that simultaneously advances both goals. At a high level, we use classical optimizations such as graph coloring and travelling salesperson to order the execution of quantum programs. Specifically, we group together mutually commuting terms in the Hamiltonian (a matrix characterizing the quantum mechanical system) to improve the accuracy of the simulation. We then rearrange the terms within each group to maximize gate cancellation in the final quantum circuit. Furthermore, these optimizations work together to improve HS performance and result in an average 40% reduction in circuit depth. This work advances the frontier of HS which in turn can advance physical and chemical modeling in both basic and applied sciences.

97 MATHEMATICS AND COMPUTING↗

Quantum Optimal Control Using High Performance Computing

This feasibility study developed numerical methods for the optimal control problem for realizing logical gates in closed quantum systems, where the evolution of the state vector is governed by the time dependent Schrodinger equation. The number of parameters in the control functions is made independent of the number of time steps by expanding them in terms of B-spline basis functions, with and without carrier waves. We use an interior point gradient-based technique from the IPOPT package to minimize the gate infidelity subject to amplitude constraints on the control functions. The symplectic Stromer-Verlet scheme is used to integrate a real-valued formulation of Schrodinger's equation in time and the gradient of the gate infidelity is obtained by solving the corresponding adjoint equation. This allows all components of the gradient to be calculated at the cost of solving three Schrodinger systems, independently of the number of parameters in the control functions. The correctness of the method is verified and applied to Hamiltonians that model the dynamics of coupled super-conducting qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum optimality of photon counting for temperature measurement of thermal astronomical sources

Using the quantum Cramér–Rao bound from quantum estimation theory, we derive a fundamental quantum limit on the sensitivity of a temperature measurement of a thermal astronomical source. This limit is expressed in terms of the source temperature T{sub s}, input spectral bandwidth Δν, and measurement duration T, subject to a long measurement time assumption TΔν≫1. It is valid for any measurement procedure that yields an unbiased estimate of the source temperature. The limit agrees with the sensitivity of direct detection or photon counting, and also with that of the ideal radiometer in the regime kT{sub s}/hν{sub 0}≫1 for which the Rayleigh–Jeans approximation is valid, where ν{sub 0} is the center frequency at which the radiometer operates. While valid across the electromagnetic spectrum, the limit is especially relevant for radio astronomy in this regime, since it implies that no ingenious design or technological improvement can beat an ideal radiometer for temperature measurement. In this connection, our result refutes the recent claim of a radio astronomy technique with much-improved sensitivity over the radiometer.

79 ASTRONOMY AND ASTROPHYSICS↗

Simulating and Optimizing Quantum State Transport

The goal of this project was to produce an accurate simulator of the “pitch and catch” process of sending quantum states between SRF cavities, and to find a method for optimizing the control pumps. We developed a program in C++ to integrate the equations of motion with high speed and precision, and used this as a basis for finding an optimal control function to maximize the state transfer efficiency. To demonstrate this we have shown an example of an optimal drive function and the resulting system dynamics, as well as a heat map of the cost function for a range of drive amplitudes.

Weston, Jacob↗

Using Reinforcement Learning to Optimize Quantum Circuits in thePresence of Noise

Many quantum computing frameworks currently use noise aware algorithms for implementing quantum circuits which do not scale efficiently as the size of the hardware architecture increases. As we move towards devices which utilize more qubits, it becomes increasing more important to map quantum circuits in a way that uses resources efficiently as well as maximizes the reliability of the results of that circuit. However, as the hardware increases to the point where Quantum supremacy is attainable, it will infeasible for a brute-force algorithm to find the most optimal circuit layout for circuits of medium to large depth sizes. To this end, we will to rely on reinforcement learning (RL) as a method of building quantum circuits based on observations of the noise characteristics in its environment. In this work, we create a working reinforcement learning environment in which an agent is able to make action which will build the class of circuits which creates the GHZ state. In addition to this, we also get preliminary results of the performance of a Deep Q Neural Network, which initially does not perform as well as we believe it can. In the future, we want to improve the performance of the agent and potentially generalize this environment to more classes of circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the Computational Viability of Quantum Optimization for PMU Placement

Using optimal phasor measurement unit placement as a prototypical problem, we assess the computational viability of the current generation D-Wave Systems 2000Q quantum annealer for power systems design problems. We reformulate minimum dominating set for the annealer hardware, solve the reformulation for a standard set of IEEE test systems, and benchmark solution quality and time to solution against the CPLEX optimizer and simulated annealing. For some problem instances the 2000Q outpaces CPLEX. For instances where the 2000Q underperforms with respect to CPLEX and simulated annealing, we suggest hardware improvements for the next generation of quantum annealers.

hardware↗

Quantum optimal control for pure-state preparation using one initial state

This paper presents a framework for solving the pure-state preparation problem using numerical optimal control. As an example, we consider the case where a number of qubits are dispersively coupled to a readout cavity. Herein, we model open system quantum dynamics using the Markovian Lindblad master equation driven by external control pulses. The main result of this paper develops a basis of density matrices (a parameterization) where each basis element is a density matrix by itself. Utilizing a specific objective function, we show how an ensemble of the basis elements can be used as a single initial state throughout the optimization process—independent of the system dimension. We apply the general framework to the specific application of ground-state reset of one and two qubits coupled to a readout cavity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum optimal control pathways of ozone isomerization dynamics subject to competing dissociation: A two-state one-dimensional model

We construct a two-state one-dimensional reaction-path model for ozone open → cyclic isomerization dynamics. The model is based on the intrinsic reaction coordinate connecting the cyclic and open isomers with the O{sub 2} + O asymptote on the ground-state {sup 1}A{sup ′} potential energy surface obtained with the high-level ab initio method. Using this two-state model time-dependent wave packet optimal control simulations are carried out. Two possible pathways are identified along with their respective band-limited optimal control fields; for pathway 1 the wave packet initially associated with the open isomer is first pumped into a shallow well on the excited electronic state potential curve and then driven back to the ground electronic state to form the cyclic isomer, whereas for pathway 2 the corresponding wave packet is excited directly to the primary well of the excited state potential curve. The simulations reveal that the optimal field for pathway 1 produces a final yield of nearly 100% with substantially smaller intensity than that obtained in a previous study [Y. Kurosaki, M. Artamonov, T.-S. Ho, and H. Rabitz, J. Chem. Phys. 131, 044306 (2009)] using a single-state one-dimensional model. Pathway 2, due to its strong coupling to the dissociation channel, is less effective than pathway 1. The simulations also show that nonlinear field effects due to molecular polarizability and hyperpolarizability are small for pathway 1 but could become significant for pathway 2 because much higher field intensity is involved in the latter. The results suggest that a practical control may be feasible with the aid of a few lowly excited electronic states for ozone isomerization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations

We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fejér-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for simulating a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.

Novikau, I [Lawrence Livermore National Laboratory↗

Optimized Quantum Phase Estimation for Simulating Electronic States in Various Energy Regimes

While quantum algorithms for simulation exhibit better asymptotic scaling than their classical counterparts, they currently cannot be implemented on real-world devices. Instead, chemists and computer scientists rely on costly classical simulations of these quantum algorithms. In particular, the quantum phase estimation (QPE) algorithm is among several approaches that have attracted much attention in recent years for its genuine quantum character. However, it is memory-intensive to simulate and intractable for moderate system sizes. Herein, this paper discusses the performance and applicability of QPESIM, a new simulation of the QPE algorithm designed to take advantage of modest computational resources. In particular, we demonstrate the versatility of QPESIM in simulating various electronic states by examining the ground and core-level states of H 2 O. For these states, we also discuss the effect of the active-space size on the quality of the calculated energies. For the high-energy core-level states, we demonstrate that new QPE simulations for active spaces defined by 15 active orbitals significantly reduce the errors in core-level excitation energies compared to earlier QPE simulations using smaller active spaces.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗