Search NASA⌕ Search

SEARCH · Search NASA

Results for “Barren”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Sedimentation and Nonlinear Trapping in Texas Reservoirs Identified Using Remote Sensing and Bathymetric Survey Records

Decreasing reservoir storage capacity due to sedimentation poses great challenges to aging U.S. reservoirs, as it reduces the efficacy and reliability of their socio‐economic services. However, systematic assessments of reservoir sedimentation rates and associated issues remain limited because of sparse and infrequent bathymetry survey data. In this study, we use remote sensing‐driven estimates of sediment concentrations to identify regions experiencing rapid reservoir capacity loss, as observed in repeated bathymetry surveys. Our analysis focuses on Texas, where one of the most reliable state‐level reservoir capacity loss data sets is available through a unique long‐term monitoring program by the Texas Water Development Board. We find that reservoirs with large storage capacities and high sedimentation rate are concentrated in Northeast Texas. We also show that reduced forest, increased barren land, and erosive soil properties are co‐varying with high reservoir sedimentation rates. Temporal changes in the longitudinal gradient of the remotely sensed sediment flux highlight the nonlinear nature of sediment trapping processes, and can be used to estimate the reservoir storage capacity loss over time. In combination with standard bathymetry surveys, our approach shows potential for more cost‐effective and frequent assessment of reservoir storage loss.

Lee, Jiyong [ORNL] (ORCID:0000000198957406)↗
DOE OSTI2025

Towards large-scale quantum optimization solvers with few qubits

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Estimating the randomness of quantum circuit ensembles up to 50 qubits

Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. To study this property of random circuits, we develop numerical protocols for estimating the frame potential, the distance between a given ensemble and the exact randomness. Our tensor-network-based algorithm has polynomial complexity for shallow circuits and is high-performing using CPU and GPU parallelism. We study 1. local and parallel random circuits to verify the linear growth in complexity as stated by the Brown–Susskind conjecture, and; 2. hardware-efficient ansätze to shed light on its expressibility and the barren plateau problem in the context of variational algorithms. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

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

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

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

Quantum simulation of molecules without fermionic encoding of the wave function

Abstract Molecular simulations generally require fermionic encoding in which fermion statistics are encoded into the qubit representation of the wave function. Recent calculations suggest that fermionic encoding of the wave function can be bypassed, leading to more efficient quantum computations. Here we show that the two-electron reduced density matrix (2-RDM) can be expressed as a unique functional of the unencoded N -qubit-particle wave function without approximation, and hence, the energy can be expressed as a functional of the 2-RDM without fermionic encoding of the wave function. In contrast to current hardware-efficient methods, the derived functional has a unique, one-to-one (and onto) mapping between the qubit-particle wave functions and 2-RDMs, which avoids the over-parametrization that can lead to optimization difficulties such as barren plateaus. An application to computing the ground-state energy and 2-RDM of H 4 is presented.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2021

Characterizing Canopy Openness in Open Forests: Spherical Densiometer and Canopy Photography Are Equivalent but Less Sensitive than Direct Measurements of Solar Radiation

In forest ecosystems, canopy openness affects understory light availability, plant growth, and tree species recruitment, thus shaping future forest composition, structure, and functional diversity. Foresters must correctly and quickly measure canopy openness to meet their management objectives. To help guide the selection of an appropriate method for measuring canopy openness, we compared three common techniques that vary in cost, complexity, and time required for measurements and data processing: smartphone-based hemispherical photography, spherical densiometer measurements, and direct measurements of solar radiation (using AccuPAR ceptometer). We measured canopy openness using these three methods on 28 permanent forest health monitoring plots in pine-oak forests of the Central Pine Barrens of Long Island in New York State. By analysis of variance and regression analyses, we found the three methods (particularly densiometer and hemispherical photographs) yielded broadly equivalent and strongly positively correlated descriptions of canopy openness. The direct measurements of solar radiation seemed to have a greater potential to detect subtle variation in forest understory light. Forest managers may sufficiently characterize canopy openness using quick and cheap methods (e.g., spherical densiometers) and avoid larger costs of devices for direct light measurements (e.g., ceptometers) and the larger data processing times of hemispherical photography.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Exploring thermal equilibria of the Fermi-Hubbard model with variational quantum algorithms

Here, this study investigates the thermal properties of the repulsive Fermi-Hubbard model with chemical potential using variational quantum algorithms, crucial in comprehending particle behaviour within lattices at heightened temperatures in condensed matter systems. Conventional computational methods encounter challenges, especially in managing chemical potential, prompting exploration into Hamiltonian approaches. Despite the promise of quantum algorithms, their efficacy is hampered by coherence limitations when simulating extended imaginary time evolution sequences. To overcome these constraints, this research focuses on optimizing variational quantum algorithms to probe the thermal properties of the Fermi-Hubbard model. Physics-inspired circuit designs are tailored to alleviate coherence constraints, facilitating a more comprehensive exploration of materials at elevated temperatures. Our study demonstrates the potential of variational algorithms in simulating the thermal properties of the Fermi-Hubbard model while acknowledging limitations stemming from error sources in quantum devices and encountering barren plateaus.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Trainability of Dissipative Perceptron-Based Quantum Neural Networks

Several architectures have been proposed for quantum neural networks (QNNs), with the goal of efficiently performing machine learning tasks on quantum data. Rigorous scaling results are urgently needed for specific QNN constructions to understand which, if any, will be trainable at a large scale. Here, we analyze the gradient scaling (and hence the trainability) for a recently proposed architecture that we call dissipative QNNs (DQNNs), where the input qubits of each layer are discarded at the layer’s output. We find that DQNNs can exhibit barren plateaus, i.e., gradients that vanish exponentially in the number of qubits. Moreover, we provide quantitative bounds on the scaling of the gradient for DQNNs under different conditions, such as different cost functions and circuit depths, and show that trainability is not always guaranteed. Here our work represents the first rigorous analysis of the scalability of a perceptron-based QNN.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Theory for Equivariant Quantum Neural Networks

Quantum neural network architectures that have little to no inductive biases are known to face trainability and generalization issues. Inspired by a similar problem, recent breakthroughs in machine learning address this challenge by creating models encoding the symmetries of the learning task. This is materialized through the usage of equivariant neural networks the action of which commutes with that of the symmetry. In this work, we import these ideas to the quantum realm by presenting a comprehensive theoretical framework to design equivariant quantum neural networks (EQNNs) for essentially any relevant symmetry group. We develop multiple methods to construct equivariant layers for EQNNs and analyze their advantages and drawbacks. Our methods can find unitary or general equivariant quantum channels efficiently even when the symmetry group is exponentially large or continuous. As a special implementation, we show how standard quantum convolutional neural networks (QCNNs) can be generalized to group-equivariant QCNNs where both the convolution and pooling layers are equivariant to the symmetry group. We then numerically demonstrate the effectiveness of a S U ( 2 ) -equivariant QCNN over symmetry-agnostic QCNN on a classification task of phases of matter in the bond-alternating Heisenberg model. Our framework can be readily applied to virtually all areas of quantum machine learning. Lastly, we discuss about how symmetry-informed models such as EQNNs provide hopes to alleviate central challenges such as barren plateaus, poor local minima, and sample complexity. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Adaptive Quantum Generative Training using an Unbounded Loss Function

We propose a generative quantum learning algorithm using the Adaptive Derivative-Assembled Problem Tailored ansatz (ADAPT) framework in which the loss function to be minimized is the maximal quantum Rényi divergence of order two, an unbounded function that mitigates barren plateaus which inhibit training variational circuits. We benchmark this method against other state-of-the-art adaptive algorithms by learning random two-local thermal states. We perform numerical experiments of up to 12 qubits comparing our method learning algorithms that use linear objective functions and show that Rényi-ADAPT is capable of constructing shallow quantum circuits competitive with existing methods, while the gradients remain favorable resulting from the maximal Rényi divergence loss function.

quantum algorithms, quantum machine learning, quan↗
DOE OSTI2020

AmeriFlux US-xMB NEON Moab (MOAB)

This is the AmeriFlux version of the carbon flux data for the site US-xMB NEON Moab (MOAB). Site Description - The NEON MOAB site is located approximately 40 km south of the town of Moab and is characteristic of the Colorado Plateau. MOAB was selected with other sites that share a similar latitude in domains 10, 13, and 15, to assess dust generation, nutrient transport, and nutrient deposition. The western half of the site, including the tower airshed, is a grazed shrub land, often with pockets of barren soil. To the east, in the higher elevations, evergreen forests sit atop the mesas. Biological soil crust, dominated by cyanobacteria, is a living groundcover across the area.

Network), NEON (National Ecological Observatory↗
DOE OSTI2023

AmeriFlux FLUXNET-1F US-xMB NEON Moab (MOAB)

This is the AmeriFlux Management Project (AMP) created FLUXNET-1F version of the carbon flux data for the site US-xMB NEON Moab (MOAB). This is the FLUXNET version of the carbon flux data for the site US-xMB NEON Moab (MOAB) produced by applying the standard ONEFlux (1F) software. Site Description - The NEON MOAB site is located approximately 40 km south of the town of Moab and is characteristic of the Colorado Plateau. MOAB was selected with other sites that share a similar latitude in domains 10, 13, and 15, to assess dust generation, nutrient transport, and nutrient deposition. The western half of the site, including the tower airshed, is a grazed shrub land, often with pockets of barren soil. To the east, in the higher elevations, evergreen forests sit atop the mesas. Biological soil crust, dominated by cyanobacteria, is a living groundcover across the area.

Network), NEON (National Ecological Observatory↗
DOE OSTI2021

Oxygen isotope evidence for input of magmatic fluids and precipitation of Au-Ag-tellurides in an otherwise ordinary adularia-sericite epithermal system in NE China

Abstract Tellurium-rich (Te) adularia-sericite epithermal Au-Ag deposits are an important current and future source of precious and critical metals. However, the source and evolution of ore-forming fluids in these deposits are masked by traditional bulk analysis of quartz oxygen isotope ratios that homogenize fine-scale textures and growth zones. To advance understanding of the source of Te and precious metals, herein, we use petrographic and cathodoluminescence (CL) images of such textures and growth zones to guide high spatial resolution secondary ion mass spectroscopy (SIMS) oxygen isotope analyses (10 µm spot) and spatially correlated fluid inclusion microthermometric measurements on successive quartz bands in contemporary Te-rich and Te-poor adularia-sericite (-quartz) epithermal Au-Ag vein deposits in northeastern China. The results show that large positive oxygen isotope shifts from –7.1 to +7.7‰ in quartz rims are followed by precipitation of Au-Ag telluride minerals in the Te-rich deposit, whereas small oxygen isotope shifts of only 4‰ (–2.2 to +1.6‰) were detected in quartz associated with Au-Ag minerals in the Te-poor deposits. Moreover, fluid-inclusion homogenization temperatures are higher in comb quartz rims (avg. 266.4 to 277.5 °C) followed by Au-Ag telluride minerals than in previous stages (~250 °C) in the Te-rich deposit. The Te-poor deposit has a consistent temperature (~245 °C) in quartz that pre- and postdates Au-Ag minerals. Together, the coupled increase in oxygen isotope ratios and homogenization temperatures followed by precipitation of Au-Ag tellurides strongly supports that inputs of magmatic fluid containing Au, Ag, and Te into barren meteoric water-dominated flow systems are critical to the formation of Te-rich adularia-sericite epithermal Au-Ag deposits. In contrast, Te-poor adularia-sericite epithermal Au-Ag deposits show little or no oxygen isotope or fluid-inclusion evidence for inputs of magmatic fluid.

Geochemistry & Geophysics↗
DOE OSTI2021

Assessing the Key Requirements for 450 GW of Renewable Capacity in India by 2030

In this policy brief, we assess the prerequisites for India to achieve 450 GW of solar and wind cumulative installed capacity by 2030. We examine requirements such as availability of land, new transmission buildout, financing and pace of deployment, as well as the impact on grid reliability and cost of generation. We also examine the impact of policies promoting domestic manufacturing. Deploying 307 GW of solar and 142 GW of wind capacity would use only about 1.25% of land that is categorized as barren or waste, which is equivalent to about 0.22% of the total land area in India. Because of the good solar resource across large swaths of India, the solar energy buildout—and thus the land use—potentially can be spread out. India would need about 280 GW of new interstate transmission capacity by 2030, a little over double the transmission expansion that has already been planned through 2025. However, most of the new transmission buildout is driven by the near doubling of electricity demand between 2020 and 2030. The total investment needed (in generation and storage resources) to realize this target is around USD 26.5 billion annually, which is 20% lower than the annual investment in India’s power sector across all generation resources between 2015 and 2019. We estimate that using domestically manufactured panels instead of imported panels may increase solar PPA prices by about 10%–15% in the medium term, but solar power would still be a cost-effective way to meet growing demand instead of building new fossil fuel-based power plants, because the price of electricity from solar plants has fallen below the variable cost of most existing coal units. To reach this target, India would need to build about 35–40 GW of solar and wind capacity every year in this decade. India’s power sector achieved a pace of capacity addition of 22 GW per year in the previous decade (including thermal and renewable). Policy and regulatory measures would be needed to increase the pace of deployment.

14 SOLAR ENERGY↗
DOE OSTI2023

Investigating parameter trainability in the SNAP-Displacement protocol of a qudit system.

Our main focus is to investigate the sensitivity of training any of the SNAP parameters in the SNAP-Displacement protocol. We analyze conditions that could potentially lead to the Barren Plateau problem in a qudit system and draw comparisons with multi-qubit systems. The parameterized ansatz we consider consists of SNAP -Displacement blocks. We utilize techniques similar to those in [8] and [2] along with the concept of $t-$design. Through this analysis, we make the following key observations: (a) The trainability of a SNAP-parameter does not exhibit a preference for any particular direction within our cost function landscape, (b) using Haar measure properties, we establish new lemmas concerning the expectation of certain polynomial functions, and (c) utilizing these new lemmas, we identify a general condition that indicates an expected trainability advantage in a qudit system when compared to multi-qubit systems.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

Quantum Neural Networks: Issues, Training, and Applications

Our work in the field aims at explaining the limitations and expressive power of Quantum Machine Learning models, as well as finding feasible training algorithms that could be implemented in near-term Quantum Computers. The promise of Quantum Machine Learning is that by incorporating quantum effects, such as entanglement, into machine learning models researchers can improve model performance and understand more complex datasets. This pledge is particularly pronounced in the design of Quantum neural networks (QNNs), a promising framework for creating quantum algorithms, that promise to outperform classical models by combining the speedups of quantum computation with the widespread successes of deep learning. We show that applying this approach alone to quantum deep learning is problematic given that an excess of entanglement between the hidden and visible layers can destroy the predictive power of our QNN models. We address the barren plateau problem by suggesting the use of a generative, unbounded, nonlinear loss function with simple gradients. The loss function quantifies how much the quantum states generated by the QNNs differ from the data and the goal during training is to minimize it. Finally, we showcase how to use generative training to construct a "classical-quantum" neural network to accurately interpolate between the ground states of a Molecular Hamiltonian, a central question in Quantum Chemistry.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Porting Classical Approaches for Quantum Simulations to Quantum Computers

Simulating quantum many-body systems is one of the most promising problems in which we might anticipate that quantum computers should show quantum advantage. Unfortunately, there is still a gap between this promise and actual practice. New quantum algorithms need to be developed and the current quantum algorithms have various difficulties - e.g efficient state preparation - which must be overcome and improved upon. In many cases, classical approaches need to be ported over to quantum devices. In this project we have developed a suite of new quantum algorithms which makes progress in this regard. We developed a new optimization scheme for variational quantum eigensolvers, UBOS, which mitigates problems with local minimas and barren plateaus while improving convergence to the ground state by an order of magnitude. We developed a new way to utilize qubitization to find ground states of nearly frustration-free Hamiltonians faster than all previous methods. We developed a series of state preparation techniques which helps initialize parameterized quantum circuits into reasonable starting points on which quantum algorithms are then applied. In addition to the development of novel algorithms, it is critical to have classical simulation techniques for approximately simulating quantum circuits which can be used to benchmark and understand quantum algorithms. Toward that end, we developed a novel POVM formalism to simulate quantum circuits as well as exemplify the massive parallelization of tensor network methodologies. Finally, we developed physical understanding of entanglement phase transitions such as many-body localization and random tensor networks.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

The battle of clean and dirty qubits in the era of partial error correction

When error correction becomes possible it will be necessary to dedicate a large number of physical qubits to each logical qubit. Error correction allows for deeper circuits to be run, but each additional physical qubit can potentially contribute an exponential increase in computational space, so there is a trade-off between using qubits for error correction or using them as noisy qubits. In this work, we look at the effects of using noisy qubits in conjunction with noiseless qubits (an idealized model for error-corrected qubits), which we call the “clean and dirty” setup. We employ analytical models and numerical simulations to characterize this setup. Numerically we show the appearance of Noise-Induced Barren Plateaus (NIBPs), i.e., an exponential concentration of observables caused by noise, in an Ising model Hamiltonian variational ansatz circuit. We observe this even if only a single qubit is noisy and given a deep enough circuit, suggesting that NIBPs cannot be fully overcome simply by error-correcting a subset of the qubits. On the positive side, we find that for every noiseless qubit in the circuit, there is an exponential suppression in the concentration of gradient observables, showing the benefit of partial error correction. Finally, our analytical models corroborate these findings by showing that observables concentrate with a scaling in the exponent related to the ratio of dirty-to-total qubits.

97 MATHEMATICS AND COMPUTING↗