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.
Adaptive pruning-based optimization of parameterized quantum circuits
Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).
Red-QAOA: Efficient Variational Optimization through Circuit Reduction
The Quantum Approximate Optimization Algorithm (QAOA) provides a quantum solution for combinatorial optimization problems. However, the optimal parameter searching process of QAOA is greatly affected by noise, leading to non-optimal solutions. This paper introduces a novel approach to optimize QAOA by exploiting the energy landscape concentration of similar instances via graph reduction, thus addressing the effect of noise. We formalize the notion of similar instances in QAOA and develop a Simulated Annealing-based graph reduction algorithm, called Red-QAOA, to identify the most similar subgraph for efficient parameter optimization. Red-QAOA outperforms state-of-the-art Graph Neural Network (GNN) based graph pooling techniques in performance and demonstrates effectiveness on a diverse set of real-world optimization problems encompassing 3200 graphs. Red-QAOA reduced the node counts and edge counts by 28% and 37%, respectively, while maintaining a low mean square error of 2%. These enable the identification of an optimal parameter set that is closer to the ideal true optimal solution in the presence of noise. By substantially streamlining the search for QAOA parameters, our approach sets the stage for the practical application of quantum algorithms in solving complex optimization problems.
Harnessing deep reinforcement learning to construct time-dependent optimal fields for quantum control dynamics
Here, we present an efficient deep reinforcement learning (DRL) approach to automatically construct time-dependent optimal control fields that enable desired transitions in dynamical chemical systems. Our DRL approach gives impressive performance in constructing optimal control fields, even for cases that are difficult to converge with existing gradient-based approaches. We provide a detailed description of the algorithms and hyperparameters as well as performance metrics for our DRL-based approach. Our results demonstrate that DRL can be employed as an effective artificial intelligence approach to efficiently and autonomously design control fields in quantum dynamical chemical systems.
Sample-Efficient Adaptive Calibration of Quantum Networks Using Bayesian Optimization
All physical systems employed for quantum information tasks must act as unbiased carriers of encoded quantum states. Ensuring such indistinguishability of information carriers is a major challenge in many quantum information applications, including advanced quantum communication protocols. For photons, the workhorses of quantum communication networks, it is difficult to obtain and maintain their indistinguishability because of environment-induced transformations and loss imparted by communication channels, especially in noisy scenarios. Conventional strategies to mitigate these transformations often require hardware or software overhead that is restrictive (e.g., adding noise), infeasible (e.g., on a satellite), or time-consuming for deployed networks. In this work we propose and develop resource-efficient Bayesian optimization techniques to rapidly and adaptively calibrate the indistinguishability of individual photons for quantum networks using only information derived from their measurement. To experimentally validate our approach, we demonstrate the optimization of Hong-Ou-Mandel interference between two photons-a central task in quantum networking- finding rapid, efficient, and reliable convergence towards maximal photon indistinguishability in the presence of high loss and shot noise. We expect our resource-optimized and experimentally friendly methodology will allow fast and reliable calibration of indistinguishable quanta, a necessary task in distributed quantum computing, communications, and sensing, as well as for fundamental investigations.
Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achieves the near optimal $\mathcal{\tilde{O}}$(dκlog(1/ϵ)) query complexity for a d -sparse matrix, where κ is the condition number, and ϵ is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.
Efficient frequency allocation for superconducting quantum processors using improved optimization techniques
Building on previous research on frequency allocation optimization for superconducting circuit quantum processors, this work incorporates several techniques to improve overall solution quality. Here, we introduce constraints and imposed edgewise differences help to improve the optimization results. We also introduce optimization variables for the orientation of each edge, defined as the direction from the control qubit to the target qubit, to be chosen during optimization. To scale up to larger processors, multimodule designs are employed with various boundary conditions, thereby enhancing the collective yield. These enhancements allow for greater flexibility in processor design by eliminating the need for handpicked orientations. We support the efficient assembly of large processors with dense connectivity by choosing the best boundary conditions. Examples demonstrate that, at low computational cost, this optimization approach finds a frequency configuration for a square chip with over 1000 qubits and over 10% yield at much larger dispersion levels than required by previous approaches.
Quantum Computing in Next-Generation Transportation Optimization
We explore how quantum computing (QC) can advance transportation optimization, with a focus on two high-impact areas: traffic signal control and vehicle electrification with grid integration. As transportation systems grow in complexity, classical optimization methods increasingly struggle to deliver scalable and efficient solutions, particularly for real-time, data-rich environments. This work identifies key challenges within these two domains where QC may offer advantages, particularly in handling combinatorial decision spaces and dynamic constraints. We begin by outlining the limitations of classical approaches for traffic signal control optimization and electric vehicle charging coordination, highlighting where computational limitations arise. Previous quantum formulations are presented and new formulations are proposed to demonstrate how emerging quantum algorithms, including quantum annealing and the Quantum Approximation Optimization Algorithm, could be leveraged to reformulate and address these problems. We also evaluate the suitability of current quantum hardware and discuss recent trends that indicate when QC may become a viable tool for transportation applications. While acknowledging the present limitations of QC technologies, this poster emphasizes the importance of preparing quantum-compatible models today. By reviewing and establishing formulations that align with the strengths of quantum algorithms, researchers and practitioners can better position themselves to take advantage of QC advancements as they occur. This work aims to provide a practical, forward-looking perspective on the near-term potential of quantum computing in transportation optimization.
Optimal guidance law in quantum mechanics
Following de Broglie’s idea of a pilot wave, this paper treats quantum mechanics as a problem of stochastic optimal guidance law design. The guidance scenario considered in the quantum world is that an electron is the flight vehicle to be guided and its accompanying pilot wave is the guidance law to be designed so as to guide the electron to a random target driven by the Wiener process, while minimizing a cost-to-go function. After solving the stochastic optimal guidance problem by differential dynamic programming, we point out that the optimal pilot wave guiding the particle’s motion is just the wavefunction Ψ(t,x), a solution to the Schrödinger equation; meanwhile, the closed-loop guidance system forms a complex state–space dynamics for Ψ(t,x), from which quantum operators emerge naturally. Quantum trajectories under the action of the optimal guidance law are solved and their statistical distribution is shown to coincide with the prediction of the probability density function Ψ{sup ∗}Ψ. -- Highlights: •Treating quantum mechanics as a pursuit-evasion game. •Reveal an interesting analogy between guided flight motion and guided quantum motion. •Solve optimal quantum guidance problem by dynamic programming. •Gives a formal proof of de Broglie–Bohm’s idea of a pilot wave. •The optimal pilot wave is shown to be a wavefunction solved from Schrödinger equation.
Quantum Interior Point Methods for Semidefinite Optimization
We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction and is not guaranteed to explore only feasible points; the second scheme uses a nullspace representation of the Newton linear system to ensure feasibility even with inexact search directions. The second is a novel scheme that might seem impractical in the classical world, but it is well-suited for a hybrid quantum-classical setting. We show that both schemes converge to an optimal solution of the semidefinite optimization problem under standard assumptions. By comparing the theoretical performance of classical and quantum interior point methods with respect to various input parameters, we show that our second scheme obtains a speedup over classical algorithms in terms of the dimension of the problem n , but has worse dependence on other numerical parameters.
Optimal measurements for quantum multiparameter estimation with general states
We generalize the approach by Braunstein and Caves, [Phys. Rev. Lett. 72, 3439 (1994)].PRLTAO0031-900710.1103/PhysRevLett.72.3439 to quantum multiparameter estimation with general states. We derive a matrix bound of the classical Fisher information matrix due to each measurement operator. The saturation of all these bounds results in the saturation of the matrix Helstrom Cramér-Rao bound. Remarkably, the saturation of the matrix bound is equivalent to the saturation of the scalar bound with respect to any given positive definite weight matrix. Necessary and sufficient conditions are obtained for the optimal measurements that give rise to the Helstrom Cramér-Rao bound associated with a general quantum state. To saturate the Helstrom bound with separable measurements or collective measurement entangling only a small number of identical states, we find it is necessary for the symmetric logarithmic derivatives to commute on the support of the state. As an important application of our results, we construct several local optimal measurements for the problem of estimating the three-dimensional separation of two incoherent optical point sources.
Ion trap long-range XY model for quantum state transfer and optimal spatial search
Abstract Linear ion trap chains are a promising platform for quantum computation and simulation. The XY model with long-range interactions can be implemented with a single side-band Mølmer–Sørensen scheme, giving interactions that decay as 1 / r α , where α parameterises the interaction range. Lower α leads to longer range interactions, allowing faster long-range gate operations for quantum computing. However, decreasing α causes an increased generation of coherent phonons and appears to dephase the effective XY interaction model. We characterise and show how to correct for this effect completely, allowing lower α interactions to be coherently implemented. Ion trap chains are thus shown to be a viable platform for spatial quantum search in optimal O ( N ) time, for N ions. Finally, we introduce a O ( N ) quantum state transfer protocol, with a qubit encoding that maintains a high fidelity.
Polarized Photocathodes development for the EIC: Optimizing Spin and Quantum Efficiency
GaAs/GaAsP superlattice photocathodes play a critical role for producing highly polarized electron beams for the Electron-Ion Collider (EIC) at Brookhaven National Laboratory. The electron pre-injector for the EIC requires electron bunches with high bunch charge (1-2 nC) and high polarization, from GaAs-based superlattice photocathode. Herein, we have systematically investigated a range of GaAs/GaAsP superlattice photocathodes fabricated via molecular beam epitaxy (MBE) and metal-organic chemical vapor deposition (MOCVD). Through optimization of pre-cleaning procedures and surface doping conditions, we aim to identify the most promising photocathode configurations for future EIC operations. To enhance the quantum efficiency (QE), a Distributed Bragg Reflector structure is frequently incorporated beneath the superlattice. While this approach effectively increases QE, it also introduces additional complexities that can adversely influence spin polarization and the spectral response at specific laser wavelengths. This note provides an overview of superlattice GaAs development and outlines the EIC team’s ongoing efforts to address related challenges and advance high-performance photocathode development tailored for the EIC. Over five years of multi-institutional collaboration and measurements of about 50 SL-GaAs samples, our analysis presents statistics on samples exhibiting high ESP and high QE. It will help to set the initial ESP requirements for the EIC project.
Energy-scales convergence for optimal and robust quantum transport in photosynthetic complexes
Underlying physical principles for the high efficiency of excitation energy transfer in light-harvesting complexes are not fully understood. Notably, the degree of robustness of these systems for transporting energy is not known considering their realistic interactions with vibrational and radiative environments within the surrounding solvent and scaffold proteins. In this work, we employ an efficient technique to estimate energy transfer efficiency of such complex excitonic systems. We observe that the dynamics of the Fenna-Matthews-Olson (FMO) complex leads to optimal and robust energy transport due to a convergence of energy scales among all important internal and external parameters. In particular, we show that the FMO energy transfer efficiency is optimum and stable with respect to important parameters of environmental interactions including reorganization energy λ, bath frequency cutoff γ, temperature T, and bath spatial correlations. We identify the ratio of k{sub B}λT/ℏγg as a single key parameter governing quantum transport efficiency, where g is the average excitonic energy gap.
Improving the Accuracy of Variational Quantum Eigensolvers with Fewer Qubits Using Orbital Optimization
Near-term quantum computers will be limited in the number of qubits on which they can process information as well as the depth of the circuits that they can coherently carry out. To date, experimental demonstrations of algorithms such as the Variational Quantum Eigensolver (VQE) have been limited to small molecules using minimal basis sets for this reason. In this work we propose incorporating an orbital optimization scheme into quantum eigensolvers wherein a parametrized partial unitary transformation is applied to the basis functions set in order to reduce the number of qubits required for a given problem. The optimal transformation is found by minimizing the ground state energy with respect to this partial unitary matrix. Through numerical simulations of small molecules up to 16 spin orbitals, we demonstrate that this method has the ability to greatly extend the capabilities of near-term quantum computers with regard to the electronic structure problem. Finally, we find that VQE paired with orbital optimization consistently achieves lower ground state energies than traditional VQE when using the same number of qubits and even frequently achieves lower ground state energies than VQE methods using more qubits.
Impact of graph structures for QAOA on MaxCut
The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.
Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.