Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum network”

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 955 records · Page 53
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Discrete and continuous variables for measurement-device-independent quantum cryptography

In a recent Article in Nature Photonics, Pirandola et al.1 claim that the achievable secret key rates of discrete-variable (DV) measurementdevice- independent (MDI) quantum key distribution (QKD) (refs 2,3) are “typically very low, unsuitable for the demands of a metropolitan network” and introduce a continuous-variable (CV) MDI QKD protocol capable of providing key rates which, they claim, are “three orders of magnitude higher” than those of DV MDI QKD. We believe, however, that the claims regarding low key rates of DV MDI QKD made by Pirandola et al.1 are too pessimistic. Here in this paper, we show that the secret key rate of DV MDI QKD with commercially available high-efficiency single-photon detectors (SPDs) (for example, see http://www.photonspot.com/detectors and http://www.singlequantum.com) and good system alignment is typically rather high and thus highly suitable for not only long-distance communication but also metropolitan networks.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Preparing angular momentum eigenstates using engineered quantum walks

Coupled angular-momentum eigenstates are widely used in atomic and nuclear physics calculations and are building blocks for spin networks and the Schur transform. To combine two angular momenta J 1 and J 2 , forming eigenstates of their total angular momentum J=J 1 +J 2 , we develop a quantum-walk scheme that does not require inputting O(j 3 ) nonzero Clebsch–Gordan (CG) coefficients classically. In fact, our scheme may be regarded as a unitary method for computing CG coefficients on quantum computers with a typical complexity of O⁡(j) and a worst-case complexity of O⁡(j 3 ). Equivalently, our scheme provides decompositions of the dense CG unitary into sparser unitary operations. Our scheme prepares angular-momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states, which are usually highly entangled states in the computational basis. In contrast with usual quantum walks, whose Hamiltonians are prescribed, we engineer the Hamiltonians in su⁡(2)×su⁡(2), which are inspired by, but different from, Hamiltonians that govern magnetic resonances and dipole interactions. To achieve a deterministic preparation of both ket and bra states, we use projection and destructive interference to double pinch the quantum walks, such that each step is a unit-probability population transfer within a two-level system. We test our state preparation scheme on classical computers, reproducing tables of CG coefficients. Finally, we also implement small test problems on current quantum hardware.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantum Reinforcement Learning for Volt-VAR Control in Power Distribution Systems

Volt-VAR control (VVC) is crucial in active distribution networks for optimizing voltage profiles and minimizing network losses. While traditional deep reinforcement learning (DRL) algorithms exhibit promise for VVC, they often require extensive computational resources to handle such a high-dimensional problem. As a potential solution, quantum reinforcement learning (QRL) algorithms integrate the computational capabilities of quantum computing into the DRL framework. However, existing QRL algorithms struggle with complex VVC problems due to the limitations of current quantum hardware. To bridge this gap, this paper proposes an innovative QRL algorithm featuring an end-to-end architecture that integrates a classical autoencoder, variational quantum circuits (VQCs), and classical post-processing layers. This design efficiently compresses high-dimensional grid states, enabling VQCs to leverage quantum advantages while producing multiple control device outputs tailored for VVC tasks. Numerical studies on three representative distribution systems verify the effectiveness and scalability of the proposed QRL algorithm, and demonstrate its enhanced performance over classical approaches with only approximately 1% of the parameters. Additionally, the robustness of our developed algorithm is validated through noisy quantum environments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

LUNA: LUT-Based Neural Architecture for Fast and Low-Cost Qubit Readout

Qubit readout is a critical operation in quantum computing systems, which maps the analog response of qubits into discrete classical states. Deep neural networks (DNNs) have recently emerged as a promising solution to improve readout accuracy . Prior hardware implementations of DNN-based readout are resource-intensive and suffer from high inference latency, limiting their practical use in low-latency decoding and quantum error correction (QEC) loops. This paper proposes LUNA, a fast and efficient superconducting qubit readout accelerator that combines low-cost integrator-based preprocessing with Look-Up Table (LUT) based neural networks for classification. The architecture uses simple integrators for dimensionality reduction with minimal hardware overhead, and employs LogicNets (DNNs synthesized into LUT logic) to drastically reduce resource usage while enabling ultra-low-latency inference. We integrate this with a differential evolution based exploration and optimization framework to identify high-quality design points. Our results show up to a 10.95x reduction in area and 30% lower latency with little to no loss in fidelity compared to the state-of-the-art. LUNA enables scalable, low-footprint, and high-speed qubit readout, supporting the development of larger and more reliable quantum computing systems.

Farooq, M. A. [Arizona State U., Tempe]↗
DOE OSTI2015

Characteristic operator functions for quantum input-plant-output models and coherent control

We introduce the characteristic operator as the generalization of the usual concept of a transfer function of linear input-plant-output systems to arbitrary quantum nonlinear Markovian input-output models. This is intended as a tool in the characterization of quantum feedback control systems that fits in with the general theory of networks. The definition exploits the linearity of noise differentials in both the plant Heisenberg equations of motion and the differential form of the input-output relations. Mathematically, the characteristic operator is a matrix of dimension equal to the number of outputs times the number of inputs (which must coincide), but with entries that are operators of the plant system. In this sense, the characteristic operator retains details of the effective plant dynamical structure and is an essentially quantum object. We illustrate the relevance to model reduction and simplification definition by showing that the convergence of the characteristic operator in adiabatic elimination limit models requires the same conditions and assumptions appearing in the work on limit quantum stochastic differential theorems of Bouten and Silberfarb [Commun. Math. Phys. 283, 491-505 (2008)]. This approach also shows in a natural way that the limit coefficients of the quantum stochastic differential equations in adiabatic elimination problems arise algebraically as Schur complements and amounts to a model reduction where the fast degrees of freedom are decoupled from the slow ones and eliminated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1990

Spatial light modulators and applications III; Proceedings of the Meeting, San Diego, CA, Aug. 7, 8, 1989

Recent advances in the technology and applications of spatial light modulators (SLMs) are discussed in review essays by leading experts. Topics addressed include materials for SLMs, SLM devices and device technology, applications to optical data processing, and applications to artificial neural networks. Particular attention is given to nonlinear optical polymers, liquid crystals, magnetooptic SLMs, multiple-quantum-well SLMs, deformable-mirror SLMs, three-dimensional optical memories, applications of photorefractive devices to optical computing, photonic neurocomputers and learning machines, holographic associative memories, SLMs as parallel memories for optoelectronic neural networks, and coherent-optics implementations of neural-network models.

Efron, Uzi↗
DOE OSTI2013

Networks of silicon nanowires: A large-scale atomistic electronic structure analysis

Networks of silicon nanowires possess intriguing electronic properties surpassing the predictions based on quantum confinement of individual nanowires. Employing large-scale atomistic pseudopotential computations, as yet unexplored branched nanostructures are investigated in the subsystem level as well as in full assembly. The end product is a simple but versatile expression for the bandgap and band edge alignments of multiply-crossing Si nanowires for various diameters, number of crossings, and wire orientations. Further progress along this line can potentially topple the bottom-up approach for Si nanowire networks to a top-down design by starting with functionality and leading to an enabling structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Inverse Design of a Graphene-Based Quantum Transducer via Neuroevolution

Here we introduce an inverse design framework based on artificial neural networks, genetic algorithms, and tight-binding calculations, capable to optimize the very large configuration space of nanoelectronic devices. Our non-linear optimization procedure operates on trial Hamiltonians through superoperators controlling growth policies of regions of distinct doping. We demonstrate that our algorithm optimizes the doping of graphene-based three-terminal devices for valleytronics applications, monotonously converging to synthesizable devices with high merit functions in a few thousand evaluations (out of similar or equal to ≃ 2 3800 possible configurations). The best-performing device allowed for a terminal-specific separation of valley currents with similar or equal to ≃ 96% (≃ 94%) K(K') valley purity. Importantly, the devices found through our non-linear optimization procedure have both a higher merit function and higher robustness to defects than the ones obtained through geometry optimization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2014

Dynamics, stability, and statistics on lattices and networks

These lectures aim at surveying some dynamical models that have been widely explored in the recent scientific literature as case studies of complex dynamical evolution, emerging from the spatio-temporal organization of several coupled dynamical variables. The first message is that a suitable mathematical description of such models needs tools and concepts borrowed from the general theory of dynamical systems and from out-of-equilibrium statistical mechanics. The second message is that the overall scenario is definitely reacher than the standard problems in these fields. For instance, systems exhibiting complex unpredictable evolution do not necessarily exhibit deterministic chaotic behavior (i.e., Lyapunov chaos) as it happens for dynamical models made of a few degrees of freedom. In fact, a very large number of spatially organized dynamical variables may yield unpredictable evolution even in the absence of Lyapunov instability. Such a mechanism may emerge from the combination of spatial extension and nonlinearity. Moreover, spatial extension allows one to introduce naturally disorder, or heterogeneity of the interactions as important ingredients for complex evolution. It is worth to point out that the models discussed in these lectures share such features, despite they have been inspired by quite different physical and biological problems. Along these lectures we describe also some of the technical tools employed for the study of such models, e.g., Lyapunov stability analysis, unpredictability indicators for “stable chaos,” hydrodynamic description of transport in low spatial dimension, spectral decomposition of stochastic dynamics on directed networks, etc.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Uniform redundancy allocation maximizes the robustness of flow networks against cascading failures

We study the robustness of flow networks against cascading failures under a partial load redistribution model. In particular, we consider a flow network of N lines with initial loads L 1 ,...,L N and free spaces (i.e., redundant space) S 1 ,...,S N that are independent and identically distributed with joint distribution P LS (x,y) = P[L ≤ x, S ≤ y]. The capacity C i is the maximum load allowed on line i and is given by C i = L i + S i . Furthermore, when a line fails due to overloading, it is removed from the system and (1 – ε) fraction of the load it was carrying is redistributed equally among all remaining lines in the system. The rest (i.e., ε fraction) of the load is assumed to be lost or absorbed, e.g., due to advanced circuitry disconnecting overloaded power lines or an interconnected network or material absorbing a fraction of the flow from overloaded lines. We analyze the robustness of this flow network against random attacks that remove a p fraction of the lines. Our contributions include (i) deriving the final fraction of alive lines n ∞ (p,ε) for all p,εϵ(0,1) and confirming the results via extensive simulations; (ii) showing that partial redistribution might lead to (depending on the parameter 0 < ε ≤ 1) the order of transition at the critical attack size p* changing from first to second-order; and (iii) proving analytically that flow networks achieve maximum robustness [quantified by the area ∫$^{1}_{0}$ n ∞ (p,ε)dp] when all lines have the same free space regardless of their initial load. The optimality of equal free-space allocation is also confirmed on real-world data from the UK National Power Grid.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

A workflow for automatic generation and efficient refinement of individual pressure-dependent networks

Manual chemical kinetic model construction often requires modelists to at least implicitly guess all possible decay pathways and their relative fluxes for all important species. We present a workflow and associated tool for automatic generation and re finement of pressure-dependent networks that should enable modelists to efficiently and comprehensively identify decay pathways and estimate respective parameters for chemical species. This tool combines the capabilities of the Reaction Mechanism Generator (RMG) software to generate possible reaction paths, determine thermochemistry, approximate rate coefficients and estimate frequencies with the capabilities of the Arkane software to use quantum chemical parameters to compute thermochemistry and pressure dependent rates. A flux-based algorithm is used to decide which isomers to add to the network. Isomers added to the network are reacted to form other channels. When enough of the flux is accounted for by the isomers and bimolecular product channels, the generation process terminates to yield a comprehensive network. Network sensitivity analysis is applied to the network to identify the most important wells and barriers that can be refined using quantum chemistry calculations. Iterative refinement can then be used to achieve accuracy. The comprehensive network can be easily reduced using energy and flux-based algorithms to the most important channels and isomers in the network.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRSDate not supplied

Quantum Hardware-Enabled Molecular Dynamics via Transfer Learning

The ability to perform ab initio molecular dynamics simulations using potential energy surfaces provided by quantum computers would open the door to virtually exact dynamics for a variety of chemical and biochemical systems, with impacts on catalysis and biophysics. Nonetheless, performing molecular dynamics on surfaces produced by quantum hardware has been hampered by the noisy energies typically produced by quantum computers and challenges associated with computing gradients and scaling to large systems interest. A recent set of advances in machine learning, known as transfer learning, provides a new path forward for molecular dynamics simulations on quantum hardware. Transfer learning offers a workaround, where one first trains models on larger, less accurate classical datasets and then refines them on smaller, more accurate quantum datasets. We explore this approach by training machine learning models to predict a molecule's potential energy based on its geometric structure using Behler-Parrinello neural networks. When successfully trained, the model enables energy gradient predictions necessary for dynamic simulations. To reduce the quantum resources needed, the model is initially trained with data derived from classical density functional theory and subsequently refined with a smaller dataset obtained from a variational quantum eigensolver optimization of the unitary coupled cluster ansatz. We show that this approach significantly reduces the size of the needed quantum training dataset while capturing the high accuracies needed within quantum chemistry simulations. The success of this two-step training method opens more opportunities to apply machine learning models on quantum data, a significant stride towards efficient quantum-classical hybrid computational models.

quantum computing↗
DOE OSTI2023

Exploring the impact of ions on oxygen K-edge X-ray absorption spectroscopy in NaCl solution using the GW-Bethe-Salpeter-equation approach

X-ray absorption spectroscopy (XAS) is a powerful experimental tool to probe the local structure in materials with the core hole excitations. Here, the oxygen K-edge XAS spectra of the NaCl solution and pure water are computed by using a recently developed GW-Bethe-Salpeter equation approach, based on configurations modeled by path-integral molecular dynamics with the deep-learning technique. The neural network is trained on ab initio data obtained with strongly constrained and appropriately normed density functional theory. The observed changes in the XAS features of the NaCl solution, compared to those of pure water, are in good agreement between experimental and theoretical results. We provided detailed explanations for these spectral changes that occur when NaCl is solvated in pure water. Specifically, the presence of solvating ion pairs leads to localization of electron-hole excitons. As a result, our theoretical XAS results support the theory that the effects of the solvating ions on the H-bond network are mainly confined within the first hydration shell of ions, however beyond the shell the arrangement of water molecules remains to be comparable to that observed in pure water.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2014

Stochastic approximation methods-Powerful tools for simulation and optimization: A survey of some recent work on multi-agent systems and cyber-physical systems

Stochastic approximation methods have found extensive and diversified applications. Recent emergence of networked systems and cyber-physical systems has generated renewed interest in advancing stochastic approximation into a general framework to support algorithm development for information processing and decisions in such systems. This paper presents a survey on some recent developments in stochastic approximation methods and their applications. Using connected vehicles in platoon formation and coordination as a platform, we highlight some traditional and new methodologies of stochastic approximation algorithms and explain how they can be used to capture essential features in networked systems. Distinct features of networked systems with randomly switching topologies, dynamically evolving parameters, and unknown delays are presented, and control strategies are provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A density-functional theory study of the Al/AlOx/Al tunnel junction

The aluminum oxide tunnel junction is a key component of the majority of superconducting quantum devices. For high-quality, reproducible, and scalably manufacturable qubits, the ability to fabricate Josephson junctions (JJs) with a targeted critical current and high uniformity is essential. In this study, we use first-principles modeling to assess fundamental aspects of the atomic structure of both amorphous and crystalline aluminum oxide tunnel junctions and relate the structure to predicted performance metrics. We use modified ab initio molecular dynamics to develop realistic models of the tunnel junction, from which interface roughness and local thickness fluctuations are analyzed in an unbiased manner by training a neural network to identify the boundary between metal and oxide. We show that the effective thickness of the insulating part of the junction can be different from the apparent physical thickness. We calculate the rate of Cooper pair tunneling for the atomically resolved electrostatic potential using direct numerical solution in 3D, which shows a channeling effect that impacts the junction critical current. The predicted critical current is a useful JJ design parameter that can be accessed from the ab initio calculations without fitting parameters. To assess the limits of uniformity and fabrication choices (e.g., oxidation vs epitaxy), we compare the amorphous junctions to crystalline models, which show order of magnitude more efficient tunneling compared to the amorphous case, underlining the connection between atomistic structure and Cooper pair tunneling efficiency. Further, this work provides a foundation for ab initio materials design and evaluation to help accelerate future development of improved tunnel junctions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Distributed quantum sensing enhanced by continuous-variable error correction

Abstract A distributed sensing protocol uses a network of local sensing nodes to estimate a global feature of the network, such as a weighted average of locally detectable parameters. In the noiseless case, continuous-variable (CV) multipartite entanglement shared by the nodes can improve the precision of parameter estimation relative to the precision attainable by a network without shared entanglement; for an entangled protocol, the root mean square estimation error scales like 1/ M with the number M of sensing nodes, the so-called Heisenberg scaling, while for protocols without entanglement, the error scales like 1 / M . However, in the presence of loss and other noise sources, although multipartite entanglement still has some advantages for sensing displacements and phases, the scaling of the precision with M is less favorable. In this paper, we show that using CV error correction codes can enhance the robustness of sensing protocols against imperfections and reinstate Heisenberg scaling up to moderate values of M . Furthermore, while previous distributed sensing protocols could measure only a single quadrature, we construct a protocol in which both quadratures can be sensed simultaneously. Our work demonstrates the value of CV error correction codes in realistic sensing scenarios.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Toward accelerating rare-earth metal extraction using equivariant neural networks

The separation of rare-earth metals, vital for numerous advanced technologies, is hampered by their similar chemical properties, making ligand discovery a significant challenge. Traditional experimental and quantum chemistry approaches for identifying effective ligands are often resource-intensive. We introduce a machine learning protocol based on an equivariant neural network, Allegro, for the rapid and accurate prediction of binding energies in rare-earth complexes. Key to this work is our newly curated dataset of rare-earth metal complexes—made publicly available to foster further research—systematically generated using the Architector program. This dataset distinctively features functionalized derivatives of proven rare-earth-chelating scaffolds, hydroxypyridinone (HOPO), catecholamide (CAM), and their thio-analogues, selected for their established efficacy in binding these elements. Trained on this valuable resource, our Allegro models demonstrate excellent performance, particularly when trained to directly predict DFT-level binding energies, yielding highly accurate results that closely correlate with theoretical calculations on a diverse test set. Furthermore, this strategy exhibited strong out-of-sample generalization, accurately predicting binding energies for an isomeric HOPO-derivative ligand not seen during training. By substantially reducing computational demands, this machine learning framework, alongside the provided dataset, represent powerful tools to accelerate the high-throughput screening and rational design of novel ligands for efficient rare-earth metal separation.

Gupta, Ankur K. [Lawrence Berkeley National Labora↗
DOE OSTI2023

Q-BEEP: Quantum Bayesian Error Mitigation Employing Poisson Modeling over the Hamming Spectrum

Quantum computing technology has grown rapidly in recent years, with new technologies being explored, error rates being reduced, and quantum processor’s qubit capacity growing. However, near-term quantum algorithms are still unable to be induced without compounding consequential levels of noise, leading to non-trivial erroneous results. Quantum Error Correction (in-situ error mitigation) and Quantum Error Mitigation (post-induction error mitigation) are promising fields of research within the quantum algorithm scene, aiming to alleviate quantum errors, increasing the overall fidelity and hence the overall quality of circuit induction. Earlier this year, a pioneering work, namely HAMMER, published in ASPLOS-22 demonstrated the existence of a latent structure regarding post-circuit induction errors when mapping to the Hamming spectrum. However, they intuitively assumed that errors occur in local clusters, and that at higher average Hamming distances this structure falls away. In this work, we show that such a correlation structure is not only local but extends certain non-local clustering patterns which can be precisely described by a Poisson distribution model taking the input circuit, the device run time status (i.e., calibration statistics) and qubit topology into consideration. Using this quantum error characterizing model, we developed an iterative algorithm over the generated Bayesian network state-graph for post-induction error mitigation. Thanks to more precise modeling of the error distribution latent structure and the new iterative method, our Q-Beep approach provides state of the art performance and can boost circuit execution fidelity by up to 234.6% on Bernstein-Vazirani circuits and on average 71.0% on QAOA solution quality, using 16 practical IBMQ quantum processors. For other benchmarks such as those in QASMBench, the fidelity improvement is up to 17.8%. Q-Beep is a light-weight post-processing technique that can be performed offline and remotely, making it a useful tool for quantum vendors to integrate and provide more reliable circuit induction results.

Stein, Samuel A.↗