Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Information science”

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,189 records · Page 66

Scaling quantum approximate optimization on near-term hardware

The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers to potentially demonstrate computational advantage in solving combinatorial optimization problems. However, the viability of the QAOA depends on how its performance and resource requirements scale with problem size and complexity for realistic hardware implementations. Here, we quantify scaling of the expected resource requirements by synthesizing optimized circuits for hardware architectures with varying levels of connectivity. Assuming noisy gate operations, we estimate the number of measurements needed to sample the output of the idealized QAOA circuit with high probability. We show the number of measurements, and hence total time to solution, grows exponentially in problem size and problem graph degree as well as depth of the QAOA ansatz, gate infidelities, and inverse hardware graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.

97 MATHEMATICS AND COMPUTING↗

Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer

Abstract Realizing the potential of near-term quantum computers to solve industry-relevant constrained-optimization problems is a promising path to quantum advantage. In this work, we consider the extractive summarization constrained-optimization problem and demonstrate the largest-to-date execution of a quantum optimization algorithm that natively preserves constraints on quantum hardware. We report results with the Quantum Alternating Operator Ansatz algorithm with a Hamming-weight-preserving XY mixer (XY-QAOA) on trapped-ion quantum computer. We successfully execute XY-QAOA circuits that restrict the quantum evolution to the in-constraint subspace, using up to 20 qubits and a two-qubit gate depth of up to 159. We demonstrate the necessity of directly encoding the constraints into the quantum circuit by showing the trade-off between the in-constraint probability and the quality of the solution that is implicit if unconstrained quantum optimization methods are used. We show that this trade-off makes choosing good parameters difficult in general. We compare XY-QAOA to the Layer Variational Quantum Eigensolver algorithm, which has a highly expressive constant-depth circuit, and the Quantum Approximate Optimization Algorithm. We discuss the respective trade-offs of the algorithms and implications for their execution on near-term quantum hardware.

97 MATHEMATICS AND COMPUTING↗

Encoding integers and rationals on neuromorphic computers using virtual neuron

Abstract Neuromorphic computers emulate the human brain while being extremely power efficient for computing tasks. In fact, they are poised to be critical for energy-efficient computing in the future. Neuromorphic computers are primarily used in spiking neural network–based machine learning applications. However, they are known to be Turing-complete, and in theory can perform all general-purpose computation. One of the biggest bottlenecks in realizing general-purpose computations on neuromorphic computers today is the inability to efficiently encode data on the neuromorphic computers. To fully realize the potential of neuromorphic computers for energy-efficient general-purpose computing, efficient mechanisms must be devised for encoding numbers. Current encoding mechanisms (e.g., binning, rate-based encoding, and time-based encoding) have limited applicability and are not suited for general-purpose computation. In this paper, we present the virtual neuron abstraction as a mechanism for encoding and adding integers and rational numbers by using spiking neural network primitives. We evaluate the performance of the virtual neuron on physical and simulated neuromorphic hardware. We estimate that the virtual neuron could perform an addition operation using just 23 nJ of energy on average with a mixed-signal, memristor-based neuromorphic processor. We also demonstrate the utility of the virtual neuron by using it in some of the μ -recursive functions, which are the building blocks of general-purpose computation.

97 MATHEMATICS AND COMPUTING↗

Local Bayesian Dirichlet mixing of imperfect models

Abstract To improve the predictability of complex computational models in the experimentally-unknown domains, we propose a Bayesian statistical machine learning framework utilizing the Dirichlet distribution that combines results of several imperfect models. This framework can be viewed as an extension of Bayesian stacking. To illustrate the method, we study the ability of Bayesian model averaging and mixing techniques to mine nuclear masses. We show that the global and local mixtures of models reach excellent performance on both prediction accuracy and uncertainty quantification and are preferable to classical Bayesian model averaging. Additionally, our statistical analysis indicates that improving model predictions through mixing rather than mixing of corrected models leads to more robust extrapolations.

97 MATHEMATICS AND COMPUTING↗

Land conversion to energy crops for sustainable aviation fuel production reduces greenhouse gas emissions in the United States

Energy crops will be critical for scaling up production of Sustainable Aviation Fuel in the United States and reducing greenhouse gas emissions. Here we examine the economic incentives for the extent and type of land conversion needed to scale up fuel production from a mix of cellulosic feedstocks and quantify its greenhouse gas intensity. We show that even with the availability of marginal non-cropland, there will be incentives for converting cropland to produce energy crops as the price of sustainable aviation fuel increases. But contrary to expectations, we find that scaling up fuel production by converting more cropland and more non-cropland from existing uses to energy crops lowers its net greenhouse gas intensity, due to high soil carbon sequestration rate of energy crops, even after considering land use change emissions. The potential savings in emissions are larger than the foregone soil carbon accumulation benefits from keeping that land in current uses.

54 ENVIRONMENTAL SCIENCES↗

Dirac fermions and possible weak antilocalization in LaCuSb 2

Layered heavy-metal square-lattice compounds have recently emerged as potential Dirac fermion materials due to bonding within those sublattices. We report quantum transport and spectroscopic data on the layered Sb square-lattice material LaCuSb 2 . Linearly dispersing band crossings, necessary to generate Dirac fermions, are experimentally observed in the electronic band structure observed using angle-resolved photoemission spectroscopy, along with a quasi-two-dimensional Fermi surface. Weak antilocalization that arises from two-dimensional transport is observed in the magnetoresistance, as well as regions of linear dependence, both of which are indicative of topologically nontrivial effects. Measurements of the Shubnikov–de Haas quantum oscillations show low effective mass electrons on the order of 0.065m e , further confirming the presence of Dirac fermions in this material.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quasicubic model for metal halide perovskite nanocrystals

In this work, we present an analysis of quantum confinement of carriers and excitons, and exciton fine structure, in metal halide perovskite (MHP) nanocrystals (NCs). Starting with coupled-band k · P theory, we derive a nonparabolic effective mass model for the exciton energies in MHP NCs valid for the full size range from the strong to the weak confinement limits. We illustrate the application of the model to CsPbBr 3 NCs and compare the theory against published absorption data, finding excellent agreement. We then apply the theory of electron-hole exchange, including both short- and long-range exchange interactions, to develop a model for the exciton fine structure. We develop an analytical quasicubic model for the effect of tetragonal and orthorhombic lattice distortions on the exchange-related exciton fine structure in CsPbBr 3 , as well as some hybrid organic MHPs of recent interest, including formamidinium lead bromide (FAPbBr 3 ) and methylammonium lead iodide (MAPbI3). Testing the predictions of the quasicubic model using hybrid density functional theory (DFT) calculations, we find qualitative agreement in tetragonal MHPs but significant disagreement in the orthorhombic modifications. Moreover, the quasicubic model fails to correctly describe the exciton oscillator strength and with it the long-range exchange corrections in these systems. Introducing the effect of NC shape anisotropy and possible Rashba terms into the model, we illustrate the calculation of the exciton fine structure in CsPbBr 3 NCs based on the results of the DFT calculations and examine the effect of Rashba terms and shape anisotropy on the calculated fine structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fine structure of current noise spectra in nanoelectromechanical resonators

Here, we study the frequency-dependent noise of a suspended carbon nanotube quantum dot nanoelectromechanical resonator induced by electron-vibration coupling. Using a rigorous Keldysh diagrammatic technique, we establish a formal framework connecting the vibrational properties to electrical measurements. We find that the noise power spectrum exhibits a narrow resonant peak at the frequency of the vibrational modes. However, this fine structure tends to disappear due to a coherent cancellation effect when the tunneling barriers are tuned to a symmetric point. Notably, measuring the electrical current noise spectra provides a sensitive alternative method for detecting the damping and dephasing of quantum vibrational modes.

Electric measurements↗

Stability of Kuramoto networks subject to large and small fluctuations from heterogeneous and spatially correlated noise

Oscillatory networks subjected to noise are broadly used to model physical and technological systems. Due to their nonlinear coupling, such networks typically have multiple stable and unstable states that a network might visit due to noise. In this article, we focus on the assessment of fluctuations resulting from heterogeneous and spatially correlated noise inputs on Kuramoto model networks. We evaluate the typical, small fluctuations near synchronized states and connect the network variance to the overlap between stable modes of synchronization and the input noise covariance. Going beyond small to large fluctuations, we introduce the indicator mode approximation that projects the dynamics onto a single amplitude dimension. Such an approximation allows for estimating rates of fluctuations to saddle instabilities, resulting in phase slips between connected oscillators. Statistics for both regimes are quantified in terms of effective noise amplitudes that are compared and contrasted for several noise models. In conclusion, bridging the gap between small and large fluctuations, we show that a larger network variance does not necessarily lead to higher rates of large fluctuations.

42 ENGINEERING↗

Bridge connectivity effects on photoinduced ground-state electron spin polarization

Transient electron paramagnetic resonance (TREPR) spectroscopy has been used to probe photoinduced electron spin polarization in the recovered ground states of four radical-elaborated (CAT)Pt(bpy) donor-acceptor complexes (CAT = catechol; bpy = 4,4'-di-tert-butyl-2,2'-bipyridine). These complexes are comprised of one or two S = 1/2 nitronyl nitroxide radicals attached through different phenylethynyl bridges to the 3- or 3,6 positions of the CAT donor. In this paper, we demonstrate the effects of substitution patterns on the magnitude of the TREPR signal, thereby guiding future design principles for generating and understanding the origin of photoinduced electron spin polarization in these and related chromophores.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator

Quantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly improving performance for solving exponentially hard problems, such as optimization and satisfiability. Here, we report the implementation of a low-depth Quantum Approximate Optimization Algorithm (QAOA) using an analog quantum simulator. We estimate the ground-state energy of the Transverse Field Ising Model with long-range interactions with tunable range, and we optimize the corresponding combinatorial classical problem by sampling the QAOA output with high-fidelity, single-shot, individual qubit measurements. We execute the algorithm with both an exhaustive search and closed-loop optimization of the variational parameters, approximating the ground-state energy with up to 40 trapped-ion qubits. We benchmark the experiment with bootstrapping heuristic methods scaling polynomially with the system size. We observe, in agreement with numerics, that the QAOA performance does not degrade significantly as we scale up the system size and that the runtime is approximately independent from the number of qubits. We finally give a comprehensive analysis of the errors occurring in our system, a crucial step in the path forward toward the application of the QAOA to more general problem instances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Triplet-pair spin signatures from macroscopically aligned heteroacenes in an oriented single crystal

The photo-driven process of singlet fission generates coupled triplet pairs (TT) with fundamentally intriguing and potentially useful properties. The quintet 5 TT 0 sublevel is particularly interesting for quantum information because it is highly entangled, is addressable with microwave pulses, and could be detected using optical techniques. Previous theoretical work on a model Hamiltonian and nonadiabatic transition theory, called the JDE model, has determined that this sublevel can be selectively populated if certain conditions are met. Among the most challenging, the molecules within the dimer undergoing singlet fission must have their principal magnetic axes parallel to one another and to an applied Zeeman field. Here, we present time-resolved electron paramagnetic resonance (TR-EPR) spectroscopy of a single crystal sample of a tetracenethiophene compound featuring arrays of dimers aligned in this manner, which were mounted so that the orientation of the field relative to the molecular axes could be controlled. The observed spin sublevel populations in the paired TT and unpaired (T+T) triplets are consistent with predictions from the JDE model, including preferential 5 TT 0 formation at z ‖ B 0 , with one caveat—two 5 TT spin sublevels have little to no population. This may be due to crossings between the 5 TT and 3 TT manifolds in the field range investigated by TR-EPR, consistent with the intertriplet exchange energy determined by monitoring photoluminescence at varying magnetic fields.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Noise resilience of variational quantum compiling

Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that leverage classical optimization to minimize a cost function, which is efficiently evaluated on a quantum computer. Recently VHQCAs have been proposed for quantum compiling, where a target unitary U is compiled into a short-depth gate sequence V. In this work, we report on a surprising form of noise resilience for these algorithms. Namely, we find one often learns the correct gate sequence V (i.e. the correct variational parameters) despite various sources of incoherent noise acting during the cost-evaluation circuit. Our main results are rigorous theorems stating that the optimal variational parameters are unaffected by a broad class of noise models, such as measurement noise, gate noise, and Pauli channel noise. Furthermore, our numerical implementations on IBM's noisy simulator demonstrate resilience when compiling the quantum Fourier transform, Toffoli gate, and W-state preparation. Hence, variational quantum compiling, due to its robustness, could be practically useful for noisy intermediate-scale quantum devices. Finally, we speculate that this noise resilience may be a general phenomenon that applies to other VHQCAs such as the variational quantum eigensolver.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large gradients via correlation in random parameterized quantum circuits

Scaling of variational quantum algorithms to large problem sizes requires efficient optimization of random parameterized quantum circuits. For such circuits with uncorrelated parameters, the presence of exponentially vanishing gradients in cost function landscapes is an obstacle to optimization by gradient descent methods. In this work, we prove that reducing the dimensionality of the parameter space by utilizing circuit modules containing spatially or temporally correlated gate layers can allow one to circumvent the vanishing gradient phenomenon. Here, examples are drawn from random separable circuits and asymptotically optimal variational versions of Grover's algorithm based on the quantum alternating operator ansatz. In the latter scenario, our bounds on cost function variation imply a transition between vanishing gradients and efficient trainability as the number of layers is increased toward $\mathcal{O}\left({2}^{n/2}\right)$, the optimal oracle complexity of quantum unstructured search.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum mixed state compiling

The task of learning a quantum circuit to prepare a given mixed state is a fundamental quantum subroutine. We present a variational quantum algorithm (VQA) to learn mixed states which is suitable for near-term hardware. Our algorithm represents a generalization of previous VQAs that aimed at learning preparation circuits for pure states. We consider two different ansätze for compiling the target state; the first is based on learning a purification of the state and the second on representing it as a convex combination of pure states. In both cases, the resources required to store and manipulate the compiled state grow with the rank of the approximation. Thus, by learning a lower rank approximation of the target state, our algorithm provides a means of compressing a state for more efficient processing. As a byproduct of our algorithm, one effectively learns the principal components of the target state, and hence our algorithm further provides a new method for principal component analysis. We investigate the efficacy of our algorithm through extensive numerical implementations, showing that typical random states and thermal states of many body systems may be learnt this way. Additionally, we demonstrate on quantum hardware how our algorithm can be used to study hardware noise-induced states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Diabatic quantum annealing for the frustrated ring model

Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum computer-enabled receivers for optical communication

Abstract Optical communication is the standard for high-bandwidth information transfer in today’s digital age. The increasing demand for bandwidth has led to the maturation of coherent transceivers that use phase- and amplitude-modulated optical signals to encode more bits of information per transmitted pulse. Such encoding schemes achieve higher information density, but also require more complicated receivers to discriminate the signaling states. In fact, achieving the ultimate limit of optical communication capacity, especially in the low light regime, requires coherent joint detection of multiple pulses. Despite their superiority, such joint detection receivers are not in widespread use because of the difficulty of constructing them in the optical domain. In this work we describe how optomechanical transduction of phase information from coherent optical pulses to superconducting qubit states followed by the execution of trained short-depth variational quantum circuits can perform joint detection of communication codewords with error probabilities that surpass all classical, individual pulse detection receivers. Importantly, we utilize a model of optomechanical transduction that captures non-idealities such as thermal noise and loss in order to understand the transduction performance necessary to achieve a quantum advantage with such a scheme. We also execute the trained variational circuits on an IBM-Q device with the modeled transduced states as input to demonstrate that a quantum advantage is possible even with current levels of quantum computing hardware noise.

97 MATHEMATICS AND COMPUTING↗

Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher order terms using the Julia based QAOA simulation tool \texttt{JuliQAOA} to perform classical angle finding for up to $49$ QAOA layers ($p$). Parameter transfer of the fixed angles is validated using a combination of full statevector, Projected Entangled Pair States (PEPS), Matrix Product State (MPS), and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of $p$ - there are many cases where the performance temporarily decreases as a function of $p$ - but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the $100+$ qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM Quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM NISQ processors up to $p=5$ on \texttt{ibm\_fez}, up to $p=9$ on \texttt{ibm\_torino}, and up to $p=10$ on \texttt{ibm\_pittsburgh}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗