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 703 records · Page 39

Performance Optimization of Tensor Contraction Expressions for Many Body Methods in Quantum Chemistry

Complex tensor contraction expressions arise in accurate electronic structure models in quantum chemistry, such as the coupled cluster method. This paper addresses two complementary aspects of performance optimization of such tensor contraction expressions. Transformations using algebraic properties of commutativity and associativity can be used to significantly decrease the number of arithmetic operations required for evaluation of these expressions. The identification of common subexpressions among a set of tensor contraction expressions can result in a reduction of the total number of operations required to evaluate the tensor contractions. The first part of the paper describes an effective algorithm for operation minimization with common subexpression identification and demonstrates its effectiveness on tensor contraction expressions for coupled cluster equations. The second part of the paper highlights the importance of data layout transformation in the optimization of tensor contraction computations on modern processors. A number of considerations such as minimization of cache misses and utilization of multimedia vector instructions are discussed. A library for efficient index permutation of multi-dimensional tensors is described and experimental performance data is provided that demonstrates its effectiveness.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Optimizing photovoltaic performance in CuInS 2 and CdS quantum dot-sensitized solar cells by using an agar-based gel polymer electrolyte

Quantum dot-sensitized solar cells (QDSSCs) offer new opportunities to address the clean energy challenge, being one of the top candidates for third generation photovoltaics. Like dye-sensitized solar cells (DSSCs), QDSSCs normally use liquid electrolytes that suffer from issues such as evaporation or leakage. In this study a gel polysulfide electrolyte was prepared containing a natural polymer, agar, and was used as a quasi-solid-state electrolyte in solar cells to replace the conventional liquid electrolytes. This gel electrolyte shows almost the same conductivity as the liquid one. The solar cells were fabricated using CuInS 2 quantum dots (QDs), previously synthesized, deposited on TiO 2 photoanodes by electrophoretic deposition (EPD). CdS was deposited on TiO 2 by successive ionic layer adsorption and reaction (SILAR). Reduced graphene oxide (RGO)–Cu 2 S, brass, and thin film CuxS were used as counter electrodes. Compared to a liquid polysulfide water based electrolyte, solar cells based on CuInS 2 and CdS using gel polymer electrolyte (GPE) exhibit greater incident photon to current conversion efficiency (IPCE = 51.7% at 520 nm and 72.7% at 440 nm), photocurrent density (J sc = 10.75 and 13.51 mA cm -2 ), and power conversion efficiency (η = 2.97 and 2.98%) while exhibiting significantly enhanced stability. The solar cells employing the agar-based gel polymeric electrolyte are about a factor of 0.20 more stable than using a liquid electrolyte. The higher photovoltaic performance is due to the good conductivity and high wettability as well as the superior permeation capability of the gel electrolyte into the mesoporous matrix of a TiO 2 film

14 SOLAR ENERGY↗

Convex Optimization for Nonequilibrium Steady States on a Hybrid Quantum Processor

Finding the transient and steady state properties of open quantum systems is a central problem in various fields of quantum technologies. Here, in this work, we present a quantum-assisted algorithm to determine the steady states of open system dynamics. By reformulating the problem of finding the fixed point of Lindblad dynamics as a feasibility semidefinite program, we bypass several well-known issues with variational quantum approaches to solving for steady states. We demonstrate that our hybrid approach allows us to estimate the steady states of higher dimensional open quantum systems and discuss how our method can find multiple steady states for systems with symmetries.

97 MATHEMATICS AND COMPUTING↗

Enabling Scalable VQE Simulation on Leading HPC Systems

Large-scale simulations of quantum circuits pose significant challenges, especially in the context of quantum chemistry, due to the number of qubits, circuit depth, and the number of circuits needed per problem. High-performance computing (HPC) systems offer massive computational capabilities that could help overcome these obstacles. We developed a high-performance quantum circuit simulator, called NWQ-Sim, and demonstrate its capability to simulate large quantum chemistry problems on NERSC's Perlmutter supercomputer. Integrating NWQ-Sim with XACC, we have executed QPE and VQE algorithms for downfolded quantum chemistry systems at unprecedented scales. Our work demonstrates the potential of leveraging HPC resources to advance quantum chemistry and other applications of near-term quantum devices.

Wang, Meng↗

Performance Optimization of Tensor Contraction Expressions for Many Body Methods in Quantum Chemistry

Complex tensor contraction expressions arise in accurate electronic structure models in quantum chemistry, such as the coupled cluster method. This paper addresses two complementary aspects of performance optimization of such tensor contraction expressions. Transformations using algebraic properties of commutativity and associativity can be used to significantly decrease the number of arithmetic operations required for evaluation of these expressions. The identification of common subexpressions among a set of tensor contraction expressions can result in a reduction of the total number of operations required to evaluate the tensor contractions. The first part of the paper describes an effective algorithm for operation minimization with common subexpression identification and demonstrates its effectiveness on tensor contraction expressions for coupled cluster equations. The second part of the paper highlights the importance of data layout transformation in the optimization of tensor contraction computations on modern processors. A number of considerations, such as minimization of cache misses and utilization of multimedia vector instructions, are discussed. A library for efficient index permutation of multidimensional tensors is described, and experimental performance data is provided that demonstrates its effectiveness.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Compiling Adiabatic Quantum Programs

We develop a non-cooperative game-theoretic model for the problem of graph minor-embedding to show that optimal compiling of adiabatic quantum programs in the sense of Nash equilibrium is possible.

Khan, Faisal Shah↗

Quantum annealing correction for random Ising problems

Here, we demonstrate that the performance of a quantum annealer on hard random Ising optimization problems can be substantially improved using quantum annealing correction (QAC). Our error correction strategy is tailored to the D-Wave Two device. We find that QAC provides a statistically significant enhancement in the performance of the device over a classical repetition code, improving as a function of problem size as well as hardness. Moreover, QAC provides a mechanism for overcoming the precision limit of the device, in addition to correcting calibration errors. Performance is robust even to missing qubits. We present evidence for a constructive role played by quantum effects in our experiments by contrasting the experimental results with the predictions of a classical model of the device. Our work demonstrates the importance of error correction in appropriately determining the performance of quantum annealers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum computing approach for building surface sunlit in urban-scale energy modeling

Solar shadow calculations are needed in building energy modeling and performance simulation of PV systems installed on roofs or facades of buildings. We present a quantum computing approach for calculation of building surface sunlit fractions by recasting solar visibility as a binary optimization problem solved by quantum annealing. Each triangulated surface centroid is encoded as a binary qubit indicating sunlit or shaded status. Geometric visibility constraints are derived from the Möller-Trumbore intersection algorithm and converted into a constrained quadratic binary model compatible with contemporary quantum annealers. The coefficients were embedded to D-Wave quantum computer. To demonstrate feasibility, we conducted a case study in San Francisco for a target building with 52 triangles and roughly 2700 nearby triangles within 50 m evaluated at representative winter and summer solar positions. The results demonstrated that quantum annealing can reliably calculate and distinguish sunlit from shaded surfaces. Quantum samples achieved average accuracy exceeding 92.4 %, with the aggregate surface-level agreement approaching 99.9 %. The outputs of quantum computers agreed closely with classical algorithms, indicating practical feasibility and promising scalability. Finally, the hourly sunlit fractions of building surfaces can be obtained for urban energy modelling. This is the first study to apply quantum computing to the solar shadow and building surface sunlit calculation. It introduces a new paradigm that differs fundamentally from traditional approaches.

Deng, Zhipeng↗

Hamiltonian variational ansatz without barren plateaus

Variational quantum algorithms, which combine highly expressive parameterized quantum circuits (PQCs) and optimization techniques in machine learning, are one of the most promising applications of a near-term quantum computer. Despite their huge potential, the utility of variational quantum algorithms beyond tens of qubits is still questioned. One of the central problems is the trainability of PQCs. The cost function landscape of a randomly initialized PQC is often too flat, asking for an exponential amount of quantum resources to find a solution. This problem, dubbed barren plateaus , has gained lots of attention recently, but a general solution is still not available. In this paper, we solve this problem for the Hamiltonian variational ansatz (HVA), which is widely studied for solving quantum many-body problems. After showing that a circuit described by a time-evolution operator generated by a local Hamiltonian does not have exponentially small gradients, we derive parameter conditions for which the HVA is well approximated by such an operator. Based on this result, we propose an initialization scheme for the variational quantum algorithms and a parameter-constrained ansatz free from barren plateaus.

Physics↗

Scattering wave packets of hadrons in gauge theories: Preparation on a quantum computer

Quantum simulation holds promise of enabling a complete description of high-energy scattering processes rooted in gauge theories of the Standard Model. A first step in such simulations is preparation of interacting hadronic wave packets. To create the wave packets, one typically resorts to adiabatic evolution to bridge between wave packets in the free theory and those in the interacting theory, rendering the simulation resource intensive. In this work, we construct a wave-packet creation operator directly in the interacting theory to circumvent adiabatic evolution, taking advantage of resource-efficient schemes for ground-state preparation, such as variational quantum eigensolvers. By means of an ansatz for bound mesonic excitations in confining gauge theories, which is subsequently optimized using classical or quantum methods, we show that interacting mesonic wave packets can be created efficiently and accurately using digital quantum algorithms that we develop. Specifically, we obtain high-fidelity mesonic wave packets in the Z 2 and U(1) lattice gauge theories coupled to fermionic matter in 1+1 dimensions. Our method is applicable to both perturbative and non-perturbative regimes of couplings. The wave-packet creation circuit for the case of the Z 2 lattice gauge theory is built and implemented on the Quantinuum H1-1 trapped-ion quantum computer using 13 qubits and up to 308 entangling gates. The fidelities agree well with classical benchmark calculations after employing a simple symmetry-based noise-mitigation technique. This work serves as a step toward quantum computing scattering processes in quantum chromodynamics.

97 MATHEMATICS AND COMPUTING↗

Reducing Randomized Quantum Algorithm Cost [Slides]

We derive the optimal sampling strategy for minimizing total resource cost in randomized quantum algorithms. Our framework is completely general, allowing for resources as diverse as gate counts circuit depth, runtime, or even dissipated energy.

97 MATHEMATICS AND COMPUTING↗

Programmable interactions and emergent geometry in an array of atom clouds

Interactions govern the flow of information and the formation of correlations between constituents of many-body quantum systems, dictating phases of matter found in nature and forms of entanglement generated in the laboratory. Typical interactions decay with distance and thus produce a network of connectivity governed by geometry—such as the crystalline structure of a material or the trapping sites of atoms in a quantum simulator. However, many envisioned applications in quantum simulation and computation require more complex coupling graphs including non-local interactions, which feature in models of information scrambling in black hole, and mappings of hard optimization problems onto frustrated classical magnets. Here we describe the realization of programmable non-local interactions in an array of atomic ensembles within an optical cavity, in which photons carry information between atomic spins. By programming the distance dependence of the interactions, we access effective geometries for which the dimensionality, topology and metric are entirely distinct from the physical geometry of the array. As examples, we engineer an antiferromagnetic triangular ladder, a Möbius strip with sign-changing interactions and a treelike geometry inspired by concepts of quantum gravity. The tree graph constitutes a toy model of holographic duality, in which the quantum system lies on the boundary of a higher-dimensional geometry that emerges from measured correlations. Overall, our work provides broader prospects for simulating frustrated magnets and topological phases, investigating quantum optimization paradigms and engineering entangled resource states for sensing and computation.

74 ATOMIC AND MOLECULAR PHYSICS↗

Faster Tensor Network Decoding for Topological Quantum Codes

We present a fast and Bayes-optimal-approximating tensor network decoder for planar quantum LDPC codes based on the tensor renormalization group algorithm, originally proposed by Levin, and Nave. By precomputing the renormalization group flow for the null syndrome, we need only recompute tensor contractions in the causal cone of the measured syndrome at the time of decoding. This allows us to achieve an overall runtime complexity of ($pnχ^6$) where p is the depolarizing noise rate, and χ is the cutoff value used to control singular value decomposition approximations used in the algorithm. We apply our decoder to the surface code in the code capacity noise model and compare its performance to the original matrix product state (MPS) tensor network decoder introduced by Bravyi, Suchara, and Vargo. The MPS decoder has a p-independent runtime complexity of $\mathcal{O}(nχ^3)$ resulting in significantly slower decoding times compared to our algorithm in the low-p regime.

97 MATHEMATICS AND COMPUTING↗

Intermediate band solar cells: Recent progress and future directions

Extensive literature and publications on intermediate band solar cells (IBSCs) are reviewed. A detailed discussion is given on the thermodynamics of solar energy conversion in IBSCs, the device physics, and the carrier dynamics processes with a particular emphasis on the two-step inter-subband absorption/recombination processes that are of paramount importance in a successful implementation high-efficiency IBSC. The experimental solar cell performance is further discussed, which has been recently demonstrated by using highly mismatched alloys and high-density quantum dot arrays and superlattice. IBSCs having widely different structures, materials, and spectral responses are also covered, as is the optimization of device parameters to achieve maximum performance.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Evolutionary optimization of rotational population transfer

We present experimental and numerical studies on control of rotational population transfer of NO(J=1/2) molecules to higher rotational states. We are able to transfer 57% of the population to the J=5/2 state and 46% to J=9/2, in good agreement with quantum mechanical simulations. The optimal pulse shapes are composed of pulse sequences with delays corresponding to the beat frequencies of states on the rotational ladder. The evolutionary algorithm is limited by experimental constraints such as volume averaging and the finite laser intensity used, the latter to circumvent ionization. Without these constraints, near-perfect control (>98%) is possible. In addition, we show that downward control, moving molecules from high to low rotational states, is also possible.

74 ATOMIC AND MOLECULAR PHYSICS↗